{"version":3,"file":"static/chunks/5857.f5fe32cd73137312.js","mappings":"iGAGA,SAAAA,EAAAC,CAAA,EACA,IAAAC,OAAAC,aAAA,CAAAF,IAAAA,EAAA,EACA,8CAA0DA,EAAE,EAC5D,CAEA,SAAAG,EAAAC,CAAA,EACA,qBAAAA,EACA,qCAAiDA,EAAE,EACnD,CAGA,SAAAC,EAAAC,CAAA,EACA,OAAAA,aAAAC,YACAD,MAAAA,GAAA,iBAAAA,GAAAA,eAAAA,EAAAE,WAAA,CAAAC,IAAA,CAGA,SAAAC,EAAAN,CAAA,IAAAO,CAAA,EACA,IAAAN,EAAAD,GACA,mCACA,GAAAO,EAAAC,MAAA,KAAAD,EAAAE,QAAA,CAAAT,EAAAQ,MAAA,EACA,6CAAyDD,EAAQ,kBAAkBP,EAAAQ,MAAA,CAAS,EAC5F,CAEA,SAAAE,EAAAC,CAAA,EACA,sBAAAA,GAAA,mBAAAA,EAAAC,MAAA,CACA,+DACAjB,EAAAgB,EAAAE,SAAA,EACAlB,EAAAgB,EAAAG,QAAA,CACA,CAEA,SAAAC,EAAAC,CAAA,CAAAC,EAAA,IACA,GAAAD,EAAAE,SAAA,CACA,gDACA,GAAAD,GAAAD,EAAAG,QAAA,CACA,oDACA,CAEA,SAAAC,EAAAC,CAAA,CAAAL,CAAA,EACAV,EAAAe,GACA,IAAAC,EAAAN,EAAAH,SAAA,CACA,GAAAQ,EAAAb,MAAA,CAAAc,EACA,qEAAiFA,EAAI,EAErF,CA7CAC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAL,MAAc,CAAGK,EAAAV,MAAc,CAAGU,EAAAf,IAAY,CAAGe,EAAAnB,KAAa,CAAGmB,EAAA1B,IAAY,CAAG0B,EAAA9B,MAAc,CAAG8B,EAAAxB,OAAe,QAKhHwB,EAAA9B,MAAc,CAAAA,EAKd8B,EAAA1B,IAAY,CAAAA,EAMZ0B,EAAAxB,OAAe,CAAAA,EAOfwB,EAAAnB,KAAa,CAAAA,EAObmB,EAAAf,IAAY,CAAAA,EAOZe,EAAAV,MAAc,CAAAA,EAQdU,EAAAL,MAAc,CAAAA,EAEdK,EAAA,OAAe,CADf,CAAiB9B,OAAAA,EAAAI,KAAAA,EAAAO,MAAAA,EAAAI,KAAAA,EAAAK,OAAAA,EAAAK,OAAAA,CAAA,oCC/CjBG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAE,KAAa,CAAGF,EAAAG,KAAa,CAAGH,EAAAI,KAAa,CAAGJ,EAAAK,KAAa,CAAGL,EAAAM,KAAa,CAAGN,EAAAO,KAAa,CAAGP,EAAAQ,GAAW,CAAGR,EAAAS,MAAc,CAAGT,EAAAU,MAAc,CAAGV,EAAAW,MAAc,CAAGX,EAAAY,MAAc,CAAGZ,EAAAa,OAAe,CAAGb,EAAAc,OAAe,CAAGd,EAAAe,MAAc,CAAGf,EAAAgB,MAAc,CAAGhB,EAAAiB,MAAc,CAAGjB,EAAAkB,MAAc,CAAGlB,EAAAmB,KAAa,CAAGnB,EAAAoB,KAAa,CAAGpB,EAAAqB,KAAa,CAAGrB,EAAAsB,KAAa,CAAGtB,EAAAuB,OAAe,QACzW,IAAAC,EAAAC,OAAA,cACAC,EAAAD,OAAA,IAEA,SAAAF,EAAApD,CAAA,CAAAwD,EAAA,WACA,EACA,CAAiBzC,EAAAd,OAAAD,EAAAqD,GAAAI,EAAAxD,OAAA,GAAAsD,EAAAF,EAAA,EACjB,CAAatC,EAAAd,EAAAA,OAAA,GAAAsD,EAAAF,GAAAI,EAAAxD,EAAAA,OAAAD,EAAAqD,EAAA,CACb,CAEA,SAAAF,EAAAO,CAAA,CAAAF,EAAA,IACA,IAAAG,EAAA,IAAAC,YAAAF,EAAA9C,MAAA,EACAiD,EAAA,IAAAD,YAAAF,EAAA9C,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAJ,EAAA9C,MAAA,CAAgBkD,IAAA,CACpC,IAAgB/C,EAAAA,CAAA,CAAA0C,CAAA,EAAOL,EAAAM,CAAA,CAAAI,EAAA,CAAAN,EACvB,EAAAG,CAAA,CAAAG,EAAA,CAAAD,CAAA,CAAAC,EAAA,GAAA/C,EAAA0C,EAAA,CAEA,OAAAE,EAAAE,EAAA,CARAhC,EAAAuB,OAAe,CAAAA,EAUfvB,EAAAsB,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAnC,EAAA0C,IAAA,OAAA1C,IAAA,IAAAwC,EAAAD,OAAAG,IAAA,EACA5B,CAAAA,EAAAqB,KAAa,CAAAA,EAEb,IAAAD,EAAA,CAAAlC,EAAAgD,EAAAC,IAAAjD,IAAAiD,CACAnC,CAAAA,EAAAoB,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAjC,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,CACAnC,CAAAA,EAAAmB,KAAa,CAAAA,EAEb,IAAAD,EAAA,CAAAhC,EAAA0C,EAAAO,IAAA,IAAAA,EAAAP,GAAA,GAAAO,CACAnC,CAAAA,EAAAkB,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAA/B,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,CACAnC,CAAAA,EAAAiB,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAA9B,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,EAAA,EACAnC,CAAAA,EAAAgB,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAA7B,EAAA0C,EAAAO,IAAA,IAAAA,EAAA,GAAAP,GAAA,GAAAO,CACAnC,CAAAA,EAAAe,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAAsB,EAAAR,IAAAA,CACA5B,CAAAA,EAAAc,OAAe,CAAAA,EACf,IAAAD,EAAA,CAAA3B,EAAAgD,IAAAhD,CACAc,CAAAA,EAAAa,OAAe,CAAAA,EAEf,IAAAD,EAAA,CAAA1B,EAAA0C,EAAAO,IAAA,GAAAA,EAAAP,IAAA,GAAAO,CACAnC,CAAAA,EAAAY,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAAzB,EAAA0C,EAAAO,IAAA,GAAAA,EAAAjD,IAAA,GAAAiD,CACAnC,CAAAA,EAAAW,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAAxB,EAAA0C,EAAAO,IAAA,GAAAA,EAAA,GAAAjD,IAAA,GAAAiD,CACAnC,CAAAA,EAAAU,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAAvB,EAAA0C,EAAAO,IAAA,GAAAA,EAAA,GAAAP,IAAA,GAAAO,EAIA,SAAA3B,EAAAsB,CAAA,CAAAE,CAAA,CAAAK,CAAA,CAAAC,CAAA,EACA,IAAAV,EAAA,CAAAI,IAAA,GAAAM,CAAAA,IAAA,GACA,OAAapD,EAAA,EAAAmD,EAAA,mBAAAT,EAAAA,EAAAA,CAAA,CACb,CANA5B,EAAAS,MAAc,CAAAA,EAOdT,EAAAQ,GAAW,CAAAA,EAEX,IAAAD,EAAA,CAAAyB,EAAAM,EAAAC,IAAA,CAAAP,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,EACAvC,CAAAA,EAAAO,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAkC,EAAAV,EAAAO,EAAAI,IAAA,EAAAJ,EAAAI,EAAA,kBACAzC,CAAAA,EAAAM,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAA2B,EAAAM,EAAAC,EAAAG,IAAA,CAAAV,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,GAAAG,CAAAA,IAAA,EACA1C,CAAAA,EAAAK,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAoC,EAAAV,EAAAO,EAAAI,EAAAE,IAAA,EAAAN,EAAAI,EAAAE,EAAA,kBACA3C,CAAAA,EAAAI,KAAa,CAAAA,EACb,IAAAF,EAAA,CAAA8B,EAAAM,EAAAC,EAAAG,EAAAE,IAAA,CAAAZ,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,GAAAG,CAAAA,IAAA,GAAAE,CAAAA,IAAA,EACA5C,CAAAA,EAAAE,KAAa,CAAAA,EACb,IAAAC,EAAA,CAAAqC,EAAAV,EAAAO,EAAAI,EAAAE,EAAAE,IAAA,EAAAR,EAAAI,EAAAE,EAAAE,EAAA,kBACA7C,CAAAA,EAAAG,KAAa,CAAAA,EAUbH,EAAA,OAAe,CARf,CACAuB,QAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EACAD,MAAAA,EAAAD,MAAAA,EACAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EACAD,QAAAA,EAAAD,QAAAA,EACAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EACAD,IAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,CACA,oCCjFAJ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8C,MAAc,QACd9C,EAAA8C,MAAc,kBAAAC,YAAA,WAAAA,WAAAA,WAAAD,MAAA,CAAAE,KAAAA,sCCFdlD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAiD,QAAgB,CAAGjD,EAAAkD,QAAgB,CAAGlD,EAAAmD,UAAkB,CAAGnD,EAAAoD,UAAkB,CAAGpD,EAAAqD,UAAkB,CAAGrD,EAAAsD,UAAkB,CAAGtD,EAAAuD,QAAgB,CAAGvD,EAAAwD,QAAgB,CAAGxD,EAAAyD,QAAgB,CAAGzD,EAAA0D,QAAgB,CAAG1D,EAAA2D,MAAc,CAAG3D,EAAA4D,OAAe,QACtO,IAAAC,EAAqBC,EAAQ,OAC7BC,EAAkBD,EAAQ,OAC1BE,EAAmBF,EAAQ,OAI3BG,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA3C,OAAA,GACA4C,EAAA5C,OAAA,GACA6C,EAAA7C,OAAA,GACA8C,EAAA9C,OAAA,GACA+C,EAAA/C,OAAA,KACAgD,EAAAhD,OAAA,KACA,QAAAiD,EAAA,EAAAC,EAAAN,EAAAO,EAAA,EAAAC,EAAA,EAA2CH,EAAA,GAAYA,IAAA,CAEvD,CAAAE,EAAAC,EAAA,EAAAA,EAAA,GAAAD,EAAA,EAAAC,CAAAA,EAAA,GACAZ,EAAAa,IAAA,MAAAD,EAAAD,CAAAA,GAEAV,EAAAY,IAAA,EAAAJ,EAAA,GAAAA,CAAAA,EAAA,SAEA,IAAAK,EAAAX,EACA,QAAAY,EAAA,EAAoBA,EAAA,EAAOA,IAC3BL,CAAAA,EAAA,IAAAN,EAAA,CAAAM,GAAAJ,CAAA,EAAAE,CAAA,EAAAD,CAAA,EACAF,GACAS,CAAAA,GAAAV,GAAA,CAAAA,GAAA5C,OAAAuD,EAAA,EAAAX,CAAA,EAEAF,EAAAW,IAAA,CAAAC,EACA,CACA,IAAAE,EAAAC,EAAA,IAAAnB,EAAAzC,KAAA,EAAA6C,EAAA,IAEAgB,EAAA,CAAAjG,EAAA0C,EAAAO,IAAAA,EAAA,MAAA4B,EAAArD,MAAA,EAAAxB,EAAA0C,EAAAO,GAAA,GAAA4B,EAAAnD,MAAA,EAAA1B,EAAA0C,EAAAO,GACAiD,EAAA,CAAAlG,EAAA0C,EAAAO,IAAAA,EAAA,MAAA4B,EAAAtD,MAAA,EAAAvB,EAAA0C,EAAAO,GAAA,GAAA4B,EAAApD,MAAA,EAAAzB,EAAA0C,EAAAO,GAEA,SAAAyB,EAAAzB,CAAA,CAAAkD,EAAA,IACA,IAAAC,EAAA,IAAAvD,YAAA,IAEA,QAAA2C,EAAA,GAAAW,EAAkCX,EAAA,GAAYA,IAAA,CAE9C,QAAAE,EAAA,EAAwBA,EAAA,GAAQA,IAChCU,CAAA,CAAAV,EAAA,CAAAzC,CAAA,CAAAyC,EAAA,CAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IACA,QAAAA,EAAA,EAAwBA,EAAA,GAAQA,GAAA,GAChC,IAAAW,EAAA,CAAAX,EAAA,MACAY,EAAA,CAAAZ,EAAA,MACAa,EAAAH,CAAA,CAAAE,EAAA,CACAE,EAAAJ,CAAA,CAAAE,EAAA,GACAG,EAAAR,EAAAM,EAAAC,EAAA,GAAAJ,CAAA,CAAAC,EAAA,CACAK,EAAAR,EAAAK,EAAAC,EAAA,GAAAJ,CAAA,CAAAC,EAAA,GACA,QAAAV,EAAA,EAA4BA,EAAA,GAAQA,GAAA,GACpC1C,CAAA,CAAAyC,EAAAC,EAAA,EAAAc,EACAxD,CAAA,CAAAyC,EAAAC,EAAA,IAAAe,CAEA,CAEA,IAAAC,EAAA1D,CAAA,IACA2D,EAAA3D,CAAA,IACA,QAAA4C,EAAA,EAAwBA,EAAA,GAAQA,IAAA,CAChC,IAAAgB,EAAA7B,CAAA,CAAAa,EAAA,CACAY,EAAAR,EAAAU,EAAAC,EAAAC,GACAH,EAAAR,EAAAS,EAAAC,EAAAC,GACAC,EAAA/B,CAAA,CAAAc,EAAA,CACAc,EAAA1D,CAAA,CAAA6D,EAAA,CACAF,EAAA3D,CAAA,CAAA6D,EAAA,GACA7D,CAAA,CAAA6D,EAAA,CAAAL,EACAxD,CAAA,CAAA6D,EAAA,GAAAJ,CACA,CAEA,QAAAf,EAAA,EAAwBA,EAAA,GAAQA,GAAA,IAChC,QAAAD,EAAA,EAA4BA,EAAA,GAAQA,IACpCU,CAAA,CAAAV,EAAA,CAAAzC,CAAA,CAAA0C,EAAAD,EAAA,CACA,QAAAA,EAAA,EAA4BA,EAAA,GAAQA,IACpCzC,CAAA,CAAA0C,EAAAD,EAAA,GAAAU,CAAA,EAAAV,EAAA,OAAAU,CAAA,EAAAV,EAAA,OAGAzC,CAAA,KAAA8C,CAAA,CAAAP,EAAA,CACAvC,CAAA,KAAA+C,CAAA,CAAAR,EAAA,CAEAY,EAAAW,IAAA,GACA,CACAjG,EAAA4D,OAAe,CAAAA,CACf,OAAAD,UAAAK,EAAAkC,IAAA,CAEAvH,YAAAU,CAAA,CAAA8G,CAAA,CAAA/G,CAAA,CAAAgH,EAAA,GAAAf,EAAA,IAcA,GAbA,QACA,KAAAhG,QAAA,CAAAA,EACA,KAAA8G,MAAA,CAAAA,EACA,KAAA/G,SAAA,CAAAA,EACA,KAAAgH,SAAA,CAAAA,EACA,KAAAf,MAAA,CAAAA,EACA,KAAAgB,GAAA,GACA,KAAAC,MAAA,GACA,KAAA5G,QAAA,IACA,KAAAD,SAAA,IAEA,GAAAoE,EAAA3F,MAAA,EAAAkB,GAEA,QAAAC,QAAA,OAAAA,QAAA,MACA,uDACA,MAAAkH,KAAA,KAAA7H,WAAA,KACA,KAAA8H,OAAA,IAAAxC,EAAAyC,GAAA,OAAAF,KAAA,CACA,CACAG,QAAA,CACA1C,EAAA2C,IAAA,EACA,GAAA3C,EAAA4C,UAAA,OAAAJ,OAAA,EACA5C,EAAA,KAAA4C,OAAA,MAAAnB,MAAA,EACArB,EAAA2C,IAAA,EACA,GAAA3C,EAAA4C,UAAA,OAAAJ,OAAA,EACA,KAAAF,MAAA,GACA,KAAAD,GAAA,EACA,CACAQ,OAAAC,CAAA,EACA,GAAAjD,EAAAvE,MAAA,QACA,IAAgBD,SAAAA,CAAA,CAAAkH,MAAAA,CAAA,EAAkB,KAElCQ,EAAAD,CADAA,EAAA,GAAA9C,EAAAgD,OAAA,EAAAF,EAAA,EACA/H,MAAA,CACA,QAAAsH,EAAA,EAA0BA,EAAAU,GAAU,CACpC,IAAAE,EAAAC,KAAArH,GAAA,CAAAR,EAAA,KAAAgH,GAAA,CAAAU,EAAAV,GACA,QAAApE,EAAA,EAA4BA,EAAAgF,EAAUhF,IACtCsE,CAAA,MAAAF,GAAA,KAAAS,CAAA,CAAAT,IAAA,CACA,KAAAA,GAAA,GAAAhH,GACA,KAAAqH,MAAA,EACA,CACA,YAEAS,QAAA,CACA,QAAAzH,QAAA,CACA,MACA,MAAAA,QAAA,IACA,IAAgB6G,MAAAA,CAAA,CAAAJ,OAAAA,CAAA,CAAAE,IAAAA,CAAA,CAAAhH,SAAAA,CAAA,EAA+B,KAE/CkH,CAAA,CAAAF,EAAA,EAAAF,EACAA,CAAAA,IAAAA,CAAA,MAAAE,IAAAhH,EAAA,GACA,KAAAqH,MAAA,GACAH,CAAA,CAAAlH,EAAA,QACA,KAAAqH,MAAA,EACA,CACAU,UAAAxH,CAAA,EACA,GAAAiE,EAAAvE,MAAA,WACA,GAAAuE,EAAAhF,KAAA,EAAAe,GACA,KAAAuH,MAAA,GACA,IAAAE,EAAA,KAAAd,KAAA,CACA,CAAgBlH,SAAAA,CAAA,EAAW,KAC3B,QAAAgH,EAAA,EAAAU,EAAAnH,EAAAb,MAAA,CAA4CsH,EAAAU,GAAU,CACtD,KAAAT,MAAA,EAAAjH,GACA,KAAAqH,MAAA,GACA,IAAAO,EAAAC,KAAArH,GAAA,CAAAR,EAAA,KAAAiH,MAAA,CAAAS,EAAAV,GACAzG,EAAA0H,GAAA,CAAAD,EAAAE,QAAA,MAAAjB,MAAA,MAAAA,MAAA,CAAAW,GAAAZ,GACA,KAAAC,MAAA,EAAAW,EACAZ,GAAAY,CACA,CACA,OAAArH,CACA,CACA4H,QAAA5H,CAAA,EAEA,SAAAwG,SAAA,CACA,qDACA,YAAAgB,SAAA,CAAAxH,EACA,CACA6H,IAAA5I,CAAA,EAEA,MADA,GAAAgF,EAAA3F,MAAA,EAAAW,GACA,KAAA2I,OAAA,KAAA9I,WAAAG,GACA,CACA6I,WAAA9H,CAAA,EAEA,GADA,GAAAiE,EAAAlE,MAAA,EAAAC,EAAA,MACA,KAAAF,QAAA,CACA,2CAGA,OAFA,KAAA0H,SAAA,CAAAxH,GACA,KAAA+H,OAAA,GACA/H,CACA,CACAgI,QAAA,CACA,YAAAF,UAAA,KAAAhJ,WAAA,KAAAU,SAAA,EACA,CACAuI,SAAA,CACA,KAAAlI,SAAA,IACA,KAAA8G,KAAA,CAAAN,IAAA,GACA,CACA4B,WAAAC,CAAA,EACA,IAAgBzI,SAAAA,CAAA,CAAA8G,OAAAA,CAAA,CAAA/G,UAAAA,CAAA,CAAAiG,OAAAA,CAAA,CAAAe,UAAAA,CAAA,EAAiD,KAYjE,OAXA0B,GAAAA,CAAAA,EAAA,IAAAnE,EAAAtE,EAAA8G,EAAA/G,EAAAgH,EAAAf,EAAA,EACAyC,EAAAtB,OAAA,CAAAc,GAAA,MAAAd,OAAA,EACAsB,EAAAzB,GAAA,MAAAA,GAAA,CACAyB,EAAAxB,MAAA,MAAAA,MAAA,CACAwB,EAAApI,QAAA,MAAAA,QAAA,CACAoI,EAAAzC,MAAA,CAAAA,EAEAyC,EAAA3B,MAAA,CAAAA,EACA2B,EAAA1I,SAAA,CAAAA,EACA0I,EAAA1B,SAAA,CAAAA,EACA0B,EAAArI,SAAA,MAAAA,SAAA,CACAqI,CACA,CACA,CACA9H,EAAA2D,MAAc,CAAAA,EACd,IAAAoE,EAAA,CAAA5B,EAAA9G,EAAAD,IAAA,GAAA4E,EAAAgE,eAAA,UAAArE,EAAAtE,EAAA8G,EAAA/G,GACAY,CAAAA,EAAA0D,QAAgB,CAAAqE,EAAA,UAKhB/H,EAAAyD,QAAgB,CAAAsE,EAAA,UAChB/H,EAAAwD,QAAgB,CAAAuE,EAAA,UAChB/H,EAAAuD,QAAgB,CAAAwE,EAAA,SAChB/H,EAAAsD,UAAkB,CAAAyE,EAAA,UAKlB/H,EAAAqD,UAAkB,CAAA0E,EAAA,UAClB/H,EAAAoD,UAAkB,CAAA2E,EAAA,UAClB/H,EAAAmD,UAAkB,CAAA4E,EAAA,SAClB,IAAAE,EAAA,CAAA9B,EAAA9G,EAAAD,IAAA,GAAA4E,EAAAkE,0BAAA,GAAAC,EAAA,EAAuG,OAAAxE,EAAAtE,EAAA8G,EAAAgC,KAAAnF,IAAAmF,EAAAC,KAAA,CAAAhJ,EAAA+I,EAAAC,KAAA,KACvGpI,CAAAA,EAAAkD,QAAgB,CAAA+E,EAAA,WAChBjI,EAAAiD,QAAgB,CAAAgF,EAAA,+CCvNhBnI,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqI,WAAmB,CAAGrI,EAAAkI,0BAAkC,CAAGlI,EAAAsI,uBAA+B,CAAGtI,EAAAgI,eAAuB,CAAGhI,EAAAuI,SAAiB,CAAGvI,EAAAkG,IAAY,CAAGlG,EAAAwI,WAAmB,CAAGxI,EAAAgH,OAAe,CAAGhH,EAAAyI,WAAmB,CAAGzI,EAAA0I,SAAiB,CAAG1I,EAAA2I,QAAgB,CAAG3I,EAAA4I,UAAkB,CAAG5I,EAAA6I,UAAkB,CAAG7I,EAAA4G,UAAkB,CAAG5G,EAAA8I,YAAoB,CAAG9I,EAAA+I,QAAgB,CAAG/I,EAAA2G,IAAY,CAAG3G,EAAAgJ,IAAY,CAAGhJ,EAAAiJ,IAAY,CAAGjJ,EAAAkJ,UAAkB,CAAGlJ,EAAAyG,GAAW,CAAGzG,EAAAmJ,EAAU,CAAGnJ,EAAAxB,OAAe,QAOpd,IAAA4K,EAAiBtF,EAAQ,OACzBD,EAAqBC,EAAQ,MAO7B9D,CAAAA,EAAAxB,OAAe,CAJf,SAAAC,CAAA,EACA,OAAAA,aAAAC,YACAD,MAAAA,GAAA,iBAAAA,GAAAA,eAAAA,EAAAE,WAAA,CAAAC,IAAA,EAKAoB,EAAAmJ,EAAU,CADV,OAAAzK,WAAA2K,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAAF,EAAAG,UAAA,EAGAxJ,EAAAyG,GAAW,CADX,OAAA1E,YAAAsH,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAArC,KAAAuC,KAAA,CAAAJ,EAAAG,UAAA,KAIAxJ,EAAAkJ,UAAkB,CADlB,OAAAQ,SAAAL,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAAF,EAAAG,UAAA,EAIAxJ,EAAAiJ,IAAY,CADZ,CAAAU,EAAA5D,IAAA,MAAAA,EAAA4D,IAAA5D,EAIA/F,EAAAgJ,IAAY,CADZ,CAAAW,EAAA5D,IAAA,GAAAA,EAAA,OAAAA,IAAA,EAEA/F,EAAA2G,IAAY,UAAAjI,WAAA,IAAAqD,YAAA,aAAAuH,MAAA,KAMZtJ,EAAA+I,QAAgB,CAJhB,oBACA,cACA,YACA,WAGA/I,EAAA8I,YAAoB,CAAA9I,EAAA2G,IAAA,IAAAxI,EAAA,MAAA6B,EAAA+I,QAAA,EAAA5K,GAOpB6B,EAAA4G,UAAkB,CALlB,SAAAyC,CAAA,EACA,QAAApH,EAAA,EAAoBA,EAAAoH,EAAAtK,MAAA,CAAgBkD,IACpCoH,CAAA,CAAApH,EAAA,IAAAjC,EAAA+I,QAAA,EAAAM,CAAA,CAAApH,EAAA,CAEA,EAGA,IAAA2H,EAAAC,MAAAC,IAAA,EAA2C/K,OAAA,KAAa,CAAAgL,EAAA9H,IAAAA,EAAA+H,QAAA,KAAAC,QAAA,QAaxDjK,CAAAA,EAAA6I,UAAkB,CATlB,SAAAhK,CAAA,EACA,GAAAgF,EAAAhF,KAAA,EAAAA,GAEA,IAAAqL,EAAA,GACA,QAAAjI,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IACtCiI,GAAAN,CAAA,CAAA/K,CAAA,CAAAoD,EAAA,EAEA,OAAAiI,CACA,EAGA,IAAAC,EAAA,CAAiBC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,KACjB,SAAAC,EAAAC,CAAA,SACA,GAAAR,EAAAC,EAAA,EAAAO,GAAAR,EAAAE,EAAA,CACAM,EAAAR,EAAAC,EAAA,CACAO,GAAAR,EAAAG,EAAA,EAAAK,GAAAR,EAAAI,EAAA,CACAI,EAAAR,CAAAA,EAAAG,EAAA,KACAK,GAAAR,EAAAK,EAAA,EAAAG,GAAAR,EAAAM,EAAA,CACAE,EAAAR,CAAAA,EAAAK,EAAA,WAEA,CAuBAxK,EAAA4I,UAAkB,CAnBlB,SAAAsB,CAAA,EACA,oBAAAA,EACA,+CAAAA,GACA,IAAAU,EAAAV,EAAAnL,MAAA,CACA8L,EAAAD,EAAA,EACA,GAAAA,EAAA,EACA,sEAAAA,GACA,IAAAE,EAAA,IAAApM,WAAAmM,GACA,QAAAE,EAAA,EAAAC,EAAA,EAA6BD,EAAAF,EAASE,IAAAC,GAAA,GACtC,IAAAC,EAAAP,EAAAR,EAAAgB,UAAA,CAAAF,IACAG,EAAAT,EAAAR,EAAAgB,UAAA,CAAAF,EAAA,IACA,GAAAC,KAAAjI,IAAAiI,GAAAE,KAAAnI,IAAAmI,EAEA,2DADAjB,CAAAA,CAAA,CAAAc,EAAA,CAAAd,CAAA,CAAAc,EAAA,IACA,cAAAA,EAEAF,CAAAA,CAAA,CAAAC,EAAA,CAAAE,GAAAA,EAAAE,CACA,CACA,OAAAL,CACA,EAKA,IAAAnC,EAAA,YAGA,eAAAD,EAAA0C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAC,KAAAC,GAAA,GACA,QAAAxJ,EAAA,EAAoBA,EAAAmJ,EAAWnJ,IAAA,CAC/BqJ,EAAArJ,GAEA,IAAAyJ,EAAAF,KAAAC,GAAA,GAAAF,EACAG,GAAA,GAAAA,EAAAL,IAEA,SAAArL,EAAA2I,QAAA,IACA4C,GAAAG,EACA,CACA,CAKA,SAAAjD,EAAAkD,CAAA,EACA,oBAAAA,EACA,gDAA4D,OAAAA,EAAW,GACvE,WAAAjN,WAAA,IAAAkN,cAAAC,MAAA,CAAAF,GACA,CAOA,SAAA3E,EAAAF,CAAA,EAIA,MAHA,iBAAAA,GACAA,CAAAA,EAAA2B,EAAA3B,EAAA,EACA,GAAAjD,EAAAhF,KAAA,EAAAiI,GACAA,CACA,CAlCA9G,EAAA2I,QAAgB,CAAAA,EAchB3I,EAAA0I,SAAiB,CAAAA,EASjB1I,EAAAyI,WAAmB,CAAAA,EAYnBzI,EAAAgH,OAAe,CAAAA,EAmBfhH,EAAAwI,WAAmB,CAfnB,YAAAsD,CAAA,EACA,IAAAC,EAAA,EACA,QAAA9J,EAAA,EAAoBA,EAAA6J,EAAA/M,MAAA,CAAmBkD,IAAA,CACvC,IAAAxD,EAAAqN,CAAA,CAAA7J,EAAA,CACA,GAAA4B,EAAAhF,KAAA,EAAAJ,GACAsN,GAAAtN,EAAAM,MAAA,CAEA,IAAAiN,EAAA,IAAAtN,WAAAqN,GACA,QAAA9J,EAAA,EAAAgK,EAAA,EAA6BhK,EAAA6J,EAAA/M,MAAA,CAAmBkD,IAAA,CAChD,IAAAxD,EAAAqN,CAAA,CAAA7J,EAAA,CACA+J,EAAA1E,GAAA,CAAA7I,EAAAwN,GACAA,GAAAxN,EAAAM,MAAA,CAEA,OAAAiN,CACA,CAGA,OAAA9F,EAEAgG,OAAA,CACA,YAAArE,UAAA,EACA,CACA,CACA7H,EAAAkG,IAAY,CAAAA,EACZ,IAAAiG,EAAA,GAAgBnC,QAAA,CAOhBhK,EAAAuI,SAAiB,CANjB,SAAA6D,CAAA,CAAAjE,CAAA,EACA,GAAAA,KAAAnF,IAAAmF,GAAAgE,oBAAAA,EAAAE,IAAA,CAAAlE,GACA,qDAEA,OADArI,OAAAwM,MAAA,CAAAF,EAAAjE,EAEA,EAUAnI,EAAAgI,eAAuB,CARvB,SAAAuE,CAAA,EACA,IAAAC,EAAA,GAAAD,IAAA1F,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,KAAAoN,IACAC,CACA,EAUAxM,EAAAsI,uBAA+B,CAR/B,SAAAiE,CAAA,EACA,IAAAC,EAAA,CAAAC,EAAAtE,IAAAoE,EAAApE,GAAAtB,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,EAAA,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,IAAAoN,EAAApE,GACAqE,CACA,EAUAxM,EAAAkI,0BAAkC,CARlC,SAAAqE,CAAA,EACA,IAAAC,EAAA,CAAAC,EAAAtE,IAAAoE,EAAApE,GAAAtB,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,EAAA,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,IAAAoN,EAAApE,GACAqE,CACA,EAWAxM,EAAAqI,WAAmB,CANnB,SAAAsE,EAAA,IACA,GAAAvD,EAAAtG,MAAA,qBAAAsG,EAAAtG,MAAA,CAAA8J,eAAA,CACA,OAAAxD,EAAAtG,MAAA,CAAA8J,eAAA,KAAAlO,WAAAiO,GAEA,sDACA,sCC/MA,IAAAE,EAAA,WAAAA,eAAA,WAAAC,CAAA,EACA,UAAAA,EAAAC,UAAA,CAAAD,EAAA,CAA6C,QAAAA,CAAA,CAC7C,EAEAhN,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAgN,aAAqB,QACrB,IAAAC,EAAAJ,EAA8B/I,EAAQ,QACtCoJ,EAAAL,EAAuC/I,EAAQ,QAC/CqJ,EAAgBrJ,EAAQ,OACxBsJ,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4IA,QACAC,EACA,OAAAC,aAAA,CACA,IAAAC,EAAA,IAAAN,EAAAO,OAAA,CAAAJ,GAEA,GADAG,EAAAE,QAAA,GACAF,EAAAG,MAAA,CAAA3O,MAAA,CAIA,MAHA4O,QAAAC,KAAA,CAAAL,EAAAM,aAAA,IACAF,QAAAC,KAAA,CAAAL,EAAAO,YAAA,IACAH,QAAAI,GAAA,CAAAR,EAAAS,sBAAA,IACA,iCAEA,OAAAT,EAAAU,QAAA,EACA,CACA,CAEAZ,EAAAa,UAAA,CAAA1D,EAAA8C,WAAA,EACA,OAAAN,EACArO,YAAA8N,CAAA,EACA,IAAA0B,EAAA,IAAAjB,EAAAM,OAAA,CAAAW,MAAA,CACAA,EAAAC,GAAA,KAAAlB,EAAAM,OAAA,CAAAY,GAAA,CACA,IAAAC,EAAAnB,EAAAM,OAAA,CAAAc,GAAA,CAQAH,EAAAC,GAAA,CAAAG,SAAA,CAAAC,MAAA,CAPA,SAAAjI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EAAAJ,IAAAA,GACA5H,CAAAA,EAAA0H,MAAA,CAAAtB,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,CAAAU,MAAA,CAPA,SAAA1I,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAmI,MAAA,CAAA/B,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,CAAAW,OAAA,CAPA,SAAA3I,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAoI,OAAA,CAAAhC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,CAAAY,SAAA,CAPA,SAAA5I,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAqI,SAAA,CAAAjC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EAWAT,EAAAC,GAAA,CAAAG,SAAA,CAAAa,GAAA,CATA,SAAA7I,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAAsI,GAAA,EACAtI,CAAAA,EAAAsI,GAAA,CAAAlC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAGAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,CAAAc,OAAA,CAPA,SAAA9I,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAuI,OAAA,CAAAnC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,aAPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAwI,OAAA,IAAAnC,EAAAoC,kBAAA,EAAArC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,GAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,CAAAiB,KAAA,CAPA,SAAAjJ,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA0I,KAAA,CAAAtC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,cAPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA2I,QAAA,CAAAvC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,oBAPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA4I,cAAA,CAAAxC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,eAPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA6I,SAAA,CAAAzC,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EASAT,EAAAC,GAAA,CAAAG,SAAA,eAPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA8I,SAAA,CAAA1C,EAAAM,OAAA,CAAAuB,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAC,EAAA,EAEAC,CACA,EAYAT,EAAAC,GAAA,CAAAG,SAAA,CAAAsB,SAAA,CAVA,SAAAtJ,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAA7H,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAOA,OANAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA+I,SAAA,CAAA3C,EAAAM,OAAA,CAAAuB,KAAA,CACAC,aAAA,CAAAP,EAAAC,EAAAC,GACAmB,KAAA,IACAxO,KAAA,UAEAsN,CACA,EAEA,IAAAmB,EAAA5B,EAAA6B,KAAA,CAAA3C,EAAAa,UAAA,yBAAAzB,GACA,IAAAsD,EAAAE,OAAA,CACA,gCAAgDC,KAAAC,SAAA,CAAAJ,GAAuB,GAEvE,IAAAK,EAAA,GAEA,QAAAC,EAAApQ,EAAA,GADAkO,EAAAC,GAAA,CAAAkC,SAAA,CAAAF,GACAtQ,OAAAyQ,OAAA,CAAAH,IACA,KAAAC,EAAA,CAAApQ,EAEA,YAAAgP,MAAA,CAAAlQ,MAAA,CACA,uCAEA,OAAAoO,EAAAqD,cAAA,OAAAtB,OAAA,EACA,gDAEA,CACA,CACAlP,EAAAgN,aAAqB,CAAAA,sCCxSrB,IAAAyD,EAAA,WAAAA,eAAA,EAAA3Q,CAAAA,OAAAX,MAAA,UAAAuR,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACA,IAAAE,EAAAhR,OAAAiR,wBAAA,CAAAJ,EAAAC,GACA,EAAAE,GAAA,SAAAA,EAAA,CAAAH,EAAA5D,UAAA,CAAA+D,EAAAE,QAAA,EAAAF,EAAAG,YAAA,IACAH,CAAAA,EAAA,CAAeI,WAAA,GAAAC,IAAA,WAAoC,OAAAR,CAAA,CAAAC,EAAA,IAEnD9Q,OAAAC,cAAA,CAAA2Q,EAAAG,EAAAC,EACA,EAAC,SAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACD7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACAF,CAAA,CAAAG,EAAA,CAAAF,CAAA,CAAAC,EAAA,CACC,EACDQ,EAAA,WAAAA,YAAA,WAAAT,CAAA,CAAA3Q,CAAA,EACA,QAAAqR,KAAAV,EAAA,YAAAU,GAAAvR,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAArM,EAAAqR,IAAAZ,EAAAzQ,EAAA2Q,EAAAU,EACA,EACAvR,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAgN,aAAqB,QACrB,IAAAwE,EAAe1N,EAAQ,OACvBhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAK,EAAAxE,aAAA,IACvFoE,EAAatN,EAAQ,OAAS9D,uCClB9BF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAuP,kBAA0B,CAAGvP,EAAAwQ,cAAsB,QACnD,IAAAiB,EAAe3N,EAAQ,OACvBqJ,EAAgBrJ,EAAQ,MAuBxB9D,CAAAA,EAAAwQ,cAAsB,CAjBtB,IACA,GAAAtB,IAAAA,EAAAnQ,MAAA,CACA,SAEA,IAAA2S,EAAA,GAA4BxC,EAAQ,EAAAyC,WAAA,GAAAC,OAAA,UACpC3S,EAAA,GAAAkO,EAAAtE,UAAA,KAAA4I,EAAApO,UAAA,EAAAqO,IACA9C,EAAA,KACA,QAAA3M,EAAA,EAAoBA,EAAAyP,EAAA3S,MAAA,CAAyBkD,IAC7C4P,SAAA5S,CAAA,CAAAgD,EAAA,QACA2M,GAAA8C,CAAA,CAAAzP,EAAA,CAAA6P,WAAA,GAGAlD,GAAA8C,CAAA,CAAAzP,EAAA,CAGA,OAAAiN,IAAAN,CACA,EAUA5O,EAAAuP,kBAA0B,CAR1B,IACA,IAAAwC,EAAAF,SAAA3T,GACA,GAAA8T,MAAAD,IAEAA,IAAAE,IADA,+BAGA,OAAAF,CACA,yBCPAG,EAAAlS,OAAA,UAAAmS,CAAA,MAqQAC,EApQA,IAAUC,OAAAA,CAAA,EAAWvO,EAAQ,OAC7BwO,EAAA,WACAC,EAAA,KAGAC,EAAiB1O,EAAQ,OACzB2O,EAAoB3O,EAAQ,OAC5B4O,EAAkB5O,EAAQ,OAC1BqK,EAAA,GAAsBrK,CAAAA,EAAQ,MAAU,EACxC,CAAU6O,WAAAA,CAAA,CAAAC,eAAAA,CAAA,CAAAC,oBAAAA,CAAA,CAAAC,qBAAAA,CAAA,EAA0EhP,EAAQ,OAC5FiP,EAAoBjP,EAAQ,OAI5BkP,EAAA,SAAAvE,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,MAQAmM,EAJA,IAAAC,EAAA,gBAAwCX,EAAAY,KAAA,CAAAC,cAAA,CAA4B,IACpEC,EAAA,UACAC,EAAA,gBAAwCf,EAAAY,KAAA,CAAAI,aAAA,CAA2B,IACnEC,EAAA,UAEAC,EAAA,GAEA,KACA,MAAAC,OAAA,CAAAlF,IAAAA,IAAAA,EAAA1P,MAAA,EADA,CAIA,oBAAAkU,EACA,mDAEA,GAAAA,GAAAxE,EAAA1P,MAAA,CACA,MAGAmU,EADA,iBAAAnM,GAAAkM,EAAAlM,GAAA0H,EAAA1P,MAAA,CACA0P,EAAA1P,MAAA,CAEAkU,EAAAlM,EAEA,IAAAR,EAzBA,EA0BA,QAAAtE,EAAAgR,EAAwBhR,EAAAiR,EAASjR,GAAA,GACjC,IAAA2R,EAAAnF,CAAA,CAAAxM,EAAA,CACA,GAAA2R,GAAA,IAAAA,GAAA,IAUA,OARArN,IAAAA,GACAmN,GAAAJ,EACA/M,EAhCA,GAEA,IA+BYA,IACZmN,GAAAD,EACAlN,EAnCA,GAsCAqN,GACA,QACAF,GAAA,SACA,KACA,SACAA,GAAA,OACA,KACA,SACAA,GAAA,OACA,KACA,SACAA,GAAA,QACA,KACA,SACAA,GAAA,SACA,KACA,SACAA,GAAA,SACA,KACA,SACAA,GAAA,SACA,KACA,SACAA,GAAAG,OAAAC,YAAA,CAAAF,EAEA,MACUA,IAAAA,GAAAA,KAAAA,GAAAA,KAAAA,GAEVrN,IAAAA,GACAmN,GAAAP,EACA5M,EAnEA,GACA,IAmEYA,IACZmN,GAAAD,EAAAN,EACA5M,EAtEA,GAwEA,IAAAqN,GACAF,CAAAA,GAAA,OAEA,KAAAE,GACAF,CAAAA,GAAA,MAEA,KAAAE,GACAF,CAAAA,GAAA,QAIAnN,IAAAA,GACAmN,GAAAH,EACAhN,EApFA,GADA,IAsFYA,IACZmN,GAAAJ,EAAAC,EACAhN,EAvFA,GA0FAmN,GAAA,MAAwBlB,EAAAzD,KAAA,CAAAgF,SAAA,CAAAH,GAA2B,EAEnD,CA5FA,IA6FArN,GACAmN,CAAAA,GAAAD,CAAA,EA/FA,IAiGAlN,GACAmN,CAAAA,GAAAJ,CAAA,EAEA,KACA,CACA,OAAAI,CACA,EAEAM,EAAA,SAAAvF,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACA,IAAA4E,EAAA,GACA,QAAA1J,EAAAgR,EAAsBhR,EAAAgR,EAAAlM,EAAe9E,GAAA,GACrC,IAAA2R,EAAAnF,CAAA,CAAAxM,EAAA,CACA,GAAA2R,GAAA,IAAAA,GAAA,IACAjI,GAAAkI,OAAAC,YAAA,CAAAF,QAEA,OAAAA,GACA,OACAjI,GAAA,MACA,KACA,SACAA,GAAA,MACA,KACA,SACAA,GAAA,MACA,KACA,SACAA,GAAA,WAEA,CAEA,CACA,OAAAA,CACA,EAEAmC,EAAA,SAAAmG,CAAA,EACA,IAAAtI,EAAA,0BASA,OARAsI,EAAAC,OAAA,KAKAvI,GAHA;SAAA,EAAyBwI,EAAAC,MAAA,CACzB,iBAA+BD,EAAAE,SAAA,CAC/B,aAA2BF,EAAApV,MAAA,CAC3B,WAAyBiV,EAAAzB,EAAA9D,KAAA,CAAA0F,EAAAE,SAAA,CAAAF,EAAApV,MAAA,EAAyD,CAH9C,GAKpC4M,GAAA,IAEA,EAEA2I,EAAA,SAAAL,CAAA,EACA,IAAAP,EAAA,UAMAA,GALA,iBAA6BlB,EAAAY,KAAA,CAAAmB,aAAA;;;CAA2B,CAMxDN,EAAAC,OAAA,KAOAR,GALA,WAAqBS,EAAAC,MAAA,CACrB,WAA0BD,EAAAE,SAAA,CAC1B,WAA0BF,EAAApV,MAAA,CAC1B,WAA0BiU,EAAAT,EAAA9D,KAAA,CAAA0F,EAAAE,SAAA,CAAAF,EAAApV,MAAA,EAAwD;AAAA,CAHlD,GAQhC2U,GAAA,YAEA,EAEAc,EAAA,SAAA9G,CAAA,CAAAuG,CAAA,CAAAxF,CAAA,CAAAgG,CAAA,EACA,IAAArB,EAAA,CAAAZ,EACAkB,EAAA,GACAgB,EAAA,gBAAuCtB,EAAAI,aAAA,CAAoB,gBAAS,EAuCpE,OAtCAE,GAAA,oBAAgCN,EAAAmB,aAAA,CAAoB;AAAA,EACpDE,GAAA,iBAAAA,GACAf,CAAAA,GAAA,YAA0Be,EAAM;AAAA,GAEhCf,GAAA,kGACAhG,EAAAwG,OAAA,SACAS,EACAC,EACA3B,EACAC,EACA2B,EACA,IAAAC,EAAA,GACA3O,EAAA,EACA8N,CAAA,IAAAA,EAAAlV,MAAA,EACA8V,EAAAH,EACAE,EAAA,IAGA3B,EAAA0B,CADAA,EAAAV,CAAA,CAAAE,EAAAQ,IAAA,GACAN,SAAA,CACAF,EAAAxJ,IAAA,CAAAsI,GACA6B,CAAAA,EAAA9B,EAAAvE,EAAAwE,EAAAkB,EAAAxJ,IAAA,CAAAsI,EAAA,EAEAA,CAAAA,EAAAkB,EAAAxJ,IAAA,EACAuI,CAAAA,EAAAyB,EAAAN,SAAA,CAAAM,EAAA5V,MAAA,GAEAoH,CAAAA,EAAA6M,EAAAvE,EAAAwE,EAAAC,EAAAD,EAAA,EAEA4B,EAAAC,EAAAJ,EAAAvO,EACAyO,EAAAT,EAAAxJ,IAAA,CAAAgK,EAAAN,SAAA,CAMAX,GAJA,WAAuBS,EAAAQ,IAAA,CAAS,WAAWA,EAAAN,SAAA,CAAe,WAAWO,EAAQ,WAAWC,EAGxF;0CAAuD,EAAErC,EAAAzD,KAAA,CAAAgG,iBAAA,CAAAZ,EAAA1H,GAAA,EAAwC;AAAA,CAHJ,CAM7F,GACAiH,GAAA,gBAEA,EAEA7F,EAAA,SAAAH,CAAA,CAAAuG,CAAA,CAAAxF,CAAA,EACA,IAAA9C,EACAgJ,EACA1B,EACAlM,EAsBA,OArBA4E,EAAA,GACA+B,EAAAwG,OAAA,KACAS,EAAAV,CAAA,CAAArG,EAAA+G,IAAA,EAGAhJ,GAFA,GAAgBgJ,EAAAP,MAAA,CAChB,IAAgBO,EAAAN,SAAA,CAChB,IAAgBzG,EAAAjD,IAAA,CAAAgK,EAAAN,SAAA,CAA4B,GAFhB,CAG5BpB,EAAA0B,EAAAN,SAAA,CACAtN,EAAA6G,EAAAjD,IAAA,CAAAgK,EAAAN,SAAA,CAEA1I,GADAqI,EAAAvF,EAAAwE,EAAAlM,GACA,OACAkM,EAAArF,EAAAjD,IAAA,CACA5D,EAAA4N,EAAAN,SAAA,CAAAM,EAAA5V,MAAA,CAAA6O,EAAAjD,IAAA,CAQAgB,GAPAqI,EAAAvF,EAAAwE,EAAAlM,GACA,KACA,GAAgB4N,EAAAP,MAAA,CAAY,IAC5B,GAAgBO,EAAAN,SAAA,CAAe,IAC/B,GAAgBzG,EAAAjD,IAAA,CAAAgK,EAAAN,SAAA,CAA4B,IAC5C,UACAzG,EAAAnB,GAAA,CACA,IACA,GACAd,CACA,EACAqJ,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,EAkCA,GAHA,KAAA1H,MAAA,IAGA2E,EAAAgD,QAAA,CAAAlD,GACA,KAAA1D,KAAA,CAAAgE,EAAA6C,MAAA,UAAAnD,QACI,GAAAtI,MAAA8J,OAAA,CAAAxB,GACJ,KAAA1D,KAAA,CAAA0D,EAAArC,KAAA,QACI,oBAAAqC,EACJ,KAAA1D,KAAA,CAAAgE,EAAA6C,MAAA,UAAAnD,QAEA,eAAuBG,EAAa,8DAEpC,MAAAiD,KAAA,CAAA9C,EAAA5G,MAAA,eAAA4C,KAAA,EAOA,KAAA+G,IAAA,UAAAC,CAAA,CAAAC,CAAA,EACA,KAAAzB,KAAA,CAAAvB,EAAA,KAAAjE,KAAA,MAAAf,MAAA,CAAA+H,EAAAC,GACAV,EAAA,EACA,EAQA,KAAAhF,KAAA,UAAAyF,CAAA,CAAAE,CAAA,CAAAD,CAAA,EACA,IAAAV,EACA,eAAyB1C,EAAa,sBAEtCnE,EAAAyH,MAAA,MAAAnH,KAAA,MAAAwF,KAAA,MAAAvG,MAAA,CAAA+H,EAAAE,EAAAD,GACAT,EAAA,EACA,EAEA,KAAA3E,SAAA,YACA,IAAA2E,EACA,eAAyB3C,EAAa,iCAEtC,IAAA1D,EAAAT,EAAA0H,QAAA,MAAApH,KAAA,MAAAwF,KAAA,MAAAvG,MAAA,CACA,UAAAA,MAAA,CAAA3O,MAAA,GACA,KAAA+W,KAAA,CAAAlH,EAAAkH,KAAA,CACA,KAAAC,IAAA,CAAAnH,EAAAmH,IAAA,CACA3D,EAAAxD,EAAAwD,OAAA,CACA8C,EAAA,GAEA,EAEA,KAAAvC,UAAA,YACA,IAAAuC,EACA,eAAyB5C,EAAa,6CAItC,OAFA8C,EAAAzC,EAAA,KAAAmD,KAAA,MAAAC,IAAA,CAAA3D,EAAA,KAAA1E,MAAA,EACAyH,EAAA,GACAC,CACA,EAGA,KAAA3H,QAAA,UAAAgI,CAAA,EAEA,GADA,KAAAxB,KAAA,CAAAvB,EAAA,KAAAjE,KAAA,MAAAf,MAAA,CAAA+H,GACA,KAAA/H,MAAA,CAAA3O,MAAA,GAGAoP,EAAAyH,MAAA,MAAAnH,KAAA,MAAAwF,KAAA,MAAAvG,MAAA,CAAA+H,GACA,KAAA/H,MAAA,CAAA3O,MAAA,EAHA,OAMA,IAAA6P,EAAAT,EAAA0H,QAAA,MAAApH,KAAA,MAAAwF,KAAA,MAAAvG,MAAA,CACA,MAAAA,MAAA,CAAA3O,MAAA,GAGA,KAAA+W,KAAA,CAAAlH,EAAAkH,KAAA,CACA,KAAAC,IAAA,CAAAnH,EAAAmH,IAAA,CACA3D,EAAAxD,EAAAwD,OAAA,CAEAgD,EAAAzC,EAAA,KAAAmD,KAAA,MAAAC,IAAA,CAAA3D,EAAA,KAAA1E,MAAA,EACAyH,EAAA,GACA,EAOA,KAAAa,YAAA,UAAAC,EAAA,SACA,IAAAf,EACA,eAAyB5C,EAAa,6CAEtC,OAAAS,EAAA,KAAA+C,KAAA,MAAAC,IAAA,CAAAE,EACA,EASA,KAAAC,uBAAA,UAAAD,EAAA,SACA,IAAAd,EACA,eAAyB7C,EAAa,4DAEtC,OAAAQ,EAAAmD,EACA,EAQA,KAAAE,iBAAA,UAAAF,EAAA,SACA,IAAAd,EACA,eAAyB7C,EAAa,4DAKtC,OAHA8C,GACAvC,EAAAoD,GAEArD,EAAAqD,EACA,EACA,KAAAjI,sBAAA,YACA,IAAAmH,EACA,eAAyB7C,EAAa,4DAEtC,OAAAO,GACA,EAGA,KAAAuD,QAAA,UAAAC,CAAA,EACA,IAAAlB,EACA,eAAyB7C,EAAa,2EAEtC,GAAA8C,EACA,eAAyB9C,EAAa,iDAAiD8C,EAAA,OAAiB,GAExG,OAAAjH,EAAAmI,cAAA,MAAA7H,KAAA,MAAAwF,KAAA,MAAA6B,KAAA,MAAAC,IAAA,CAAAM,EACA,EAGA,KAAApI,QAAA,YACA,IAAAkH,EACA,eAAyB7C,EAAa,2EAEtC,GAAA8C,EACA,eAAyB9C,EAAa,iDAAiD8C,EAAA,OAAiB,GAExG,OAAAjH,EAAAoI,cAAA,MAAAhB,KAAA,MAAAO,KAAA,MAAAC,IAAA,CACA,EAEA,KAAAlI,aAAA,YACA,OAAAA,EAAA,KAAAH,MAAA,MAAAuG,KAAA,MAAAxF,KAAA,CACA,EAGA,KAAA+F,YAAA,UAAAC,CAAA,EACA,OAAAD,EAAA,KAAA9G,MAAA,MAAAuG,KAAA,MAAAxF,KAAA,CAAAgG,EACA,EAEA,KAAA3G,YAAA,YACA,OAAAA,EAAA,KAAAmG,KAAA,CACA,EAGA,KAAAK,WAAA,YACA,OAAAA,EAAA,KAAAL,KAAA,CACA,CAOA,yBCxbA/B,EAAAlS,OAAA,YACA,IAAAqO,EAAavK,EAAQ,OACrB,CAAU0S,eAAAA,CAAA,CAAA5D,eAAAA,CAAA,CAAAC,oBAAAA,CAAA,EAAwD/O,EAAQ,OAC1E,CAAU2S,iBAAAA,CAAA,CAAA3D,qBAAAA,CAAA,EAA2ChP,EAAQ,MAC7D,OAAA4S,EACA/X,YAAAmX,CAAA,CAAAC,CAAA,EACA,KAAAD,KAAA,CAAAA,EACA,KAAAC,IAAA,CAAAA,EACA,KAAAY,SAAA,CAAAb,EAAA/W,MAAA,CACA,KAAA6X,QAAA,CAAAb,EAAAhX,MAAA,CACA,KAAA8X,SAAA,GACA,KAAAC,oBAAA,IACA,KAAAC,kBAAA,IACA,KAAAC,mBAAA,IACA,KAAAC,WAAA,MAAAC,UAAA,MAAAP,SAAA,EACA,KAAAQ,gBAAA,MAAAD,UAAA,MAAAP,SAAA,EACA,KAAAS,eAAA,MAAAF,UAAA,MAAAP,SAAA,EACA,KAAAU,UAAA,MAAAH,UAAA,MAAAN,QAAA,EACA,KAAAU,eAAA,MAAAJ,UAAA,MAAAN,QAAA,EACA,KAAAW,eAAA,GACA,KAAAC,KAAA,IACA,KAAAC,WAAA,IACA,KAAAC,YAAA,IACA,KAAAC,QAAA,IACA,QAAA1V,EAAA,EAAsBA,EAAA,KAAA0U,SAAA,CAAoB1U,GAAA,EAC1C,KAAAuV,KAAA,CAAA1S,IAAA,MAAA8S,OAAA,MAAA9B,KAAA,CAAA7T,EAAA,GACA,KAAAyV,YAAA,CAAA5S,IAAA,MAAA8S,OAAA,MAAA9B,KAAA,CAAA7T,EAAA,GACA,KAAA0V,QAAA,CAAA7S,IAAA,MAAA+S,KAAA,CAAA/B,CAAA,CAAA7T,EAAA,MAAA0U,SAAA,MAAAC,QAAA,EAEA,MAAAkB,cAAA,MAAAA,cAAA,CAAAC,IAAA,OACA,KAAAC,aAAA,MAAAA,aAAA,CAAAD,IAAA,OACA,KAAAE,aAAA,MAAAA,aAAA,CAAAF,IAAA,OACA,KAAAG,cAAA,MAAAA,cAAA,CAAAH,IAAA,MACA,CAGAH,QAAAO,CAAA,EACA,OACAC,KAAA,GACAC,OAAA,GACAC,MAAA,GACAC,MAAA,GACAC,OAAA,GACAC,OAAA,GACAC,KAAA,GACAC,OAAA,GACAC,WAAA,GACAT,KAAAA,CACA,CACA,CAGAU,SAAAC,CAAA,EACAA,EAAAV,IAAA,IACAU,EAAAT,MAAA,IACAS,EAAAR,KAAA,IACAQ,EAAAP,KAAA,IACAO,EAAAN,MAAA,IACAM,EAAAL,MAAA,IACAK,EAAAJ,IAAA,IACAI,EAAAH,MAAA,IACAG,EAAAF,UAAA,GACA,CAEAG,SAAAC,CAAA,CAAA7G,CAAA,EACA6G,EAAAZ,IAAA,CAAAjG,EAAAiG,IAAA,CACAY,EAAAX,MAAA,CAAAlG,EAAAkG,MAAA,CACAW,EAAAV,KAAA,CAAAnG,EAAAmG,KAAA,CACAU,EAAAT,KAAA,CAAApG,EAAAoG,KAAA,CACAS,EAAAR,MAAA,CAAArG,EAAAqG,MAAA,CACAQ,EAAAP,MAAA,CAAAtG,EAAAsG,MAAA,CACAO,EAAAN,IAAA,CAAAvG,EAAAuG,IAAA,CACAM,EAAAL,MAAA,CAAAxG,EAAAwG,MAAA,CACAK,EAAAJ,UAAA,CAAAzG,EAAAyG,UAAA,CACAI,EAAAb,IAAA,CAAAhG,EAAAgG,IAAA,CAGAN,MAAAM,CAAA,CAAAxB,CAAA,CAAAC,CAAA,EASA,MARA,CACAuB,KAAAA,EACAc,cAAA5K,EAAA6K,MAAA,CACAC,YAAA,GACAC,SAAA,KAAAC,UAAA,CAAA1C,GACA2C,YAAA,KAAAD,UAAA,CAAAzC,GACA2C,aAAA,KAAAF,UAAA,CAAA1C,EACA,CAEA,CAEA6C,aAAAP,CAAA,EACA,OAAAA,GACA,KAAA5K,EAAA6K,MAAA,CACA,UACA,MAAA7K,EAAAoL,MAAA,CACA,UACA,MAAApL,EAAAqL,OAAA,CACA,UACA,SACA,eACA,CACA,CAEAL,WAAAta,CAAA,EACA,IAAA6P,EAAA,GACA,GAAA7P,EAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAAlD,EAAYkD,GAAA,EACpC2M,EAAA9J,IAAA,KAGA,OAAA8J,CACA,CAEA+K,aAAAlb,CAAA,EACA,QAAAwD,EAAA,EAAsBA,EAAAxD,EAAAM,MAAA,CAAckD,GAAA,EACpCxD,CAAA,CAAAwD,EAAA,GAEA,CAEAiV,WAAAnY,CAAA,EACA,IAAA6P,EAAA,GACA,GAAA7P,EAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAAlD,EAAYkD,GAAA,EACpC2M,EAAA9J,IAAA,CAAA7C,GAGA,OAAA2M,CACA,CAEAkJ,eAAAM,CAAA,CAAAE,CAAA,SACA,KAAAxC,KAAA,CAAAsC,EAAA,CAAAwB,KAAA,MAAA9D,KAAA,CAAAwC,EAAA,CAAAsB,KAAA,CACA,GAEA,KAAA9D,KAAA,CAAAsC,EAAA,CAAAwB,KAAA,MAAA9D,KAAA,CAAAwC,EAAA,CAAAsB,KAAA,CACA,EAEA,CACA,CAEA5B,cAAAI,CAAA,CAAAE,CAAA,SACA,KAAAvC,IAAA,CAAAqC,EAAA,CAAAwB,KAAA,MAAA7D,IAAA,CAAAuC,EAAA,CAAAsB,KAAA,CACA,GAEA,KAAA7D,IAAA,CAAAqC,EAAA,CAAAwB,KAAA,MAAA7D,IAAA,CAAAuC,EAAA,CAAAsB,KAAA,CACA,EAEA,CACA,CAEA3B,cAAAG,CAAA,CAAAE,CAAA,SACA,KAAAX,QAAA,CAAAS,EAAA,CAAAa,aAAA,MAAAtB,QAAA,CAAAW,EAAA,CAAAW,aAAA,CACA,GAEA,KAAAtB,QAAA,CAAAS,EAAA,CAAAa,aAAA,MAAAtB,QAAA,CAAAW,EAAA,CAAAW,aAAA,CACA,EAEA,CACA,CAEAf,eAAAE,CAAA,CAAAE,CAAA,EACA,QAAAX,QAAA,CAAAS,EAAA,CAAAa,aAAA,GAAA5K,EAAAqL,OAAA,OAAA/B,QAAA,CAAAW,EAAA,CAAAW,aAAA,GAAA5K,EAAAqL,OAAA,EACA,QAAA/B,QAAA,CAAAS,EAAA,CAAAe,WAAA,MAAAxB,QAAA,CAAAW,EAAA,CAAAa,WAAA,CACA,UAEA,QAAAxB,QAAA,CAAAS,EAAA,CAAAe,WAAA,MAAAxB,QAAA,CAAAW,EAAA,CAAAa,WAAA,CACA,QAEA,CACA,QACA,CACA,CAuBA,OAAWxG,WArBX,SAAAmD,EAAA,GAAAC,EAAA,GAAA3D,EAAA,GAAA1E,EAAA,IAGA,IAAAnH,EAAA,IAAAmQ,EAAAZ,EAAAC,GAcA,OATAU,EAAAlQ,GAGAiQ,EAAAjQ,GACAA,EAAAgR,eAAA,EACA7J,EAAA5I,IAAA,EAAoB6P,KAAA,EAAAhK,KAAA,EAAA8B,IAAA,GAA0BlG,EAAAgR,eAAA,kBAAuB,IAIrEhR,EAAAgR,eAAA,EAIW3E,eAAAA,EAAAC,oBAAAA,EAAAC,qBAAAA,CAAA,CACX,2BC5OAZ,EAAAlS,OAAA,YAEA,IAAA6Z,EAAiB/V,EAAQ,OACzBuK,EAAAwL,EAAAvL,GAAA,CACAwL,EAAA,GAAmBhW,CAAAA,EAAQ,MAAoB,EAC/CiW,EAAA,GAAmBjW,CAAAA,EAAQ,MAAsB,EACjDkW,EAAA,GAA4BlW,CAAAA,EAAQ,MAAiB,EAErDqK,EAAA,IAAA0L,EAAA1L,MAAA,CAEAA,EAAAC,GAAA,KAAAyL,EAAAzL,GAAA,CACAD,EAAAI,SAAA,CAAAuL,EAAAvL,SAAA,CACAJ,EAAAC,GAAA,CAAAG,SAAA,CAAAwL,EAAAxL,SAAA,CAGA,IAAA0L,EAAA,SAAAhG,CAAA,CAAAiG,CAAA,CAAAC,CAAA,EACA,GAAAD,EAAA,GAAAA,GAAAC,EAEA,UAEA,QAAAlY,EAAA,EAAoBA,EAAAgS,EAAAlV,MAAA,CAAkBkD,GAAA,EACtC,GAAAiY,GAAAjG,CAAA,CAAAhS,EAAA,CAAAoS,SAAA,EAAA6F,EAAAjG,CAAA,CAAAhS,EAAA,CAAAoS,SAAA,CAAAJ,CAAA,CAAAhS,EAAA,CAAAlD,MAAA,CACA,OAAAkD,EAIA,SACA,EACAmY,EAAA,SAAAC,CAAA,CAAAC,CAAA,EACA,IAAA1L,EAAA,GACA,GAAA0L,EAAAD,EAAAtb,MAAA,CACA,SAAAkD,EAAAqY,EAA0BrY,EAAAoY,EAAAtb,MAAA,CAAgBkD,GAAA,EAC1C,GAAAoY,OAAAA,CAAA,CAAApY,EAAA,EACA2M,EAAAyL,CAAA,CAAApY,EAAA,CACA,KACA,CACA,CAEA,OAAA2M,CACA,EAEA2L,EAAA,SAAAzE,CAAA,EACAA,EAAA5B,OAAA,KACA,IAAAsG,EAAA,GACAH,EAAA,GACAI,EAAA,EACAtC,EAAAqC,OAAA,CAAAtG,OAAA,KACAwG,EAAAC,IAAA,GAAAtM,EAAAuM,GAAA,EAAAF,IAAAA,EAAAG,QAAA,CAAA9b,MAAA,CACAsb,EAAAvV,IAAA,OACU4V,EAAAC,IAAA,GAAAtM,EAAAyM,GAAA,EAAAJ,IAAAA,EAAAG,QAAA,CAAA9b,MAAA,CACVsb,EAAAvV,IAAA,OACU4V,EAAAC,IAAA,GAAAtM,EAAA0M,GAAA,EAAAL,IAAAA,EAAA7a,GAAA,EAAA6a,IAAAA,EAAAM,GAAA,CACVX,EAAAvV,IAAA,QAEAuV,EAAAvV,IAAA,CAAA2V,GACAD,EAAA1V,IAAA,CAAA4V,GACAD,GAAA,EAEA,GACAJ,EAAAvV,IAAA,CAAA2V,GAEAD,EAAAtG,OAAA,KACA,GAAAwG,EAAAC,IAAA,GAAAtM,EAAAuM,GAAA,EAAAF,EAAAC,IAAA,GAAAtM,EAAAyM,GAAA,CACA,QAAA7Y,EAAA,EAA0BA,EAAAyY,EAAAG,QAAA,CAAA9b,MAAA,CAAwBkD,GAAA,EAClDyY,EAAAG,QAAA,CAAA5Y,EAAA,CAAAmY,EAAAC,EAAAK,EAAAG,QAAA,CAAA5Y,EAAA,CAGA,GACAkW,EAAAqC,OAAA,CAAAA,CACA,EACA,CAGA,MAAA5E,MAAA,UAAAnH,CAAA,CAAAwF,CAAA,CAAAvG,CAAA,CAAA+H,CAAA,CAAAE,CAAA,CAAAD,CAAA,EACA,GAAAA,EAAA,CACA,GAAAA,gBAAAA,EAAAuF,WAAA,CACA,+DAEA9M,CAAAA,EAAAuH,KAAA,CAAAA,CACA,CACA,IAAA5O,EAAA,EACAA,CAAAA,EAAA4G,MAAA,CAAAA,EACA5G,EAAA2O,MAAA,GAAAA,EACA3O,EAAA6O,IAAA,GAAAA,EACA7O,EAAAmN,KAAA,CAAAA,EACAnN,EAAAmT,QAAA,CAAAA,EACAnT,EAAAoU,WAAA,CAAAzM,EAAA1P,MAAA,CACA+H,EAAA6P,SAAA,GAEA5G,EADAC,KAAA,CAAAgK,EAAA,OAAAvL,EAAA3H,GACAmJ,OAAA,EACAvC,EAAA5I,IAAA,EACA6P,KAAA,EACAhK,KAAA,EACA8B,IAAA,yCACA,EAEA,EAGA,KAAAoJ,QAAA,UAAApH,CAAA,CAAAwF,CAAA,CAAAvG,CAAA,EACA,IAAA5G,EAAA,SAMA,CALAA,EAAA4G,MAAA,CAAAA,EACA5G,EAAAmN,KAAA,CAAAA,EACAnN,EAAAmT,QAAA,CAAAA,EACAnT,EAAAoU,WAAA,CAAAzM,EAAA1P,MAAA,CACAoP,EAAAC,GAAA,CAAAkC,SAAA,CAAAxJ,GACA4G,EAAA3O,MAAA,EACA,MAMAwb,EAAAzT,EAAAgP,KAAA,EACA,CACAA,MAAAhP,EAAAgP,KAAA,CACAC,KAAAjP,EAAAiP,IAAA,CACA3D,QAAAtL,EAAAqU,YAAA,EAEA,EAGA,KAAA7E,cAAA,UAAA7H,CAAA,CAAAwF,CAAA,CAAA6B,CAAA,CAAAC,CAAA,CAAAM,CAAA,EACA,IAcApU,EACAmZ,EACAC,EAqSA1P,EArTA2P,EAAA,GACAC,EAAA,GACA5F,EAAA,GAGAU,IACAA,EAAAkF,UAAA,EACAA,EAAA,GACA5F,EAAA,IACQU,EAAAV,IAAA,GACR4F,EAAA,GACA5F,EAAA,KAMA,IAAA6F,EAAA,EACAC,EAAAxJ,IACAyJ,EAAA,EACAC,EAAA,GACAC,EAAA,GACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EAkTA,OAjTA7G,EAAA5B,OAAA,KACAyH,EAAA7W,IAAA,CAAAqT,EAAAyB,KAAA,EACA4B,GAAArD,EAAAqC,OAAA,CAAAzb,MAAA,CACAoZ,EAAAqC,OAAA,CAAAtG,OAAA,KACA,OAAAwG,EAAAC,IAAA,EACA,KAAAtM,EAAAuM,GAAA,CACAiB,GAAA,EACA,KACA,MAAAxN,EAAAyM,GAAA,CACAgB,GAAA,EACA,KACA,MAAAzN,EAAAuO,GAAA,CACAb,GAAA,EACA,KACA,MAAA1N,EAAAwO,GAAA,CACAb,GAAA,EACA,KACA,MAAA3N,EAAA0M,GAAA,CACAkB,GAAA,EACA,KACA,MAAA5N,EAAAyO,GAAA,CACAZ,GAAA,EACA,KACA,MAAA7N,EAAA0O,GAAA,CACAZ,GAAA,EACA,KACA,MAAA9N,EAAA2O,GAAA,CACAR,GAAA,EACA,KACA,MAAAnO,EAAA4O,GAAA,CACAR,GAAA,EACA,KACA,MAAApO,EAAA6O,GAAA,CACAX,GAAA,EACA,KACA,MAAAlO,EAAA8O,GAAA,CACAT,GAAA,EACA,KACA,MAAArO,EAAA+O,GAAA,CACAT,GAAA,EACA,KACA,MAAAtO,EAAAgP,GAAA,CAEA,IADAjB,GAAA,EACAna,EAAA,EAAwBA,EAAAyY,EAAA4C,MAAA,CAAAve,MAAA,CAAsBkD,GAAA,EAC9CyY,EAAA4C,MAAA,CAAArb,EAAA,CAAAwZ,GACAA,CAAAA,EAAAf,EAAA4C,MAAA,CAAArb,EAAA,EAEAyY,EAAA4C,MAAA,CAAArb,EAAA,CAAAyZ,GACAA,CAAAA,EAAAhB,EAAA4C,MAAA,CAAArb,EAAA,EAGA,KACA,MAAAoM,EAAAkP,GAAA,CAEA,IADAlB,GAAA,EACApa,EAAA,EAAwBA,EAAAyY,EAAA4C,MAAA,CAAAve,MAAA,CAAsBkD,GAAA,EAC9CyY,EAAA4C,MAAA,CAAArb,EAAA,CAAAwZ,GACAA,CAAAA,EAAAf,EAAA4C,MAAA,CAAArb,EAAA,EAEAyY,EAAA4C,MAAA,CAAArb,EAAA,CAAAyZ,GACAA,CAAAA,EAAAhB,EAAA4C,MAAA,CAAArb,EAAA,EAGA,KACA,MAAAoM,EAAAmP,GAAA,CACAlB,GAAA,EACA5B,EAAA7a,GAAA,CAAA4b,GACAA,CAAAA,EAAAf,EAAA7a,GAAA,EAEA6a,EAAAM,GAAA,CAAAU,GACAA,CAAAA,EAAAhB,EAAAM,GAAA,EAEA,KACA,SACA,kDACA,CACA,EACA,GACAW,EAAA8B,IAAA,GACA1H,EAAAhX,MAAA,KACAgX,EAAA7B,OAAA,KACA0H,EAAA9W,IAAA,CAAA4Y,EAAA9D,KAAA,CACA,GACAgC,EAAA6B,IAAA,IAKAnC,yPACAjF,EACAA,EAAAsH,QAAA,CACArC,GAAA,SAA2BjF,EAAAsH,QAAA;AAAsC,EACzDpC,EACRD,GAAA,+BACQ3F,EACR2F,GAAA,uCAEAA,GAAA;AAAuD,EAGvDA,GAAA;AAAqD,EAkBrDA,GAdA;;kBAAA,EAAmCxF,EAAA/W,MAAA,CACnC;kBAAA,EAAmCgX,EAAAhX,MAAA,CACnC;kBAAA,EAAmCyc,EAEnC;;kBAAA,EAAmCK,EACnC;kBAAA,EAAmCC,EACnC;kBAAA,EAAmCG,EACnC;kBAAA,EAAmCF,EACnC;kBAAA,EAAmCK,EACnC;kBAAA,EAAmCC,EACnC;kBAAA,EAAmCC,EAEnC;;kBAAA,EAAmCN,EACnC;kBAAA,EAAmCE,EACnC;kBAAA,EAAmCC,EAAI;AAAA,CAdS,CAehDxG,GAKA2F,CAAAA,GAJA,qBAAqCkB,EACrC;kBAAA,EAAqCC,EACrC;kBAAA,EAAqCF,EACrC;kBAAA,EAAqCG,EACrC;kBAAA,EAAqCC,EAAI;AAAA,CAJA,EAMzCrB,GAAA,sBACAc,EAAAC,EAAAC,IAAA,EACAhB,GAAA,kBAEAA,GAAA,GAAmBG,EAAA,GAAa,EAAIC,EAAY,GAEhDM,EAAA,GACAV,CAAAA,GAAA,mBAQAA,qJACAxF,EAAA5B,OAAA,EAAAiE,EAAAyF,KACA,IAAAC,EAAA,gBAUAA,GATAD,EACA,gBACAzF,EAAAvZ,IAAA,CACA,cACAuZ,EAAAyB,KAAA,CACA,aACAzB,EAAAmC,KAAA,CACA,YACAnC,EAAA2F,KAAA,CACA,QACAxC,GAAAuC,CACA,GAGAvC,yCACAvF,EAAAhX,MAAA,IACAgX,EAAA7B,OAAA,EAAAwJ,EAAAE,KACA,IAAAG,EAAA,eAYAA,GAXAH,EACA,gBACAF,EAAA9e,IAAA,CACA,cACA8e,EAAA9D,KAAA,CACA,aACA8D,EAAApD,KAAA,CACA,YACAoD,EAAAnF,KAAA,CACA,YACAmF,EAAAI,KAAA,CACA,QACAxC,GAAAyC,CACA,GAGAzC,yBACAxF,EAAA5B,OAAA,EAAAiE,EAAA6F,KACAA,EAAA,GACA1C,CAAAA,GAAA,MAGAA,GADA,QAAwBnD,EAAAvZ,IAAA,CACxB;aAAA,EAAgCof,EAAU;AAAe,CADtB,CAEnC7F,EAAAqC,OAAA,CAAAtG,OAAA,EAAAwG,EAAAuD,KACA,IAAAnJ,EACA,OAAA4F,EAAAC,IAAA,EACA,KAAAtM,EAAAuM,GAAA,CACAU,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAC1EvD,EAAAC,IAAA,CACa,eAAeD,EAAAG,QAAA,CAAA7Q,QAAA,GAAuB;AAAI,EACvD,KACA,MAAAqE,EAAAyM,GAAA,CACAQ,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAC1EvD,EAAAC,IAAA,CACa,eAAeD,EAAAG,QAAA,CAAA7Q,QAAA,GAAuB;AAAI,EACvD,KACA,MAAAqE,EAAAuO,GAAA,CACAtB,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA,CAAQ,WAC1FD,EAAAJ,KAAA,CACA,UAAgB,EAASxE,CAAA,CAAA4E,EAAAJ,KAAA,EAAA1b,IAAA,CAAqB;AAAA,EAC9C,KACA,MAAAyP,EAAA6O,GAAA,CACAxC,EAAAJ,KAAA,EAAAxE,EAAA/W,MAAA,EACAqc,EAAArF,CAAA,CAAA2E,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,EAAAH,IAAA,CACAyc,EAAAtF,CAAA,CAAA2E,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,EAAA6a,KAAA,GAEAwB,EAAAtF,CAAA,CAAA4E,EAAAJ,KAAA,EAAA1b,IAAA,CACAyc,EAAAvF,CAAA,CAAA4E,EAAAJ,KAAA,EAAAV,KAAA,EAEA9E,EAAA,KACA4F,EAAAwD,OAAA,GAAA7P,EAAA8P,WAAA,EACArJ,CAAAA,EAAA,MAEA4F,EAAA0D,OAAA,GAAA/P,EAAAgQ,WAAA,CACAvJ,GAAA,KAEAA,GAAA,KAEAsG,EAAAtG,EAAAsG,EACAE,GACA,gBAA8B0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA,CAAQ,WAAWD,EAAAJ,KAAA,CAAS,YAAYe,EAClH,cAA4BX,EAAAwD,OAAA,CAAW,aAAaxD,EAAA0D,OAAA,aAAc,EAAWhD,EAAQ;AAAA,CADsC,CAE3H,KACA,MAAA/M,EAAAwO,GAAA,CACAvB,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA,CAAQ,WAC1FD,EAAAnC,KAAA,CACa,WAAWmC,EAAAJ,KAAA,WAAY,EAASvE,CAAA,CAAA2E,EAAAJ,KAAA,EAAA1b,IAAA,CAAoB;AAAA,EACjE,KACA,MAAAyP,EAAA0M,GAAA,CACAO,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA,CAAQ,SAASD,EAAA7a,GAAA,CAAO,SAAS6a,EAAAM,GAAA;AAAU,EAC7H,KACA,MAAA3M,EAAAyO,GAAA,CACAxB,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAA0O,GAAA,CACAzB,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAA8O,GAAA,CACA7B,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAA+O,GAAA,CACA9B,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAA2O,GAAA,CACA1B,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAA4O,GAAA,CACA3B,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA;AAAW,EAC7F,KACA,MAAAtM,EAAAgP,GAAA,CACA/B,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAC1EvD,EAAAC,IAAA,CACa,aAAaD,EAAA4C,MAAA,CAAAtT,QAAA,GAAqB;AAAI,EACnD,KACA,MAAAqE,EAAAkP,GAAA,CACAjC,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAC1EvD,EAAAC,IAAA,CACa,aAAaD,EAAA4C,MAAA,CAAAtT,QAAA,GAAqB;AAAI,EACnD,KACA,MAAAqE,EAAAmP,GAAA,CACAlC,GAAA,gBAAsC0C,EAAU,YAAYC,EAAQ,YAAM,EAAQvD,EAAAC,IAAA,CAAQ,SAASD,EAAA7a,GAAA,CAAO,SAAS6a,EAAAM,GAAA;AAAU,EAC7H,KACA,SACA,mDACA,CACA,EACA,GAIAM,0KAEArH,EAAAC,OAAA,KACA,IAAAhB,EAAAyB,EAAAN,SAAA,CAAAM,EAAA5V,MAAA,CACA4M,EAAA,GACA2P,GAAA,eACA,QAAAsC,EAAAjJ,EAAAN,SAAA,CAAoCuJ,EAAA1K,EAAU0K,GAAA,GAC9C,OAAAnP,CAAA,CAAAmP,EAAA,EACA,OACAjS,EAAA,IACA,KACA,SACAA,EAAA,MACA,KACA,SACAA,EAAA,MACA,KACA,SACAA,EAAA,MACA,KACA,SACAA,EAAA,OACA,KACA,SACAA,EAAAkI,OAAAC,YAAA,CAAArF,CAAA,CAAAmP,EAAA,CAEA,CACAtC,GAAA3P,CACA,CACA2P,GAAA,MACA,GAGAA,8BAEA,EAIA,KAAA/E,cAAA,UAAA+H,CAAA,CAAAxI,CAAA,CAAAC,CAAA,EACA,IAAAwI,EAAA,GACA5C,EAAA,GACAC,EAAA,GACA0B,EAAAgB,EAAAxO,KAAA,IA0BA,OAzBAyO,EAAAC,aAAA,iBACA1I,EAAA5B,OAAA,KACAyH,EAAA7W,IAAA,CAAAqT,EAAAyB,KAAA,CACA,GACA+B,EAAA8B,IAAA,GACA1H,EAAAhX,MAAA,KACAgX,EAAA7B,OAAA,KACA0H,EAAA9W,IAAA,CAAA4Y,EAAA9D,KAAA,CACA,GACAgC,EAAA6B,IAAA,IAEAc,EAAAhQ,SAAA,IACAoN,EAAAzH,OAAA,KACAqK,EAAAhQ,SAAA,CAAA3P,EAAA,GACA,GACAmX,EAAAhX,MAAA,IACA6c,EAAA1H,OAAA,KACAqK,EAAAhQ,SAAA,CAAA3P,EAAA,GACA,GAEA2f,EAAAzI,KAAA,CAAAA,EACAyI,EAAAxI,IAAA,CAAAA,EACAwI,EAAAvU,QAAA,YACA,OAAAsT,CACA,EACAiB,CACA,CACA,yBC5fArM,EAAAlS,OAAA,YACA,IAAAqO,EAAavK,EAAQ,OAErByC,EAAA,KACA,SAAAkY,EAAA3F,CAAA,QACA,CAAAA,EAAAV,IAAA,GAAAU,EAAAT,MAAA,GAAAS,EAAAR,KAAA,GAAAQ,EAAAL,MAAA,EAGAK,EAAAP,KAAA,CAEA,SAAAmG,EAAA5F,CAAA,QACAA,EAAAA,EAAAV,IAAA,IAAAU,EAAAT,MAAA,IAAAS,EAAAR,KAAA,IAAAQ,EAAAL,MAAA,CA2TA,IAAAkG,EAAA,GAAAxK,EAAA,QACAyK,EAAA,GAAAzK,EAAA,QACA0K,EAAA,GAAA1K,EAAA,QACA2K,EAAA,CAAAC,EAAAzE,EAAAxB,EAAAkG,IAUArT,CATA,EAAiBoT,EAAI,GAAGzE,EAAM,IAC9B,GAAcsE,EAAA9F,EAAAV,IAAA,EACd,GAAcuG,EAAA7F,EAAAT,MAAA,EACd,GAAcsG,EAAA7F,EAAAR,KAAA,EACd,GAAcsG,EAAA9F,EAAAL,MAAA,EACd,GAAcoG,EAAA/F,EAAAN,MAAA,EACd,GAAcmG,EAAA7F,EAAAP,KAAA,EACd,GAAchS,EAAAiT,YAAA,CAAAwF,EAAA/F,aAAA,EAAsC,EANnB,CAOjC+F,CAAAA,EAAA/F,aAAA,GAAA5K,EAAAqL,OAAA,CAAAsF,EAAA7F,WAAA,OACA,IAAeL,EAAAX,IAAA,CAAAvZ,IAAA,CAAe;AAAA,EAI9BqgB,EAAA,IAEAtT,6HAqBAuT,EAAA,IACA,IAAAjd,EAAA,EACA2b,EAAA,EACAuB,EAAA,KACAC,EAAA,KACAzT,EAAA,GACA,CAAUsL,YAAAA,CAAA,EAAc1Q,EAUxB,IARAoU,KAAAA,EACA1D,EAAA1Q,EAAA4Q,gBAAA,CAEM,MAAAwD,GACN1D,CAAAA,EAAA1Q,EAAA6Q,eAAA,EAIAnV,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EACrC2b,EAAA3G,CAAA,CAAAhV,EAAA,CACAkd,EAAA5Y,EAAAiR,KAAA,CAAAoG,EAAA,CACAwB,EAAA7Y,EAAAoR,QAAA,CAAAiG,EAAA,CACAjS,GAAAmT,EAAA7c,EAAA2b,EAAAuB,EAAAC,GAEA,OAAAzT,CACA,EAkCA,OAAW6K,eA7HX,IAEA,IAAAvU,EAAA,EACA+C,EAAA,EACAqa,EAAA9Y,CAHAA,EAAA+Y,CAAA,EAGA1H,OAAA,GACA,IAAA3V,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,GAErC,IAAA+C,EAAA,EAAkBA,EAAAuB,EAAAoQ,SAAA,CAAqB3R,GAAA,EACvCuB,EAAAsS,QAAA,CAAAtS,EAAAmR,YAAA,CAAA1S,EAAA,CAEAuB,CAAAA,EAAAsQ,SAAA,CAAA5U,EACAsd,SA5CAA,EAAAD,CAAA,CAAAtB,CAAA,CAAAqB,CAAA,EACA,IAAAF,EAAAG,EAAA5H,YAAA,CAAAsG,EAAA,CACAmB,EAAAvG,UAAA,CAEA0G,EAAAvG,QAAA,CAAAsG,EAAAF,GACMA,EAAAxG,MAAA,CAcAqF,IAAAsB,EAAAzI,SAAA,CAENmH,IAAAsB,EAAAzI,SAAA,GACAwI,EAAAjH,IAAA,IACAiH,EAAA/G,KAAA,IACA+G,EAAA5G,MAAA,IACA4G,EAAA3G,IAAA,KAIA2G,EAAA7G,MAAA,KAtBA2G,EAAAxG,MAAA,IACA6G,SAtEAA,EAAAF,CAAA,CAAA9E,CAAA,CAAAyD,CAAA,CAAAoB,CAAA,EACAC,EAAAzG,QAAA,CAAAwG,GACA,IAAAI,EAAAjF,CAAA,CAAAyD,EAAA,CACA,OAAAwB,EAAA9E,IAAA,EACA,KAAAtM,EAAAuM,GAAA,EACAiB,SAnEAyD,CAAA,CAAA9E,CAAA,CAAAyD,CAAA,CAAAoB,CAAA,EACA,IAAApd,EAAA,EACAyd,EAAAlF,CAAA,CAAAyD,EAAA,CACA0B,EAAAD,EAAA7E,QAAA,CAAA9b,MAAA,CAGA6gB,EAAA,GACA,IAAA3d,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAC3B2d,EAAA9a,IAAA,CAAAwa,EAAA1H,OAAA,IAEA,IAAA3V,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAE3Bud,EAAAF,EAAA9E,EAAAkF,EAAA7E,QAAA,CAAA5Y,EAAA,CAAA2d,CAAA,CAAA3d,EAAA,EAUA,IAAAA,EAAA,EANAod,EAAAjH,IAAA,IACAiH,EAAA/G,KAAA,IACA+G,EAAAhH,MAAA,IACAgH,EAAA9G,KAAA,IACA8G,EAAA7G,MAAA,IACA6G,EAAA5G,MAAA,IACgBxW,EAAA0d,EAAW1d,GAAA,EAC3B2d,CAAA,CAAA3d,EAAA,CAAAmW,IAAA,EACAiH,CAAAA,EAAAjH,IAAA,KAEAwH,CAAA,CAAA3d,EAAA,CAAAoW,MAAA,EACAgH,CAAAA,EAAAhH,MAAA,KAEAuH,CAAA,CAAA3d,EAAA,CAAAqW,KAAA,EACA+G,CAAAA,EAAA/G,KAAA,KAEAsH,CAAA,CAAA3d,EAAA,CAAAsW,KAAA,EACA8G,CAAAA,EAAA9G,KAAA,KAEAqH,CAAA,CAAA3d,EAAA,CAAAuW,MAAA,EACA6G,CAAAA,EAAA7G,MAAA,KAEAoH,CAAA,CAAA3d,EAAA,CAAAwW,MAAA,EACA4G,CAAAA,EAAA5G,MAAA,IAGA,EAyBA6G,EAAA9E,EAAAyD,EAAAoB,GACA,KACA,MAAAhR,EAAAyM,GAAA,EACAgB,SA3FAwD,CAAA,CAAA9E,CAAA,CAAAyD,CAAA,CAAAoB,CAAA,EACA,IAAApd,EAAA,EACA4d,EAAArF,CAAA,CAAAyD,EAAA,CACA0B,EAAAE,EAAAhF,QAAA,CAAA9b,MAAA,CAGA6gB,EAAA,GACA,IAAA3d,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAC3B2d,EAAA9a,IAAA,CAAAwa,EAAA1H,OAAA,IAEA,IAAA3V,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAE3Bud,EAAAF,EAAA9E,EAAAqF,EAAAhF,QAAA,CAAA5Y,EAAA,CAAA2d,CAAA,CAAA3d,EAAA,CAEAod,CAAAA,EAAAjH,IAAA,CAAA0H,SA1DAtI,CAAA,CAAAmI,CAAA,EAEA,QAAA1d,EAAA,EAAoBA,EAAA0d,EAAW1d,GAAA,GAC/B,GAAAuV,CAAA,CAAAvV,EAAA,CAAAmW,IAAA,CACA,SAEA,IAAAZ,CAAA,CAAAvV,EAAA,CAAAsW,KAAA,CACA,KAGA,CACA,QACA,EA8CAqH,EAAAD,GACAN,EAAA/G,KAAA,CAAAyH,SA9CAvI,CAAA,CAAAmI,CAAA,EAEA,QAAA1d,EAAA0d,EAAA,EAA4B1d,GAAA,EAAQA,GAAA,GACpC,GAAAuV,CAAA,CAAAvV,EAAA,CAAAqW,KAAA,CACA,SAEA,IAAAd,CAAA,CAAAvV,EAAA,CAAAsW,KAAA,CACA,KAGA,CACA,QACA,EAkCAqH,EAAAD,GACAN,EAAAhH,MAAA,CAAA2H,SAxHAxI,CAAA,CAAAmI,CAAA,EACA,IAAA1d,EAAA,EACA+C,EAAA,EACA4L,EAAA,EAEA,IAAA3O,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAC3B,GAAAuV,CAAA,CAAAvV,EAAA,CAAAoW,MAAA,CACA,SAKA,IAAApW,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAC3B,GAAAuV,CAAA,CAAAvV,EAAA,CAAAqW,KAAA,GAAAd,CAAA,CAAAvV,EAAA,CAAAyW,IAAA,CACA,KAAA1T,EAAA/C,EAAA,EAAwB+C,EAAA2a,EAAW3a,GAAA,EACnC,IAAAyZ,EAAAjH,CAAA,CAAAxS,EAAA,EACA,QAEA,CAKA,IAAA/C,EAAA0d,EAAA,EAAwB1d,GAAA,EAAQA,GAAA,EAChC,GAAAuV,CAAA,CAAAvV,EAAA,CAAAmW,IAAA,GAAAZ,CAAA,CAAAvV,EAAA,CAAAyW,IAAA,CACA,KAAA1T,EAAA/C,EAAA,EAAwB+C,GAAA,EAAQA,GAAA,EAChC,IAAAyZ,EAAAjH,CAAA,CAAAxS,EAAA,EACA,QAEA,CAKA,IAAA/C,EAAA,EAAgBA,EAAA0d,EAAW1d,GAAA,EAC3B,IAAAuV,CAAA,CAAAvV,EAAA,CAAAsW,KAAA,GAAAmG,EAAAlH,CAAA,CAAAvV,EAAA,EACA,KAAA+C,EAAA/C,EAAA,EAAwB+C,EAAA2a,EAAW3a,GAAA,EACnC,GAAA0Z,EAAAlH,CAAA,CAAAxS,EAAA,EACA,KAAA4L,EAAA5L,EAAA,EAA4B4L,EAAA+O,EAAW/O,GAAA,EACvC,IAAA4G,CAAA,CAAA5G,EAAA,CAAA2H,KAAA,GAAAmG,EAAAlH,CAAA,CAAA5G,EAAA,EACA,QAEA,CAEA,CAKA,QACA,EAsEAgP,EAAAD,GACAN,EAAA9G,KAAA,CAAA0H,SAnCAzI,CAAA,CAAAmI,CAAA,EAEA,QAAA1d,EAAA,EAAoBA,EAAA0d,EAAW1d,GAAA,EAC/B,IAAAuV,CAAA,CAAAvV,EAAA,CAAAsW,KAAA,CACA,SAGA,QACA,EA2BAqH,EAAAD,GACAN,EAAA7G,MAAA,CAAA0H,SA3BA1I,CAAA,CAAAmI,CAAA,EAEA,QAAA1d,EAAA,EAAoBA,EAAA0d,EAAW1d,GAAA,EAC/B,IAAAuV,CAAA,CAAAvV,EAAA,CAAAuW,MAAA,CACA,SAGA,QACA,EAmBAoH,EAAAD,GACAN,EAAA5G,MAAA,CAAA0H,SAxEA3I,CAAA,CAAAmI,CAAA,EAEA,QAAA1d,EAAA,EAAoBA,EAAA0d,EAAW1d,GAAA,EAC/B,IAAAuV,CAAA,CAAAvV,EAAA,CAAAwW,MAAA,CACA,SAGA,QACA,EAgEAmH,EAAAD,EACA,EAuEAL,EAAA9E,EAAAyD,EAAAoB,GACA,KACA,MAAAhR,EAAA0M,GAAA,CACAyE,EAAAF,EAAA9E,EAAAyD,EAAA,EAAAoB,GACA,IAAAI,EAAA5f,GAAA,GACAwf,EAAA9G,KAAA,IACA8G,EAAA7G,MAAA,KAEA,KACA,MAAAnK,EAAAuO,GAAA,CAEA2C,EAAAD,EAAA9E,CAAA,CAAAyD,EAAA,CAAA3D,KAAA,CAAA+E,GACA,KACA,MAAAhR,EAAA6O,GAAA,EACAX,SAzCA+C,CAAA,CAAA9E,CAAA,CAAAyD,CAAA,CAAAoB,CAAA,EACA,IAAAe,EAAA5F,CAAA,CAAAyD,EAAA,CACAmC,EAAA9F,KAAA,EAAAgF,EAAA3I,SAAA,EAEA0I,EAAA9G,KAAA,CAAA+G,EAAAvJ,IAAA,CAAAqK,EAAA9F,KAAA,CAAAgF,EAAA3I,SAAA,EAAA4B,KAAA,CACA8G,EAAA7G,MAAA,MAIA+G,EAAAD,EAAAc,EAAA9F,KAAA,CAAA+E,GAGAA,EAAAjH,IAAA,IACAiH,EAAAhH,MAAA,IACAgH,EAAA/G,KAAA,IACA+G,EAAA5G,MAAA,IAEA,EAwBA6G,EAAA9E,EAAAyD,EAAAoB,GACA,KACA,MAAAhR,EAAAyO,GAAA,CACA,KAAAzO,EAAA0O,GAAA,CACA,KAAA1O,EAAA2O,GAAA,CACA,KAAA3O,EAAA4O,GAAA,CACAuC,EAAAF,EAAA9E,EAAAyD,EAAA,EAAAoB,GACAA,EAAA9G,KAAA,IACA,KACA,MAAAlK,EAAAgP,GAAA,CACAgC,EAAA9G,KAAA,EAAAiC,CAAA,CAAAyD,EAAA,CAAAX,MAAA,CAAAve,MAAA,CACAsgB,EAAA7G,MAAA,IACA6G,EAAA5G,MAAA,IACA,KACA,MAAApK,EAAAkP,GAAA,CACA,KAAAlP,EAAAmP,GAAA,CACA6B,EAAA9G,KAAA,IACA8G,EAAA7G,MAAA,IACA6G,EAAA5G,MAAA,IACA,KACA,MAAApK,EAAAwO,GAAA,CACAwC,EAAA9G,KAAA,CAAAkH,EAAAlH,KAAA,CACA8G,EAAA7G,MAAA,IACA6G,EAAA5G,MAAA,IACA,KACA,MAAApK,EAAA8O,GAAA,CACA,KAAA9O,EAAA+O,GAAA,CACAiC,EAAA9G,KAAA,IACA8G,EAAA7G,MAAA,IACA6G,EAAA5G,MAAA,IACA,KACA,SACA,oCAAgDgH,EAAI,EACpD,CACA,EAcAH,EAAAH,EAAAhH,IAAA,CAAAqC,OAAA,GAAA6E,GAEAF,EAAA/G,IAAA,CAAAiH,EAAAjH,IAAA,CACA+G,EAAA7G,KAAA,CAAA+G,EAAA/G,KAAA,CACA6G,EAAA9G,MAAA,CAAAgH,EAAAhH,MAAA,CACA8G,EAAA5G,KAAA,CAAA8G,EAAA9G,KAAA,CACA4G,EAAA3G,MAAA,CAAA6G,EAAA7G,MAAA,CACA2G,EAAA1G,MAAA,CAAA4G,EAAA5G,MAAA,CACA0G,EAAAzG,IAAA,IACAyG,EAAAxG,MAAA,IACAwG,EAAAvG,UAAA,IAaA,EAaArS,EAAAtE,EAAAod,GAGA9Y,EAAAwS,QAAA,CAAAxS,EAAAiR,KAAA,CAAAvV,EAAA,CAAAsE,EAAAmR,YAAA,CAAAzV,EAAA,CACA,CACAsE,EAAAwQ,kBAAA,IACA,IAAAoI,EAAA,KACA,IAAAld,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EAErC,GAAAkd,CADAA,EAAA5Y,EAAAiR,KAAA,CAAAvV,EAAA,EACAmW,IAAA,GAAA+G,EAAA3G,MAAA,EAAA2G,EAAA1G,MAAA,EACA,IAAA4H,EAAA9Z,EAAAqR,OAAA,CAAAuH,EAAAhH,IAAA,EACA5R,EAAAwS,QAAA,CAAAsH,EAAAlB,GACA5Y,EAAAkR,WAAA,CAAA3S,IAAA,CAAAub,GACA9Z,EAAAgR,eAAA,GACA,CAEA,EAkGW3E,eA1BX,CAAAqD,EAAA,WACA,IAAA1P,EAAAwQ,kBAAA,CACA,2EAEA,IAAApL,EAAA,GACA2U,EAAA,oBAiBA,OAhBArK,KAAAA,EAAA/K,UAAA,IAIAS,GAHA,8BACA2U,EACArB,IACAC,EAAA,IACMjJ,MAAAA,EAAA/K,UAAA,IAINS,GAHA,yBACA2U,EACArB,IACAC,EAAA,KAKAvT,GAHA,0BACA2U,EACArB,IACAC,IAEAvT,CACA,EAGWkH,oBA3EX,KACA,IAAAsM,EAAA,KACAC,EAAA,KACAzT,EAAA,GAGA,GADAA,GADA,gCACAsT,IACA1Y,EAAAgR,eAAA,CACA,QAAAtV,EAAA,EAAsBA,EAAAsE,EAAAgR,eAAA,CAA2BtV,GAAA,EACjDkd,EAAA5Y,EAAAkR,WAAA,CAAAxV,EAAA,CACAmd,EAAA7Y,EAAAoR,QAAA,CAAAwH,EAAAhH,IAAA,CAAAmC,KAAA,EACA3O,GAAAmT,EAAA7c,EAAAkd,EAAAhH,IAAA,CAAAmC,KAAA,CAAA6E,EAAAC,QAGAzT,GAAA,WAEA,OAAAA,CACA,CA2DW,CACX,2BCjaAuG,EAAAlS,OAAA,OACA,IAAAqO,EAAavK,EAAQ,OACrByC,EAAA,KAGAiP,EAAA,CAAAmB,EAAAgB,EAAA2C,EAAAtF,KACA,IAAA/S,EAAA,EACA+C,EAAA,EACAub,EAAA5I,CAAA,CAAA2C,EAAA,CACAtF,CAAA,CAAAsF,EAAA,IACA,IAAAI,EAAA6F,EAAApI,IAAA,CAAAqC,OAAA,CACA,IAAAvY,EAAA,EAAgBA,EAAAyY,EAAA3b,MAAA,CAAekD,GAAA,GAC/B,IAAAwd,EAAA/E,CAAA,CAAAzY,EAAA,CACA,GAAAwd,EAAA9E,IAAA,GAAAtM,EAAAuO,GAAA,CAKA,IAJA2D,EAAAnH,QAAA,CAAAqG,EAAAnF,KAAA,KACAtF,CAAA,CAAAyK,EAAAnF,KAAA,GACA9E,EAAAmB,EAAAgB,EAAA8H,EAAAnF,KAAA,CAAAtF,GAEAhQ,EAAA,EAAoBA,EAAA2R,EAAe3R,GAAA,EACnC2S,CAAA,CAAA8H,EAAAnF,KAAA,EAAAlB,QAAA,CAAApU,EAAA,EACAub,CAAAA,EAAAnH,QAAA,CAAApU,EAAA,UAGQya,EAAA9E,IAAA,GAAAtM,EAAAwO,GAAA,CACR0D,EAAAjH,WAAA,CAAAmG,EAAAnF,KAAA,KACQmF,EAAA9E,IAAA,GAAAtM,EAAA6O,GAAA,GACRuC,EAAAnF,KAAA,CAAA3D,GACA4J,EAAAnH,QAAA,CAAAqG,EAAAnF,KAAA,KACAtF,CAAA,CAAAyK,EAAAnF,KAAA,GACA9E,EAAAmB,EAAAgB,EAAA8H,EAAAnF,KAAA,CAAAtF,IAGAuL,EAAAjH,WAAA,CAAA3C,EAAA8I,EAAAnF,KAAA,KAGA,CACA,EA8EA4E,EAAA,CAAAvE,EAAA,QACA,IAAA1Y,EAAA,EACA+C,EAAA,EACA2a,EAAA,EACAa,EAAA,EACAC,EAAAla,EAAAoQ,SAAA,GACA+J,EAAAna,EAAAqQ,QAAA,GAEAjL,EAAA,GACAgV,EAAA,GAGAC,EAAA,GACAL,EAAA,KACA,CAAUtJ,YAAAA,CAAA,EAAc1Q,EACxB,CAAU8Q,WAAAA,CAAA,EAAa9Q,EAQvB,IAPAoU,KAAAA,GACA1D,EAAA1Q,EAAA4Q,gBAAA,CACAE,EAAA9Q,EAAA+Q,eAAA,EACM,MAAAqD,IACN1D,EAAA1Q,EAAA6Q,eAAA,CACAC,EAAA9Q,EAAA+Q,eAAA,EAEArV,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,GAarC,IAZAse,EAAAha,EAAAoR,QAAA,CAAAV,CAAA,CAAAhV,EAAA,EACA0e,EAAA,GAAe1J,CAAA,CAAAhV,EAAA,CAAe,GAAGsE,EAAAiT,YAAA,CAAA+G,EAAAtH,aAAA,EAAsC,GACvE1S,EAAAyQ,mBAAA,EAEA2J,CAAAA,GADAJ,CAAAA,EAAApH,WAAA,IAAAoH,EAAApH,WAAA,MACA,KAEAwH,GAAA,IACAhV,GAAA,GAAgBgV,EAAApa,EAAAuP,KAAA,CAAAmB,CAAA,CAAAhV,EAAA,EAAArD,IAAA,CAAuC;AAAA,EACvDgiB,EAAA,GACAjB,EAAA,EACAa,EAAA7U,EAAA5M,MAAA,CACA4M,GAAAgV,EACA3b,EAAA,EAAkBA,EAAAuB,EAAAoQ,SAAA,CAAqB3R,GAAA,EACvCub,EAAAnH,QAAA,CAAAnC,CAAA,CAAAjS,EAAA,IACA4b,GAEAA,EAAA,GACAjV,GA/BA,MA+BApF,EAAAoR,QAAA,CAAAV,CAAA,CAAAjS,EAAA,EAAAmT,IAAA,CAAAvZ,IAAA,EAEA+M,GAAA,KAAwBpF,EAAAoR,QAAA,CAAAV,CAAA,CAAAjS,EAAA,EAAAmT,IAAA,CAAAvZ,IAAA,CAAyC,EAEjE+gB,GAAA,GAEAhU,EAAA5M,MAAA,CAAAyhB,EAxCA,KAwCAxb,IAAAyb,IACA9U,GAAA;EAAsBgV,MAAc,CACpCH,EAAA7U,EAAA5M,MAAA,EAGA,GAAAwH,EAAAqQ,QAAA,CACA,IAAA5R,EAAA,EAAoBA,EAAAuB,EAAAqQ,QAAA,CAAoB5R,GAAA,EACxCub,EAAAjH,WAAA,CAAAjC,CAAA,CAAArS,EAAA,IACA4b,GAEAA,EAAA,GACAjV,GAhDA,MAgDApF,EAAAwP,IAAA,CAAAsB,CAAA,CAAArS,EAAA,EAAApG,IAAA,EAEA+M,GAAA,KAA0BpF,EAAAwP,IAAA,CAAAsB,CAAA,CAAArS,EAAA,EAAApG,IAAA,CAA+B,EAEzD+gB,GAAA,GAEAhU,EAAA5M,MAAA,CAAAyhB,EAzDA,KAyDAxb,IAAA0b,IACA/U,GAAA;EAAwBgV,MAAc,CACtCH,EAAA7U,EAAA5M,MAAA,EAcA,IAVA,IAAA4gB,GACAhU,CAAAA,GAAA,eAEA,KAAAiV,GACAjV,CAAAA,GAAA,MAEAiV,EAAA,GACAjB,EAAA,EACAa,EAAA7U,EAAA5M,MAAA,CACA4M,GAAAgV,EACA3b,EAAA,EAAkBA,EAAAuB,EAAAoQ,SAAA,CAAqB3R,GAAA,EACvCub,EAAAhH,YAAA,CAAAtC,CAAA,CAAAjS,EAAA,IACA4b,GAEAA,EAAA,GACAjV,GA1EA,MA0EApF,EAAAoR,QAAA,CAAAV,CAAA,CAAAjS,EAAA,EAAAmT,IAAA,CAAAvZ,IAAA,EAEA+M,GAAA,KAAwBpF,EAAAoR,QAAA,CAAAV,CAAA,CAAAjS,EAAA,EAAAmT,IAAA,CAAAvZ,IAAA,CAAyC,EAEjE+gB,GAAA,GAEAhU,EAAA5M,MAAA,CAAAyhB,EApFA,KAoFAxb,IAAAyb,IACA9U,GAAA;EAAsBgV,MAAc,CACpCH,EAAA7U,EAAA5M,MAAA,CAGA,KAAA4gB,GACAhU,CAAAA,GAAA,eAEA,KAAAiV,GACAjV,CAAAA,GAAA,MAEAA,GAAA,IACA,CACA,OAAAA,CACA,EA6BA,OAAW8K,iBAlNX,IAEA,IAAAxU,EAAA,EACA+C,EAAA,EACA6b,EAAA,EACAN,EAAA,KACAO,EAAA,KACAC,EAAA,EACAxa,CAPAA,CAAAA,EAAA+Y,CAAA,EAOAxI,oBAAA,IAGA,IAAA9B,EAAAzO,EAAA8S,UAAA,CAAA9S,EAAAoQ,SAAA,EAGA,IAAA1U,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EACrCsE,EAAAoT,YAAA,CAAA3E,GACAQ,EAAAjP,EAAAoQ,SAAA,CAAApQ,EAAAoR,QAAA,CAAA1V,EAAA+S,GAGA,IAAA/S,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EACrC,IAAA+C,EAAA,EAAkBA,EAAAuB,EAAAoQ,SAAA,CAAqB3R,GAAA,EACvC/C,IAAA+C,GACAuB,EAAAoR,QAAA,CAAA3S,EAAA,CAAAoU,QAAA,CAAAnX,EAAA,EACAsE,CAAAA,EAAAoR,QAAA,CAAA1V,EAAA,CAAAsX,YAAA,CAAAvU,EAAA,KAMA,IAAA/C,EAAA,EAAgBA,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EACrCsE,EAAAoR,QAAA,CAAA1V,EAAA,CAAAgX,aAAA,CAAA5K,EAAA6K,MAAA,CACA3S,EAAAoR,QAAA,CAAA1V,EAAA,CAAAmX,QAAA,CAAAnX,EAAA,EACAsE,CAAAA,EAAAoR,QAAA,CAAA1V,EAAA,CAAAgX,aAAA,CAAA5K,EAAAoL,MAAA,EAMA,IAAAxX,EAAA,EADA4e,EAAA,GACgB5e,EAAAsE,EAAAoQ,SAAA,CAAqB1U,GAAA,EAErC,GAAAse,CADAA,EAAAha,EAAAoR,QAAA,CAAA1V,EAAA,EACAgX,aAAA,GAAA5K,EAAAoL,MAAA,CAEA,IAAAzU,EAAA,EADA+b,EAAA,GACoB/b,EAAAuB,EAAAoQ,SAAA,CAAqB3R,GAAA,EACzC/C,IAAA+C,GAEA8b,CADAA,EAAAva,EAAAoR,QAAA,CAAA3S,EAAA,EACAiU,aAAA,GAAA5K,EAAAoL,MAAA,EACA8G,EAAAnH,QAAA,CAAApU,EAAA,EAAA8b,EAAA1H,QAAA,CAAAnX,EAAA,GACA8e,IACAF,GAAA,EACAN,EAAAtH,aAAA,CAAA5K,EAAAqL,OAAA,CACA6G,EAAApH,WAAA,CAAA0H,EACAE,EAAA,IAEAD,EAAA7H,aAAA,CAAA5K,EAAAqL,OAAA,CACAoH,EAAA3H,WAAA,CAAA0H,EAOAta,CAAAA,EAAAyQ,mBAAA,CAAA6J,EAAA,GAGAta,EAAA4Q,gBAAA,CAAAsG,IAAA,CAAAlX,EAAAuR,cAAA,EACAvR,EAAA6Q,eAAA,CAAAqG,IAAA,CAAAlX,EAAAuR,cAAA,EACAvR,EAAA6Q,eAAA,CAAAqG,IAAA,CAAAlX,EAAA0R,aAAA,EACA1R,EAAAyQ,mBAAA,EACAzQ,EAAA6Q,eAAA,CAAAqG,IAAA,CAAAlX,EAAA2R,cAAA,EAEA3R,EAAAqQ,QAAA,EACArQ,EAAA+Q,eAAA,CAAAmG,IAAA,CAAAlX,EAAAyR,aAAA,EAGAzR,EAAAuQ,oBAAA,GACA,EAuIWhE,qBAtBX,CAAAmD,EAAA,WACA,IAAAtK,EAAA,yDAEAA,4DACApF,EAAAuQ,oBAAA,GAIAb,KAAAA,EAAA/K,UAAA,IAEAS,GADA,8BACAuT,EAAA,IACMjJ,MAAAA,EAAA/K,UAAA,IAENS,GADA,yBACAuT,EAAA,KAGAvT,GADA,0BACAuT,EAAA,OAXAvT,CAcA,CAGW,CACX,wBCjQAuG,EAAAlS,OAAA,YA0BA,KAAAwe,aAAA,iBAGA,KAAA1I,KAAA,IACA,KAAAA,KAAA,KAAoBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,aAAAgb,MAAA,aAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,eAAAgb,MAAA,eAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,gBAAAgb,MAAA,gBAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,gBAAAgb,MAAA,gBAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,iBAAAgb,MAAA,iBAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,SAAAgb,MAAA,SAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,eAAAgb,MAAA,eAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,gBAAAgb,MAAA,gBAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,aAAAgb,MAAA,aAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,eAAAgb,MAAA,eAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,kBAAAgb,MAAA,kBAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,aAAAgb,MAAA,aAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,aAAAgb,MAAA,aAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,SAAAgb,MAAA,SAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,aAAAgb,MAAA,aAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,gBAAAgb,MAAA,gBAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,SAAAgb,MAAA,SAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,gBAAAgb,MAAA,gBAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,eAAAgb,MAAA,eAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,cAAAgb,MAAA,cAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,MAAAgb,MAAA,MAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,MAAAgb,MAAA,MAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,MAAAgb,MAAA,MAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,WAAAgb,MAAA,WAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,MAAAgb,MAAA,MAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,GAAAwD,MAAA,IACrB,KAAAhI,KAAA,MAAqBlX,KAAA,eAAAgb,MAAA,eAAAU,MAAA,GAAAwD,MAAA,IAGrB,KAAA/H,IAAA,IAIA,KAAAD,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,SAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,SAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,MAC/B,KAAAxH,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,KAC/B,KAAAxH,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,WAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,QAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,MAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,SAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAG/B,KAAAlF,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAG/B,KAAAlF,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,IAG/B,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,wBAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IAGjC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,aAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GACjC,KAAAlF,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GACjC,KAAAlF,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IAGjC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,eAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,QAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IAGjC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,UAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,cAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA2C,OAAA,MACjC,KAAAxH,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,eACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA2C,OAAA,MACjC,KAAAxH,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IAGjC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,YACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EACjC,KAAA6D,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA2C,OAAA,MACjC,KAAAxH,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,YACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IACjC,KAAAxE,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EACjC,KAAA6D,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAE,SAAA,SACjC,KAAA/E,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAA2C,OAAA,MACjC,KAAAxH,KAAA,KAAA0E,OAAA,MAAiCG,KAAA,EAAAL,MAAA,IAGjC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,UAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,OAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,OAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAGhC,KAAAlF,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,WAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAChC,KAAAxE,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAL,MAAA,IAGhC,KAAAxE,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAChC,KAAA6D,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAChC,KAAAlF,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAGhC,KAAAxH,KAAA,KAAA0E,OAAA,IACA,KAAA1E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,SAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,SAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAAE,SAAA,OAChC,KAAA/E,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,MAChC,KAAAxH,KAAA,KAAA0E,OAAA,KAAgCG,KAAA,EAAA2C,OAAA,KAGhC,KAAAtT,QAAA,YA6KA,MADA2B,k5OAEA,CACA,uBCj8BA,IAAA2C,EAAYxK,EAAQ,OACpBiL,EAAcjL,EAAQ,OA0GtByK,EAAA,GACAA,EAAAoG,IAAA,CAzGA,SAAApO,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAeA,OAdAP,IAAA+H,EAAAQ,OAAA,EACAhI,EAAAma,SAAA,GACAna,EAAAoa,UAAA,GACApa,EAAAqa,YAAA,IAEAra,EAAAmN,KAAA,CAAAnP,IAAA,EACAsP,OAAAtN,EAAAmN,KAAA,CAAAlV,MAAA,CACAsV,UAAA3F,EACA3P,OAAAiiB,EACAE,WAAApa,EAAAoa,UAAA,CACAE,QAAAta,EAAAsa,OAAA,CACAC,aAAAva,EAAAqa,YAAA,GAGA7S,EAAAO,MAAA,EA2FAN,CAAA,cAzFA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAIA,OAHAP,IAAA+H,EAAAQ,OAAA,EACAhI,CAAAA,EAAAoa,UAAA,CAAAF,CAAA,EAEA1S,EAAAO,MAAA,EAsFAN,CAAA,cApFA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EA+BA,OA9BAP,IAAA+H,EAAAQ,OAAA,EACAhI,EAAAma,SAAA,GACAna,EAAAoa,UAAA,GACApa,EAAAqa,YAAA,IACIra,EAAA2O,MAAA,EACJ3O,EAAAmN,KAAA,CAAAnP,IAAA,EACAsP,OAAAtN,EAAAmN,KAAA,CAAAlV,MAAA,CACAsV,UAAA3F,EACA3P,OAAAiiB,EACAE,WAAAF,EACAI,QAAA,OACAC,aAAAva,EAAAqa,YAAA,GAEAra,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAsN,MAAA,CACAzJ,KAAA+D,EAAAsS,EACAvU,IAAA,2EACA,KAGAgC,EAAA3J,IAAA,KACAgC,EAAAmN,KAAA,CAAAnP,IAAA,EACAsP,OAAAtN,EAAAmN,KAAA,CAAAlV,MAAA,CACAsV,UAAA3F,EACA3P,OAAAiiB,EAAA,EACAE,WAAAF,EACAI,QAAA,KACAC,aAAAva,EAAAqa,YAAA,IAGA7S,EAAAO,MAAA,EAsDAN,EAAA+S,OAAA,CApDA,SAAA/a,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAQA,OAPAP,IAAA+H,EAAAQ,OAAA,EACAhI,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAsN,MAAA,CACAzJ,KAAA+D,EACAjC,IAAA,+BAA0CsC,EAAAgF,SAAA,CAAAtF,CAAA,CAAAC,EAAA,EAAoC,KAG9EJ,EAAAO,MAAA,EA6CAN,EAAA2E,GAAA,CA3CA,SAAA3M,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAIA,OAHAP,IAAA+H,EAAAiT,QAAA,EACAza,CAAAA,EAAAsN,MAAA,KAEA9F,EAAAO,MAAA,EAwCAN,EAAAiT,EAAA,CAtCA,SAAAjb,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAWA,OAVAP,IAAA+H,EAAAQ,OAAA,GACAhI,EAAAsa,OAAA,MACAta,EAAA2O,MAAA,EACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAsN,MAAA,CACAzJ,KAAA+D,EACAjC,IAAA,oFACA,IAGA6B,EAAAO,MAAA,EA4BAN,EAAAkT,EAAA,CA1BA,SAAAlb,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAWA,OAVAP,IAAA+H,EAAAQ,OAAA,GACAhI,EAAAsa,OAAA,MACAta,EAAA2O,MAAA,EACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAsN,MAAA,CACAzJ,KAAA+D,EACAjC,IAAA,oFACA,IAGA6B,EAAAO,MAAA,EAgBAN,EAAAmT,IAAA,CAdA,SAAAnb,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EAIA,OAHAP,IAAA+H,EAAAQ,OAAA,EACAhI,CAAAA,EAAAsa,OAAA,SAEA9S,EAAAO,MAAA,EAWA7O,EAAAuO,SAAiB,CAAAA,qBCtHjB2D,EAAAlS,OAAA,YA0BA,KAAAwe,aAAA,iBAGA,KAAA1I,KAAA,IACA,KAAAA,KAAA,KAAoBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,YAAAgb,MAAA,YAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,QAAAgb,MAAA,QAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,UAAAgb,MAAA,UAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,MAAAgb,MAAA,MAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,OAAAgb,MAAA,OAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,EAAAwD,MAAA,IACpB,KAAAhI,KAAA,KAAoBlX,KAAA,KAAAgb,MAAA,KAAAU,MAAA,EAAAwD,MAAA,IAGpB,KAAA/H,IAAA,IAIA,KAAAD,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA/I,GAAA,EAC/B,KAAA6D,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,OAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,KAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,KAG/B,KAAAxH,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,WAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,EAAAmb,IAAA,GAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,GAAAmb,IAAA,IAC/B,KAAAlF,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA9a,IAAA,IAAAmb,IAAA,YAG/B,KAAAlF,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAE,SAAA,SAC/B,KAAA/E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAC/B,KAAAxE,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAAL,MAAA,GAG/B,KAAAxE,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,SAG/B,KAAAxH,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,MAG/B,KAAAxH,KAAA,IAAA0E,OAAA,IACA,KAAA1E,KAAA,IAAA0E,OAAA,KAA+BG,KAAA,EAAA2C,OAAA,MAG/B,KAAAtT,QAAA,YAYA,MADA2B,uPAEA,CACA,yBC9GAuG,EAAAlS,OAAA,UAAAyO,CAAA,CAAAf,CAAA,CAAA+H,CAAA,CAAAC,CAAA,EAEA,IAAAlD,EAAiB1O,EAAQ,OACzB6d,EAAA,GAAuB7d,CAAAA,EAAQ,MAAmB,EAClD,CAAUyK,UAAAA,CAAA,EAAczK,EAAQ,KAGhCmQ,EAAA,GAEA9F,EAAA,IAAAqE,EAAArE,MAAA,CAIA,GAFAA,EAAAC,GAAA,KAAAoE,EAAApE,GAAA,CACAD,EAAAC,GAAA,CAAAG,SAAA,CAAAA,EACAmH,EAAA,CACA,GAAAA,gBAAAA,EAAAuF,WAAA,CACA,mEAEA9M,CAAAA,EAAAuH,KAAA,CAAAA,CACA,CAIA,GAAAkM,CAAA,IAAAA,EADA5R,KAAA,CAAA2R,EAAA,OAAAlT,GACAwB,OAAA,EACAvC,EAAA5I,IAAA,EACA6P,KAAA,EACAhK,KAAA,EACA8B,IAAA,qDACA,GACA,MACA,CAWA,OAFA0B,EAAAC,GAAA,CAAAkC,SAAA,CARA,CACA2D,MAAAA,EACAG,OAAA,EACA1G,OAAAA,EACA+H,OAAA,EAAAA,CACA,GAKAxB,CACA,yBC/CA/B,EAAAlS,OAAA,YACA,IAAAwS,EAAiB1O,EAAQ,OACzBuK,EAAAmE,EAAAlE,GAAA,CAGAuT,EAAA,WACA,KAAAC,KAAA,IAGA,KAAAthB,GAAA,UAAA5B,CAAA,EACA,IAAAgQ,EAAA,GAUA,OARA,KADA,KAAAuC,GAAA,CAAAvS,KAEAgQ,EAAA,CACAhQ,KAAAA,EACAgb,MAAAhb,EAAA+S,WAAA,GACA2I,MAAA,KAAAwH,KAAA,CAAA/iB,MAAA,EAEA,KAAA+iB,KAAA,CAAAhd,IAAA,CAAA8J,IAEAA,CACA,EAEA,KAAAuC,GAAA,UAAAvS,CAAA,EACA,IAAAgQ,EAAA,GACAgL,EAAAhb,EAAA+S,WAAA,GACA,QAAA1P,EAAA,EAAsBA,EAAA,KAAA6f,KAAA,CAAA/iB,MAAA,CAAuBkD,GAAA,EAC7C,QAAA6f,KAAA,CAAA7f,EAAA,CAAA2X,KAAA,GAAAA,EAAA,CACAhL,EAAA,KAAAkT,KAAA,CAAA7f,EAAA,CACA,KACA,CAEA,OAAA2M,CACA,CACA,EAEAmT,EAAA,SAAAtT,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACA,IAAAib,EAAA,EACA,QAAA/f,EAAAgR,EAAsBhR,EAAAgR,EAAAlM,EAAe9E,GAAA,EACrC+f,EAAA,GAAAA,EAAAvT,CAAA,CAAAxM,EAAA,IAEA,OAAA+f,CACA,EAEAC,EAAA,SAAAxT,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACA,IAAAib,EAAA,EACA,QAAA/f,EAAAgR,EAAsBhR,EAAAgR,EAAAlM,EAAe9E,GAAA,EACrC+f,EAAA,EAAAA,EAAAvT,CAAA,CAAAxM,EAAA,IAEA,OAAA+f,CACA,EAEAE,EAAA,SAAAzT,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACA,IAAAib,EAAA,EACA,QAAA/f,EAAAgR,EAAsBhR,EAAAgR,EAAAlM,EAAe9E,GAAA,GACrC,IAAAkgB,EAAA1T,CAAA,CAAAxM,EAAA,CACA,GAAAkgB,GAAA,IAAAA,GAAA,GACAA,GAAA,QACQ,GAAAA,GAAA,IAAAA,GAAA,GACRA,GAAA,QACQ,GAAAA,GAAA,IAAAA,GAAA,IACRA,GAAA,QAEA,mCAEAH,EAAA,GAAAA,EAAAG,CACA,CACA,OAAAH,CACA,CAkoBA,MAAAzT,SAAA,IACA,KAAAA,SAAA,CAAA6T,KAAA,CAjTA,SAAA7b,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA8O,GAAA,GAGAvO,CACA,EA0SA,KAAAL,SAAA,CAAA8T,KAAA,CAzSA,SAAA9b,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA+O,GAAA,GAGAxO,CACA,EAkSA,KAAAL,SAAA,CAAA+T,WAAA,CA/eA,SAAA/b,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAS,OAAA,CAEA,QACA,GAAAhI,OAAAA,EAAAyb,SAAA,EAEA3T,EAAAP,EAAAmU,QAAA,CACA,KACA,CACA,GAAA1b,OAAAA,EAAA2b,QAAA,EAEA,GAAA3b,MAAAA,EAAAyb,SAAA,EAEAzb,EAAA2b,QAAA,EACA5G,IAAA,CACAlB,KAAAtM,EAAAuM,GAAA,CACAC,SAAA,IAEAiB,IAAA,IACA,EACAhV,EAAA4b,QAAA,CAAA5d,IAAA,CAAAgC,EAAA2b,QAAA,EACA3b,EAAA0T,OAAA,CAAA1V,IAAA,CAAAgC,EAAA2b,QAAA,CAAA5G,GAAA,EACA,KACA,CAEA/U,EAAA2b,QAAA,EACA5G,IAAA/U,EAAA0T,OAAA,IACAsB,IAAA,IACA,EACAhV,EAAA4b,QAAA,CAAA5d,IAAA,CAAAgC,EAAA2b,QAAA,EACA,KACA,CAEA3b,EAAA2b,QAAA,EACA5G,IAAA,CACAlB,KAAAtM,EAAAuM,GAAA,CACAC,SAAA,IAEAiB,IAAA,IACA,EACAhV,EAAA4b,QAAA,CAAA5d,IAAA,CAAAgC,EAAA2b,QAAA,EACA3b,EAAA0T,OAAA,CAAA1V,IAAA,CAAAgC,EAAA2b,QAAA,CAAA5G,GAAA,EACA,KACA,MACMtV,IAAA8H,EAAAkT,QAAA,GACNza,EAAA4b,QAAA,CAAAC,GAAA,GACA7b,EAAA4b,QAAA,CAAA3jB,MAAA,GACA+H,EAAA2b,QAAA,CAAA3b,EAAA4b,QAAA,CAAA5b,EAAA4b,QAAA,CAAA3jB,MAAA,IAEA+H,EAAA2b,QAAA,OAGA,OAAA7T,CACA,EA0bA,KAAAL,SAAA,CAAAqU,KAAA,CArVA,SAAArc,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAyO,GAAA,GAGAlO,CACA,EA8UA,KAAAL,SAAA,CAAAsU,IAAA,CAhDA,SAAAtc,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAkU,GAAA,CAAAiH,EAAAxT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EA2CA,KAAAL,SAAA,CAAAuU,IAAA,CAxDA,SAAAvc,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAjH,GAAA,CAAAoiB,EAAAxT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EAmDA,KAAAL,SAAA,CAAAwU,KAAA,CArSA,SAAAxc,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA2O,GAAA,GAGApO,CACA,EA8RA,KAAAL,SAAA,CAAAyU,KAAA,CA7RA,SAAAzc,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA4O,GAAA,GAGArO,CACA,EAsRA,KAAAL,SAAA,CAAA0U,KAAA,CArRA,SAAA1c,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAmBA,OAlBAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAAoc,EAAA,IACApc,EAAAqc,EAAA,IACArc,EAAAsc,EAAA,IACAtc,EAAAuc,EAAA,KACM9c,IAAA8H,EAAAkT,QAAA,EACNza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA6O,GAAA,CACAgB,QAAApX,CAAA,IAAAA,EAAAqc,EAAA,CAAA9U,EAAA8P,WAAA,CAAA9P,EAAAiV,WAAA,CACAlF,QAAAtX,CAAA,IAAAA,EAAAuc,EAAA,CAAAhV,EAAAkV,WAAA,CAAAlV,EAAAgQ,WAAA,CAGA/D,MAAA,CACA5L,YAAA5H,EAAAsU,OAAA,CAAA1M,WAAA,CACA9P,KAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAA3H,EAAAsU,OAAA,CAAA1M,WAAA,CAAA5H,EAAAsU,OAAA,CAAAzM,YAAA,CACA,CACA,GAEAC,CACA,EAiQA,KAAAL,SAAA,aApOA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAOA,OANAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAsU,OAAA,EACA1M,YAAAA,EACAC,aAAAqS,CACA,GAEApS,CACA,EA4NA,KAAAL,SAAA,CAAAiV,OAAA,CA1BA,SAAAjd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA2c,MAAA,CAAA3e,IAAA,CAAAmd,EAAAxT,EAAAC,EAAAsS,IAEApS,CACA,EAqBA,KAAAL,SAAA,CAAAmV,KAAA,CA/HA,SAAAnd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAeA,OAdAtI,IAAA8H,EAAAkT,QAAA,GACAP,GAAA,EAEAla,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAgP,GAAA,CACAC,OAAA,KAGAxW,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAkP,GAAA,CACAD,OAAA7O,EAAAqB,KAAA,CAAApB,EAAA,EAAAA,EAAAsS,EAAA,EACA,IAGApS,CACA,EA+GA,KAAAL,SAAA,CAAA2U,EAAA,CAnQA,SAAA3c,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAoc,EAAA,KAEAtU,CACA,EA8PA,KAAAL,SAAA,CAAA4U,EAAA,CA7PA,SAAA5c,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAqc,EAAA,KAEAvU,CACA,EAwPA,KAAAL,SAAA,CAAA6U,EAAA,CAvPA,SAAA7c,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAsc,EAAA,KAEAxU,CACA,EAkPA,KAAAL,SAAA,CAAA8U,EAAA,CAjPA,SAAA9c,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAuc,EAAA,KAEAzU,CACA,EA4OA,KAAAL,SAAA,CAAAoV,aAAA,CAtcA,SAAApd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAWA,OAVAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAA2b,QAAA,CAAA5G,GAAA,CAAAhB,QAAA,CAAA/V,IAAA,CAAAgC,EAAA0T,OAAA,CAAAzb,MAAA,EACA+H,EAAA2b,QAAA,CAAA3G,GAAA,EACAnB,KAAAtM,EAAAyM,GAAA,CACAD,SAAA,IAEA/T,EAAA0T,OAAA,CAAA1V,IAAA,CAAAgC,EAAA2b,QAAA,CAAA3G,GAAA,GACMvV,IAAA8H,EAAAkT,QAAA,EACNza,CAAAA,EAAA2b,QAAA,CAAA3G,GAAA,OAEAlN,CACA,EA0bA,KAAAL,SAAA,CAAAqV,OAAA,CA/ZA,SAAArd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAyb,SAAA,MAEA3T,CACA,EA0ZA,KAAAL,SAAA,CAAAsV,IAAA,CA5EA,SAAAtd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAkU,GAAA,CAAA+G,EAAAtT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EAuEA,KAAAL,SAAA,CAAAuV,IAAA,CApFA,SAAAvd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAjH,GAAA,CAAAkiB,EAAAtT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EA+EA,KAAAL,SAAA,CAAAwV,OAAA,CA3CA,SAAAxd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA2c,MAAA,CAAA3e,IAAA,CAAAid,EAAAtT,EAAAC,EAAAsS,IAEApS,CACA,EAsCA,KAAAL,SAAA,CAAAyV,IAAA,CA3nBA,SAAAzd,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAS,OAAA,CACAhI,EAAA6U,SAAA,KAAAkG,EACA/a,EAAA8U,QAAA,KAAAiG,EACA/a,EAAAgP,KAAA,IACAhP,EAAAiP,IAAA,IACAjP,EAAAqU,YAAA,IACArU,EAAA0T,OAAA,IACA1T,EAAA4b,QAAA,IACA5b,EAAA2b,QAAA,MACA3b,EAAAmd,OAAA,WACM,GAAA1d,IAAA8H,EAAAkT,QAAA,EAEN,IAAA2C,EACApd,EAAAgP,KAAA,CAAA5B,OAAA,KACAiE,EAAA2F,KAAA,IACA3F,EAAAqC,OAAA,CAAAtG,OAAA,KACAwG,EAAAC,IAAA,GAAAtM,EAAAuO,GAAA,GAEAsH,KADAA,CAAAA,EAAApd,EAAA6U,SAAA,CAAAxK,GAAA,CAAAuJ,EAAAJ,KAAA,CAAA1b,IAAA,IAEAkI,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAyG,EAAAJ,KAAA,CAAA5L,WAAA,CAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+P,EAAAJ,KAAA,CAAA5L,WAAA,CACAjC,IAAA,cAAmCiO,EAAAJ,KAAA,CAAA1b,IAAA,CAAc,2BAEjD8b,EAAAJ,KAAA,KAEAI,EAAAJ,KAAA,CAAA4J,EAAA5J,KAAA,CAGA,EACA,GAEAxT,EAAAiP,IAAA,CAAA7B,OAAA,KACA8H,EAAA8B,KAAA,GACA,GACAhX,EAAAgP,KAAA,CAAA5B,OAAA,KACAiE,EAAAqC,OAAA,CAAAtG,OAAA,KACAwG,EAAAC,IAAA,GAAAtM,EAAA6O,GAAA,GACA/E,EAAAgM,MAAA,IAEAD,KADAA,CAAAA,EAAApd,EAAA6U,SAAA,CAAAxK,GAAA,CAAAuJ,EAAAJ,KAAA,CAAA1b,IAAA,IAEAkI,EAAAgP,KAAA,CAAAoO,EAAA5J,KAAA,EAAAwD,KAAA,IACApD,EAAAJ,KAAA,CAAA4J,EAAA5J,KAAA,EAGA4J,KADAA,CAAAA,EAAApd,EAAA8U,QAAA,CAAAzK,GAAA,CAAAuJ,EAAAJ,KAAA,CAAA1b,IAAA,IAEAkI,EAAAiP,IAAA,CAAAmO,EAAA5J,KAAA,EAAAwD,KAAA,IACApD,EAAAJ,KAAA,CAAAxT,EAAAgP,KAAA,CAAA/W,MAAA,CAAAmlB,EAAA5J,KAAA,GAEAxT,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAyG,EAAAJ,KAAA,CAAA5L,WAAA,CAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+P,EAAAJ,KAAA,CAAA5L,WAAA,CACAjC,IAAA,wBAA+CiO,EAAAJ,KAAA,CAAA1b,IAAA,CAAc,6CAE7D8b,EAAAJ,KAAA,KAIA,EACA,EACA,CACA,OAAA1L,CACA,EA4jBA,KAAAL,SAAA,CAAA6V,MAAA,CA7ZA,SAAA7d,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAyb,SAAA,OAEA3T,CACA,EAwZA,KAAAL,SAAA,CAAA8V,KAAA,CAhWA,SAAA9d,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA0O,GAAA,GAGAnO,CACA,EAyVA,KAAAL,SAAA,CAAA+V,UAAA,CAzbA,SAAA/d,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CASA,OARAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAA0M,GAAA,CACAlb,IAAA,EACAmb,IAAA,EACArQ,KAAA+D,CACA,GAEAE,CACA,EA+aA,KAAAL,SAAA,YA1XA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAkU,GAAA,CAAA+G,EAAAtT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EAqXA,KAAAL,SAAA,YAlYA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAjH,GAAA,CAAAkiB,EAAAtT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EA6XA,KAAAL,SAAA,gBArXA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAKA,OAJAtI,IAAA8H,EAAAkT,QAAA,GACAza,EAAAkU,GAAA,CAAA+G,EAAAtT,EAAAC,EAAAsS,GACAla,EAAAjH,GAAA,CAAAiH,EAAAkU,GAAA,EAEApM,CACA,EA+WA,KAAAL,SAAA,CAAAgW,UAAA,CApcA,SAAAhe,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAA2b,QAAA,CAAA3G,GAAA,CAAAjB,QAAA,CAAA/V,IAAA,CAAAgC,EAAA0T,OAAA,CAAAzb,MAAA,EAEA6P,CACA,EA+bA,KAAAL,SAAA,CAAAiW,KAAA,CA7ZA,SAAAje,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAqBA,OApBAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAAjH,GAAA,GACAiH,EAAAkU,GAAA,CAAA/I,IACAnL,EAAA2d,MAAA,EACA9J,KAAAtM,EAAA0M,GAAA,CACAlb,IAAA,EACAmb,IAAA/I,GACA,EACAnL,EAAA0T,OAAA,CAAA1V,IAAA,CAAAgC,EAAA2d,MAAA,GACMle,IAAA8H,EAAAkT,QAAA,GACNza,EAAAjH,GAAA,CAAAiH,EAAAkU,GAAA,EACAlU,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,mDAAkE3F,EAAAjH,GAAA,CAAS,SAASiH,EAAAkU,GAAA,CAAS,IAG7FlU,EAAA2d,MAAA,CAAA5kB,GAAA,CAAAiH,EAAAjH,GAAA,CACAiH,EAAA2d,MAAA,CAAAzJ,GAAA,CAAAlU,EAAAkU,GAAA,EAEApM,CACA,EAuYA,KAAAL,SAAA,CAAAmW,KAAA,CA9VA,SAAAne,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAYA,OAXAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAuO,GAAA,CAGAtC,MAAA,CACA5L,YAAAA,EACA9P,KAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAsS,EACA,CACA,GAEApS,CACA,EAiVA,KAAAL,SAAA,CAAA4J,IAAA,CApkBA,SAAA5R,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CASA,OARAtI,IAAA8H,EAAAS,OAAA,GACAhI,EAAA4b,QAAA,CAAA3jB,MAAA,GACA+H,EAAA2b,QAAA,MACA3b,EAAAqU,YAAA,CAAArW,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,CACA,IAEAE,CACA,EA0jBA,KAAAL,SAAA,CAAAoW,UAAA,CAzjBA,SAAApe,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAS,OAAA,CACAhI,EAAA8d,QAAA,IACA9d,EAAAyb,SAAA,SACM,GAAAhc,IAAA8H,EAAAkT,QAAA,EACN,IAAAqD,CACA9d,CAAA,MAAAA,EAAAyb,SAAA,CAEAqC,KADAA,CAAAA,EAAA9d,EAAA6U,SAAA,CAAAnb,GAAA,CAAAsG,EAAA8d,QAAA,IAEA9d,EAAAyb,SAAA,MACAzb,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,cAA+B3F,EAAA8d,QAAA,CAAc,2BAI7C9d,EAAAmd,OAAA,EACArlB,KAAAgmB,EAAAhmB,IAAA,CACAgb,MAAAgL,EAAAhL,KAAA,CACAY,QAAA,GACAF,MAAAsK,EAAAtK,KAAA,EAEAxT,EAAAgP,KAAA,CAAAhR,IAAA,CAAAgC,EAAAmd,OAAA,EACAnd,EAAA0T,OAAA,CAAA1T,EAAAmd,OAAA,CAAAzJ,OAAA,EAIAoK,KADAA,CAAAA,EAAA9d,EAAA6U,SAAA,CAAAxK,GAAA,CAAArK,EAAA8d,QAAA,IAEA9d,EAAAyb,SAAA,MACAzb,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,cAA+B3F,EAAA8d,QAAA,CAAc,yDAG7C9d,EAAAmd,OAAA,CAAAnd,EAAAgP,KAAA,CAAA8O,EAAAtK,KAAA,EACAxT,EAAA0T,OAAA,CAAA1T,EAAAmd,OAAA,CAAAzJ,OAAA,CAGA,CACA,OAAA5L,CACA,EA+gBA,KAAAL,SAAA,CAAAsW,QAAA,CAtbA,SAAAte,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAA8d,QAAA,CAAApS,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EAibA,KAAAL,SAAA,CAAAuW,KAAA,CApIA,SAAAve,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CASA,OARAtI,IAAA8H,EAAAS,OAAA,CACAhI,EAAA2c,MAAA,IACMld,IAAA8H,EAAAkT,QAAA,EACNza,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAkP,GAAA,CACAD,OAAAxW,EAAA2c,MAAA,GAGA7U,CACA,EA0HA,KAAAL,SAAA,CAAAwW,OAAA,CAvLA,SAAAxe,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAMA,OALAtI,IAAA8H,EAAAkT,QAAA,EACAP,EAAA,GAAAvS,CAAAA,KAAAA,CAAA,CAAAC,EAAA,IAAAD,MAAAA,CAAA,CAAAC,EAAA,KACA5H,CAAAA,EAAAie,OAAA,KAGAnW,CACA,EAgLA,KAAAL,SAAA,CAAAyW,SAAA,CA/KA,SAAAze,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAkT,QAAA,EACA,GAAAza,EAAAie,OAAA,EACA,IAAApZ,EAAA8C,EAAAqB,KAAA,CAAApB,EAAAA,EAAAsS,GACA,QAAA/e,EAAA,EAAwBA,EAAA0J,EAAA5M,MAAA,CAAgBkD,GAAA,EACxC0J,CAAA,CAAA1J,EAAA,MAAA0J,CAAA,CAAA1J,EAAA,MACA0J,CAAAA,CAAA,CAAA1J,EAAA,MAGA6E,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAgP,GAAA,CACAC,OAAA3R,CACA,EACA,MACA7E,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAkP,GAAA,CACAD,OAAA7O,EAAAqB,KAAA,CAAApB,EAAAA,EAAAsS,EACA,GAGA,OAAApS,CACA,EA0JA,KAAAL,SAAA,CAAA0W,KAAA,CAhMA,SAAA1e,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAS,OAAA,EACAhI,CAAAA,EAAAie,OAAA,KAEAnW,CACA,EA2LA,KAAAL,SAAA,CAAA2W,KAAA,CA5HA,SAAA3e,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAkBA,OAjBAtI,IAAA8H,EAAAS,OAAA,EACAhI,EAAAjH,GAAA,GACAiH,EAAAkU,GAAA,IACMzU,IAAA8H,EAAAkT,QAAA,GACNza,EAAAjH,GAAA,CAAAiH,EAAAkU,GAAA,EACAlU,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,0DAAyE3F,EAAAjH,GAAA,CAAS,SAASiH,EAAAkU,GAAA,CAAS,IAGpGlU,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAmP,GAAA,CACA3d,IAAAiH,EAAAjH,GAAA,CACAmb,IAAAlU,EAAAkU,GAAA,IAGApM,CACA,EAyGA,KAAAL,SAAA,cAxPA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAkT,QAAA,EACA,IAAA3iB,EAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAsS,GACAmE,EAAAre,EAAA8U,QAAA,CAAApb,GAAA,CAAA5B,GACA,GAAAumB,KAAAA,EAEA,IAAAA,KADAA,CAAAA,EAAAre,EAAA8U,QAAA,CAAAzK,GAAA,CAAAvS,EAAA,EAEA,8CACA,MAEAkI,EAAAiP,IAAA,CAAAjR,IAAA,EACAlG,KAAAumB,EAAAvmB,IAAA,CACAgb,MAAAuL,EAAAvL,KAAA,CACAU,MAAA6K,EAAA7K,KAAA,CACA/B,MAAA,EACA,GAEAzR,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAwO,GAAA,CACAtE,MAAA,GACA+B,MAAA6K,EAAA7K,KAAA,EAEA,CACA,OAAA1L,CACA,EAgOA,KAAAL,SAAA,kBA/NA,SAAAhI,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CACA,GAAAtI,IAAA8H,EAAAkT,QAAA,EACA,IAAA3iB,EAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAsS,GACAmE,EAAAre,EAAA8U,QAAA,CAAApb,GAAA,CAAA5B,GACA,GAAAumB,KAAAA,EAEA,IAAAA,KADAA,CAAAA,EAAAre,EAAA8U,QAAA,CAAAzK,GAAA,CAAAvS,EAAA,EAEA,iDACA,MAEAkI,EAAAiP,IAAA,CAAAjR,IAAA,EACAlG,KAAAumB,EAAAvmB,IAAA,CACAgb,MAAAuL,EAAAvL,KAAA,CACAU,MAAA6K,EAAA7K,KAAA,CACA/B,MAAA,EACA,GAEAzR,EAAA0T,OAAA,CAAA1V,IAAA,EACA6V,KAAAtM,EAAAwO,GAAA,CACAtE,MAAA,GACA+B,MAAA6K,EAAA7K,KAAA,CACA1E,OAAA,KACAC,SAAA,IACA,EACA,CACA,OAAAjH,CACA,EAqMA,KAAAL,SAAA,CAAA6W,IAAA,CAvEA,SAAA7e,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAkU,GAAA,CAAAkH,EAAAzT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EAkEA,KAAAL,SAAA,CAAA8W,IAAA,CA/EA,SAAA9e,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,CAAAA,EAAAjH,GAAA,CAAAqiB,EAAAzT,EAAAC,EAAAsS,EAAA,EAEApS,CACA,EA0EA,KAAAL,SAAA,CAAA+W,OAAA,CApDA,SAAA/e,CAAA,CAAAkI,CAAA,CAAAC,CAAA,CAAAsS,CAAA,CAAAla,CAAA,EACA,IAAA8H,EAAAP,EAAAQ,MAAA,CAIA,OAHAtI,IAAA8H,EAAAkT,QAAA,EACAza,EAAA2c,MAAA,CAAA3e,IAAA,CAAAod,EAAAzT,EAAAC,EAAAsS,IAEApS,CACA,CA+CA,qBCxvBAsD,EAAAlS,OAAA,YACA,IAAAsS,EAAA,gBAgFA,OAxEA,SAAAiT,EAAA,GAAAC,EAAA,GAAAvP,EAAA,aAWAhU,EAVA,IAAAwjB,EAAA,YACAC,EAAA,GACAC,EAAA,GACAzO,EAAA,GACA0O,EAAA,GAGAjP,EAAA4O,EAAAxmB,MAAA,CACA6X,EAAA4O,EAAAzmB,MAAA,CACA4M,EAAA,iBAoBA,IAAA9B,CAAAA,MAAA8J,OAAA,CAAA4R,IAAAA,EAAAxmB,MAAA,EACA,eAAyBuT,EAAa,GAAGmT,EAAa,4CAEtD,IAAA5b,MAAA8J,OAAA,CAAA6R,GACA,eAAyBlT,EAAa,GAAGmT,EAAa,2BAGtD,IAAAxjB,EAAA,EAAgBA,EAAA0U,EAAe1U,GAAA,EAC/BiV,EAAApS,IAAA,CAAA7C,GAIA,GADAyjB,CADAA,EAAAxO,EAAApH,KAAA,KACA2N,IAAA,CA7BA,SAAArF,CAAA,CAAAE,CAAA,SACA,EAAAF,EAAA,CAAAwB,KAAA,CAAA9D,CAAA,CAAAwC,EAAA,CAAAsB,KAAA,CACA,GAEA9D,CAAA,CAAAsC,EAAA,CAAAwB,KAAA,CAAA9D,CAAA,CAAAwC,EAAA,CAAAsB,KAAA,CACA,EAEA,CACA,GAsBAhD,EAAA,CACA,IAAA3U,EAAA,EAAkBA,EAAA2U,EAAc3U,GAAA,EAChC2jB,EAAA9gB,IAAA,CAAA7C,GAGA0jB,CADAA,EAAAC,EAAA9V,KAAA,KACA2N,IAAA,CA1BA,SAAArF,CAAA,CAAAE,CAAA,SACA,EAAAF,EAAA,CAAAwB,KAAA,CAAA7D,CAAA,CAAAuC,EAAA,CAAAsB,KAAA,CACA,GAEA7D,CAAA,CAAAqC,EAAA,CAAAwB,KAAA,CAAA7D,CAAA,CAAAuC,EAAA,CAAAsB,KAAA,CACA,EAEA,CACA,EAmBA,CACA,GAAA3D,KAAAA,EAAA/K,UAAA,KAEA,IADAS,GAAA,qCACA1J,EAAA,EAAkBA,EAAA0U,EAAe1U,GAAA,EACjC0J,GAAA,GAAkB1J,EAAE,IAAIyjB,CAAA,CAAAzjB,EAAA,CAAc,IAAI6T,CAAA,CAAA4P,CAAA,CAAAzjB,EAAA,EAAArD,IAAA,CAA0B;AAAA,EAEpE,GAAAgY,EACA,IAAA3U,EAAA,EAAoBA,EAAA2U,EAAc3U,GAAA,EAClC0J,GAAA,GAAoB1J,EAAE,IAAI0jB,CAAA,CAAA1jB,EAAA,CAAiB,IAAI8T,CAAA,CAAA4P,CAAA,CAAA1jB,EAAA,EAAArD,IAAA,CAA4B;AAAA,MAGrE,CAEN,IADA+M,GAAA,iCACA1J,EAAA,EAAkBA,EAAA0U,EAAe1U,GAAA,EACjC0J,GAAA,GAAkB1J,EAAE,IAAI6T,CAAA,CAAA7T,EAAA,CAAArD,IAAA,CAAc;AAAA,EAEtC,GAAAgY,EACA,IAAA3U,EAAA,EAAoBA,EAAA2U,EAAc3U,GAAA,EAClC0J,GAAA,GAAoB1J,EAAE,IAAI8T,CAAA,CAAA9T,EAAA,CAAArD,IAAA,CAAa;AAAA,EAIvC,OAAA+M,CACA,CAEA,2BC7EAuG,EAAAlS,OAAA,gBAIA6lB,EAHA,IAAAvT,EAAA,wBACAE,EAAiB1O,EAAQ,OACzBuK,EAAAmE,EAAAlE,GAAA,CAsrBA,KAAAC,SAAA,IACA,KAAAA,SAAA,CAAAqU,KAAA,CAnkBA,SAAA7S,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,EACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,gDACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EAgjBA,KAAA/D,SAAA,CAAA2X,eAAA,CAjFA,SAAAnW,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACA,KAAAJ,EAAAM,UAAA,EACArf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,6BACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA8DA,KAAA/D,SAAA,CAAA6X,QAAA,CA7QA,SAAArW,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CACAlf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAQ,OAAA,EACA1b,KAAAkb,EAAAQ,OAAA,CACA5Z,IAAA,6DACA,GACAoZ,EAAAQ,OAAA,MACAR,EAAAM,UAAA,IACA,KACA,MAAA9X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,EACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAQ,OAAA,EACA1b,KAAAkb,EAAAQ,OAAA,CACA5Z,IAAA,sEACA,GAEAoZ,EAAAQ,OAAA,MACA,KACA,SACA,eAA2B/T,EAAa,6BACxC,CACA,EAkPA,KAAA/D,SAAA,CAAA+X,OAAA,CAnTA,SAAAvW,CAAA,CAAAtB,CAAA,CAAAC,CAAA,EACA,OAAAqB,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAJ,EAAAQ,OAAA,CAAA3X,EACA,KACA,SACA,eAA2B4D,EAAa,6BACxC,CACA,EAsSA,KAAA/D,SAAA,CAAAgY,SAAA,CArSA,SAAAxW,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACAhf,EAAA0f,aAAA,IACA,KACA,MAAAnY,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CADA,KAGA,MAAA3X,EAAA4X,KAAA,CACA,KAAAnf,EAAA0f,aAAA,EACA1f,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAnN,EAAA0f,aAAA,EACA7b,KAAA7D,EAAA0f,aAAA,CACA/Z,IAAA,yDACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EAiRA,KAAA/D,SAAA,CAAAkY,cAAA,CA3lBA,SAAA1W,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,kCACA,GACA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA0kBA,KAAA/D,SAAA,CAAAyV,IAAA,CA1rBA,SAAAjU,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACAhf,EAAA4b,QAAA,IACA5b,EAAA4f,QAAA,GACA,KACA,MAAArY,EAAA0X,KAAA,CACAjf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA,EACAhK,KAAA,EACA8B,IAAA,uBACA,GACA,KACA,MAAA4B,EAAA4X,KAAA,CACA,IAAAnf,EAAA6P,SAAA,EACA7P,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA,EACAhK,KAAA,EACA8B,IAAA,kBACA,GAEA,KACA,MAAA4B,EAAA2X,OAAA,CACA,eAA2B1T,EAAa,mEACxC,SACA,eAA2BA,EAAa,6BACxC,CACA,EAgqBA,KAAA/D,SAAA,CAAAoY,UAAA,CA5JA,SAAA5W,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CACAlf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAe,SAAA,EACAjc,KAAAkb,EAAAe,SAAA,CACAna,IAAA,sCACA,GAEAoZ,CADAA,EAAA/e,EAAA4b,QAAA,CAAAC,GAAA,IACAkE,UAAA,IACA,KACA,MAAAxY,EAAA4X,KAAA,CACAJ,EAAA/e,EAAA4b,QAAA,CAAAC,GAAA,GACA,KACA,SACA,eAA2BrQ,EAAa,6BACxC,CACA,EAwIA,KAAA/D,SAAA,CAAAuY,SAAA,CAtLA,SAAA/W,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAJ,EAAA,CACAe,UAAAlY,EACAmY,WAAA,GACAE,WAAA,KACAC,YAAA,GACAC,QAAA,KACAZ,QAAA,KACAa,YAAA,KACAf,WAAA,EACA,EACArf,EAAA4b,QAAA,CAAA5d,IAAA,CAAA+gB,GACA,KACA,SACA,eAA2BvT,EAAa,6BACxC,CACA,EA+JA,KAAA/D,SAAA,CAAA4Y,YAAA,CA9CA,SAAApX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,6CACA,GACA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA6BA,KAAA/D,SAAA,CAAA6Y,OAAA,CArEA,SAAArX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACA,GAAAlW,IAAAA,EAAApB,YAAA,EAAA7H,EAAA2O,MAAA,EACA,IAAAvC,EAAAzE,KAAAA,CAAA,CAAAC,EAAA,WACA5H,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,aAA8ByG,EAAI,sDAElC,CACA,KACA,SACA,eAA2BZ,EAAa,6BACxC,CACA,EAiDA,KAAA/D,SAAA,CAAA8V,KAAA,CAzjBA,SAAAtU,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,EACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,gDACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EAsiBA,KAAA/D,SAAA,CAAA8Y,WAAA,CAlHA,SAAAtX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CACAlf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAkB,UAAA,EACApc,KAAAkb,EAAAkB,UAAA,CACAta,IAAA,uCACA,GAEAoZ,CADAA,EAAA/e,EAAA4b,QAAA,CAAAC,GAAA,IACAqE,WAAA,IACA,KACA,MAAA3Y,EAAA4X,KAAA,CACAJ,EAAA/e,EAAA4b,QAAA,CAAAC,GAAA,GACA,KACA,SACA,eAA2BrQ,EAAa,6BACxC,CACA,EA8FA,KAAA/D,SAAA,CAAA+V,UAAA,CA5IA,SAAAvU,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAJ,EAAA,CACAe,UAAA,KACAC,WAAA,GACAE,WAAArY,EACAsY,YAAA,GACAC,QAAA,KACAZ,QAAA,KACAa,YAAA,KACAf,WAAA,EACA,EACArf,EAAA4b,QAAA,CAAA5d,IAAA,CAAA+gB,GACA,KACA,SACA,eAA2BvT,EAAa,6BACxC,CACA,EAqHA,KAAA/D,SAAA,CAAA+Y,YAAA,CAvNA,SAAAvX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CACAlf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAqB,WAAA,EACAvc,KAAAkb,EAAAqB,WAAA,CACAza,IAAA,oDACA,GACAoZ,EAAAM,UAAA,IACAN,EAAAqB,WAAA,MACA,KACA,MAAA7Y,EAAA4X,KAAA,CACAnf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAqB,WAAA,EACAvc,KAAAkb,EAAAqB,WAAA,CACAza,IAAA,kHACA,GACAoZ,EAAAqB,WAAA,MACA,KACA,SACA,eAA2B5U,EAAa,6BACxC,CACA,EA8LA,KAAA/D,SAAA,CAAAgZ,WAAA,CA7PA,SAAAxX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,EACA,OAAAqB,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAJ,EAAAqB,WAAA,CAAAxY,EACA,KACA,SACA,eAA2B4D,EAAa,6BACxC,CACA,EAgPA,KAAA/D,SAAA,CAAAiZ,aAAA,CA/OA,SAAAzX,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACAhf,EAAA0f,aAAA,IACA,KACA,MAAAnY,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CADA,KAGA,MAAA3X,EAAA4X,KAAA,CACA,KAAAnf,EAAA0f,aAAA,EACA1f,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAnN,EAAA0f,aAAA,EACA7b,KAAA7D,EAAA0f,aAAA,CACA/Z,IAAA,6DACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA2NA,KAAA/D,SAAA,CAAAgW,UAAA,CAnCA,SAAAxU,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CAGA,KAAA3X,EAAA4X,KAAA,CAFAnf,EAAA4f,QAAA,IACA,KAIA,SACA,eAA2BpU,EAAa,6BACxC,CACA,EAqBA,KAAA/D,SAAA,CAAA4J,IAAA,CAzqBA,SAAApI,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACAhf,EAAA4b,QAAA,CAAA3jB,MAAA,GACA8mB,EAAA,CACAe,UAAA,KACAC,WAAA,GACAE,WAAA,KACAC,YAAA,GACAC,QAAA,KACAZ,QAAA,KACAa,YAAA,KACAf,WAAA,EACA,EACArf,EAAA4b,QAAA,CAAA5d,IAAA,CAAA+gB,GACA,KACA,MAAAxX,EAAA0X,KAAA,CACA,eAA2BzT,EAAa,sCACxC,MAAAjE,EAAA2X,OAAA,CACA,KACA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA6P,SAAA,IACA,KACA,SACA,eAA2BrE,EAAa,6BACxC,CACA,EAgpBA,KAAA/D,SAAA,CAAAkZ,SAAA,CA/oBA,SAAA1X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,+DACA,GACA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA8nBA,KAAA/D,SAAA,CAAAmZ,aAAA,CA7nBA,SAAA3X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,kEACA,GACA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA4mBA,KAAA/D,SAAA,CAAAoZ,SAAA,CA1WA,SAAA5X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA0f,aAAA,CAAA9X,EACA,KACA,SACA,eAA2B4D,EAAa,6BACxC,CACA,EA6VA,KAAA/D,SAAA,CAAAqZ,QAAA,CA5VA,SAAA7X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CADA,KAGA,MAAA1X,EAAA2X,OAAA,CACAlf,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAA4R,EAAAoB,OAAA,EACAtc,KAAAkb,EAAAoB,OAAA,CACAxa,IAAA,+DACA,GACAoZ,EAAAM,UAAA,IACAN,EAAAoB,OAAA,MACA,KACA,MAAA5Y,EAAA4X,KAAA,CACAJ,EAAAoB,OAAA,MACA,KACA,SACA,eAA2B3U,EAAa,6BACxC,CACA,EAwUA,KAAA/D,SAAA,CAAAsZ,OAAA,CAjZA,SAAA9X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,EACA,OAAAqB,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAJ,EAAAoB,OAAA,CAAAvY,EACA,KACA,SACA,eAA2B4D,EAAa,6BACxC,CACA,EAoYA,KAAA/D,SAAA,CAAAyW,SAAA,CAnYA,SAAAjV,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACAhf,EAAA0f,aAAA,IACA,KACA,MAAAnY,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CADA,KAGA,MAAA3X,EAAA4X,KAAA,CACA,KAAAnf,EAAA0f,aAAA,EACA1f,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAnN,EAAA0f,aAAA,EACA7b,KAAA7D,EAAA0f,aAAA,CACA/Z,IAAA,oGACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA+WA,KAAA/D,SAAA,CAAAuZ,KAAA,CAzaA,SAAA/X,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACA,GAAAnf,EAAA2O,MAAA,EACA,IAAA7W,EAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAqB,EAAApB,YAAA,EACA7H,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,sBAAuC7N,EAAK,6BAE5C,CACA,KACA,SACA,eAA2B0T,EAAa,6BACxC,CACA,EAqZA,KAAA/D,SAAA,CAAAwU,KAAA,CAnjBA,SAAAhT,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,CACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,kEACA,GACU3F,EAAA6O,IAAA,EACV7O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,+DACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EA0hBA,KAAA/D,SAAA,CAAAyU,KAAA,CAzhBA,SAAAjT,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,CACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,kEACA,GACU3F,EAAA6O,IAAA,EACV7O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,+DACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EAggBA,KAAA/D,SAAA,CAAA0U,KAAA,CAzcA,SAAAlT,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACA,GAAAnf,EAAA2O,MAAA,EACA,IAAA7W,EAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAqB,EAAApB,YAAA,EACA7H,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,2BAA4C7N,EAAK,mCAEjD,MAAU,GAAAkI,EAAA6O,IAAA,EACV,IAAA/W,EAAA4T,EAAAzD,KAAA,CAAAC,aAAA,CAAAP,EAAAC,EAAAqB,EAAApB,YAAA,EACA7H,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,2BAA4C7N,EAAK,gCAEjD,CACA,KACA,SACA,eAA2B0T,EAAa,6BACxC,CACA,EA8aA,KAAA/D,SAAA,CAAA6T,KAAA,CAhgBA,SAAArS,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,CACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,+DACA,GACU3F,EAAA6O,IAAA,EACV7O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,4DACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,EAueA,KAAA/D,SAAA,CAAA8T,KAAA,CAteA,SAAAtS,CAAA,CAAAtB,CAAA,CAAAC,CAAA,CAAA5H,CAAA,EACA,OAAAiJ,EAAAxJ,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CAEA,KAAAzX,EAAA0X,KAAA,CAEA,KAAA1X,EAAA2X,OAAA,CAHA,KAKA,MAAA3X,EAAA4X,KAAA,CACAnf,EAAA2O,MAAA,CACA3O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,yDACA,GACU3F,EAAA6O,IAAA,EACV7O,EAAA4G,MAAA,CAAA5I,IAAA,EACA6P,KAAA7N,EAAAmT,QAAA,CAAAnT,EAAAmN,KAAA,CAAAvF,EAAA5H,EAAAoU,WAAA,EACAvQ,KAAA+D,EACAjC,IAAA,sDACA,GAEA,KACA,SACA,eAA2B6F,EAAa,6BACxC,CACA,CA6cA,yBCrtBA,IAAQD,OAAAA,CAAA,EAAWvO,EAAQ,OAE3BikB,EAAcjkB,EAAQ,OAGtBkkB,EAAA,OACAC,EAAA,QACAC,EAAA,UACAC,EAAA,UACAC,EAAA,QACAC,EAAA,UACAC,EAAA,UACAC,EAAA,QACAC,EAAA,QACAC,EAAA,SACAC,EAAA,QACAC,EAAA,SACAC,EAAA,WACAC,EAAA,WACAC,EAAA,SACAC,EAAA,WACAC,EAAA,WACAC,EAAA,UACAC,EAAA,SAIAC,EAAA,SAAAhX,CAAA,EACAA,EAAAwI,IAAA,CAAAqN,EACA,IAAAoB,EAAAjX,EAAArL,IAAA,CACAqL,EAAAkX,GAAA,GACAD,EAAArqB,MAAA,KACAqqB,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KACAjX,CAAAA,EAAAkX,GAAA,GAGA,EAIAC,EAAA,SAAAnX,CAAA,EACA,IAAAiX,EAAAjX,EAAArL,IAAA,CAEA,OADAqL,EAAAkX,GAAA,GACAlX,EAAAwI,IAAA,EACA,KAAAsN,EACA9V,EAAAwI,IAAA,CAAAuN,EACAkB,EAAArqB,MAAA,MACAqqB,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACAjX,EAAAkX,GAAA,GACU,MAAAD,CAAA,KAAAA,MAAAA,CAAA,MACVjX,EAAAwI,IAAA,CAAAwN,EACAhW,EAAAkX,GAAA,KAGA,KACA,MAAAnB,EAEA,GADA/V,EAAAwI,IAAA,CAAAuN,EACAkB,EAAArqB,MAAA,KACA,GAAAqqB,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACAjX,EAAAkX,GAAA,QACU,GAAAD,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACV,8BAA4ClB,EAAQ,8BAA8BC,EAAQ,IAG1F,KACA,MAAAA,EAEA,GADAhW,EAAAwI,IAAA,CAAAwN,EACAiB,EAAArqB,MAAA,KACA,GAAAqqB,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACA,8BAA4CjB,EAAQ,8BAA8BD,EAAQ,GAChF,OAAAkB,CAAA,KAAAA,MAAAA,CAAA,KACVjX,CAAAA,EAAAkX,GAAA,GAEA,CACA,KACA,SACA,wCAAkDlX,EAAAwI,IAAA,CAAS,gBAC3D,CACA,EAIA4O,EAAA,SAAApX,CAAA,EACA,IAAAiX,EAAAjX,EAAArL,IAAA,CAEA,OADAqL,EAAAkX,GAAA,GACAlX,EAAAwI,IAAA,EACA,KAAAyN,EACAjW,EAAAwI,IAAA,CAAA0N,EACAe,EAAArqB,MAAA,MACA,IAAAqqB,CAAA,KAAAA,IAAAA,CAAA,KAAAA,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KACAjX,CAAAA,EAAAkX,GAAA,IAEA,MAAAD,CAAA,KAAAA,MAAAA,CAAA,KAAAA,IAAAA,CAAA,KAAAA,IAAAA,CAAA,MACAjX,EAAAwI,IAAA,CAAA2N,EACAnW,EAAAkX,GAAA,KAGA,KACA,MAAAhB,EAEA,GADAlW,EAAAwI,IAAA,CAAA0N,EACAe,EAAArqB,MAAA,MACA,IAAAqqB,CAAA,KAAAA,IAAAA,CAAA,KAAAA,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KACAjX,CAAAA,EAAAkX,GAAA,IAEAD,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KAAAA,IAAAA,CAAA,KAAAA,IAAAA,CAAA,KACA,6BAA2Cf,EAAA,0BAAS,EAA2BC,EAAQ,IAGvF,KACA,MAAAA,EAEA,GADAnW,EAAAwI,IAAA,CAAA2N,EACAc,EAAArqB,MAAA,KACA,GAAAqqB,IAAAA,CAAA,KAAAA,IAAAA,CAAA,KAAAA,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACA,8BAA4Cd,EAAQ,8BAA8BD,EAAQ,GAE1F,OAAAe,CAAA,KAAAA,MAAAA,CAAA,KAAAA,IAAAA,CAAA,KAAAA,IAAAA,CAAA,KACAjX,CAAAA,EAAAkX,GAAA,GAEA,CACA,KACA,SACA,wCAAkDlX,EAAAwI,IAAA,CAAS,gBAC3D,CACA,EAOA6O,EAAA,SAAA7O,CAAA,CAAA7T,CAAA,EAkBA,IAAA8H,EAAA6a,SAjBAC,CAAA,EACA,IAAA9a,EAAA,CACA+L,KAAA,GACAgP,OAAA,EACA,EAEA5Z,EAAA6Z,8BAAAC,IAAA,CAAAH,GASA,OARA3Z,IACAA,CAAA,KACAnB,CAAAA,EAAA+L,IAAA,CAAA5K,CAAA,IAAA+B,WAAA,IAEA/B,CAAA,KACAnB,CAAAA,EAAA+a,MAAA,MAGA/a,CACA,EACA+L,EAAA7I,WAAA,IACA,GAAAlD,EAAA+a,MAAA,EAEA,GAAA/a,EAAA+L,IAAA,GAAAuO,EACA,0BAAoCvO,EAAA,wCAAM,EAAyCuO,EAAO,GAE1F,GAAA7W,EAAAgD,QAAA,CAAAvO,GACA8H,EAAA9H,IAAA,CAAAihB,EAAA4B,MAAA,CAAArU,MAAA,CAAAxO,QACM,oBAAAA,EAAA,CACN,IAAAsiB,EAAA/W,EAAAvI,IAAA,CAAAhD,EAAA,QACA8H,CAAAA,EAAA9H,IAAA,CAAAihB,EAAA4B,MAAA,CAAArU,MAAA,CAAA8T,EACA,MACA,0BAAoCzO,EAAA,uCAAM,EAAwC,OAAA7T,EAAY,EAE9F,MACA8H,EAAA9H,IAAA,CAAAA,EAEA,OAAA8H,EAAA+L,IAAA,EACA,KAAAqN,EACAmB,EAAAva,GACA,KACA,MAAAqZ,EACA,KAAAC,EACA,KAAAC,EACAmB,EAAA1a,GACA,KACA,MAAAwZ,EACA,KAAAC,EACA,KAAAC,EACAiB,EAAA3a,GACA,KACA,MAAA+Z,EACA/Z,EAAA+L,IAAA,CAAAkO,EACA,KACA,MAAAC,EACAla,EAAA+L,IAAA,CAAAqO,EACA,KACA,MAAAR,EACA5Z,EAAA+L,IAAA,CAAA4N,EACA,KACA,MAAAE,EACA7Z,EAAA+L,IAAA,CAAA+N,EACA,KACA,MAAAH,EACA,KAAAG,EACA,KAAAE,EACA,KAAAC,EACA,KAAAE,EACA,KAAAC,EACA,KAAAE,EACA,KAAAD,EACA,KACA,SACA,0BAAoCtO,EAAK,kBACzC,CACA,GAAA/L,EAAA+L,IAAA,GAAAuO,EACA,qBAAAta,EAAA9H,IAAA,CACA,0BAAoC6T,EAAK,4BACzC,MACI,IAAAtI,EAAAgD,QAAA,CAAAzG,EAAA9H,IAAA,EACJ,0BAAkC6T,EAAK,6BAEvC,OAAA/L,CACA,EAIAkb,EAAA,SAAAnP,CAAA,CAAAlM,CAAA,EAwCA,IAAA5E,MAAA8J,OAAA,CAAAlF,GACA,0CAAkD,OAAAA,EAAa,GAE/D,oBAAAkM,EACA,0CAAkD,OAAAA,EAAY,GAE9D,IAAA/L,EAAA6a,SA7CAC,CAAA,MACAK,EACAC,EACA,IAAApb,EAAA,CACA8S,KAAA,GACAF,GAAA,GACAmI,OAAA,GACAhP,KAAA,EACA,EAGA,QAGA,GAFAqP,EAAAN,EAEAK,UADAA,CAAAA,EAAAL,EAAA5Z,KAAA,OACA,CACAlB,EAAA8S,IAAA,IACAsI,EAAAN,EAAA5Z,KAAA,IACA,KACA,CAEA,QADAia,CAAAA,EAAAL,EAAA5Z,KAAA,SAEAlB,EAAA4S,EAAA,IACAwI,EAAAN,EAAA5Z,KAAA,KAGA,KACA,CAWA,OARAia,IAAAA,CADAA,EAAAC,EAAA1oB,KAAA,OACAvC,MAAA,CAEA6P,EAAA+L,IAAA,CAAAoP,CAAA,IACM,IAAAA,EAAAhrB,MAAA,EAAAgrB,WAAAA,CAAA,MACNnb,EAAA+a,MAAA,IAEA/a,EAAA+L,IAAA,CAAAoP,CAAA,KAEAnb,CACA,EAOA+L,EAAA7I,WAAA,IACA,OAAAlD,EAAA+L,IAAA,EACA,KAAAqN,EACA,KAAAE,EACA,KAAAC,EACA,KAAAE,EACA,KAAAC,EACA,KAAAC,EACA,KAAAG,EACA,KAAAE,EACA,KAAAC,EACA,KAAAE,EACA,KAAAC,EACA,KAAAC,EACA,KACA,MAAAC,EACA,GAAAta,EAAA+a,MAAA,CACA,0DAAsET,EAAO,GAE7E,KACA,MAAAV,EACA5Z,EAAA+L,IAAA,CAAA4N,EACA,KACA,MAAAE,EACA7Z,EAAA+L,IAAA,CAAA+N,EACA,KACA,MAAAT,EACArZ,EAAA+L,IAAA,CAAAuN,EACA,KACA,MAAAE,EACAxZ,EAAA+L,IAAA,CAAA0N,EACA,KACA,MAAAM,EACA/Z,EAAA+L,IAAA,CAAAkO,EACA,KACA,MAAAC,EACAla,EAAA+L,IAAA,CAAAqO,EACA,KACA,SACA,2CAAqDrO,EAAK,6CAC1D,CACA,OAAA/L,CACA,EAEA/C,EAAA,SAAA8O,CAAA,CAAAlM,CAAA,EACA,OAAAkM,GACA,KAAAqN,EACA,OAAAD,EAAAkC,IAAA,CAAApe,MAAA,CAAA4C,EACA,MAAAyZ,EACA,OAAAH,EAAAmC,OAAA,CAAAre,MAAA,CAAA4C,EACA,MAAA0Z,EACA,OAAAJ,EAAAoC,OAAA,CAAAte,MAAA,CAAA4C,EACA,MAAA4Z,EACA,OAAAN,EAAAqC,OAAA,CAAAve,MAAA,CAAA4C,EACA,MAAA6Z,EACA,OAAAP,EAAAsC,OAAA,CAAAxe,MAAA,CAAA4C,EACA,MAAA8Z,EACA,OAAAR,EAAAuC,KAAA,CAAAze,MAAA,CAAA4C,EACA,MAAAia,EACA,OAAAX,EAAAwC,KAAA,CAAA1e,MAAA,CAAA4C,EACA,MAAAoa,EACA,OAAAd,EAAAyC,QAAA,CAAA3e,MAAA,CAAA4C,EACA,MAAAma,EACA,OAAAb,EAAA0C,QAAA,CAAA5e,MAAA,CAAA4C,EACA,MAAAua,EACA,OAAAjB,EAAA2C,QAAA,CAAA7e,MAAA,CAAA4C,EACA,MAAAsa,EACA,OAAAhB,EAAA4C,QAAA,CAAA9e,MAAA,CAAA4C,EACA,MAAAya,EACA,OAAAnB,EAAAzK,MAAA,CAAAzR,MAAA,CAAA4C,EACA,MAAAwa,EACA,OAAAlB,EAAA6C,OAAA,CAAA/e,MAAA,CAAA4C,EACA,SACA,gCAA0CkM,EAAK,kBAC/C,CACA,EAGArF,EAAA,SAAAnD,CAAA,EACA,OAAAA,EAAAwI,IAAA,EACA,KAAAqN,EACA,OAAAD,EAAAkC,IAAA,CAAA3U,MAAA,CAAAnD,EAAArL,IAAA,CAAAqL,EAAAkX,GAAA,CACA,MAAAlB,EACA,OAAAJ,EAAAoC,OAAA,CAAA7U,MAAA,CAAAnD,EAAArL,IAAA,CAAAqL,EAAAkX,GAAA,CACA,MAAAnB,EACA,OAAAH,EAAAmC,OAAA,CAAA5U,MAAA,CAAAnD,EAAArL,IAAA,CAAAqL,EAAAkX,GAAA,CACA,MAAAhB,EACA,OAAAN,EAAAqC,OAAA,CAAA9U,MAAA,CAAAnD,EAAArL,IAAA,CAAAqL,EAAAkX,GAAA,CACA,MAAAf,EACA,OAAAP,EAAAsC,OAAA,CAAA/U,MAAA,CAAAnD,EAAArL,IAAA,CAAAqL,EAAAkX,GAAA,CACA,MAAAd,EACA,OAAAR,EAAAuC,KAAA,CAAAhV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAA4hB,EACA,OAAAX,EAAAwC,KAAA,CAAAjV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAA+hB,EACA,OAAAd,EAAAyC,QAAA,CAAAlV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAA8hB,EACA,OAAAb,EAAA0C,QAAA,CAAAnV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAAkiB,EACA,OAAAjB,EAAA2C,QAAA,CAAApV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAAiiB,EACA,OAAAhB,EAAA4C,QAAA,CAAArV,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAAoiB,EACA,OAAAnB,EAAAzK,MAAA,CAAAhI,MAAA,CAAAnD,EAAArL,IAAA,CACA,MAAAmiB,EACA,OAAAlB,EAAA6C,OAAA,CAAAtV,MAAA,CAAAnD,EAAArL,IAAA,CACA,SACA,gCAA0CqL,EAAAwI,IAAA,CAAS,kBACnD,CACA,CAGA3a,CAAAA,EAAAsV,MAAc,UAAAqF,CAAA,CAAA7T,CAAA,EAEd,OAAAwO,EADAkU,EAAA7O,EAAA7T,GAEA,EAEA9G,EAAA6L,MAAc,UAAA8O,CAAA,CAAAlM,CAAA,MACdoc,EACAzB,EACA,IAAApQ,EAAA8Q,EAAAnP,EAAAlM,GAgBA,OAfAuK,EAAA0I,IAAA,EAEAmJ,EAAA9C,EAAA+C,QAAA,CAAApJ,IAAA,CAAAjT,GACA2a,EAAAvd,EAAAmN,EAAA2B,IAAA,CAAAkQ,IACI7R,EAAAwI,EAAA,EAEJqJ,EAAA9C,EAAA+C,QAAA,CAAAtJ,EAAA,CAAA/S,GACA2a,EAAAvd,EAAAmN,EAAA2B,IAAA,CAAAkQ,IAEAzB,EAAAvd,EAAAmN,EAAA2B,IAAA,CAAAlM,GAEAuK,EAAA2Q,MAAA,EAEAP,CAAAA,EAAArB,EAAA4B,MAAA,CAAA9d,MAAA,CAAAud,EAAA,EAEAA,CACA,EAMAppB,EAAA+qB,OAAe,CAHf,SAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,OAAAlrB,EAAA6L,MAAA,CAAAqf,EAAAlrB,EAAAsV,MAAA,CAAA0V,EAAAC,GACA,yBCpZA,IAAQ5Y,OAAAA,CAAA,EAAWvO,EAAQ,OAY3BqnB,EAAA,CACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,CAMAC,EAAA,GACAC,oEAJA/pB,KAAA,KAIA4S,OAAA,KACAkX,EAAAtmB,IAAA,CAAA6F,EAAAO,UAAA,IACA,GAGAlL,EAAAiqB,IAAY,EACZpe,OAAA4C,CAAA,EACA,IAAA5P,EAAA,GAqBA,OApBA4P,EAAAyF,OAAA,KACA,GAAAvJ,GAAA,GAAAA,GAAA,IACA9L,EAAAiG,IAAA,CAAA6F,QACQ,GAAAA,GAAA,KACR9L,EAAAiG,IAAA,WAvRA,EAuRA,GACAjG,EAAAiG,IAAA,KAAA6F,CAAAA,GAAAA,CAAA,QACQ,GAAAA,EAAA,OAAAA,EAAA,OAAAA,GAAA,MACR9L,EAAAiG,IAAA,YA1RA,EA0RA,GACAjG,EAAAiG,IAAA,WA3RA,EA2RA,GACAjG,EAAAiG,IAAA,KAAA6F,CAAAA,GAAAA,CAAA,QACQ,GAAAA,GAAA,OAAAA,GAAA,SACR,IAAA2gB,EAAA,MA9RA,GA+RAzsB,EAAAiG,IAAA,KAAAwmB,CAAAA,GAAA,IACAzsB,EAAAiG,IAAA,OAAAwmB,EAAAA,CAAA,aAhSA,EAgSA,GACAzsB,EAAAiG,IAAA,WAjSA,EAiSA,GACAjG,EAAAiG,IAAA,KAAA6F,CAAAA,GAAAA,CAAA,EACA,MACA,+DAA2EA,EAAK,EAEhF,GACA0H,EAAAvI,IAAA,CAAAjL,EACA,EACAyW,OAAA8T,CAAA,CAAAC,CAAA,MAgDAwB,EACAU,EACAC,EACAC,EACAC,EACAC,EACA,IAAA5kB,EAAAqiB,EAAArqB,MAAA,CACAkD,EAAAonB,EAAA,IACA5a,EAAA,GACA,KAAAxM,EAAA8E,GAAA,CAIA,IAHAwkB,EAAAnC,CAAA,CAAAnnB,EAAA,CACA4oB,EAvWA,aAyWA,CACA,GAAAU,GAAA,GAAAA,GAAA,KAEAV,EAAAU,EACAI,EAAA,EACA,KACA,CAEA,GAAAH,CADAA,EAAAvpB,EAAA,GACA8E,GAAAwkB,GAAA,KAAAA,GAAA,KAEAV,EAAAe,SArEAL,CAAA,CAAAM,CAAA,EAGA,IAAAA,IAAAA,CAAA,OACA,OApTA,WAsTA,IAAAjnB,EAAA,EAAA2mB,GAAAA,CAAA,MAAAM,CAAAA,GAAAA,CAAA,SACA,MAxTA,WA2TAjnB,CACA,EA0DA2mB,EAAAnC,CAAA,CAAAoC,EAAA,EACAG,EAAA,EACA,KACA,CAEA,GAAAF,CADAA,EAAAxpB,EAAA,GACA8E,GAAAwkB,GAAA,KAAAA,GAAA,KAEAV,EAAAiB,SAhEAP,CAAA,CAAAM,CAAA,CAAAE,CAAA,EAGA,IAAAA,IAAAA,CAAA,SAAAF,IAAAA,CAAA,OACA,OAhUA,WAkUA,IAAAjnB,EAAA,EAAA2mB,GAAAA,CAAA,SAAAM,GAAAA,CAAA,MAAAE,CAAAA,GAAAA,CAAA,SACA,OApUA,WAuUAnnB,GAAA,OAAAA,GAAA,MArUA,WAwUAA,CACA,EAkDA2mB,EAAAnC,CAAA,CAAAoC,EAAA,CAAApC,CAAA,CAAAqC,EAAA,EACAE,EAAA,EACA,KACA,CACAD,CAAAA,EAAAzpB,EAAA,GACA8E,GAAAwkB,GAAA,KAAAA,GAAA,MAEAV,EAAAmB,SAxDAT,CAAA,CAAAM,CAAA,CAAAE,CAAA,CAAAE,CAAA,EAGA,IAAAA,IAAAA,CAAA,SAAAF,IAAAA,CAAA,SAAAF,IAAAA,CAAA,OACA,OA/UA,WAiVA,IAAAjnB,EACA,GAAA2mB,EAAAA,CAAA,YA7UA,CA6UA,OACA,EAAAM,GAAAA,CAAA,OACA,EAAAE,GAAAA,CAAA,MACAE,CAAAA,GAAAA,CAAA,SACA,QAvVA,WA0VArnB,EAAA,QAxVA,WA2VAA,CACA,EAsCA2mB,EAAAnC,CAAA,CAAAoC,EAAA,CAAApC,CAAA,CAAAqC,EAAA,CAAArC,CAAA,CAAAsC,EAAA,EACAC,EAAA,GAIA,KACA,CACA,GAAAd,EAAA,SACA,IAAAqB,EAAA,QAA2BjqB,EAAE,GAC7B,GAAA4oB,aAAAA,EACA,yEAAuFqB,EAAG,GAE1F,GAAArB,aAAAA,EACA,iEAA+EqB,EAAG,GAElF,GAAArB,aAAAA,EACA,mEAAiFqB,EAAG,GAEpF,GAAArB,aAAAA,EACA,6DAA2EqB,EAAG,EAE9E,+DAA0EA,EAAG,EAC7E,CACAzd,EAAA3J,IAAA,CAAA+lB,GACA5oB,GAAA0pB,CACA,CACA,OAAAld,CACA,CACA,EAGAzO,EAAAkqB,OAAe,EACfre,OAAA4C,CAAA,MAEA9D,EACAzL,EACA0C,EAHA,IAAA/C,EAAA,GAIA,QAAAoD,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,EAEtC,IADA0I,EAAA8D,CAAA,CAAAxM,EAAA,GACA,GAAA0I,GAAA,OAAAA,GAAA,OAAAA,GAAA,MACA9L,EAAAiG,IAAA,MAtaA,KAuaAjG,EAAAiG,IAAA,CAAA6F,IAAAA,QACQ,GAAAA,GAAA,OAAAA,GAAA,QAERzL,EAAA,MAAA0C,CAAAA,CADAA,EAAA+I,EAAA,QACA,IACA/I,EAAA,MAAAA,CAAAA,KAAAA,CAAA,EACA/C,EAAAiG,IAAA,MA5aA,KA6aAjG,EAAAiG,IAAA,CAAA5F,IAAAA,GACAL,EAAAiG,IAAA,MA9aA,KA+aAjG,EAAAiG,IAAA,CAAAlD,IAAAA,QAEA,qEAAiFK,EAAE,KAAK0I,EAAK,GAG7F,OAAA0H,EAAAvI,IAAA,CAAAjL,EACA,EACAyW,OAAA8T,CAAA,CAAAC,CAAA,MASAwB,EACAc,EACAH,EACAE,EACAS,EACA3pB,EAZA,GAAA4mB,EAAArqB,MAAA,KACA,oFAA8FqqB,EAAArqB,MAAA,CAAW,GAEzG,IAAA0P,EAAA,GACA1H,EAAAqiB,EAAArqB,MAAA,CACAkD,EAAAonB,EAAA,IACArkB,EAAA,EAOA,KAAA/C,EAAA8E,GAAA,CAEA,QAEA,GAAAykB,CADAA,EAAAvpB,EAAA,GACA8E,EAAA,CAEA,GAAAolB,CADAA,EAAA,CAAA/C,CAAA,CAAAnnB,EAAA,KAAAmnB,CAAA,CAAAoC,EAAA,EACA,OAAAW,EAAA,OACAtB,EAAAsB,EACAR,EAAA,EACA,KACA,CAEA,GAAAD,CADAA,EAAAzpB,EAAA,GACA8E,IACAvE,EAAA,CAAA4mB,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAsC,EAAA,CACAS,GAAA,OAAA3pB,GAAA,OAAAA,GAAA,QACAqoB,EAAA,oBAAAroB,CAAAA,EAAA,OACAmpB,EAAA,EACA,KACA,CAEA,CAEA,iFAA6F1pB,EAAE,GAC/F,CACAwM,CAAA,CAAAzJ,IAAA,CAAA6lB,EACA5oB,GAAA0pB,CACA,CACA,OAAAld,CACA,CACA,EAGAzO,EAAAmqB,OAAe,EACfte,OAAA4C,CAAA,MAEA9D,EACAzL,EACA0C,EAHA,IAAA/C,EAAA,GAIA,QAAAoD,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,EAEtC,IADA0I,EAAA8D,CAAA,CAAAxM,EAAA,GACA,GAAA0I,GAAA,OAAAA,GAAA,OAAAA,GAAA,MACA9L,EAAAiG,IAAA,CAAA6F,IAAAA,GACA9L,EAAAiG,IAAA,MA/eA,UAgfQ,GAAA6F,GAAA,OAAAA,GAAA,QAERzL,EAAA,MAAA0C,CAAAA,CADAA,EAAA+I,EAAA,QACA,IACA/I,EAAA,MAAAA,CAAAA,KAAAA,CAAA,EACA/C,EAAAiG,IAAA,CAAA5F,IAAAA,GACAL,EAAAiG,IAAA,MArfA,KAsfAjG,EAAAiG,IAAA,CAAAlD,IAAAA,GACA/C,EAAAiG,IAAA,MAvfA,UAyfA,qEAAiF7C,EAAE,KAAK0I,EAAK,GAG7F,OAAA0H,EAAAvI,IAAA,CAAAjL,EACA,EACAyW,OAAA8T,CAAA,CAAAC,CAAA,MASAwB,EACAc,EACAH,EACAE,EACAS,EACA3pB,EAZA,GAAA4mB,EAAArqB,MAAA,KACA,oFAA8FqqB,EAAArqB,MAAA,CAAW,GAEzG,IAAA0P,EAAA,GACA1H,EAAAqiB,EAAArqB,MAAA,CACAkD,EAAAonB,EAAA,IACArkB,EAAA,EAOA,KAAA/C,EAAA8E,GAAA,CAEA,QAEA,GAAAykB,CADAA,EAAAvpB,EAAA,GACA8E,EAAA,CAEA,GAAAolB,CADAA,EAAA,CAAA/C,CAAA,CAAAoC,EAAA,KAAApC,CAAA,CAAAnnB,EAAA,EACA,OAAAkqB,EAAA,OACAtB,EAAAsB,EACAR,EAAA,EACA,KACA,CAEA,GAAAD,CADAA,EAAAzpB,EAAA,GACA8E,IACAvE,EAAA,CAAA4mB,CAAA,CAAAsC,EAAA,KAAAtC,CAAA,CAAAnnB,EAAA,GACAkqB,GAAA,OAAA3pB,GAAA,OAAAA,GAAA,QACAqoB,EAAA,oBAAAroB,CAAAA,EAAA,OACAmpB,EAAA,EACA,KACA,CAEA,CAEA,iFAA6F1pB,EAAE,GAC/F,CACAwM,CAAA,CAAAzJ,IAAA,CAAA6lB,EACA5oB,GAAA0pB,CACA,CACA,OAAAld,CACA,CACA,EAGAzO,EAAAoqB,OAAe,EACfve,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAUA,OATAwM,EAAAyF,OAAA,KACA,aAAAvJ,GAAA,OAAAA,EAAA,QACA,8EAA0F1I,EAAA,EAAM,KAAK0I,EAAK,EAE1Gye,CAAAA,CAAA,CAAAnnB,IAAA,OArjBA,IAsjBAmnB,CAAA,CAAAnnB,IAAA,OAtjBA,IAujBAmnB,CAAA,CAAAnnB,IAAA,MAvjBA,IAwjBAmnB,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,CACA,GACAye,CACA,EACA9T,OAAA8T,CAAA,CAAAC,CAAA,EAEA,GAAAD,EAAArqB,MAAA,KACA,4FAAsGqqB,EAAArqB,MAAA,CAAW,GAEjH,IAAA0P,EAAA,GACAxM,EAAAonB,EAAA,IACA,KAAWpnB,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,GAC3B,IAAA0I,EAAA,CAAAye,CAAA,CAAAnnB,EAAA,MAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAnnB,EAAA,GACA,aAAA0I,GAAA,OAAAA,EAAA,QACA,8EAA0F1I,EAAA,EAAM,KAAK0I,EAAK,GAE1G8D,EAAA3J,IAAA,CAAA6F,EACA,CACA,OAAA8D,CACA,CACA,EAGAzO,EAAAqqB,OAAe,EACfxe,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAUA,OATAwM,EAAAyF,OAAA,KACA,aAAAvJ,GAAA,OAAAA,EAAA,QACA,8EAA0F1I,EAAA,EAAM,KAAK0I,EAAK,EAE1Gye,CAAAA,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,EACAye,CAAA,CAAAnnB,IAAA,MAxlBA,IAylBAmnB,CAAA,CAAAnnB,IAAA,OAzlBA,IA0lBAmnB,CAAA,CAAAnnB,IAAA,OA1lBA,GA2lBA,GACAmnB,CACA,EACA9T,OAAA8T,CAAA,CAAAC,CAAA,EAEA,GAAAD,EAAArqB,MAAA,KACA,4FAAsGqqB,EAAArqB,MAAA,CAAW,GAEjH,IAAA0P,EAAA,GACAxM,EAAAonB,EAAA,IACA,KAAWpnB,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,GAC3B,IAAA0I,EAAA,CAAAye,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAnnB,EAAA,CACA,aAAA0I,GAAA,OAAAA,EAAA,QACA,8EAA0F1I,EAAA,EAAM,KAAK0I,EAAK,GAE1G8D,EAAA3J,IAAA,CAAA6F,EACA,CACA,OAAA8D,CACA,CACA,EAGAzO,EAAAsqB,KAAa,EACbze,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAA1P,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,GACtC,GAAAwM,CAAA,CAAAxM,EAAA,KACA,0EAAsFA,EAAE,KAAKwM,CAAA,CAAAxM,EAAA,CAAS,EAEtGmnB,CAAAA,CAAA,CAAAnnB,EAAA,CAAAwM,CAAA,CAAAxM,EAAA,CAEA,OAAAmnB,CACA,EACA9T,OAAA8T,CAAA,EACA,IAAA3a,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,GACpC,GAAAmnB,CAAA,CAAAnnB,EAAA,KACA,0EAAsFA,EAAE,KAAKmnB,CAAA,CAAAnnB,EAAA,CAAO,EAEpGwM,CAAAA,CAAA,CAAAxM,EAAA,CAAAmnB,CAAA,CAAAnnB,EAAA,CAEA,OAAAwM,CACA,CACA,EAGAzO,EAAAuqB,KAAa,EACb1e,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAA1P,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,GACtC,GAAAwM,CAAA,CAAAxM,EAAA,KACA,0EAAsFA,EAAE,KAAKwM,CAAA,CAAAxM,EAAA,CAAS,EAEtGmnB,CAAAA,CAAA,CAAAnnB,EAAA,CAAAwM,CAAA,CAAAxM,EAAA,CAEA,OAAAmnB,CACA,EACA9T,OAAA8T,CAAA,EACA,IAAA3a,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,EACpCwM,CAAA,CAAAxM,EAAA,CAAAmnB,CAAA,CAAAnnB,EAAA,CAEA,OAAAwM,CACA,CACA,EAGAzO,EAAAwqB,QAAgB,EAChB3e,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAQA,OAPAwM,EAAAyF,OAAA,KACA,GAAAvJ,EAAA,MACA,gFAA4F1I,EAAA,EAAM,KAAK0I,EAAK,EAE5Gye,CAAAA,CAAA,CAAAnnB,IAAA,MAtqBA,IAuqBAmnB,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,CACA,GACAye,CACA,EACA9T,OAAA8T,CAAA,EACA,GAAAA,EAAArqB,MAAA,KACA,8FAAwGqqB,EAAArqB,MAAA,CAAW,GAEnH,IAAA0P,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,EACpCwM,EAAA3J,IAAA,EAAAskB,CAAA,CAAAnnB,EAAA,KAAAmnB,CAAA,CAAAnnB,EAAA,IAEA,OAAAwM,CACA,CACA,EAGAzO,EAAAyqB,QAAgB,EAChB5e,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAQA,OAPAwM,EAAAyF,OAAA,KACA,GAAAvJ,EAAA,MACA,gFAA4F1I,EAAA,EAAM,KAAK0I,EAAK,EAE5Gye,CAAAA,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,EACAye,CAAA,CAAAnnB,IAAA,MAjsBA,GAksBA,GACAmnB,CACA,EACA9T,OAAA8T,CAAA,EACA,GAAAA,EAAArqB,MAAA,KACA,8FAAwGqqB,EAAArqB,MAAA,CAAW,GAEnH,IAAA0P,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,EACpCwM,EAAA3J,IAAA,EAAAskB,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAnnB,EAAA,EAEA,OAAAwM,CACA,CACA,EAGAzO,EAAA0qB,QAAgB,EAChB7e,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAOA,OANAwM,EAAAyF,OAAA,KACAkV,CAAA,CAAAnnB,IAAA,OAvtBA,IAwtBAmnB,CAAA,CAAAnnB,IAAA,OAxtBA,IAytBAmnB,CAAA,CAAAnnB,IAAA,MAztBA,IA0tBAmnB,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,CACA,GACAye,CACA,EACA9T,OAAA8T,CAAA,EACA,GAAAA,EAAArqB,MAAA,KACA,8FAAwGqqB,EAAArqB,MAAA,CAAW,GAEnH,IAAA0P,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,EACpCwM,EAAA3J,IAAA,EAAAskB,CAAA,CAAAnnB,EAAA,MAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAnnB,EAAA,IAEA,OAAAwM,CACA,CACA,EAGAzO,EAAA2qB,QAAgB,EAChB9e,OAAA4C,CAAA,EACA,IAAA2a,EAAA/W,EAAA+Z,KAAA,CAAA3d,EAAAA,EAAA1P,MAAA,EACAkD,EAAA,EAOA,OANAwM,EAAAyF,OAAA,KACAkV,CAAA,CAAAnnB,IAAA,CAAA0I,IAAAA,EACAye,CAAA,CAAAnnB,IAAA,MAjvBA,IAkvBAmnB,CAAA,CAAAnnB,IAAA,OAlvBA,IAmvBAmnB,CAAA,CAAAnnB,IAAA,OAnvBA,GAovBA,GACAmnB,CACA,EACA9T,OAAA8T,CAAA,EAEA,GAAAA,EAAArqB,MAAA,KACA,8FAAwGqqB,EAAArqB,MAAA,CAAW,GAEnH,IAAA0P,EAAA,GACA,QAAAxM,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,EACpCwM,EAAA3J,IAAA,EAAAskB,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,QAAAmnB,CAAAA,CAAA,CAAAnnB,EAAA,OAAAmnB,CAAA,CAAAnnB,EAAA,EAEA,OAAAwM,CACA,CACA,EAIAzO,EAAAsd,MAAc,EACdzR,OAAAA,GACA7L,EAAAmqB,OAAA,CAAAte,MAAA,CAAA4C,GAAAzE,QAAA,YAEAsL,OAAAA,GACAtV,EAAAmqB,OAAA,CAAA7U,MAAA,CAAAjD,EAAAvI,IAAA,CAAA6B,EAAA,aAEA,EAKA3L,EAAA4qB,OAAe,EAEf/e,OAAA4C,CAAA,EACA,IAAA5P,EAAA,GACA,QAAAoD,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,GACtC,IAAA0I,EAAA8D,CAAA,CAAAxM,EAAA,CACA,GAAA0I,KAAAA,EACA9L,EAAAiG,IAAA,CAAA6F,GACA9L,EAAAiG,IAAA,CAAA6F,QACQ,GAAAA,KAAAA,EACR9L,EAAAiG,IAAA,CAAA6F,QACQ,GAAAA,GAAA,IAAAA,GAAA,IACR9L,EAAAiG,IAAA,CAAA6F,OACQ,CACR,IAAAgB,EAAA,GACA,GAAAhB,GAAA,GAAAA,GAAA,GACAgB,GAAA,MAAuBwf,CAAA,CAAAxgB,EAAA,CAAY,OACzB,GAAAA,GAAA,KAAAA,GAAA,IACVgB,GAAA,MAAuBwf,CAAA,CAAAxgB,EAAA,CAAY,OACzB,GAAAA,GAAA,KAAAA,GAAA,MACVgB,GAAA,MAAuBwf,CAAA,MAtyBvB,IAsyBuB,CAA6B,EAAEA,CAAA,CAAAxgB,IAAAA,EAAA,CAAsB,OAClE,GAAAA,GAAA,OAAAA,GAAA,YACVgB,GAAA,MACA,IAAAwW,EAAA,MAzyBA,IA0yBAA,EAAA,GACAxW,CAAAA,GAAAwf,CAAA,CAAAhJ,EAAA,EAEAxW,GAAA,GAAoBwf,CAAA,OA7yBpB,IA6yBoB,CAAAA,CAAA,MA7yBpB,IA6yBoB,CAAAA,CAAA,CAAAxgB,IAAAA,EAAA,EAAsF,OAE1G,kEAGAye,EADAtf,IAAA,CAAA6B,GACAuI,OAAA,KACArV,EAAAiG,IAAA,CAAAvG,EACA,EACA,CACA,CACA,OAAA8T,EAAAvI,IAAA,CAAAjL,EACA,EAEAyW,OAAA8T,CAAA,MAkDAoC,EACA5c,EACAhB,EAnDA,SAAAye,EAAAniB,CAAA,SACA,OAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,GAIA,CA0CA,IAAAuE,EAAA,GACA1H,EAAAqiB,EAAArqB,MAAA,CAIAkD,EAAA,EACA,KAAAA,EAAA8E,GAAA,CAEA,QAEA,GADA6G,EAAA,GACAwb,KAAAA,CAAA,CAAAnnB,EAAA,EAEAwM,EAAA3J,IAAA,CAAAskB,CAAA,CAAAnnB,EAAA,EACAA,GAAA,EACA2L,EAAA,GACA,KACA,CAEA,GAAA4d,CADAA,EAAAvpB,EAAA,IACA8E,EACA,MAEA,GAAAqiB,KAAAA,CAAA,CAAAoC,EAAA,EAEA/c,EAAA3J,IAAA,KACA7C,GAAA,EACA2L,EAAA,GACA,KACA,CACA,GAAAwb,MAAAA,CAAA,CAAAoC,EAAA,EAEA,GAAA5c,CADAA,EAAA0d,SAtEArqB,CAAA,CAAA8E,CAAA,CAAAwlB,CAAA,EACA,IAAA3d,EAAA,CAAoBjE,KAAA,KAAA6hB,MAAAvqB,EAAA,EAAA2L,MAAA,IACpB,GAAA3L,EAAA,EAAA8E,GACAslB,EAAAE,CAAA,CAAAtqB,EAAA,GAAAoqB,EAAAE,CAAA,CAAAtqB,EAAA,KACA,IAAA0J,EAAAkI,OAAA4Y,aAAA,CAAAF,CAAA,CAAAtqB,EAAA,CAAAsqB,CAAA,CAAAtqB,EAAA,GACA2M,CAAAA,EAAAjE,IAAA,CAAAkH,SAAAlG,EAAA,IACAvN,OAAA4T,KAAA,CAAApD,EAAAjE,IAAA,GACAiE,CAAAA,EAAAhB,KAAA,IAEA,CAEA,OAAAgB,CACA,EA0DA4c,EAAA,EAAAzkB,EAAAqiB,EAAA,EACAxb,KAAA,CACA,MAGAa,EAAA3J,IAAA,CAAA8J,EAAAjE,IAAA,EACA1I,EAAA2M,EAAA4d,KAAA,CACA5e,EAAA,GACA,KACA,CACA,GAAAwb,MAAAA,CAAA,CAAAoC,EAAA,EACA,GAAApC,MAAAA,CAAA,CAAAoC,EAAA,IAEA,GAAA5c,CADAA,EAAA8d,SAxDAzqB,CAAA,CAAA8E,CAAA,CAAAwlB,CAAA,EACA,IAAA3d,EAAA,CAAoBjE,KAAA,KAAA6hB,MAAAvqB,EAAA,EAAA2L,MAAA,IACpBjC,EAAA,GACA,KAAA1J,EAAA8E,GAAAslB,EAAAE,CAAA,CAAAtqB,EAAA,GACA0J,GAAAkI,OAAA4Y,aAAA,CAAAF,CAAA,CAAAtqB,EAAA,EAEAA,GAAA,EAOA,OALA2M,EAAAjE,IAAA,CAAAkH,SAAAlG,EAAA,IACA,MAAA4gB,CAAA,CAAAtqB,EAAA,EAAA7D,OAAA4T,KAAA,CAAApD,EAAAjE,IAAA,GACAiE,CAAAA,EAAAhB,KAAA,KAEAgB,EAAA4d,KAAA,CAAAvqB,EAAA,EACA2M,CACA,EA0CA4c,EAAA,EAAAzkB,EAAAqiB,EAAA,EACAxb,KAAA,CACA,MAGAa,EAAA3J,IAAA,CAAA8J,EAAAjE,IAAA,EACA1I,EAAA2M,EAAA4d,KAAA,CACA5e,EAAA,GACA,KACA,CAEA,GAAAgB,CADAA,EAAA+d,SA/EA1qB,CAAA,CAAA8E,CAAA,CAAAwlB,CAAA,EACA,IAAA3d,EAAA,CAAoBjE,KAAA,KAAA6hB,MAAAvqB,EAAA,EAAA2L,MAAA,IACpB,GAAA3L,EAAA,EAAA8E,GACAslB,EAAAE,CAAA,CAAAtqB,EAAA,GAAAoqB,EAAAE,CAAA,CAAAtqB,EAAA,KAAAoqB,EAAAE,CAAA,CAAAtqB,EAAA,KAAAoqB,EAAAE,CAAA,CAAAtqB,EAAA,KACA,IAAA0J,EAAAkI,OAAA4Y,aAAA,CAAAF,CAAA,CAAAtqB,EAAA,CAAAsqB,CAAA,CAAAtqB,EAAA,GAAAsqB,CAAA,CAAAtqB,EAAA,GAAAsqB,CAAA,CAAAtqB,EAAA,GACA2M,CAAAA,EAAAjE,IAAA,CAAAkH,SAAAlG,EAAA,IACAvN,OAAA4T,KAAA,CAAApD,EAAAjE,IAAA,GACAiE,CAAAA,EAAAhB,KAAA,IAEA,CAEA,OAAAgB,CACA,EAmEA4c,EAAA,EAAAzkB,EAAAqiB,EAAA,EACAxb,KAAA,CACA,MAGAa,EAAA3J,IAAA,CAAA8J,EAAAjE,IAAA,EACA1I,EAAA2M,EAAA4d,KAAA,CACA5e,EAAA,EAEA,CACA,KACA,CACA,GAAAA,EACA,iEAA6E3L,EAAE,GAE/E,CACA,OAAAwM,CACA,CACA,EAKAzO,EAAA8qB,QAAgB,EAChBpJ,KAAAjT,CAAA,EACA,IAAAme,EAAA,GACA3qB,EAAA,EACA,KAAAA,EAAAwM,EAAA1P,MAAA,EACA,OAAA0P,CAAA,CAAAxM,EAAA,EACA,KARA,GASAA,EAAA,EAAAwM,EAAA1P,MAAA,EAAA0P,KAAAA,CAAA,CAAAxM,EAAA,GACAA,GAAA,EAEAA,GAAA,EAEA2qB,EAAA9nB,IAAA,CAdA,IAeA8nB,EAAA9nB,IAAA,CAdA,IAeA,KACA,MAhBA,GAiBA8nB,EAAA9nB,IAAA,CAlBA,IAmBA8nB,EAAA9nB,IAAA,CAlBA,IAmBA7C,GAAA,EACA,KACA,SACA2qB,EAAA9nB,IAAA,CAAA2J,CAAA,CAAAxM,EAAA,EACAA,GAAA,CAEA,CAMA,OAJA2qB,EAAA7tB,MAAA,IAAA6tB,KAAAA,CAAA,CAAAA,EAAA7tB,MAAA,MACA6tB,EAAA9nB,IAAA,CA7BA,IA8BA8nB,EAAA9nB,IAAA,CA7BA,KA+BA8nB,CACA,EACApL,GAAA/S,CAAA,EACA,IAAAme,EAAA,GACA3qB,EAAA,EACA,KAAAA,EAAAwM,EAAA1P,MAAA,EACA,OAAA0P,CAAA,CAAAxM,EAAA,EACA,KAvCA,GAwCAA,EAAA,EAAAwM,EAAA1P,MAAA,EAAA0P,KAAAA,CAAA,CAAAxM,EAAA,GACAA,GAAA,EAEAA,GAAA,EAEA2qB,EAAA9nB,IAAA,CA5CA,IA6CA,KACA,MA9CA,GA+CA8nB,EAAA9nB,IAAA,CA/CA,IAgDA7C,GAAA,EACA,KACA,SACA2qB,EAAA9nB,IAAA,CAAA2J,CAAA,CAAAxM,EAAA,EACAA,GAAA,CAEA,CAKA,OAHA2qB,EAAA7tB,MAAA,IAAA6tB,KAAAA,CAAA,CAAAA,EAAA7tB,MAAA,KACA6tB,EAAA9nB,IAAA,CAzDA,IA2DA8nB,CACA,CACA,EAGA5sB,EAAA2pB,MAAc,EACd9d,OAAAud,CAAA,MAIAnnB,EACA+C,EACA7G,EALA,GAAAirB,IAAAA,EAAArqB,MAAA,CACA,OAAAsT,EAAA+Z,KAAA,IAKA,IAAAS,EAAAzD,EAAArqB,MAAA,GACA8tB,EAAAA,EAAA,IAAAA,EAAA,EACA,IAAAC,EAAA,CAAA1D,EAAArqB,MAAA,CAAA8tB,CAAA,IACAlD,EAAAtX,EAAA+Z,KAAA,CAAAU,EAAAA,GACAD,EAAA,GACAC,CAAAA,GAAA,GAEA7qB,EAAA,EACA+C,EAAA,EACA,QAAAsmB,EAAA,EAAoBA,EAAAwB,EAAWxB,GAAA,EAG/BntB,EAFAirB,CAAAA,CAAA,CAAAnnB,IAAA,MACAmnB,CAAAA,CAAA,CAAAnnB,IAAA,KACAmnB,CAAA,CAAAnnB,IAAA,CACA0nB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OAxgCA,GAwgCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OAzgCA,GAygCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,MA1gCA,GA0gCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,CAAAjtB,GAAAA,EAAA,QAEA,IAAA0uB,EACAlD,EAEAkD,IAAAA,GAEA1uB,EADAirB,CAAAA,CAAA,CAAAnnB,IAAA,MACAmnB,CAAAA,CAAA,CAAAnnB,EAAA,KACA0nB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OAnhCA,GAmhCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OAphCA,GAohCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,MArhCA,GAqhCA,CACAzB,CAAA,CAAA3kB,EAAA,CAAAomB,CAAA,KACAzB,GAEAkD,IAAAA,GACA1uB,EAAAirB,CAAA,CAAAnnB,EAAA,KACA0nB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OA3hCA,GA2hCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,OA5hCA,GA4hCA,CACAzB,CAAA,CAAA3kB,IAAA,CAAAomB,CAAA,KACAzB,CAAA,CAAA3kB,EAAA,CAAAomB,CAAA,KACAzB,SAGA,EACArU,OAAAyX,CAAA,MAuEA9qB,EACA+C,EACA7G,EARA,GAAA4uB,IAAAA,EAAAhuB,MAAA,CACA,OAAAsT,EAAA+Z,KAAA,IAEA,IAAAjY,EAAA6Y,SAlEA5D,CAAA,EACA,IAAA3a,EAAA,GACAoe,EAAA,EACA,QAAA5qB,EAAA,EAAsBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,GACtC,IAAA0I,EAAAye,CAAA,CAAAnnB,EAAA,CAEA,KACA0I,KAAAA,GAAAA,IAAAA,GAAAA,KAAAA,GAAAA,KAAAA,GADA,CAIA,GAAAA,GAAA,IAAAA,GAAA,IACA8D,EAAA3J,IAAA,CAAA6F,EAAA,IACA,KACA,CACA,GAAAA,GAAA,IAAAA,GAAA,KACA8D,EAAA3J,IAAA,CAAA6F,EAAA,IACA,KACA,CACA,GAAAA,GAAA,IAAAA,GAAA,IACA8D,EAAA3J,IAAA,CAAA6F,EAAA,GACA,KACA,CACA,GAAAA,KAAAA,EAAA,CACA8D,EAAA3J,IAAA,KACA,KACA,CACA,GAAA6F,KAAAA,EAAA,CACA8D,EAAA3J,IAAA,KACA,KACA,CACA,GAAA6F,KAAAA,EAAA,CACA8D,EAAA3J,IAAA,KACA+nB,GAAA,EACA,KACA,CAEA,yDAAuE5qB,EAAE,KAAK0I,EAAK,EACnF,CACA,CAEA,GAAA8D,EAAA1P,MAAA,KACA,6EAAyF0P,EAAA1P,MAAA,CAAa,GAGtG,OAAA8tB,GACA,OACA,KACA,QACA,GAAApe,KAAAA,CAAA,CAAAA,EAAA1P,MAAA,IACA,gFAEA,KACA,QACA,GAAA0P,KAAAA,CAAA,CAAAA,EAAA1P,MAAA,KAAA0P,KAAAA,CAAA,CAAAA,EAAA1P,MAAA,IACA,kFAEA,KACA,SACA,wEAAsF8tB,EAAK,EAC3F,CACA,OAAeA,KAAAA,EAAAzD,IAAA/W,EAAAvI,IAAA,CAAA2E,EAAA,CACf,EAKAse,GACA,CAAYF,KAAAA,CAAA,EAAO1Y,EACnBwV,EAAAxV,EAAAiV,GAAA,CAIA0D,EAAAnD,EAAA5qB,MAAA,GACAqqB,EAAA/W,EAAA+Z,KAAA,CAAAU,EAAAA,EAAAD,GACAA,EAAA,GACAC,CAAAA,GAAA,GAEA9nB,EAAA,EACA/C,EAAA,EACA,QAAAqpB,EAAA,EAAoBA,EAAAwB,EAAWxB,GAAA,EAI/BntB,EAHAwrB,CAAAA,CAAA,CAAA1nB,IAAA,MACA0nB,CAAAA,CAAA,CAAA1nB,IAAA,MACA0nB,CAAAA,CAAA,CAAA1nB,IAAA,KACA0nB,CAAA,CAAA1nB,IAAA,CACAmnB,CAAA,CAAApkB,IAAA,OAznCA,IA0nCAokB,CAAA,CAAApkB,IAAA,MA1nCA,IA2nCAokB,CAAA,CAAApkB,IAAA,CAAA7G,IAAAA,EAcA,OAZA,IAAA0uB,IAGA1uB,EAFAwrB,CAAAA,CAAA,CAAA1nB,IAAA,MACA0nB,CAAAA,CAAA,CAAA1nB,IAAA,MACA0nB,CAAAA,CAAA,CAAA1nB,EAAA,KACAmnB,CAAA,CAAApkB,IAAA,OAjoCA,IAkoCAokB,CAAA,CAAApkB,EAAA,MAloCA,KAooCA,IAAA6nB,IAEA1uB,EADAwrB,CAAAA,CAAA,CAAA1nB,IAAA,MACA0nB,CAAAA,CAAA,CAAA1nB,IAAA,MACAmnB,CAAA,CAAApkB,EAAA,OAvoCA,KAyoCAokB,CACA,EAEApf,SAAAof,CAAA,EACA,GAAAA,EAAArqB,MAAA,KACA,4EAAsFqqB,EAAArqB,MAAA,CAAW,GAEjG,IAAA4M,EAAA,GACAshB,EAAA,EA8CA,QAAAhrB,EAAA,EAAoBA,EAAAmnB,EAAArqB,MAAA,CAAgBkD,GAAA,GACpC,QAAA+C,EAAA/C,EAAsB+C,EAAA/C,EAAA,EAAW+C,GAAA,OAtBjC6lB,EAuBA,MAvBAA,EAuBAzB,CAAA,CAAApkB,EAAA,GAtBA,IAAA6lB,GAAA,IAGAA,GAAA,IAAAA,GAAA,KAGAA,GAAA,IAAAA,GAAA,IAGAA,KAAAA,GAGAA,KAAAA,GAGAA,KAAAA,GAQA,yCAAuD7lB,EAAE,KAAKokB,CAAA,CAAApkB,EAAA,mCAAQ,EAEtE,EACAkoB,SAnDAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,OAAAL,GACA,QACAthB,GAAA;AAAA,EAAwBwhB,EAAG,EAAEC,EAAG,EAAEC,EAAG,EAAEC,EAAG,EAC1CL,EAAA,EACA,KACA,SACAthB,GAAA,GAAoBwhB,EAAG;AAAA,EAAMC,EAAG,EAAEC,EAAG,EAAEC,EAAG,EAC1CL,EAAA,EACA,KACA,SACAthB,GAAA,GAAoBwhB,EAAAC,EAAQ;AAAA,EAAMC,EAAG,EAAEC,EAAG,EAC1CL,EAAA,EACA,KACA,SACAthB,GAAA,GAAoBwhB,EAAAC,EAAAC,EAAa;AAAA,EAAMC,EAAG,EAC1CL,EAAA,EACA,KACA,SACAthB,GAAAwhB,EAAAC,EAAAC,EAAAC,EACAL,GAAA,CAEA,CACA,EA6BApZ,OAAAC,YAAA,CAAAsV,CAAA,CAAAnnB,EAAA,EACA4R,OAAAC,YAAA,CAAAsV,CAAA,CAAAnnB,EAAA,IACA4R,OAAAC,YAAA,CAAAsV,CAAA,CAAAnnB,EAAA,IACA4R,OAAAC,YAAA,CAAAsV,CAAA,CAAAnnB,EAAA,IAEA,CACA,OAAA0J,CACA,CACA,yBCpsCAuG,EAAAlS,OAAA,YACA,IAAAqO,EAAavK,EAAQ,OACrBiL,EAAgBjL,EAAQ,OAGxBypB,EAAA,KACAzX,EAAA,KACAC,EAAA,KACAtH,EAAA,KACA+e,EAAA,EACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GA+HA,SAAAC,EAAA1vB,CAAA,EACA,IAAAyQ,EAAA,GACA,QAAA3M,EAAA,EAAoBA,EAAA9D,EAAO8D,GAAA,EAC3B2M,GAAA,IAEA,OAAAA,CACA,CApIA,KAAAL,SAAA,IACA,KAAAuf,SAAA,aAEA,KAAAC,IAAA,UAAAxI,CAAA,CAAAC,CAAA,CAAAwI,CAAA,MAQA/rB,CAPA0rB,CAAAA,EAAA5uB,MAAA,GACA6uB,EAAA7uB,MAAA,GACA0uB,EAAA1uB,MAAA,GACAyuB,EAAA,EACA1X,EAAAyP,EACAxP,EAAAyP,EACA/W,EAAAuf,EAEA,IAAAC,EAAA,GACA,IAAAhsB,EAAA,EAAgBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EAClCgsB,EAAAnpB,IAAA,CAAAgR,CAAA,CAAA7T,EAAA,CAAA2X,KAAA,EAEA,IAAA3X,EAAA,EAAgBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACjCgsB,EAAAnpB,IAAA,CAAAiR,CAAA,CAAA9T,EAAA,CAAA2X,KAAA,EAGA,IAAA3X,EAAA,EADAurB,EAAA1X,EAAA/W,MAAA,CAAAgX,EAAAhX,MAAA,CACgBkD,EAAAurB,EAAevrB,GAAA,EAC/BwrB,CAAA,CAAAxrB,EAAA,IACAyrB,CAAA,CAAAzrB,EAAA,MAEA,QAAAqY,KAAAiT,EAAAhf,SAAA,EACA,IAAAqL,EAAAU,EAAA3I,WAAA,GAEA,GAAA1P,CADAA,EAAAgsB,EAAAC,OAAA,CAAAtU,EAAA,EACA,EACA,mCAAsDU,2BAAM,CAE5D,oBAAAiT,EAAAhf,SAAA,CAAA+L,EAAA,GACAmT,CAAA,CAAAxrB,EAAA,IACAyrB,CAAA,CAAAzrB,EAAA,CAAAsrB,EAAAhf,SAAA,CAAA+L,EAAA,EAEA,KAAAiT,EAAAhf,SAAA,CAAA+L,EAAA,EACAmT,CAAAA,CAAA,CAAAxrB,EAAA,IAEA,CACA,EAEA,KAAAksB,WAAA,UAAA7T,CAAA,EACA,MAAAmT,CAAA,IAAAA,CAAA,CAAAnT,EAAA,EAGA,KAAA8T,UAAA,UAAA9T,CAAA,EACA,MAAAmT,CAAA,IAAAA,CAAA,CAAA3X,EAAA/W,MAAA,CAAAub,EAAA,EAIA,KAAA+T,IAAA,UAAAC,CAAA,CAAA1vB,CAAA,EACA,IAAA2vB,EAAAX,EAAA7uB,MAAA,CAYA,OAXA4uB,EAAA7oB,IAAA,CAAAypB,GACAX,EAAA9oB,IAAA,EACAlG,KAAAA,EACA2vB,UAAAA,EACAC,UAAA,KACAjoB,MAAA8H,EAAAS,OAAA,CACAwf,cAAAA,EACA5f,YAAA,KACAC,aAAA,KACAgf,MAAAA,EAAA5uB,MAAA,GAEAwvB,CACA,EAGA,KAAAE,EAAA,UAAAH,CAAA,CAAA1vB,CAAA,CAAA8P,CAAA,CAAAC,CAAA,EACA,IAAA4f,EAAAX,EAAA7uB,MAAA,CACAyvB,EAAAb,EAAAhL,GAAA,GAcA,OAbAiL,EAAA9oB,IAAA,EACAlG,KAAAA,EACA2vB,UAAAA,EACAC,UAAAA,EACAjoB,MAAA8H,EAAAkT,QAAA,CACA+M,cAAAA,EACA5f,YAAAA,EACAC,aAAAA,EACAgf,MAAAA,EAAA5uB,MAAA,GAEA6uB,CAAA,CAAAY,EAAA,CAAAA,SAAA,CAAAD,EACAX,CAAA,CAAAY,EAAA,CAAA9f,WAAA,CAAAA,EACAkf,CAAA,CAAAY,EAAA,CAAA7f,YAAA,CAAAA,EACA4f,CACA,EASA,KAAAje,SAAA,UAAAxJ,CAAA,EAEA,IAAA4nB,EACAC,EACA,QAAA1sB,EAAA,EAAoBA,EAAA2rB,EAAA7uB,MAAA,CAAoBkD,GAAA,EAExCysB,EAAAhB,CAAA,CAAAiB,CADAA,EAAAf,CAAA,CAAA3rB,EAAA,EACAqsB,aAAA,EACAK,EAAApoB,KAAA,GAAA8H,EAAAS,OAAA,CACA,OAAA4f,GAEA9f,EADAP,EAAAS,OAAA,CAAAL,EAAAkgB,EAAAjgB,WAAA,CAAAigB,EAAAhgB,YAAA,CAAA7H,KACAuH,EAAAmU,QAAA,EACAvgB,CAAAA,EAAA0sB,EAAAH,SAAA,EAGQ,OAAAE,GACRA,EAAArgB,EAAAkT,QAAA,CAAA9S,EAAAkgB,EAAAjgB,WAAA,CAAAigB,EAAAhgB,YAAA,CAAA7H,EAGA,EAGA,KAAA8nB,SAAA,UAAA7vB,CAAA,EACA6uB,EAAA7uB,MAAA,CAAAA,EACAA,EAAA,EACA4uB,EAAA5uB,MAAA,CAAA6uB,CAAA,CAAA7uB,EAAA,GAAA4uB,KAAA,CAEAA,EAAA5uB,MAAA,EAEA,EAEA,KAAA8vB,SAAA,YACA,OAAAjB,EAAA7uB,MAAA,EAqBA,KAAA+vB,KAAA,UAAAC,CAAA,EACA,IAAAC,EAAAjgB,EAAAkgB,UAAA,CACAC,EAAA,kCACA,oBAAAH,GAAAA,EAAAhwB,MAAA,KACA,IAAAowB,EAAAJ,EAAAjf,KAAA,MAAA6B,WAAA,EACAwd,CAAA,QAAAA,GACAH,EAAAjgB,EAAAqgB,YAAA,CACAF,EAAA,uDACQC,QAAAA,GACRH,EAAAjgB,EAAAsgB,UAAA,CACAH,EAAA,uCACQ,QAAAC,IACRH,EAAAjgB,EAAAugB,cAAA,CACAJ,EAAA,yCAEA,CACA,IAAAK,EAAA,GACAC,EAAA,EAuBA,OAjBAD,GAJA;aAAA,EAA2B3B,EAAA7uB,MAAA,GAAmB,gBAAgB0P,EAAA1P,MAAA,CAC9D;mBAAA,EAAiCmwB,EAAA;AAAS,CADiC,CAE3ErB,EAAA2B,EAAA,GACAR,EAAAvgB,GACA,KACAmf,EAAA1Z,OAAA,KACAub,EAAAlpB,KAAA,GAAA8H,EAAAS,OAAA,EACA0gB,GAAA,EAKAD,GAJA1B,EAAA2B,GACA,eAA8BC,EAAA7wB,IAAA,CAAS,WAAW6wB,EAAA/gB,WAAA,CAAgB,YAAY+gB,EAAA9gB,YAAA,CAAiB;AAAA,EAC/Fkf,EAAA2B,EAAA,GACAR,EAAAvgB,EAAAghB,EAAA/gB,WAAA,CAAA+gB,EAAA9gB,YAAA,EACA,OAGA4gB,GADA1B,EAAA2B,GACA,qBAAoCC,EAAA7wB,IAAA,CAAS;AAAA,EAC7C4wB,GAAA,EAEA,GAEAD,GAAA,WAEA,EAGA,KAAAG,OAAA,gBAEAztB,EACA0sB,EAFA,IAAApQ,EAAA,GAGA,IAAAtc,EAAA,EAAgBA,EAAA2rB,EAAA7uB,MAAA,CAAoBkD,GAAA,EAEpC0sB,CADAA,EAAAf,CAAA,CAAA3rB,EAAA,EACAsE,KAAA,GAAA8H,EAAAS,OAAA,GACAjF,MAAA8J,OAAA,CAAA4K,CAAA,CAAAoQ,EAAA/vB,IAAA,IACA2f,CAAAA,CAAA,CAAAoQ,EAAA/vB,IAAA,MAEA2f,CAAA,CAAAoQ,EAAA/vB,IAAA,EAAAkG,IAAA,EACAwV,MAAAqU,EAAAjgB,WAAA,CACA3P,OAAA4vB,EAAAhgB,YAAA,IAIA,OAAA4P,CACA,CACA,qBCjPArM,EAAAlS,OAAA,YAIA,IAAA2vB,EAAA,GACAC,EAAA,CAGA,MAAA7B,IAAA,UAAA8B,CAAA,EACA,oBAAAA,GAAAA,GAAA,EACA,kFAEAD,EAAA1oB,KAAA4oB,IAAA,CAAAD,GACAF,EAAA,EACA,EAGA,KAAAI,SAAA,YAEA,OAAAJ,CADAA,GAAA,GACAC,CAAA,EAAAA,CACA,EAEA,KAAAI,OAAA,YACA,OAAAJ,CACA,EAIA,KAAAK,KAAA,YACA,OAAAN,EAAA,CACA,EAEA,KAAAO,YAAA,UAAAC,CAAA,SACA,KAAAR,GAGAQ,EAAA,GAAAA,EAAAR,GAGAA,EAAAQ,GAAAP,EALA,GAQA,CAAAO,EAAAP,CAAA,EAAAA,CACA,EAIA,KAAA1b,OAAA,UAAAkc,CAAA,EACA,GAAAT,KAAAA,GAIA,GAAAA,EAAAC,EAAA,CAEA,QAAA3tB,EAAA,EAAsBA,GAAA0tB,EAAgB1tB,GAAA,EACtCmuB,EAAAnuB,EAAAA,GAEA,MACA,CAEA,QAAAA,EAAA0tB,EAAAC,EAAA,EAA8C3tB,GAAA0tB,EAAgB1tB,GAAA,EAE9DmuB,EADA,CAAAnuB,EAAA2tB,CAAA,EAAAA,EACA3tB,GAEA,CACA,qBCxEAiQ,EAAAlS,OAAA,YACA,+sIACA,qBCEAkS,EAAAlS,OAAA,EAKA4a,IAAA,EACAE,IAAA,EACAC,IAAA,EACA6B,IAAA,EACAY,IAAA,EACAD,IAAA,EACAF,IAAA,EAEAR,IAAA,GACAC,IAAA,GACAC,IAAA,GACAG,IAAA,GACAF,IAAA,GACAC,IAAA,GACAE,IAAA,GACAC,IAAA,GAOA0I,OAAA,IACAG,MAAA,IACAF,MAAA,IACAC,QAAA,IAKAlX,QAAA,IACAyS,SAAA,IAMA1S,OAAA,IACA2T,SAAA,IAKAtJ,OAAA,IACAO,OAAA,IACAC,QAAA,IAMA2W,gBAAA,IACAC,iBAAA,IACAC,kBAAA,IAMAlS,YAAA,IACAkF,YAAA,IACApF,YAAA,IACAmF,YAAA,GACA,yBCjEApR,EAAAlS,OAAA,EACAoO,IAAOtK,EAAQ,OACf0sB,SAAY1sB,EAAQ,OACpBwK,IAAOxK,EAAQ,OACfqK,OAAUrK,EAAQ,OAClB2sB,MAAS3sB,EAAQ,OACjB4R,MAAS5R,EAAQ,OACjBiL,MAASjL,EAAQ,OACjB4sB,QAAW5sB,EAAQ,OACnBsP,MAAStP,EAAQ,MACjB,yBCTAoO,EAAAlS,OAAA,gBAMA2wB,EAOAC,EACA1V,EACA2V,EACAC,EAfA,IAAAziB,EAAavK,EAAQ,OACrBiL,EAAgBjL,EAAQ,OAExBwO,EAAA,cACAye,EAAA,KAEA,KAAA3iB,GAAA,MACA,KAAAqiB,KAAA,MACA,KAAA/a,KAAA,MACA,KAAAnH,SAAA,IACA,IAAAiM,EAAA,KACA/L,EAAA,KAKAuiB,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,KACAC,EAAA,KACAtb,EAAA,KACAC,EAAA,KACAsb,EAAA,KACAC,EAAA,EACAC,EAAAtf,IACAuf,EAAAvf,IAKAwf,EAAA,SAAAzT,CAAA,CAAAtP,CAAA,CAAAgjB,CAAA,EACA,IAAAC,EAAA,GAA4Brf,EAAa,kBACzC,GAAA0L,GAAAlI,EAAA/W,MAAA,CACA,eAAyB4yB,EAAa,cAAc3T,EAAA,aAAW,GAE/D,GAAAtP,GAAAmiB,EACA,eAAyBc,EAAa,gBAAgBjjB,EAAA,aAAa,GAEnE,IAAY3P,OAAAA,CAAA,EAASyb,EACrBA,EAAA1V,IAAA,EACA6V,KAAAtM,EAAAuO,GAAA,CACAtC,MAAA0D,CACA,GACA2S,EAAA5xB,EAAA2P,EAAAgjB,GACAlX,EAAAmI,GAAA,EACA,EAKAiP,EAAA,SAAAC,CAAA,CAAAnjB,CAAA,CAAAgjB,CAAA,EACA,IAAAC,EAAA,GAA4Brf,EAAa,iBACzC,GAAAuf,GAAA9b,EAAAhX,MAAA,CACA,eAAyB4yB,EAAa,aAAaE,EAAA,aAAU,GAE7D,GAAAnjB,GAAAmiB,EACA,eAAyBc,EAAa,gBAAgBjjB,EAAA,aAAa,GAEnE,IAAY3P,OAAAA,CAAA,EAASyb,EACrBA,EAAA1V,IAAA,EACA6V,KAAAtM,EAAAwO,GAAA,CACAtE,MAAAxC,CAAA,CAAA8b,EAAA,CAAAtZ,KAAA,CACA+B,MAAAuX,CACA,GACAlB,EAAA5xB,EAAA2P,EAAAgjB,GACAlX,EAAAmI,GAAA,EACA,EAGAmP,EAAA,WACAd,EAAA,EACAC,EAAA,EACAC,EAAA,EACAI,EAAA,EACAR,EAAA,CACA,CACAA,WAAAziB,EAAAgiB,eAAA,CACA0B,OAAA,EACAlB,SAAA,EACA3V,YAAA,CACA,EACA,CACApF,EAAA,KACAC,EAAA,KACAtH,EAAA,KACAmiB,EAAA,EACA1V,EAAA,EACA2V,EAAA,EACAM,EAAA,KACAC,EAAA,KACAC,EAAA,KACA7W,EAAA,IACA,EAEAwX,EAAA,WACA,IAAArE,EAAA,GAiBAsE,EAAA,WACA,IAAAC,EAAAvE,CAAA,CAAAA,EAAA5uB,MAAA,IACAwf,EAAA,GAEA,QAAA3f,KAAAszB,EACA3T,CAAA,CAAA3f,EAAA,CAAAszB,CAAA,CAAAtzB,EAAA,CAEA,OAAA2f,CACA,CACA,MAAAzZ,IAAA,YACA6oB,EAAA7oB,IAAA,CAAAmtB,IACA,EACA,KAAAtP,GAAA,UAAAwP,CAAA,EACA,IAAApzB,EAAAozB,EAIA,GAHApzB,GACAA,CAAAA,EAAA4uB,EAAA5uB,MAAA,IAEAA,EAAA,GAAAA,EAAA4uB,EAAA5uB,MAAA,CACA,eAA2BuT,EAAa,6BAA6BvT,EAAO,GAG5E,OADA4uB,EAAA5uB,MAAA,CAAAA,EACA4uB,CAAA,CAAAA,EAAA5uB,MAAA,KAEA,KAAAA,MAAA,YACA,OAAA4uB,EAAA5uB,MAAA,EAEA,KAAAqzB,UAAA,UAAAxzB,CAAA,CAAA0b,CAAA,CAAAvb,CAAA,EACA4uB,CAAA,CAAAA,EAAA5uB,MAAA,IAAAH,EAAA,EACA8P,YAAA4L,EACA3L,aAAA5P,CACA,CACA,EACA,KAAAszB,SAAA,UAAAzzB,CAAA,EACA,OAAA+uB,CAAA,CAAAA,EAAA5uB,MAAA,IAAAH,EAAA,EAGAmvB,WAnDA,IAAAxP,EAAA,GACAzI,EAAA5B,OAAA,KACAiE,EAAA2F,KAAA,EACAS,CAAAA,CAAA,CAAApG,EAAAyB,KAAA,OAEA,GACA7D,EAAAhX,MAAA,IACAgX,EAAA7B,OAAA,KACA8H,EAAA8B,KAAA,EACAS,CAAAA,CAAA,CAAAvC,EAAApC,KAAA,OAEA,GAEA+T,EAAA7oB,IAAA,CAAAyZ,EACA,GAsCA,EAeA+T,EAAA,WACA,IAAAC,EAAA,KACA,KAAAhsB,KAAA,CAAA8H,EAAAyX,MAAA,CACA,KAAAnX,YAAA,GACA,KAAAqP,SAAA,GACA,KAAA6T,QAAA,GACA,KAAAf,UAAA,CAAAA,CAAA,CAAAA,EAAA/xB,MAAA,IACA,KAAAyzB,MAAA,KAAAR,EACA,KAAAS,MAAA,KAAAT,EACA,KAAAP,YAAA,CAAAA,EACA,KAAAG,WAAA,CAAAA,EAEA,KAAAc,OAAA,YACAH,EAAAhsB,KAAA,CAAA8H,EAAAyX,MAAA,CACAyM,EAAA5jB,YAAA,GACA4jB,EAAAzB,UAAA,CAAAA,CAAA,CAAAA,EAAA/xB,MAAA,IAEA,EAEA4zB,EAAA,WACA,OAAA7B,CAAA,CAAAA,EAAA/xB,MAAA,KAGA6zB,EAAA,WACA,OAAA9B,EAAA/xB,MAAA,EACA,EAMA8zB,EAAA,WACA,IAAAlB,EAAA,GAA4Brf,EAAa,mBAEzC,QACA,GAAAye,KAAA/tB,IAAA+tB,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,MACA,KACA,CACA,GAAA2iB,OAAAA,EAAA3iB,GAAA,CACA,MAEA,GAAA2iB,cAAAA,EAAA3iB,GAAA,CAAA0f,SAAA,CACA,eAA2B6D,EAAa,4BAExC,KACA,CACA,OAAAZ,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,CAAA2f,IAAA,CAAAjY,EAAAC,EAAAtH,EAEA,EAEAqkB,EAAA,WACA,IAAAnB,EAAA,GAA4Brf,EAAa,qBAEzC,QACA,GAAAye,KAAA/tB,IAAA+tB,EAAArb,KAAA,EACAqb,EAAArb,KAAA,MACA,KACA,CACA,GAAAqb,OAAAA,EAAArb,KAAA,CACA,MAEA,GAAAqb,gBAAAA,EAAArb,KAAA,CAAAuF,WAAA,CACA,eAA2B0W,EAAa,8BAExC,KACA,CACA,OAAAZ,EAAArb,KAAA,EACAqb,EAAArb,KAAA,CAAAqY,IAAA,CAAAjY,EAAAC,EAAAtH,EAEA,EAEAskB,EAAA,WACA,IAAApB,EAAA,GAA4Brf,EAAa,qBAEzC,QACA,GAAAye,KAAA/tB,IAAA+tB,EAAAN,KAAA,EACAM,EAAAN,KAAA,MACA,KACA,CACA,GAAAM,OAAAA,EAAAN,KAAA,CACA,MAEA,GAAAM,gBAAAA,EAAAN,KAAA,CAAAuC,WAAA,CACA,eAA2BrB,EAAa,8BAExC,KACA,CACA,OAAAZ,EAAAN,KAAA,EACAM,EAAAN,KAAA,CAAA1C,IAAA,CAAAjY,EAAAC,EAEA,EAGAkd,EAAA,SAAAtR,CAAA,EACA,IAAAgQ,EAAA,GAA4Brf,EAAa,uBACzC,IAAAqP,EACA,eAAyBgQ,EAAa,2BAEtC,GAAAhQ,kBAAAA,EAAAnD,aAAA,CACA,eAAyBmT,EAAa,qBAEtC7b,EAAA6L,EAAA7L,KAAA,CACAC,EAAA4L,EAAA5L,IAAA,EAGAmd,EAAA,SAAArc,CAAA,EACA,IAAA8a,EAAA,GAA4Brf,EAAa,yBACzC6gB,EAAA,KACA,oBAAAtc,EAAA,CACA,GAAAA,GAAAf,EAAA/W,MAAA,CACA,eAA2B4yB,EAAa,mCAAmC7b,EAAA/W,MAAA,CAAa,WAAW8X,EAAU,GAE7Gsc,EAAAtc,CACA,MAAM,oBAAAA,EAAA,CACN,IAAA+C,EAAA/C,EAAAlF,WAAA,GACA,QAAA1P,EAAA,EAAsBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EACxC,GAAA2X,IAAA9D,CAAA,CAAA7T,EAAA,CAAA2X,KAAA,EACAuZ,EAAArd,CAAA,CAAA7T,EAAA,CAAAqY,KAAA,CACA,KACA,CAEA,GAAA6Y,OAAAA,EACA,eAA2BxB,EAAa,mBAAmB9a,EAAU,kBAErE,MACA,eAAyB8a,EAAa,sBAAsB,OAAA9a,EAAiB,mBAE7E,OAAAsc,CACA,EAEAC,EAAA,SAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAA5B,EAAA,GAA4Brf,EAAa,0BAEzCkhB,EAAAH,EACApgB,EAAAqgB,EACAvsB,EAAAwsB,EACA,GAAAC,KAAAxwB,IAAAwwB,EACA,eAAyB7B,EAAa,4BAEtC,GAAA6B,OAAAA,EACA,eAAyB7B,EAAa,uBAEtC,oBAAA6B,EACAA,EAAAzkB,EAAA0kB,aAAA,CAAAD,QACM,IAAA3pB,MAAA8J,OAAA,CAAA6f,GACN,eAAyB7B,EAAa,wCAEtC,GAAA6B,EAAAz0B,MAAA,IACA,iBAAAy0B,CAAA,IACA,eAA2B7B,EAAa,wCAIxC,oBAAA1e,EACAA,EAAA,OAGA,GAAAA,CADAA,EAAA/L,KAAAuC,KAAA,CAAAwJ,EAAA,EACA,GAAAA,EAAAugB,EAAAz0B,MAAA,CACA,eAA2B4yB,EAAa,sCAAsC1e,EAAI,GAIlF,oBAAAlM,EACAA,EAAAysB,EAAAz0B,MAAA,CAAAkU,OAGA,GAAAlM,CADAA,EAAAG,KAAAuC,KAAA,CAAA1C,EAAA,EACA,GAAAA,EAAAysB,EAAAz0B,MAAA,CAAAkU,EACA,eAA2B0e,EAAa,6BAA6B5qB,EAAI,GAGzE0H,EAAA+kB,EAGA3C,EAAAD,CAFAA,EAAA3d,CAAA,EACAiI,CAAAA,EAAAnU,CAAA,CAEA,EAEA2sB,EAAA,eAEAzxB,EASA0xB,EAVA,IAAAhC,EAAA,GAA4Brf,EAAa,yBAIzC,IAAArQ,EAAA,EAFAkvB,EAAA,GACAC,EAAA,GACgBnvB,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EAClCkvB,CAAA,CAAAlvB,EAAA,MAEA,IAAAA,EAAA,EAAgBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACjCmvB,CAAA,CAAAnvB,EAAA,MAGA,IAAAgsB,EAAA,GACA,IAAAhsB,EAAA,EAAgBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EAClCgsB,EAAAnpB,IAAA,CAAAgR,CAAA,CAAA7T,EAAA,CAAA2X,KAAA,EAEA,IAAA3X,EAAA,EAAgBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACjCgsB,EAAAnpB,IAAA,CAAAiR,CAAA,CAAA9T,EAAA,CAAA2X,KAAA,EAEA,QAAAU,KAAAyW,EAAAxiB,SAAA,EAEA,GAAAtM,CADAA,EAAAgsB,EAAAC,OAAA,CAAA5T,EAAA3I,WAAA,KACA,EACA,eAA2BggB,EAAa,mBAAmBrX,EAAM,2BAMjE,GAJAqZ,CAAAA,EAAA5C,EAAAxiB,SAAA,CAAA+L,EAAA,GAEAqZ,CAAAA,EAAA,MAEA,mBAAAA,GAAAA,OAAAA,EACA1xB,EAAA6T,EAAA/W,MAAA,CACAoyB,CAAA,CAAAlvB,EAAA,CAAA0xB,EAEAvC,CAAA,CAAAnvB,EAAA6T,EAAA/W,MAAA,EAAA40B,OAGA,YACA,GAAahC,EAAa,kBAAkBrX,EAAM,qEAGlD,CAEA,IAAArY,EAAA,EAAgBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACjC,GAAAmvB,OAAAA,CAAA,CAAAnvB,EAAA,CACA,YACA,GAAa0vB,EAAa,kDAAkD5b,CAAA,CAAA9T,EAAA,CAAA2X,KAAA,CAAc,4BAI1F,CASA,MAAAga,eAAA,UAAApE,CAAA,EACA,oBAAAA,GAIA+B,CADAA,EAAArqB,KAAAuC,KAAA,CAAA+lB,EAAA,GACA,EAHA,2DAAqEA,EAAM,EAM3E,EAWA,KAAAqE,cAAA,UAAAC,CAAA,EACA,oBAAAA,GAIAtC,CADAA,EAAAtqB,KAAAuC,KAAA,CAAAqqB,EAAA,GACA,EAHA,0DAAoEA,EAAK,EAMzE,EAEA,IAAAC,EAAA,SAAApS,CAAA,CAAAqS,CAAA,CAAAC,CAAA,MACAhkB,EACA,IAAA0hB,EAAA,GAA4Brf,EAAa,WACzC2gB,EAAAtR,GACA,IAAA9K,EAAAqc,EAAAc,GACAN,IACAZ,IACAC,IACAF,IACA,IAAAnB,EAAA,IAAAY,EAeA,aAdA2B,GACA5C,CAAAA,EAAA4C,CAAA,EAGAzZ,EAAA,CACA,CACAG,KAAAtM,EAAAuO,GAAA,CACAtC,MAAAzD,CACA,EACA,CAEA8Z,EAAA,EAAAC,EAAAc,GACAlX,EAAA,KAEAkX,EAAAnrB,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACA,eAA2B6L,EAAa,sCACxC,MAAAtjB,EAAA2X,OAAA,CACA/V,EAAA,GACA,KACA,MAAA5B,EAAA0X,KAAA,CACA,KAAA1X,EAAA4X,KAAA,CAEAhW,EADAyhB,EAAA/iB,YAAA,GAAAuM,EAKA,KACA,SACA,iCACA,CACA,OACAjL,QAAAA,EACA1J,MAAAmrB,EAAAnrB,KAAA,CACAxH,OAAAmc,EACAgZ,QAAAxC,EAAA/iB,YAAA,CACA2iB,WAAAA,EACAL,aAAAA,EACAC,SAAAA,EACAiD,YAAA1lB,EAAA1P,MAAA,CACAq1B,SAAAxD,EACAyD,OAAAxD,EACAyD,UAAApZ,CACA,CACA,CAQA,MAAAqZ,cAAA,UAAA5S,CAAA,CAAA9K,CAAA,CAAA2d,CAAA,CAAAC,CAAA,CAAAN,CAAA,CAAAF,CAAA,EAGA,OAFAnC,IACAsB,EAAAoB,EAAAC,EAAAN,GACAJ,EAAApS,EAAA9K,EAAAod,EACA,EAeA,KAAAjkB,KAAA,UAAA2R,CAAA,CAAA9K,CAAA,CAAA2d,CAAA,CAAAP,CAAA,EAGA,OAFAnC,IACAsB,EAAAoB,EAAA,EAAAA,EAAAz1B,MAAA,EACAg1B,EAAApS,EAAA9K,EAAAod,EACA,EAIA,IAAAS,EAAA,SAAAzW,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACA,IAAAhX,EAAAF,CAAA,CAAAyD,EAAA,CACA,QAAAhc,EAAA,EAAoBA,EAAAyY,EAAAG,QAAA,CAAA9b,MAAA,GACpB4xB,EAAAjW,EAAAG,QAAA,CAAA5Y,EAAA,CAAAyM,EAAAgjB,GACAA,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EAF4C/jB,GAAA,GAM5C,EAKA0yB,EAAA,SAAA1W,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzhB,EACA2kB,EACAC,EACAC,EACA,IAAApa,EAAAF,CAAA,CAAAyD,EAAA,CACA8W,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,EACAgyB,CAAAA,EAAA3iB,GAAA,EACAwmB,CAAAA,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,IAEA5e,EAAA,GACA4kB,EAAAnmB,EACAomB,EAAA,EACA,QAAA7yB,EAAA,EAAoBA,EAAAyY,EAAAG,QAAA,CAAA9b,MAAA,CAAwBkD,GAAA,GAE5C,GADA0uB,EAAAjW,EAAAG,QAAA,CAAA5Y,EAAA,CAAA4yB,EAAAnD,GACAA,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EACA/V,EAAA,GACA,KACA,CACA4kB,GAAAnD,EAAA/iB,YAAA,CACAmmB,GAAApD,EAAA/iB,YAAA,CAGAsB,GACAyhB,EAAAnrB,KAAA,CAAAuuB,IAAAA,EAAAzmB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAmmB,IAEApD,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GAEA+iB,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,GACAjE,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAGA,EAMAK,EAAA,SAAAhX,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAkD,EACAM,EACAC,EACAzO,EACA,IAAAhM,EAAAF,CAAA,CAAAyD,EAAA,CACA,GAAAvD,IAAAA,EAAAM,GAAA,EAGA0W,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA2L,EAAA/iB,YAAA,GACA,MACA,CACAumB,EAAAxmB,EACAymB,EAAA,EACAzO,EAAA,EACA,IAAAqO,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,GAKA,IAJAgyB,EAAA3iB,GAAA,EACAwmB,CAAAA,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,KAIAqG,CAAAA,GAAArE,CAAA,IAIAF,EAAA1S,EAAA,EAAAiX,EAAAxD,GACAA,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EAIA0L,EAAAnrB,KAAA,GAAA8H,EAAA0X,KAAA,GAKAW,GAAA,EACAyO,GAAAzD,EAAA/iB,YAAA,CACAumB,GAAAxD,EAAA/iB,YAAA,CACA+X,IAAAhM,EAAAM,GAAA,KAMA0W,EAAAnrB,KAAA,GAAA8H,EAAA0X,KAAA,EACA2L,EAAAnrB,KAAA,CAAA4uB,IAAAA,EAAA9mB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAwmB,GACMzO,GAAAhM,EAAA7a,GAAA,EACN6xB,EAAAnrB,KAAA,CAAA4uB,IAAAA,EAAA9mB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAwmB,IAEAzD,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GAEA+iB,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,GACAjE,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAGA,EAIAQ,EAAA,SAAAjd,CAAA,CAAAuZ,CAAA,CAAA2D,CAAA,CAAAhH,CAAA,EACA,GAAAqD,EAAA/iB,YAAA,CAAA0mB,EAAA,CACA,IAAA1pB,EAAA,GAAmB2G,EAAa,QAAQ6F,EAAAvZ,IAAA,CAAU,oCAGlD,MADA+M,GADA,yBAAsC+lB,EAAA/iB,YAAA,CACtC,+BAA6C0mB,EAAU,CADI,CAG3D,CACA,OAAA3D,EAAAnrB,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACA,GAAAuI,CAAA,IAAAA,EACA,YACA,GAAe/b,EAAa,QAAQ6F,EAAAvZ,IAAA,CAAU,+DAG9C,KACA,MAAAyP,EAAA0X,KAAA,CACA2L,EAAA/iB,YAAA,GACA,KACA,MAAAN,EAAA4X,KAAA,CACA,IAAAyL,EAAA/iB,YAAA,EACA+iB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,EAEA,KACA,MAAA1X,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA,KACA,SACA,YACA,GAAa2D,EAAa,QAAQ6F,EAAAvZ,IAAA,CAAU,gEAAgE8yB,EAAAnrB,KAAA,CAAc,EAE1H,CACA,EAOA+uB,EAAA,SAAArX,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAkD,EACAW,EACAC,EACAT,EACAC,EACAS,EACA,IAAA/a,EAAAF,CAAA,CAAAyD,EAAA,CACA9F,EAAArC,CAAA,CAAA4E,EAAAJ,KAAA,EACAoU,EAAAyC,CAAA,CAAAhZ,EAAAmC,KAAA,EACAob,EAAA,CAAA9C,IAgBA,GAdA8C,IAEAH,CAAAA,EAAAxE,EAAA3iB,GAAA,EAAA2iB,EAAA3iB,GAAA,CAAA+f,WAAA,CAAAzT,EAAAJ,KAAA,KAEAsa,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,GACAkC,EAAA3iB,GAAA,CAAAigB,IAAA,CAAA3T,EAAAJ,KAAA,CAAAxE,CAAA,CAAA4E,EAAAJ,KAAA,EAAA1b,IAAA,GAEAm2B,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,GACA2yB,EAAAc,MAAA,CAAA1tB,IAAA,GACA4sB,EAAAe,MAAA,CAAA3tB,IAAA,GACA2wB,EAAA/D,EAAAe,MAAA,CACAf,EAAAe,MAAA,KAAAT,GAEAtD,OAAAA,EAEA8G,EAAAhb,EACAA,EAAArC,EAAAqC,OAAA,CACAmW,EAAA,EAAAjiB,EAAAgjB,GACAlX,EAAAgb,MACM,CAEN,IAAAH,EAAAxE,EAAAniB,CACAgjB,CAAAA,EAAA1T,SAAA,CAAA7F,EAAAmC,KAAA,CACAoU,EAAAgD,EAAAjjB,EAAAC,EAAA2iB,GACA+D,EAAAjd,EAAAuZ,EAAA2D,EAAA,IACA3D,EAAAnrB,KAAA,GAAA8H,EAAAyX,MAAA,GACA0P,EAAAhb,EACAA,EAAArC,EAAAqC,OAAA,CACAmW,EAAA,EAAAjiB,EAAAgjB,GACAlX,EAAAgb,EACA9D,EAAA1T,SAAA,CAAA7F,EAAAmC,KAAA,CACAoU,EAAAgD,EAAAjjB,EAAAC,EAAA2iB,GACA+D,EAAAjd,EAAAuZ,EAAA2D,EAAA,IAEA,CACAK,IAEAH,IACA7D,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,CACA+K,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAEA7D,EAAA3iB,GAAA,CAAAqgB,EAAA,CAAA/T,EAAAJ,KAAA,CAAAnC,EAAAvZ,IAAA,CAAA8P,EAAAgjB,EAAA/iB,YAAA,GAIA+iB,EAAAe,MAAA,CAAAgD,EACA/D,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EACA0L,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,IACQ7c,EAAA2F,KAAA,GAGR4T,EAAAe,MAAA,CAAAL,UAAA,CAAAja,EAAAyB,KAAA,CAAAlL,EAAAgjB,EAAA/iB,YAAA,EACA+iB,EAAAc,MAAA,CAAAJ,UAAA,CAAAja,EAAAyB,KAAA,CAAAlL,EAAAgjB,EAAA/iB,YAAA,GAGA,EAGAgnB,EAAA,SAAA3Z,CAAA,CAAA0V,CAAA,CAAA2D,CAAA,EACA,GAAA3D,EAAA/iB,YAAA,CAAA0mB,EAAA,CACA,IAAA1pB,EAAA,GAAmB2G,EAAa,QAAQ0J,EAAApd,IAAA,CAAS,oCAGjD,MADA+M,GADA,yBAAsC+lB,EAAA/iB,YAAA,CACtC,+BAA6C0mB,EAAU,CADI,CAG3D,CACA,OAAA3D,EAAAnrB,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACA,eAA2BxT,EAAa,QAAQ0J,EAAApd,IAAA,CAAS,8DACzD,MAAAyP,EAAA0X,KAAA,CACA,GAAA/J,CAAA,IAAAA,EAAAzD,KAAA,CACA,eAA6BjG,EAAa,QAAQ0J,EAAApd,IAAA,CAAS,0DAE3D8yB,CAAAA,EAAA/iB,YAAA,GAEA,KACA,MAAAN,EAAA4X,KAAA,CACA,GAAAyL,IAAAA,EAAA/iB,YAAA,EACA,GAAAqN,CAAA,IAAAA,EAAAzD,KAAA,CACA,eAA+BjG,EAAa,QAAQ0J,EAAApd,IAAA,CAAS,0DAE7D8yB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CAGA,KACA,MAAA1X,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA,KACA,SACA,YACA,GAAa2D,EAAa,QAAQ0J,EAAApd,IAAA,CAAS,gEAAgE8yB,EAAAnrB,KAAA,CAAc,EAEzH,CACA,EAOAqvB,EAAA,SAAA3X,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAkD,EACAiB,EACAN,EACAR,EACAC,EACAS,EACA,IAAA/a,EAAAF,CAAA,CAAAyD,EAAA,CACAjC,EAAAjG,CAAA,CAAA2E,EAAAJ,KAAA,EACAoX,EAAAoE,QAAA,CAAA9Z,EAAA1B,KAAA,CAEA,IAAAob,EAAA,CAAA9C,IAEA8C,IAEAH,CAAAA,EAAAxE,EAAA3iB,GAAA,EAAA2iB,EAAA3iB,GAAA,CAAAggB,UAAA,CAAA1T,EAAAJ,KAAA,KAEAub,EAAA/f,EAAA/W,MAAA,CAAA2b,EAAAJ,KAAA,CACAsa,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,GACAkC,EAAA3iB,GAAA,CAAAigB,IAAA,CAAAwH,EAAA7Z,EAAApd,IAAA,GAIAm2B,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,GACA2yB,EAAAc,MAAA,CAAA1tB,IAAA,GACA4sB,EAAAe,MAAA,CAAA3tB,IAAA,GACA2wB,EAAA/D,EAAAe,MAAA,CACAf,EAAAe,MAAA,KAAAT,GAGA,IAAAqD,EAAAxE,EAAAniB,EACA0iB,CAAA,CAAA1W,EAAAJ,KAAA,EAAAoX,EAAAjjB,EAAAC,EAAA2iB,GACAsE,EAAA3Z,EAAA0V,EAAA2D,GACAK,IAEAH,IACA7D,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,CACA+K,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAEA7D,EAAA3iB,GAAA,CAAAqgB,EAAA,CAAAoH,EAAA7Z,EAAApd,IAAA,CAAA8P,EAAAgjB,EAAA/iB,YAAA,GAIA+iB,EAAAe,MAAA,CAAAgD,EACA/D,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EACA0L,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,IACQhZ,EAAA8B,KAAA,GAGR4T,EAAAe,MAAA,CAAAL,UAAA,CAAApW,EAAApC,KAAA,CAAAlL,EAAAgjB,EAAA/iB,YAAA,EACA+iB,EAAAc,MAAA,CAAAJ,UAAA,CAAApW,EAAApC,KAAA,CAAAlL,EAAAgjB,EAAA/iB,YAAA,GAGA,EAMAonB,EAAA,SAAA9X,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACAZ,EAAAhsB,IAAA,EACAgsB,WAAAziB,EAAAiiB,gBAAA,CACAyB,OAAArjB,EACAmiB,SAAAA,EACA3V,YAAAA,CACA,GACA2V,EAAApiB,EAAA1P,MAAA,CACAmc,EAAAzM,EAAA1P,MAAA,CAAA6xB,EACAD,EAAA1S,EAAA,EAAAvP,EAAAgjB,GACA,IAAA/O,EAAAmO,EAAAnO,GAAA,GAIA,OAHAkO,EAAAlO,EAAAkO,QAAA,CACA3V,EAAAyH,EAAAzH,WAAA,CACAwW,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,EACA,KAAA8H,EAAA0X,KAAA,CAGA,KAAA1X,EAAA4X,KAAA,CAFAyL,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,KAIA,MAAA1X,EAAA2X,OAAA,CACA0L,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,KACA,SACA,oCAAgD0L,EAAAnrB,KAAA,CAAc,EAC9D,CACA,EAOAyvB,EAAA,SAAA/X,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACAZ,EAAAhsB,IAAA,EACAgsB,WAAAziB,EAAAiiB,gBAAA,CACAyB,OAAArjB,EACAmiB,SAAAA,EACA3V,YAAAA,CACA,GACA2V,EAAApiB,EAAA1P,MAAA,CACAmc,EAAAzM,EAAA1P,MAAA,CAAA6xB,EACAD,EAAA1S,EAAA,EAAAvP,EAAAgjB,GACA,IAAA/O,EAAAmO,EAAAnO,GAAA,GAIA,OAHAkO,EAAAlO,EAAAkO,QAAA,CACA3V,EAAAyH,EAAAzH,WAAA,CACAwW,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,EACA,KAAA8H,EAAA0X,KAAA,CACA,KAAA1X,EAAA4X,KAAA,CACAyL,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,KACA,MAAA3X,EAAA2X,OAAA,CACA0L,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,KACA,SACA,oCAAgD2L,EAAAnrB,KAAA,CAAc,EAC9D,CACA,EAIA0vB,EAAA,SAAAhY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACA,IAAAhX,EAAAF,CAAA,CAAAyD,EAAA,CACAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACAtX,EAAAmiB,GACAnW,EAAA7a,GAAA,EAAA4O,CAAA,CAAAC,EAAA,EAAAD,CAAA,CAAAC,EAAA,EAAAgM,EAAAM,GAAA,GACA0W,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,GAGA,EAQAunB,EAAA,SAAAjY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzvB,EACA,IAAAyY,EAAAF,CAAA,CAAAyD,EAAA,CACAlX,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,CAEA,GADA2yB,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACAtX,EAAA3H,GAAA8pB,EAAA,CACA,IAAA5uB,EAAA,EAAkBA,EAAA8E,EAAS9E,GAAA,EAC3B,GAAAwM,CAAA,CAAAC,EAAAzM,EAAA,GAAAyY,EAAA4C,MAAA,CAAArb,EAAA,CACA,MAGAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAOAovB,EAAA,SAAAlY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzvB,EACAm0B,EACA,IAAA1b,EAAAF,CAAA,CAAAyD,EAAA,CACAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,IAAAjf,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,CACA,GAAAgI,IAAAA,EAAA,CAEA2qB,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,MACA,CACA,GAAArX,EAAA3H,GAAA8pB,EAAA,CACA,IAAA5uB,EAAA,EAAkBA,EAAA8E,EAAS9E,GAAA,EAK3B,GAJAm0B,CAAAA,EAAA3nB,CAAA,CAAAC,EAAAzM,EAAA,GACA,IAAAm0B,GAAA,IACAA,CAAAA,GAAA,IAEAA,IAAA1b,EAAA4C,MAAA,CAAArb,EAAA,CACA,MAGAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAKAsvB,EAAA,SAAApY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACAA,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,CAAAmI,IAAAA,EAAAL,EAAA0X,KAAA,CAAA1X,EAAA2X,OAAA,EAMAsQ,EAAA,SAAArY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACAA,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,CAAAmI,IAAAD,EAAA1P,MAAA,CAAAsP,EAAA0X,KAAA,CAAA1X,EAAA2X,OAAA,EASAuQ,EAAA,SAAAtY,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzvB,EACAm0B,EACAI,EACA5c,EACA,IAAAc,EAAAF,CAAA,CAAAyD,EAAA,CACAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CAEApM,EADAc,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,CACA+W,CAAA,CAAA4E,EAAAJ,KAAA,EAAAV,KAAA,CAEA7D,CAAA,CAAA2E,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,EAAA6a,KAAA,CAEA,IAAA6c,EAAA/b,EAAA0D,OAAA,GAAA/P,EAAAkV,WAAA,CAAAmO,EAAAe,MAAA,CAAAJ,SAAA,CAAAzY,GAAA8X,EAAAc,MAAA,CAAAH,SAAA,CAAAzY,GACA8c,EAAAhc,EAAAwD,OAAA,GAAA7P,EAAAiV,WAAA,CACA,GAAAmT,OAAAA,EACA,OAEA,IAAAE,EAAAF,EAAA/nB,WAAA,CACA3H,EAAA0vB,EAAA9nB,YAAA,CACA,GAAA5H,IAAAA,EAAA,CACA2qB,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,MACA,CACA,GAAArX,EAAA3H,GAAA8pB,EAAA,CACA,GAAA6F,EAAA,CAEA,IAAAz0B,EAAA,EAAoBA,EAAA8E,EAAS9E,GAAA,EAS7B,GARAm0B,EAAA3nB,CAAA,CAAAC,EAAAzM,EAAA,CACAu0B,EAAA/nB,CAAA,CAAAkoB,EAAA10B,EAAA,CACAm0B,GAAA,IAAAA,GAAA,IACAA,CAAAA,GAAA,IAEAI,GAAA,IAAAA,GAAA,IACAA,CAAAA,GAAA,IAEAJ,IAAAI,EACA,MAGA9E,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,MAEA,IAAA9E,EAAA,EAAoBA,EAAA8E,EAAS9E,GAAA,EAG7B,GAAAm0B,CAFAA,EAAA3nB,CAAA,CAAAC,EAAAzM,EAAA,IACAu0B,CAAAA,EAAA/nB,CAAA,CAAAkoB,EAAA10B,EAAA,EAEA,MAIAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAMA6vB,GAAA,SAAA3Y,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EAQA,OAPAZ,EAAAhsB,IAAA,EACAgsB,WAAAziB,EAAAkiB,iBAAA,CACAwB,OAAArjB,CACA,GACAiiB,EAAA1S,EAAA,EAAAvP,EAAAgjB,GACAZ,EAAAnO,GAAA,GACA+O,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,EACA,KAAA8H,EAAA0X,KAAA,CAGA,KAAA1X,EAAA4X,KAAA,CAFAyL,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,KAIA,MAAA1X,EAAA2X,OAAA,CACA0L,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,KACA,SACA,oCAAgD0L,EAAAnrB,KAAA,CAAc,EAC9D,CACA,EAMAswB,GAAA,SAAA5Y,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EAUA,OAPAZ,EAAAhsB,IAAA,EACAgsB,WAAAziB,EAAAkiB,iBAAA,CACAwB,OAAArjB,CACA,GACAiiB,EAAA1S,EAAA,EAAAvP,EAAAgjB,GACAZ,EAAAnO,GAAA,GACA+O,EAAA/iB,YAAA,GACA+iB,EAAAnrB,KAAA,EACA,KAAA8H,EAAA0X,KAAA,CACA,KAAA1X,EAAA4X,KAAA,CACAyL,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,KACA,MAAA3X,EAAA2X,OAAA,CACA0L,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,KACA,SACA,oCAAgD2L,EAAAnrB,KAAA,CAAc,EAC9D,CACA,EAIAuwB,GAAA,SAAA7Y,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzhB,EACA2kB,EACAC,EACAkC,EACA,IAAArc,EAAAF,CAAA,CAAAyD,EAAA,CACA8W,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,EACAgyB,CAAAA,EAAA3iB,GAAA,EACAwmB,CAAAA,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,IAEA5e,EAAA,GACA4kB,EAAAnmB,EACAqoB,EAAA,EAEA,QAAA90B,EAAAyY,EAAAG,QAAA,CAAA9b,MAAA,GAAyCkD,GAAA,EAAQA,GAAA,EAKjD,GAJA0uB,EAAAjW,EAAAG,QAAA,CAAA5Y,EAAA,CAAA4yB,EAAAnD,GACAmD,GAAAnD,EAAA/iB,YAAA,CACAooB,GAAArF,EAAA/iB,YAAA,CAEA+iB,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EACA/V,EAAA,GACA,KACA,CAEAA,GACAyhB,EAAAnrB,KAAA,CAAAwwB,IAAAA,EAAA1oB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAooB,IAEArF,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA+iB,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,GACAjE,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAGA,EAIAoC,GAAA,SAAA/Y,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAkD,EACAM,EACAC,EACAzO,EACA,IAAAhM,EAAAF,CAAA,CAAAyD,EAAA,CACAiX,EAAAxmB,EACAymB,EAAA,EACAzO,EAAA,EACA,IAAAqO,EAAArD,EAAAc,MAAA,CAAAzzB,MAAA,GACAi2B,EAAAtD,EAAAe,MAAA,CAAA1zB,MAAA,GAKA,IAJAgyB,EAAA3iB,GAAA,EACAwmB,CAAAA,EAAA7D,EAAA3iB,GAAA,CAAAygB,SAAA,KAIAqG,CAAAA,GAAA,KAIAvE,EAAA1S,EAAA,EAAAiX,EAAAxD,GACAA,EAAAnrB,KAAA,GAAA8H,EAAA2X,OAAA,EAIA0L,EAAAnrB,KAAA,GAAA8H,EAAA0X,KAAA,GAKAW,GAAA,EACAyO,GAAAzD,EAAA/iB,YAAA,CACAumB,GAAAxD,EAAA/iB,YAAA,CACA+X,IAAAhM,EAAAM,GAAA,KAMA0W,EAAAnrB,KAAA,GAAA8H,EAAA0X,KAAA,EACA2L,EAAAnrB,KAAA,CAAA4uB,IAAAA,EAAA9mB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAwmB,GACMzO,GAAAhM,EAAA7a,GAAA,EACN6xB,EAAAnrB,KAAA,CAAA4uB,IAAAA,EAAA9mB,EAAA0X,KAAA,CAAA1X,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAAwmB,IAEAzD,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACA+iB,EAAAc,MAAA,CAAA7P,GAAA,CAAAoS,GACArD,EAAAe,MAAA,CAAA9P,GAAA,CAAAqS,GACAjE,EAAA3iB,GAAA,EACA2iB,EAAA3iB,GAAA,CAAAwgB,SAAA,CAAAgG,GAGA,EAIAqC,GAAA,SAAAhZ,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACA,IAAAhX,EAAAF,CAAA,CAAAyD,EAAA,CAGA,GAFAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GACAD,EAAA,GACA,IAAA/D,EAAA8D,CAAA,CAAAC,EAAA,GACAgM,EAAA7a,GAAA,EAAA8K,GAAAA,GAAA+P,EAAAM,GAAA,GACA0W,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,GAEA,CACA,EAIAuoB,GAAA,SAAAjZ,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzvB,EACA,IAAAyY,EAAAF,CAAA,CAAAyD,EAAA,CACAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,IAAAjf,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,CACAkU,EAAAvE,EAAA3H,EACA,GAAAkM,GAAA,GACA,IAAAhR,EAAA,EAAkBA,EAAA8E,EAAS9E,GAAA,EAC3B,GAAAwM,CAAA,CAAAwE,EAAAhR,EAAA,GAAAyY,EAAA4C,MAAA,CAAArb,EAAA,CACA,MAGAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAIAowB,GAAA,SAAAlZ,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACA/mB,EACA,IAAA+P,EAAAF,CAAA,CAAAyD,EAAA,CACAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA,IAAAjf,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,CACA,GAAAgI,IAAAA,EAAA,CAEA2qB,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA,MACA,CACA,IAAA9S,EAAAvE,EAAA3H,EACA,GAAAkM,GAAA,GACA,QAAAhR,EAAA,EAAsBA,EAAA8E,EAAS9E,GAAA,EAK/B,GAJA0I,CAAAA,EAAA8D,CAAA,CAAAwE,EAAAhR,EAAA,GACA,IAAA0I,GAAA,IACAA,CAAAA,GAAA,IAEAA,IAAA+P,EAAA4C,MAAA,CAAArb,EAAA,CACA,MAGAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAGAqwB,GAAA,SAAAnZ,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,MACAzvB,EACAm0B,EACAI,EACA5c,EACA,IAAAc,EAAAF,CAAA,CAAAyD,EAAA,CAEAyT,EAAAnrB,KAAA,CAAA8H,EAAA2X,OAAA,CACA0L,EAAA/iB,YAAA,GAEAiL,EADAc,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,CACA+W,CAAA,CAAA4E,EAAAJ,KAAA,EAAAV,KAAA,CAEA7D,CAAA,CAAA2E,EAAAJ,KAAA,CAAAxE,EAAA/W,MAAA,EAAA6a,KAAA,CAEA,IAAA6c,EAAA/b,EAAA0D,OAAA,GAAA/P,EAAAkV,WAAA,CAAAmO,EAAAe,MAAA,CAAAJ,SAAA,CAAAzY,GAAA8X,EAAAc,MAAA,CAAAH,SAAA,CAAAzY,GACA8c,EAAAhc,EAAAwD,OAAA,GAAA7P,EAAAiV,WAAA,CACA,GAAAmT,OAAAA,EACA,OAEA,IAAAE,EAAAF,EAAA/nB,WAAA,CACA3H,EAAA0vB,EAAA9nB,YAAA,CACA,GAAA5H,IAAAA,EAAA,CACA2qB,EAAAnrB,KAAA,CAAA8H,EAAA0X,KAAA,CACA2L,EAAA/iB,YAAA,GACA,MACA,CACA,IAAAsE,EAAAvE,EAAA3H,EACA,GAAAkM,GAAA,GACA,GAAAyjB,EAAA,CAEA,IAAAz0B,EAAA,EAAoBA,EAAA8E,EAAS9E,GAAA,EAS7B,GARAm0B,EAAA3nB,CAAA,CAAAwE,EAAAhR,EAAA,CACAu0B,EAAA/nB,CAAA,CAAAkoB,EAAA10B,EAAA,CACAm0B,GAAA,IAAAA,GAAA,IACAA,CAAAA,GAAA,IAEAI,GAAA,IAAAA,GAAA,IACAA,CAAAA,GAAA,IAEAJ,IAAAI,EACA,MAGA9E,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,MAEA,IAAA9E,EAAA,EAAoBA,EAAA8E,EAAS9E,GAAA,EAG7B,GAAAm0B,CAFAA,EAAA3nB,CAAA,CAAAwE,EAAAhR,EAAA,IACAu0B,CAAAA,EAAA/nB,CAAA,CAAAkoB,EAAA10B,EAAA,EAEA,MAIAyvB,CAAAA,EAAAnrB,KAAA,CAAA8H,EAAA4X,KAAA,CACAyL,EAAA/iB,YAAA,CAAA5H,CACA,CACA,EAQA4pB,EAAA,SAAA1S,CAAA,CAAAvP,CAAA,CAAAgjB,CAAA,EACA,IAAA9iB,EAAA,GACA8L,EAAAF,CAAA,CAAAyD,EAAA,CAEA,GAAAiT,CADAA,GAAA,GACAM,EACA,6DAAuEA,EAAc,GAGrF,GAAAR,CADAA,GAAA,GACAC,GAEAA,CADAA,EAAAD,CAAA,EACAO,EACA,0DAAsEA,EAAe,GAIrF,GADAG,EAAAgB,OAAA,GACA3B,OAAAA,EAAArb,KAAA,EAEA,IAAA2hB,EAAA1E,IACA5B,EAAArb,KAAA,CAAA2Y,IAAA,CAAA3T,EAAAgX,EAAAnrB,KAAA,CAAAmI,EAAAgjB,EAAA/iB,YAAA,CAAA0oB,EAAAtF,MAAA,CAAAsF,EAAAvG,UAAA,CACA,CACA,GAhpCAA,CAAA,CAAAA,EAAA/xB,MAAA,IAAA+xB,UAAA,GAAAziB,EAAAkiB,iBAAA,CAipCA,OAAA7V,EAAAC,IAAA,EACA,KAAAtM,EAAAuM,GAAA,CACA8Z,EAAAzW,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAyM,GAAA,CACAgc,GAAA7Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA0M,GAAA,CACAic,GAAA/Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAuO,GAAA,CACA0Y,EAAArX,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAwO,GAAA,CACA+Y,EAAA3X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAyO,GAAA,CACAiZ,EAAA9X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA0O,GAAA,CACAiZ,EAAA/X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAmP,GAAA,CACAyZ,GAAAhZ,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAkP,GAAA,CACA2Z,GAAAjZ,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAgP,GAAA,CACA8Z,GAAAlZ,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA6O,GAAA,CACAka,GAAAnZ,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA2O,GAAA,CACA4Z,GAAA3Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA4O,GAAA,CACA4Z,GAAA5Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA8O,GAAA,CACAkZ,EAAApY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA+O,GAAA,CACAkZ,EAAArY,EAAAvP,EAAAgjB,GACA,KACA,SACA9iB,EAAA,EAEA,MAEA,OAAA8L,EAAAC,IAAA,EACA,KAAAtM,EAAAuM,GAAA,CACA8Z,EAAAzW,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAyM,GAAA,CACA6Z,EAAA1W,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA0M,GAAA,CACAka,EAAAhX,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAuO,GAAA,CACA0Y,EAAArX,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAwO,GAAA,CACA+Y,EAAA3X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAyO,GAAA,CACAiZ,EAAA9X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA0O,GAAA,CACAiZ,EAAA/X,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAmP,GAAA,CACAyY,EAAAhY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAkP,GAAA,CACA2Y,EAAAjY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAAgP,GAAA,CACA8Y,EAAAlY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA6O,GAAA,CACAqZ,EAAAtY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA2O,GAAA,CACA4Z,GAAA3Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA4O,GAAA,CACA4Z,GAAA5Y,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA8O,GAAA,CACAkZ,EAAApY,EAAAvP,EAAAgjB,GACA,KACA,MAAArjB,EAAA+O,GAAA,CACAkZ,EAAArY,EAAAvP,EAAAgjB,GACA,KACA,SACA9iB,EAAA,EAEA,CASA,GAPA,CAAAgkB,KAAAlkB,EAAAgjB,EAAA/iB,YAAA,CAAA2iB,GACAA,CAAAA,EAAA5iB,EAAAgjB,EAAA/iB,YAAA,EAEA,OAAAoiB,EAAAN,KAAA,EAEAM,EAAAN,KAAA,CAAA6G,OAAA,CAAA5c,EAAAgX,GAEAX,OAAAA,EAAArb,KAAA,EAEA,IAAA2hB,EAAA1E,IACA5B,EAAArb,KAAA,CAAA+Y,EAAA,CAAA/T,EAAAgX,EAAAnrB,KAAA,CAAAmI,EAAAgjB,EAAA/iB,YAAA,CAAA0oB,EAAAtF,MAAA,CAAAsF,EAAAvG,UAAA,CACA,CAEA,OADAE,GAAA,EACApiB,CACA,CACA,yBCx8CAsD,EAAAlS,OAAA,gBASAu3B,EARA,IAAAlpB,EAAavK,EAAQ,OACrBiL,EAAgBjL,EAAQ,OACxBsP,EAAgBtP,EAAQ,OAGxBgS,EAAA,GACAC,EAAA,GACA0a,EAAA,GAEA+G,EAAA,GACAC,EAAA,GACA,KAAAzE,WAAA,eAGA,IAAA0E,EAAA,SAAAC,CAAA,CAAAC,CAAA,SACA,EAAAhe,KAAA,CAAAge,EAAAhe,KAAA,CACA,GAEA+d,EAAA/d,KAAA,CAAAge,EAAAhe,KAAA,CACA,EAEA,CACA,EAEAie,EAAA,SAAAF,CAAA,CAAAC,CAAA,SACA,EAAAE,KAAA,CAAAF,EAAAE,KAAA,CACA,EAEAH,EAAAG,KAAA,CAAAF,EAAAE,KAAA,CACA,GAEAJ,EAAAC,EAAAC,EACA,EAGAG,EAAA,SAAAJ,CAAA,CAAAC,CAAA,SACA,EAAAtd,KAAA,CAAAsd,EAAAtd,KAAA,CACA,GAEAqd,EAAArd,KAAA,CAAAsd,EAAAtd,KAAA,CACA,EAEA,CACA,EACA0d,EAAA,WACA,KAAAzf,KAAA,GACA,KAAA0f,KAAA,GACA,KAAAC,OAAA,GACA,KAAAJ,KAAA,EACA,EAEAhG,EAAA,WACArB,EAAA1xB,MAAA,GACAw4B,EAAA,IAAAS,EACAvH,CAAA,CAAApiB,EAAAuM,GAAA,MAAAod,EACAvH,CAAA,CAAApiB,EAAAyM,GAAA,MAAAkd,EACAvH,CAAA,CAAApiB,EAAA0M,GAAA,MAAAid,EACAvH,CAAA,CAAApiB,EAAAuO,GAAA,MAAAob,EACAvH,CAAA,CAAApiB,EAAAmP,GAAA,MAAAwa,EACAvH,CAAA,CAAApiB,EAAAkP,GAAA,MAAAya,EACAvH,CAAA,CAAApiB,EAAAgP,GAAA,MAAA2a,EACAvH,CAAA,CAAApiB,EAAAwO,GAAA,MAAAmb,EACAvH,CAAA,CAAApiB,EAAAyO,GAAA,MAAAkb,EACAvH,CAAA,CAAApiB,EAAA0O,GAAA,MAAAib,EACAvH,CAAA,CAAApiB,EAAA6O,GAAA,MAAA8a,EACAvH,CAAA,CAAApiB,EAAA2O,GAAA,MAAAgb,EACAvH,CAAA,CAAApiB,EAAA4O,GAAA,MAAA+a,EACAvH,CAAA,CAAApiB,EAAA8O,GAAA,MAAA6a,EACAvH,CAAA,CAAApiB,EAAA+O,GAAA,MAAA4a,EACAR,EAAAz4B,MAAA,GACA,QAAAkD,EAAA,EAAoBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EACtCu1B,EAAA1yB,IAAA,EACAyT,MAAA,EACA0f,MAAA,EACAC,QAAA,EACAJ,MAAA,EACAl5B,KAAAkX,CAAA,CAAA7T,EAAA,CAAArD,IAAA,CACAgb,MAAA9D,CAAA,CAAA7T,EAAA,CAAA2X,KAAA,CACAU,MAAAxE,CAAA,CAAA7T,EAAA,CAAAqY,KAAA,GAGA,GAAAvE,EAAAhX,MAAA,IACA04B,EAAA14B,MAAA,GACA,QAAAkD,EAAA,EAAsBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACvCw1B,EAAA3yB,IAAA,EACAyT,MAAA,EACA0f,MAAA,EACAC,QAAA,EACAJ,MAAA,EACAl5B,KAAAmX,CAAA,CAAA9T,EAAA,CAAArD,IAAA,CACAgb,MAAA7D,CAAA,CAAA9T,EAAA,CAAA2X,KAAA,CACAU,MAAAvE,CAAA,CAAA9T,EAAA,CAAAqY,KAAA,EAGA,CACA,EAEA6d,EAAA,SAAAC,CAAA,CAAA7xB,CAAA,EAEA,OADA6xB,EAAAN,KAAA,IACAvxB,GACA,KAAA8H,EAAA0X,KAAA,CACAqS,EAAA7f,KAAA,IACA,KACA,MAAAlK,EAAA4X,KAAA,CACAmS,EAAAH,KAAA,IACA,KACA,MAAA5pB,EAAA2X,OAAA,CACAoS,EAAAF,OAAA,IACA,KACA,SACA,mEAAoF3xB,GAAM,CAC1F,CACA,EAEA8xB,EAAA,SAAAz5B,CAAA,CAAAw5B,CAAA,EASA,MANA,kBAA0BhlB,EAAAklB,YAAA,CAAmB,IAAI15B,EACjD,kBAA0BwU,EAAAmlB,WAAA,CAAkB,IAAIH,EAAA7f,KAAA,CAChD,kBAA0BnF,EAAAolB,WAAA,CAAkB,IAAIJ,EAAAH,KAAA,CAChD,kBAA0B7kB,EAAAI,aAAA,CAAoB,IAAI4kB,EAAAF,OAAA,CAClD,kBAA0B9kB,EAAAklB,YAAA,CAAmB,IAAIF,EAAAN,KAAA,CAAW;AAAA,CAJN,EAQtDW,EAAA,WAkBA,MADA/kB,IAfA2kB,EAAA,MAAA5H,CAAA,CAAApiB,EAAAuM,GAAA,GACAyd,EAAA,MAAA5H,CAAA,CAAApiB,EAAAyM,GAAA,GACAud,EAAA,MAAA5H,CAAA,CAAApiB,EAAA0M,GAAA,GACAsd,EAAA,MAAA5H,CAAA,CAAApiB,EAAAuO,GAAA,GACAyb,EAAA,MAAA5H,CAAA,CAAApiB,EAAAmP,GAAA,GACA6a,EAAA,MAAA5H,CAAA,CAAApiB,EAAAkP,GAAA,GACA8a,EAAA,MAAA5H,CAAA,CAAApiB,EAAAgP,GAAA,GACAgb,EAAA,MAAA5H,CAAA,CAAApiB,EAAAwO,GAAA,GACAwb,EAAA,MAAA5H,CAAA,CAAApiB,EAAAyO,GAAA,GACAub,EAAA,MAAA5H,CAAA,CAAApiB,EAAA0O,GAAA,GACAsb,EAAA,MAAA5H,CAAA,CAAApiB,EAAA6O,GAAA,GACAmb,EAAA,MAAA5H,CAAA,CAAApiB,EAAA2O,GAAA,GACAqb,EAAA,MAAA5H,CAAA,CAAApiB,EAAA4O,GAAA,GACAob,EAAA,MAAA5H,CAAA,CAAApiB,EAAA8O,GAAA,GACAkb,EAAA,MAAA5H,CAAA,CAAApiB,EAAA+O,GAAA,GACAib,EAAA,SAAAd,GAEA,EAEAvhB,EAAA,WACA,IAAAtC,EAAA,GAEAA,2HACA,QAAAzR,EAAA,EAAoBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EACtCu1B,CAAA,CAAAv1B,EAAA,CAAA61B,KAAA,IAOApkB,CAAAA,GALA,kBAA8BN,EAAAklB,YAAA,CAAmB,IAAId,CAAA,CAAAv1B,EAAA,CAAArD,IAAA,CACrD,kBAA8BwU,EAAAmlB,WAAA,CAAkB,IAAIf,CAAA,CAAAv1B,EAAA,CAAAsW,KAAA,CACpD,kBAA8BnF,EAAAolB,WAAA,CAAkB,IAAIhB,CAAA,CAAAv1B,EAAA,CAAAg2B,KAAA,CACpD,kBAA8B7kB,EAAAI,aAAA,CAAoB,IAAIgkB,CAAA,CAAAv1B,EAAA,CAAAi2B,OAAA,CACtD,kBAA8B9kB,EAAAklB,YAAA,CAAmB,IAAId,CAAA,CAAAv1B,EAAA,CAAA61B,KAAA,CAAmB;AAAA,CAJD,EAQvE,GAAA/hB,EAAAhX,MAAA,IAEA2U,0HACA,QAAAzR,EAAA,EAAsBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACvCw1B,CAAA,CAAAx1B,EAAA,CAAA61B,KAAA,IAOApkB,CAAAA,GALA,kBAAgCN,EAAAklB,YAAA,CAAmB,IAAIb,CAAA,CAAAx1B,EAAA,CAAArD,IAAA,CACvD,kBAAgCwU,EAAAmlB,WAAA,CAAkB,IAAId,CAAA,CAAAx1B,EAAA,CAAAsW,KAAA,CACtD,kBAAgCnF,EAAAolB,WAAA,CAAkB,IAAIf,CAAA,CAAAx1B,EAAA,CAAAg2B,KAAA,CACtD,kBAAgC7kB,EAAAI,aAAA,CAAoB,IAAIikB,CAAA,CAAAx1B,EAAA,CAAAi2B,OAAA,CACxD,kBAAgC9kB,EAAAklB,YAAA,CAAmB,IAAIb,CAAA,CAAAx1B,EAAA,CAAA61B,KAAA,CAAkB;AAAA,CAJD,CAQxE,CACA,OAAApkB,CACA,CAEA,MAAAsZ,QAAA,UAAApuB,CAAA,EACA,IAAAgQ,EAAA,GAIA,MAHA,iBAAAhQ,GAAA85B,UAAA95B,GACAgQ,CAAAA,EAAA,IAEAA,CACA,EAEA,KAAAmf,IAAA,UAAA4K,CAAA,CAAAC,CAAA,EACA9iB,EAAA6iB,EACA5iB,EAAA6iB,EACA9G,GACA,EAGA,KAAAwF,OAAA,UAAA5c,CAAA,CAAA3K,CAAA,EACAooB,EAAAZ,EAAAxnB,EAAAxJ,KAAA,CAAAwJ,EAAApB,YAAA,EACAwpB,EAAA1H,CAAA,CAAA/V,EAAAC,IAAA,EAAA5K,EAAAxJ,KAAA,CAAAwJ,EAAApB,YAAA,EACA+L,EAAAC,IAAA,GAAAtM,EAAAuO,GAAA,EACAub,EAAAX,CAAA,CAAA9c,EAAAJ,KAAA,EAAAvK,EAAAxJ,KAAA,CAAAwJ,EAAApB,YAAA,EAEA+L,EAAAC,IAAA,GAAAtM,EAAAwO,GAAA,EACAsb,EAAAV,CAAA,CAAA/c,EAAAJ,KAAA,EAAAvK,EAAAxJ,KAAA,CAAAwJ,EAAApB,YAAA,CAEA,EAQA,KAAAkqB,MAAA,UAAAle,CAAA,CAAAuU,CAAA,EACA,IAAAxb,EAAA,GAWA,IAVAA,GAAA,iBAA6BN,EAAA0lB,WAAA,CAAkB;AAAA,EAC/C,iBAAA5J,GACAxb,CAAAA,GAAA,YAA0Bwb,EAAQ;AAAA,GAMlCxb,GAJA,kBAA8BN,EAAAklB,YAAA,CAC9B;WAAA,EAA0BllB,EAAAmlB,WAAA,CAC1B;WAAA,EAA0BnlB,EAAAolB,WAAA,CAC1B;WAAA,EAA0BplB,EAAAI,aAAA,CAC1B;WAAA,EAA0BJ,EAAAklB,YAAA,CAAmB;AAAA,CAJI,GAMjD,CACA,SAAA3d,GAQAA,QAAAA,EARA,CACAjH,GAAA+kB,IACA,KACA,CASA,GAAA9d,UAAAA,EAAA,CACA6c,EAAA/Z,IAAA,CAAAsa,GACAN,EAAA14B,MAAA,IACA04B,EAAAha,IAAA,CAAAsa,GAGArkB,GADA+kB,IACAziB,IACA,KACA,CACA,GAAA2E,SAAAA,EAAA,CACA6c,EAAA/Z,IAAA,CAAAoa,GACAJ,EAAA14B,MAAA,IACA04B,EAAAha,IAAA,CAAAsa,GAGArkB,GADA+kB,IACAziB,IACA,KACA,CACA,UAAA2E,IACA6c,EAAA/Z,IAAA,CAAAia,GACAD,EAAA14B,MAAA,IACA04B,EAAAha,IAAA,CAAAia,GAGAhkB,GADA+kB,IACAziB,KAGA,KACA,CAEA,OADAtC,EAAA,YAEA,EAEA,KAAAqlB,UAAA,UAAApe,CAAA,CAAAuU,CAAA,CAAAza,CAAA,EACA,OAAA1F,EAAAiqB,UAAA,MAAAH,MAAA,CAAAle,EAAAuU,GAAAza,EACA,CACA,qBC5RAvC,EAAAlS,OAAA,EAGAi5B,gBAAA,WACAX,aAAA,aACAC,YAAA,YACAC,YAAA,YACAhlB,cAAA,cACA0lB,gBAAA,eACAC,iBAAA,eACAC,gBAAA,gBACA/lB,eAAA,gBACAgmB,cAAA,eACAC,YAAA,YACAC,aAAA,aACAC,kBAAA,mBACAC,YAAA,YACAX,YAAA,YACAY,YAAA,YACAnlB,cAAA,cACAolB,YAAA,YACAC,gBAAA,iBACAC,iBAAA,WACA,yBC4CA3nB,EAAAlS,OAAA,YACA,IAAA+O,EAAgBjL,EAAQ,OACxBsP,EAAgBtP,EAAQ,OACxB0sB,EAAA,GAAwB1sB,CAAAA,EAAQ,MAAmB,EACnDuK,EAAavK,EAAQ,OAErBwO,EAAA,aACAib,EAAA,KAOAK,EAAA,GACAkM,EAAA,IACAC,EAAA,GACAC,EAAA,EACAhJ,EAAA,EACAiJ,EAAA,GACAxrB,EAAA,KACAqH,EAAA,KACAC,EAAA,KACAmkB,EAAA,GACAC,EAAA,GAEAC,EAAA,gBAAqChnB,EAAAimB,aAAA,CAAoB,eAAQ,EACjEgB,EAAA,gBAA0CjnB,EAAAimB,aAAA,CAAoB,iBAAU,EACxEiB,EAAA,gBAAuClnB,EAAAmlB,WAAA,CAAkB,kBAAW,EAEpEgC,EAAA,WACA,IAAAC,EAAA,SAAAlzB,CAAA,EACA4yB,CAAA,CAAA7rB,EAAAuM,GAAA,EAAAtT,EACA4yB,CAAA,CAAA7rB,EAAAyM,GAAA,EAAAxT,EACA4yB,CAAA,CAAA7rB,EAAA0M,GAAA,EAAAzT,EACA4yB,CAAA,CAAA7rB,EAAAgP,GAAA,EAAA/V,EACA4yB,CAAA,CAAA7rB,EAAAkP,GAAA,EAAAjW,EACA4yB,CAAA,CAAA7rB,EAAAmP,GAAA,EAAAlW,EACA4yB,CAAA,CAAA7rB,EAAAyO,GAAA,EAAAxV,EACA4yB,CAAA,CAAA7rB,EAAA0O,GAAA,EAAAzV,EACA4yB,CAAA,CAAA7rB,EAAA6O,GAAA,EAAA5V,EACA4yB,CAAA,CAAA7rB,EAAA2O,GAAA,EAAA1V,EACA4yB,CAAA,CAAA7rB,EAAA4O,GAAA,EAAA3V,EACA4yB,CAAA,CAAA7rB,EAAA8O,GAAA,EAAA7V,EACA4yB,CAAA,CAAA7rB,EAAA+O,GAAA,EAAA9V,CACA,EACA2oB,EAAA,EAEA,QAAArxB,KAAA2uB,EAAAkN,MAAA,CAAAC,SAAA,CACAzK,GAAA,EAEA,GAAAA,IAAAA,EAAA,CAEAuK,EAAA,IACA,MACA,CACA,QAAA57B,KAAA2uB,EAAAkN,MAAA,CAAAC,SAAA,EACA,IAAAC,EAAA/7B,EAAAkT,WAAA,GACA,GAAA6oB,UAAAA,EAAA,CAEAH,EAAA,IACA,MACA,CACA,GAAAG,WAAAA,EAAA,CAEAH,EAAA,IACA,MACA,CACA,CAEA,QAAA57B,KADA47B,EAAA,IACAjN,EAAAkN,MAAA,CAAAC,SAAA,EACA,IAAAC,EAAA/7B,EAAAkT,WAAA,GAEA,GAAA6oB,QAAAA,EACAT,CAAA,CAAA7rB,EAAAuM,GAAA,EAAA2S,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAAyM,GAAA,EAAAyS,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA0M,GAAA,EAAAwS,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAAyO,GAAA,EAAAyQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA0O,GAAA,EAAAwQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAAgP,GAAA,EAAAkQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAAkP,GAAA,EAAAgQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAAmP,GAAA,EAAA+P,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA6O,GAAA,EAAAqQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA2O,GAAA,EAAAuQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA4O,GAAA,EAAAsQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA8O,GAAA,EAAAoQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MACQ,GAAA+7B,QAAAA,EACRT,CAAA,CAAA7rB,EAAA+O,GAAA,EAAAmQ,CAAA,IAAAA,EAAAkN,MAAA,CAAAC,SAAA,CAAA97B,EAAA,MAEA,YACA,GAAa0T,EAAa,sBAAsB1T,EAAK,6GAIrD,CACA,EAEAg8B,EAAA,eAUA3K,EACAhuB,EAVA,IAAA44B,EAAA,SAAAvzB,CAAA,EACA4yB,CAAA,CAAA7rB,EAAAuO,GAAA,EAAAtV,EACA4yB,CAAA,CAAA7rB,EAAAwO,GAAA,EAAAvV,EACA,IAAAqY,EAAA7J,EAAA/W,MAAA,CAAAgX,EAAAhX,MAAA,CACAo7B,EAAAp7B,MAAA,GACA,QAAAkD,EAAA,EAAsBA,EAAA0d,EAAW1d,GAAA,EACjCk4B,EAAAr1B,IAAA,CAAAwC,EAEA,EAGA2mB,EAAA,GACA,IAAAhsB,EAAA,EAAgBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EAClCgsB,EAAAnpB,IAAA,CAAAgR,CAAA,CAAA7T,EAAA,CAAA2X,KAAA,EAEA,IAAA3X,EAAA,EAAgBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACjCgsB,EAAAnpB,IAAA,CAAAiR,CAAA,CAAA9T,EAAA,CAAA2X,KAAA,EAKA,QAAAhb,KAHAu7B,EAAAp7B,MAAA,GACAkxB,EAAA,EAEA1C,EAAAkN,MAAA,CAAA3kB,KAAA,CACAma,GAAA,EAEA,GAAAA,IAAAA,EAAA,CAEA4K,EAAA,IACA,MACA,CACA,QAAAj8B,KAAA2uB,EAAAkN,MAAA,CAAA3kB,KAAA,EACA,IAAA8D,EAAAhb,EAAA+S,WAAA,GACA,GAAAiI,UAAAA,EAAA,CAEAihB,EAAA,IACA,MACA,CACA,GAAAjhB,WAAAA,EAAA,CAEAihB,EAAA,IACA,MACA,CACA,CAKA,QAAAj8B,KAHAi8B,EAAA,IACAX,CAAA,CAAA7rB,EAAAuO,GAAA,KACAsd,CAAA,CAAA7rB,EAAAwO,GAAA,KACA0Q,EAAAkN,MAAA,CAAA3kB,KAAA,EACA,IAAA8D,EAAAhb,EAAA+S,WAAA,GAEA,GAAA1P,CADAA,EAAAgsB,EAAAC,OAAA,CAAAtU,EAAA,EACA,EACA,eAA2BtH,EAAa,mBAAmB1T,EAAK,gCAEhEu7B,CAAAA,CAAA,CAAAl4B,EAAA,CAAAsrB,CAAA,IAAAA,EAAAkN,MAAA,CAAA3kB,KAAA,CAAAlX,EAAA,CAEA,CAEA,MAAAqc,WAAA,eACA,KAAAwf,MAAA,EACAC,UAAA,GACA5kB,MAAA,IAOA,KAAAglB,aAAA,UAAA9f,CAAA,CAAA+f,CAAA,EAEA,GADAhB,EAAA,GACA,iBAAA/e,GAAAA,EAAA,EACA8e,EAAA5yB,KAAA4oB,IAAA,CAAA9U,OACM,CACN8e,EAAA,EACA,MACA,CACA,iBAAAiB,GAEAhB,CADAA,EAAA7yB,KAAAuC,KAAA,CAAAsxB,EAAA,EACA,GACAhB,CAAAA,EAAA,GAGA,EAEA,KAAAiB,aAAA,YACA,OAAAlB,CACA,EAEA,KAAAmB,aAAA,YACA,OAAAlB,CACA,EAEA,KAAAhM,IAAA,UAAAxI,CAAA,CAAAC,CAAA,CAAAwI,CAAA,EACAJ,EAAA7uB,MAAA,GACAk7B,EAAAl7B,MAAA,GACAi7B,EAAA,EACAhJ,EAAA,EACAviB,EAAAuf,EACAlY,EAAAyP,EACAxP,EAAAyP,EACA+U,IACAK,IACApK,EAAAzC,IAAA,CAAA+L,EACA,EAEA,IAAAoB,EAAA,SAAAxgB,CAAA,EAiBA,OAfAA,EAAAC,IAAA,GAAAtM,EAAAuO,GAAA,CACAsd,EAAAA,CAAA,CAAAxf,EAAAC,IAAA,KAAAwf,CAAA,CAAAzf,EAAAJ,KAAA,EAKMI,EAAAC,IAAA,GAAAtM,EAAAwO,GAAA,CACNqd,EAAAA,CAAA,CAAAxf,EAAAC,IAAA,KAAAwf,CAAA,CAAArkB,EAAA/W,MAAA,CAAA2b,EAAAJ,KAAA,EAMA4f,CAAA,CAAAxf,EAAAC,IAAA,GAIAwgB,EAAA,SAAAxM,CAAA,SACA,KAAAoL,GAGApL,GAAAoL,CAIA,CAEA,MAAA1L,IAAA,UAAA3T,CAAA,CAAAnU,CAAA,CAAA60B,CAAA,CAAAr8B,CAAA,CAAAgzB,CAAA,CAAAjB,CAAA,EACAqK,EAAAnB,IAAAkB,EAAAxgB,KACAuf,EAAAn1B,IAAA,CAAAk1B,GACApM,CAAA,CAAA4C,EAAAT,SAAA,KACAsL,MAAA,GACA7L,MAAAwB,EACAsK,SAAAtB,EACAuB,SAAAv4B,KAAAA,EACAw4B,OAAA9gB,EACAnU,MAAAA,EACAmI,YAAA0sB,EACAzsB,aAAA5P,EACA08B,WAAA1J,EACAjB,WAAAA,CACA,EACAkJ,GAAA,EACAhJ,GAAA,EAEA,EAEA,KAAAvC,EAAA,UAAA/T,CAAA,CAAAnU,CAAA,CAAA60B,CAAA,CAAAr8B,CAAA,CAAAgzB,CAAA,CAAAjB,CAAA,EACA,GAAAqK,EAAAnB,IAAAkB,EAAAxgB,GAAA,CACA,IAAA4gB,EAAAtB,EACAuB,EAAAtB,EAAAtX,GAAA,GACA+Y,EAAAlL,EAAAN,YAAA,CAAAqL,EACA,MAAAG,GACA9N,CAAAA,CAAA,CAAA8N,EAAA,CAAAH,QAAA,CAAAD,CAAA,EAEAtK,GAAA,EACApD,CAAA,CAAA4C,EAAAT,SAAA,KACAsL,MAAA,GACA7L,MAAAwB,EACAsK,SAAAA,EACAC,SAAAA,EACAC,OAAA9gB,EACAnU,MAAAA,EACAmI,YAAA0sB,EACAzsB,aAAA5P,EACA08B,WAAA1J,EACAjB,WAAAA,CACA,EACAkJ,GAAA,CACA,CACA,EAEA,IAAA2B,EAAA,eA8KAC,EACAC,EACAC,EACAnN,EAyGAoN,EAxRA,SAAAC,EAAAH,CAAA,CAAAL,CAAA,EACA,IAAA58B,EACAq9B,EACAC,EACA,GAAAV,EAGA,OAFAK,EAAAnhB,EAAA,EAAoBrM,GAAAmtB,EAAA7gB,IAAA,CAAA/b,KAAAmQ,EAAAotB,cAAA,CAAAX,EAAA7gB,IAAA,GACpBkhB,EAAAO,MAAA,CAAAp5B,KAAAA,EACAw4B,EAAA7gB,IAAA,EACA,KAAAtM,EAAAuO,GAAA,CACAif,EAAAO,MAAA,CAAAtmB,CAAA,CAAA0lB,EAAAlhB,KAAA,EAAA1b,IAAA,CACA,KACA,MAAAyP,EAAAwO,GAAA,CACAgf,EAAAO,MAAA,CAAArmB,CAAA,CAAAylB,EAAAlhB,KAAA,EAAA1b,IAAA,CACA,KACA,MAAAyP,EAAA6O,GAAA,CAEAte,EADA48B,EAAAlhB,KAAA,CAAAxE,EAAA/W,MAAA,CACA+W,CAAA,CAAA0lB,EAAAlhB,KAAA,EAAA1b,IAAA,CAEAmX,CAAA,CAAAylB,EAAAlhB,KAAA,CAAAxE,EAAA/W,MAAA,EAAAH,IAAA,CAEAq9B,EAAAT,EAAAtd,OAAA,GAAA7P,EAAAiV,WAAA,WACA4Y,EAAAV,EAAApd,OAAA,GAAA/P,EAAAgQ,WAAA,WACAwd,EAAAO,MAAA,QAAiCH,EAAS,EAAEC,EAAS,EAAEt9B,EAAK,EAC5D,KACA,MAAAyP,EAAAgP,GAAA,CACAwe,EAAAO,MAAA,IACA,QAAAn6B,EAAA,EAA4BA,EAAAu5B,EAAAle,MAAA,CAAAve,MAAA,CAA0BkD,GAAA,EACtD45B,EAAAO,MAAA,CAAAt3B,IAAA,CAAA02B,EAAAle,MAAA,CAAArb,EAAA,EAEA,KACA,MAAAoM,EAAAkP,GAAA,CACAse,EAAAO,MAAA,IACA,QAAAn6B,EAAA,EAA4BA,EAAAu5B,EAAAle,MAAA,CAAAve,MAAA,CAA0BkD,GAAA,EACtD45B,EAAAO,MAAA,CAAAt3B,IAAA,CAAA02B,EAAAle,MAAA,CAAArb,EAAA,EAEA,KACA,MAAAoM,EAAAmP,GAAA,CAGA,KAAAnP,EAAA0M,GAAA,CAFA8gB,EAAAO,MAAA,EAAAZ,EAAA37B,GAAA,CAAA27B,EAAAxgB,GAAA,EACA,KAIA,SACA,kCACA,MAEA6gB,EAAAnhB,EAAA,EAAoBrM,GAAArL,KAAAA,EAAApE,KAAAoE,KAAAA,CAAA,EACpB64B,EAAAO,MAAA,CAAAp5B,KAAAA,CAEA,CACA,SAAAq5B,EAAA91B,CAAA,CAAA+T,CAAA,CAAAvb,CAAA,SACA,IAAAsP,EAAA4X,KAAA,CACA,CACA3L,MAAAA,EACAvb,OAAAA,CACA,EAEAwH,IAAA8H,EAAA2X,OAAA,EAMAzf,IAAA8H,EAAA0X,KAAA,CALA,CACAzL,MAAAA,EACAvb,OAAA,CACA,EAQA,IACA,CACA,IAAAu9B,EAAA,GACA,SAAAC,EAAAT,CAAA,CAAAnN,CAAA,CAAAa,CAAA,EACA,IAAAqM,EAAA,CAEAxtB,GAAAiuB,IACAE,OAAA,GACAV,OAAAA,EACArN,GAAA,GACAJ,KAAA,GACAmB,MAAAA,EACA3U,SAAA,IAYA,OAVA8T,GACAkN,EAAAxN,IAAA,IACAwN,EAAAt1B,KAAA,EAAuB8H,GAAAsgB,EAAApoB,KAAA,CAAA3H,KAAAmQ,EAAA0tB,aAAA,CAAA9N,EAAApoB,KAAA,GACvBs1B,EAAAa,MAAA,MACAV,EAAAH,EAAAlN,EAAA6M,MAAA,IAEAK,EAAAt1B,KAAA,EAAuB8H,GAAArL,KAAAA,EAAApE,KAAAoE,KAAAA,CAAA,EACvB64B,EAAAa,MAAA,CAAAL,IACAL,EAAAH,EAAA74B,KAAAA,IAEA64B,CACA,CACA,SAAAc,EAAAd,CAAA,CAAAlN,CAAA,EACAA,IACAkN,EAAApN,EAAA,IACAoN,EAAAt1B,KAAA,EAAuB8H,GAAAsgB,EAAApoB,KAAA,CAAA3H,KAAAmQ,EAAA0tB,aAAA,CAAA9N,EAAApoB,KAAA,GACvBs1B,EAAAa,MAAA,CAAAL,EAAA1N,EAAApoB,KAAA,CAAAooB,EAAAjgB,WAAA,CAAAigB,EAAAhgB,YAAA,EACAktB,EAAAxN,IAAA,EACA2N,EAAAH,EAAAlN,EAAA6M,MAAA,EAGA,CAEA,IAAAoB,EAAA,EACApN,EAAA,GACAqN,EAAA,EA+DAL,EAAA,GAKAM,EAAA,GAEAC,EAAAR,EAAA,cAiCA,IAhCAC,EAAA13B,IAAA,CAAAi4B,GACAlB,EAAAkB,EACAvM,EAAAtc,OAAA,KAEA,GADAya,EAAAf,CAAA,CAAAoP,EAAA,CACAF,IACAA,EAAA,GACAnO,EAAAa,KAAA,KAEA,IAAAxN,EAAA2M,EAAA0M,KAAA,CAAA1M,EAAAa,KAAA,GAAAb,EAAAa,KAAA,CACA,QAAAvtB,EAAA,EAA0BA,EAAA+f,EAAS/f,GAAA,EACnC65B,EAAAD,EACAA,EAAAU,EAAAV,EAAA,KAAA55B,GACAu6B,EAAA13B,IAAA,CAAA+2B,GACAC,EAAAjhB,QAAA,CAAA/V,IAAA,CAAA+2B,EAEA,CAEAlN,EAAA0M,KAAA,EAGAsB,EADAd,EAAAW,EAAA7Z,GAAA,GACAgM,GACAkN,EAAAW,CAAA,CAAAA,EAAAz9B,MAAA,MAGA+8B,EAAAD,EACAA,EAAAU,EAAAV,EAAAlN,EAAAA,EAAAa,KAAA,EACAgN,EAAA13B,IAAA,CAAA+2B,GACAC,EAAAjhB,QAAA,CAAA/V,IAAA,CAAA+2B,GAEA,GAGAW,EAAAz9B,MAAA,IAEA49B,EADAd,EAAAW,EAAA7Z,GAAA,GACA,MAGA,GAAAoa,IAAAA,EAAAliB,QAAA,CAAA9b,MAAA,CACA,uDAEA,GAAAy9B,IAAAA,EAAAz9B,MAAA,CACA,6EAKA,IAAAk+B,EADArB,EAAAmB,EAAAliB,QAAA,IAEA,KAAA+gB,GAAA,CAAAA,EAAAvN,IAAA,GAAAuN,EAAAnN,EAAA,EACAwO,EAAArB,EACAA,EAAAA,EAAA/gB,QAAA,IAEA+gB,CAAAA,EAAAqB,CAAA,EAGAC,QAAA,IACAtB,EAAAuB,SAAA,IACAC,SA9HAA,EAAAvB,CAAA,EAMA,GALArM,GAAA,EACAqM,EAAAW,MAAA,CAAAK,EACArN,EAAAwB,GACAA,CAAAA,EAAAxB,CAAA,EAEAqM,IAAAA,EAAAhhB,QAAA,CAAA9b,MAAA,CACA69B,GAAA,OAEA,QAAA36B,EAAA,EAAwBA,EAAA45B,EAAAhhB,QAAA,CAAA9b,MAAA,CAA0BkD,GAAA,EAClDA,EAAA,GACA46B,CAAAA,GAAA,GAEAhB,EAAAhhB,QAAA,CAAA5Y,EAAA,CAAAi7B,QAAA,IACArB,EAAAhhB,QAAA,CAAA5Y,EAAA,CAAAk7B,SAAA,IACAtB,EAAAqB,QAAA,EACArB,CAAAA,EAAAhhB,QAAA,CAAA5Y,EAAA,CAAAi7B,QAAA,CAAAj7B,IAAAA,CAAA,EAEA45B,EAAAsB,SAAA,EACAtB,CAAAA,EAAAhhB,QAAA,CAAA5Y,EAAA,CAAAk7B,SAAA,CAAAl7B,IAAA45B,EAAAhhB,QAAA,CAAA9b,MAAA,IAEAq+B,EAAAvB,EAAAhhB,QAAA,CAAA5Y,EAAA,EAGAutB,GAAA,CACA,EAqGAoM,GACAA,EAAAY,MAAA,GAGA,IAAAje,EAAA,EACAA,CAAAA,EAAAjB,MAAA,IACA,QAAArb,EAAA,EAAoBA,EAAAwM,EAAA1P,MAAA,CAAkBkD,GAAA,EACtCsc,EAAAjB,MAAA,CAAArb,EAAA,CAAAwM,CAAA,CAAAxM,EAAA,CAGAsc,EAAAzI,KAAA,IACA,QAAA7T,EAAA,EAAoBA,EAAA6T,EAAA/W,MAAA,CAAkBkD,GAAA,EACtCsc,EAAAzI,KAAA,CAAA7T,EAAA,CAAA6T,CAAA,CAAA7T,EAAA,CAAArD,IAAA,CAGA2f,EAAAxI,IAAA,IACA,QAAA9T,EAAA,EAAoBA,EAAA8T,EAAAhX,MAAA,CAAiBkD,GAAA,EACrCsc,EAAAxI,IAAA,CAAA9T,EAAA,CAAA8T,CAAA,CAAA9T,EAAA,CAAArD,IAAA,CA0CA,OAvCA2f,EAAAlQ,EAAA,IACAkQ,EAAAlQ,EAAA,CAAAuM,GAAA,EAAmBvM,GAAAA,EAAAuM,GAAA,CAAAhc,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAyM,GAAA,EAAmBzM,GAAAA,EAAAyM,GAAA,CAAAlc,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA0M,GAAA,EAAmB1M,GAAAA,EAAA0M,GAAA,CAAAnc,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAuO,GAAA,EAAmBvO,GAAAA,EAAAuO,GAAA,CAAAhe,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAgP,GAAA,EAAmBhP,GAAAA,EAAAgP,GAAA,CAAAze,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAkP,GAAA,EAAmBlP,GAAAA,EAAAkP,GAAA,CAAA3e,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAmP,GAAA,EAAmBnP,GAAAA,EAAAmP,GAAA,CAAA5e,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAwO,GAAA,EAAmBxO,GAAAA,EAAAwO,GAAA,CAAAje,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAyO,GAAA,EAAmBzO,GAAAA,EAAAyO,GAAA,CAAAle,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA0O,GAAA,EAAmB1O,GAAAA,EAAA0O,GAAA,CAAAne,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA6O,GAAA,EAAmB7O,GAAAA,EAAA6O,GAAA,CAAAte,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA2O,GAAA,EAAmB3O,GAAAA,EAAA2O,GAAA,CAAApe,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA4O,GAAA,EAAmB5O,GAAAA,EAAA4O,GAAA,CAAAre,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA8O,GAAA,EAAmB9O,GAAAA,EAAA8O,GAAA,CAAAve,KAAA,OACnB2f,EAAAlQ,EAAA,CAAA+O,GAAA,EAAmB/O,GAAAA,EAAA+O,GAAA,CAAAxe,KAAA,OACnB2f,EAAAlQ,EAAA,CAAAyX,MAAA,EAAsBzX,GAAAA,EAAAyX,MAAA,CAAAlnB,KAAA,UACtB2f,EAAAlQ,EAAA,CAAA4X,KAAA,EAAqB5X,GAAAA,EAAA4X,KAAA,CAAArnB,KAAA,SACrB2f,EAAAlQ,EAAA,CAAA0X,KAAA,EAAqB1X,GAAAA,EAAA0X,KAAA,CAAAnnB,KAAA,SACrB2f,EAAAlQ,EAAA,CAAA2X,OAAA,EAAuB3X,GAAAA,EAAA2X,OAAA,CAAApnB,KAAA,WAEvB2f,EAAAyS,SAAA,CAAAA,EAEAzS,EAAAqe,SAAA,CAAAA,EAKAb,EAFAH,EAAAvN,IAAA,CACAuN,EAAAnN,EAAA,CACA,OAEA,QAEMmN,EAAAnN,EAAA,CACN,OAEA,OAEAlQ,EAAAwd,kBAAA,CAAAA,EACAxd,EAAA8e,IAAA,CAAArO,SA9JAA,EAAA6M,CAAA,CAAAT,CAAA,MACAx8B,EACA,IAAA2f,EAAA,GASA,GARAA,EAAAlQ,EAAA,CAAAwtB,EAAAxtB,EAAA,CACAkQ,EAAAie,MAAA,CAAAX,EAAAW,MAAA,CACAje,EAAA2e,QAAA,CAAArB,EAAAqB,QAAA,CACA3e,EAAA4e,SAAA,CAAAtB,EAAAsB,SAAA,CACAv+B,EAAAi9B,EAAAt1B,KAAA,CAAA3H,IAAA,CAAAi9B,EAAAt1B,KAAA,CAAA3H,IAAA,UACA2f,EAAAhY,KAAA,EAAoB8H,GAAAwtB,EAAAt1B,KAAA,CAAA8H,EAAA,CAAAzP,KAAAA,CAAA,EACpBA,EAAAi9B,EAAAnhB,EAAA,CAAA9b,IAAA,CAAAi9B,EAAAnhB,EAAA,CAAA9b,IAAA,KACA2f,EAAA7D,EAAA,EAAiBrM,GAAAwtB,EAAAnhB,EAAA,CAAArM,EAAA,CAAAzP,KAAAA,CAAA,EACjB,iBAAAi9B,EAAAO,MAAA,CACA7d,EAAA6d,MAAA,CAAAP,EAAAO,MAAA,MACQ,GAAAvyB,MAAA8J,OAAA,CAAAkoB,EAAAO,MAAA,GACR7d,EAAA6d,MAAA,IACA,QAAAn6B,EAAA,EAAwBA,EAAA45B,EAAAO,MAAA,CAAAr9B,MAAA,CAAwBkD,GAAA,EAChDsc,EAAA6d,MAAA,CAAAn6B,EAAA,CAAA45B,EAAAO,MAAA,CAAAn6B,EAAA,MAGAsc,EAAA6d,MAAA,CAAAp5B,KAAAA,CAEA64B,CAAAA,EAAAa,MAAA,CACAne,EAAAme,MAAA,EAAuBpiB,MAAAuhB,EAAAa,MAAA,CAAApiB,KAAA,CAAAvb,OAAA88B,EAAAa,MAAA,CAAA39B,MAAA,EAEvBwf,EAAAme,MAAA,MAEAne,EAAAiR,KAAA,CAAAqM,EAAArM,KAAA,CACAjR,EAAA1D,QAAA,IACA,QAAA5Y,EAAA,EAAsBA,EAAA45B,EAAAhhB,QAAA,CAAA9b,MAAA,CAA0BkD,GAAA,GAChD,IAAA4oB,EAAA5oB,IAAA45B,EAAAhhB,QAAA,CAAA9b,MAAA,EACAwf,CAAAA,EAAA1D,QAAA,CAAA5Y,EAAA,CAAA+sB,EAAA6M,EAAAhhB,QAAA,CAAA5Y,EAAA,CAAAm5B,EAAAvQ,EACA,CACA,OAAAtM,CACA,EA6HAqd,EAAAA,EAAApM,KAAA,KACAjR,CACA,CAGA,MAAA+e,MAAA,UAAAntB,CAAA,EACA,IAAAoO,EAAAod,WACA,EACAzrB,KAAAC,SAAA,CAAAoO,GAEAA,CACA,EAEA,KAAAwa,UAAA,UAAA5J,CAAA,CAAAD,CAAA,CAAAza,CAAA,EACA,OAAA1F,EAAAiqB,UAAA,MAAAH,MAAA,CAAA1J,EAAAD,GAAAza,EACA,EAGA,IAAA8oB,EAAA,SAAApO,CAAA,CAAAD,CAAA,MAIAsO,EACA,OAAArO,GACA,KArlBA,GAslBAqO,EAAA,cACA,KACA,MAvlBA,GAwlBAA,EAAA,UACA,KACA,MAzlBA,EA0lBAA,EAAA,QACA,KACA,MA3lBA,GA4lBAA,EAAA,UACA,KACA,SACA,eAA2BlrB,EAAa,iCAAiC6c,EAAK,EAC9E,CACA,IAAAsO,EAAA,GAMA,OAJAA,GADA,oBAAkCD,EAClC;cAAA,EAA+BpqB,EAAAsmB,WAAA,CAAkB;AAAA,CADN,CAE3C,iBAAAxK,GACAuO,CAAAA,GAAA,YAA4BvO,EAAQ,aAEpCuO,CACA,CAmDA,MAAA5P,MAAA,UAAA2B,CAAA,EACA,IAAA9b,EAAA,GACA,QAAAzR,EAAA,EAAoBA,EAAAutB,EAAWvtB,GAAA,EAC/ByR,GAAA,IAEA,OAAAA,CACA,EAEA,IAAAgqB,EAAA,SAAAvO,CAAA,CAAAzU,CAAA,EACA,IAAAhH,EAAA,GACA,GAAAgH,EAAAC,IAAA,GAAAtM,EAAAmP,GAAA,EACA,GAAA2R,KAAAA,GAAAA,KAAAA,EAAA,CACA,IAAAjlB,EAAAwQ,EAAA7a,GAAA,CAAAmK,QAAA,KAAA8H,WAAA,EACA5H,CAAAA,EAAAnL,MAAA,OACAmL,CAAAA,EAAA,IAAoBA,EAAI,GAGxBwJ,GADAyb,CAAAA,KAAAA,EAAA,WACAjlB,EAEAA,CADAA,EAAAwQ,EAAAM,GAAA,CAAAhR,QAAA,KAAA8H,WAAA,IACA/S,MAAA,OACAmL,CAAAA,EAAA,IAAoBA,EAAI,GAExBwJ,GAAA,QAAwB,EAAExJ,EAAI,OAE9BwJ,EAAA,KAAoBgH,EAAA7a,GAAA,CAAAmK,QAAA,KAAoB,OAAO,EAAE0Q,EAAAM,GAAA,CAAAhR,QAAA,KAAoB,EAGrE,OAAA0J,CACA,EAEAiqB,EAAA,SAAAxO,CAAA,CAAAzU,CAAA,EACA,IAAAhH,EAAA,GACA,GAAAgH,EAAAC,IAAA,GAAAtM,EAAA0M,GAAA,EACA,GAAAoU,KAAAA,EAAA,CACA,IAAAjlB,EAAAwQ,EAAA7a,GAAA,CAAAmK,QAAA,KAAA8H,WAAA,EACA5H,CAAAA,EAAAnL,MAAA,OACAmL,CAAAA,EAAA,IAAoBA,EAAI,GAExBwJ,EAAA,IAAmBxJ,EAAI,EACvBwQ,EAAAM,GAAA,CAAA/I,IAEA/H,CADAA,EAAAwQ,EAAAM,GAAA,CAAAhR,QAAA,KAAA8H,WAAA,IACA/S,MAAA,OACAmL,CAAAA,EAAA,IAAsBA,EAAI,GAG1BA,EAAA,MAEAwJ,GAAA,QAAwB,EAAExJ,EAAI,OAE9BwJ,EADQgH,EAAAM,GAAA,CAAA/I,IACR,GAAkByI,EAAA7a,GAAA,CAAAmK,QAAA,KAAoB,OAAO,EAAE0Q,EAAAM,GAAA,CAAAhR,QAAA,KAAoB,EAEnE,GAAkB0Q,EAAA7a,GAAA,CAAAmK,QAAA,KAAoB,UAAO,EAG7C,OAAA0J,CACA,EAEAkqB,EAAA,SAAAzO,CAAA,CAAAzU,CAAA,EACA,IAAAhH,EAAA,GACA,GAAAgH,EAAAC,IAAA,GAAAtM,EAAAkP,GAAA,EACA,IAAAxW,EAAAG,KAAArH,GAAA,CAAA6a,EAAA4C,MAAA,CAAAve,MAAA,CAAA8+B,IACA,GAAA1O,KAAAA,GAAAA,KAAAA,EAAA,CACAzb,GAAAyb,KAAAA,EAAA,UACA,QAAAltB,EAAA,EAAwBA,EAAA8E,EAAS9E,GAAA,GACjC,IAAAiI,EACAjI,EAAA,GACAyR,CAAAA,GAAA,KAGAxJ,CADAA,EAAAwQ,EAAA4C,MAAA,CAAArb,EAAA,CAAA+H,QAAA,KAAA8H,WAAA,IACA/S,MAAA,OACAmL,CAAAA,EAAA,IAAsBA,EAAI,GAE1BwJ,GAAAxJ,CACA,CACA,KAAQ,CACRwJ,EAAA,KACA,QAAAzR,EAAA,EAAwBA,EAAA8E,EAAS9E,GAAA,EACjCA,EAAA,GACAyR,CAAAA,GAAA,KAEAA,GAAAgH,EAAA4C,MAAA,CAAArb,EAAA,CAAA+H,QAAA,IAEA,CACAjD,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,EACA2U,CAAAA,GAAA2mB,CAAA,CAEA,CACA,OAAA3mB,CACA,EAEAoqB,EAAA,SAAA3O,CAAA,CAAAzU,CAAA,EACA,IAAAhH,EAAA,GACA,GAAAgH,EAAAC,IAAA,GAAAtM,EAAAgP,GAAA,EACA,IAAAtW,EAAAG,KAAArH,GAAA,CAAA6a,EAAA4C,MAAA,CAAAve,MAAA,CAtvBA,GAuvBA,GAAAowB,KAAAA,GAAAA,KAAAA,EAAA,CACA,IAAA4O,EACAC,EACAC,CACA9O,CAhwBA,KAgwBAA,GACAzb,EAAA,KACAuqB,EAAA,KAEAvqB,EAAA,KACAuqB,EAAA,IAEA,QAAAh8B,EAAA,EAAwBA,EAAA8E,EAAS9E,GAAA,EACjCA,EAAA,GACAyR,CAAAA,GAAA,KAGAsqB,CADAA,EAAAtjB,EAAA4C,MAAA,CAAArb,EAAA,GACA,IAAA+7B,GAAA,KACAD,EAAAC,EAAA,GACAtqB,GAAA,GAAuBqqB,EAAA/zB,QAAA,CAAAi0B,GAAqB,GAAGD,EAAAh0B,QAAA,CAAAi0B,GAAqB,EAAAnsB,WAAA,IACxDksB,GAAA,IAAAA,GAAA,IACZD,EAAAC,EACAA,GAAA,GACAtqB,GAAA,GAAuBqqB,EAAA/zB,QAAA,CAAAi0B,GAAqB,GAAGD,EAAAh0B,QAAA,CAAAi0B,GAAqB,EAAAnsB,WAAA,IAEpE4B,GAAAsqB,EAAAh0B,QAAA,CAAAi0B,GAAAnsB,WAAA,GAGA/K,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,EACA2U,CAAAA,GAAA2mB,CAAA,CAEA,KAAQ,CACR3mB,EAAA,IACA,QAAAzR,EAAA,EAAwBA,EAAA8E,EAAS9E,GAAA,EACjCyR,GAAA3E,EAAAmvB,UAAA,CAAAxjB,EAAA4C,MAAA,CAAArb,EAAA,EAEA8E,EAAA2T,EAAA4C,MAAA,CAAAve,MAAA,EACA2U,CAAAA,GAAA2mB,CAAA,EAEA3mB,GAAA,GACA,CACA,CACA,OAAAA,CACA,EACAyqB,EAAA,SAAAhP,CAAA,CAAAiP,CAAA,CAAA9jB,CAAA,CAAAvb,CAAA,CAAAk+B,CAAA,EACA,GAAAl+B,IAAAA,EACA,SAEA,IAAA29B,EAAA,GACA2B,EAAApB,EAAA,OACA,OAAA9N,GACA,KA9yBA,GA+yBAuN,EAAA2B,EAAAtvB,EAAAsgB,UAAA,CAAA+O,EAAA9jB,EAAAvb,GACA,KACA,MAhzBA,GAizBA,GAAAk+B,EACA,UAAqBluB,EAAAkgB,UAAA,CAAAmP,EAAA9jB,EAAAvb,GAA0C,EAE/D29B,EAAA2B,EAAAtvB,EAAAkgB,UAAA,CAAAmP,EAAA9jB,EAAAvb,GACA,KACA,MApzBA,GAqzBA29B,EAAA3tB,EAAAugB,cAAA,CAAA8O,EAAA9jB,EAAAvb,GACA,KACA,SAEA29B,EAAA3tB,EAAAuvB,gBAAA,CAAAF,EAAA9jB,EAAAvb,EAEA,CACA,OAAA29B,CACA,EAEA6B,EAAA,SAAApP,CAAA,CAAAiP,CAAA,CAAA73B,CAAA,CAAA+T,CAAA,CAAAvb,CAAA,CAAAgzB,CAAA,EACA,IACAyM,EACAC,EACAC,EACAC,EAJAjrB,EAAA,GAKAkrB,EAAAxE,EACAyE,EAAA,gBAAuCzrB,EAAA+lB,gBAAA,CAAuB,IAC9D2F,EAAA,gBAA0C1rB,EAAAgmB,eAAA,CAAsB,IAChE2F,EAAA,UACA9B,EAAA,GACA,OAAA12B,GACA,KAAA8H,EAAA0X,KAAA,CACArS,GAAA4mB,CAEA,MAAAjsB,EAAA2X,OAAA,CACA,KAAA3X,EAAA4X,KAAA,CACA,KAAA5X,EAAAyX,MAAA,CAEA2Y,EAAA1M,EADAyM,CAAAA,EAAAlkB,EAAAvb,CAAA,EAEA2/B,EAAA3M,EACA4M,EAAAP,EAAAr/B,MAAA,CAAA2/B,EACA,KACA,SACA,iCACA,CAqBA,OApBAE,EAAAxE,EACAqE,EAz1BA,IA01BAA,EA11BA,GA21BAG,EAAAvE,EACAsE,EAAA,GACMF,EAAAE,EA71BN,KA81BAC,EAAAvE,EACAsE,EAAAK,GAAAP,GAEAA,EAAA,IAGA/qB,GAFAmrB,EACAV,EAAAhP,EAAAiP,EAAAI,EAAAC,EAAAxB,GACA8B,EACA9B,EAAA,IAEA0B,EAAA,GAGAjrB,CAAAA,GAFAorB,EACAX,EAAAhP,EAAAiP,EAAAM,EAAAC,EAAA1B,GACA8B,CAAA,EAEArrB,EAAAkrB,CACA,EACAK,EAAA,SAAA9P,CAAA,CAAAiP,CAAA,CAAA73B,CAAA,CAAA+T,CAAA,CAAAvb,CAAA,CAAAmgC,CAAA,EACA,IACAV,EACAC,EACAC,EACAC,EAJAjrB,EAAA,GAKAkrB,EAAAxE,EACA0E,EAAA,gBAA0C1rB,EAAAgmB,eAAA,CAAsB,IAChE2F,EAAA,UACA9B,EAAA,GACA,OAAA12B,GACA,KAAA8H,EAAA0X,KAAA,CACArS,GAAA4mB,CAEA,MAAAjsB,EAAA2X,OAAA,CACA,KAAA3X,EAAAyX,MAAA,CACA0Y,EAAAlkB,EACAmkB,EAAA,EACAC,EAAApkB,EACAqkB,EAAAP,EAAAr/B,MAAA,CAAA2/B,EACA,KACA,MAAArwB,EAAA4X,KAAA,CACAuY,EAAAlkB,EAEAokB,EAAApkB,EADAmkB,CAAAA,EAAA1/B,CAAA,EAEA4/B,EAAAP,EAAAr/B,MAAA,CAAA2/B,EACA,KACA,SACA,iCACA,CAqBA,OApBAE,EAAAxE,EACAqE,EA74BA,IA84BAA,EA94BA,GA+4BAG,EAAAvE,EACAsE,EAAA,GACMF,EAAAE,EAj5BN,KAk5BAC,EAAAvE,EACAsE,EAAAK,GAAAP,GAEAA,EAAA,IAGA/qB,GAFAwrB,EACAf,EAAAhP,EAAAiP,EAAAI,EAAAC,EAAAxB,GACA8B,EACA9B,EAAA,IAEA0B,EAAA,GAGAjrB,CAAAA,GAFAorB,EACAX,EAAAhP,EAAAiP,EAAAM,EAAAC,EAAA1B,GACA8B,CAAA,EAEArrB,EAAAkrB,CACA,EAYAO,EAAA,SAAAhQ,CAAA,MAKAmM,EACAC,EACA6D,EACAC,EACAvO,EACAiB,EATA,GAAAjc,OAAAA,EACA,SAEA,IAAApC,EAAA,GA4GA,OApGAA,yHACA8c,EAAAtc,OAAA,KACA,IAAAS,EAAAiZ,CAAA,CAAAoP,EAAA,CAgCA,OA/BA1B,EAAA3mB,EAAA2mB,QAAA,CACAC,EAAA5mB,KAAA3R,IAAA2R,EAAA4mB,QAAA,CAAA5mB,EAAA4mB,QAAA,MACA6D,EAAA,GACAC,EAAA,GACAvO,EAAA,GACAnc,EAAAmc,UAAA,GAAAziB,EAAAiiB,gBAAA,GACA8O,EAAA,GACAtO,EAAA,GACAiB,EAAApd,EAAA8mB,UAAA,EAEA9mB,CAAAA,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAyO,GAAA,EAAAnI,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAA0O,GAAA,IACAqiB,EAAA,GACAtO,EAAA,GACAiB,EAAApd,EAAAjG,WAAA,EAEAiG,EAAAmc,UAAA,GAAAziB,EAAAkiB,iBAAA,GACA8O,EAAA,GACAvO,EAAA,GACAiB,EAAApd,EAAA8mB,UAAA,EAEA9mB,CAAAA,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAA2O,GAAA,EAAArI,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAA4O,GAAA,IACAoiB,EAAA,GACAvO,EAAA,GACAiB,EAAApd,EAAAjG,WAAA,EAOAgF,GAJA,WAAqB4nB,EAAS,WAAWC,EACzC,WAAqB5mB,EAAAjG,WAAA,CACrB,WAAqBiG,EAAAhG,YAAA,CACrB,WAAqBgG,EAAA6a,KAAA,CAAW,UAHkB,CAKlD7a,EAAApO,KAAA,EACA,KAAA8H,EAAAyX,MAAA,CACApS,GAAA,gBAAkCN,EAAAklB,YAAA,CAAmB,qBAAc,EACnE,KACA,MAAAjqB,EAAA4X,KAAA,CACAvS,GAAA,gBAAkCN,EAAAolB,WAAA,CAAkB,gBAAQ,EAC5D,KACA,MAAAnqB,EAAA2X,OAAA,CACAtS,GAAA,gBAAkCN,EAAAI,aAAA,CAAoB,gBAAQ,EAC9D,KACA,MAAAnF,EAAA0X,KAAA,CACArS,GAAA,gBAAkCN,EAAAmlB,WAAA,CAAkB,gBAAQ,EAC5D,KACA,SACA7kB,GAAA,gBAAkCN,EAAAklB,YAAA,CAAmB,aAerD,GAVA5kB,eAAA6Z,EAAAM,MAAA,CAAAlZ,EAAA6a,KAAA,EACA4P,EACA1rB,GAAA,gBAAgCN,EAAA8lB,eAAA,CAAsB,IAC9CmG,GACR3rB,CAAAA,GAAA,gBAAgCN,EAAA+lB,gBAAA,CAAuB,KAEvDzlB,GAAA3E,EAAAotB,cAAA,CAAAxnB,EAAA6mB,MAAA,CAAA7gB,IAAA,EACAhG,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAuO,GAAA,EACAlJ,CAAAA,GAAA,IAAoBoC,CAAA,CAAAnB,EAAA6mB,MAAA,CAAAlhB,KAAA,EAAA1b,IAAA,CAA8B,KAElD+V,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAA6O,GAAA,EACA,IAAA+e,EAAAtnB,EAAA6mB,MAAA,CAAAtd,OAAA,GAAA7P,EAAAiV,WAAA,WACA4Y,EAAAvnB,EAAA6mB,MAAA,CAAApd,OAAA,GAAA/P,EAAAgQ,WAAA,WACA3K,GAAA,MAAsBuoB,EAAS,EAAEC,EAAS,EAAEpmB,CAAA,CAAAnB,EAAA6mB,MAAA,CAAAlhB,KAAA,EAAA1b,IAAA,CAA8B,KAE1E+V,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAwO,GAAA,EACAnJ,CAAAA,GAAA,IAAoBqC,CAAA,CAAApB,EAAA6mB,MAAA,CAAAlhB,KAAA,EAAA1b,IAAA,CAA6B,KAEjD+V,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAmP,GAAA,EACA9J,CAAAA,GAAA,IAAoBgqB,EAAAvO,EAAAxa,EAAA6mB,MAAA,EAA8B,KAElD7mB,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAkP,GAAA,EACA7J,CAAAA,GAAA,IAAoBkqB,EAAAzO,EAAAxa,EAAA6mB,MAAA,EAA8B,KAElD7mB,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAAgP,GAAA,EACA3J,CAAAA,GAAA,IAAoBoqB,EAAA3O,EAAAxa,EAAA6mB,MAAA,EAA8B,KAElD7mB,EAAA6mB,MAAA,CAAA7gB,IAAA,GAAAtM,EAAA0M,GAAA,EACArH,CAAAA,GAAA,IAAoBiqB,EAAAxO,EAAAxa,EAAA6mB,MAAA,EAA8B,KAElD1K,GACApd,CAAAA,GAAA,WAGAA,eACA2rB,GACA3rB,GAAA6qB,EAAApP,EAAA1gB,EAAAkG,EAAApO,KAAA,CAAAoO,EAAAjG,WAAA,CAAAiG,EAAAhG,YAAA,CAAAojB,GACQqN,EACR1rB,GA/GAurB,EA+GA9P,EAAA1gB,EAAAkG,EAAApO,KAAA,CAAAoO,EAAAjG,WAAA,CAAAiG,EAAAhG,YAAA,CAhHA,gBAAsCyE,EAAA8lB,eAAA,CAAsB,KAkH5DxlB,GA5GAurB,EA4GA9P,EAAA1gB,EAAAkG,EAAApO,KAAA,CAAAoO,EAAAjG,WAAA,CAAAiG,EAAAhG,YAAA,CA7GA,gBAAsCyE,EAAAolB,WAAA,CAAkB,KA+GxD9kB,GAAA,cACA,GAGAA,kIAEA,CAKA,MAAAmlB,MAAA,UAAAyG,CAAA,CAAApQ,CAAA,EAEA,IAAAC,EAviCA,EAwiCA,oBAAAmQ,GAAAA,EAAAvgC,MAAA,KACA,IAAAwgC,EAAAD,EAAA3tB,WAAA,GAAA7B,KAAA,KACAyvB,CAAA,QAAAA,EACApQ,EA7iCA,GA8iCQoQ,QAAAA,EACRpQ,EA9iCA,GA+iCQ,QAAAoQ,GACRpQ,CAAAA,EA9iCA,EA8iCA,CAEA,CAKA,OADAzb,EAFAyb,EAAAD,GACAiQ,EAAAhQ,GAzcA,GAIA;UAAA,EAA2B/b,EAAA6lB,eAAA,CAO3B;;;;;;;4CAA8C,EAAe7lB,EAAAklB,YAAA,CAC7D;4CAA8C,EAAellB,EAAAolB,WAAA,CAC7D;4CAA8C,EAAeplB,EAAAmlB,WAAA,CAC7D;4CAA8C,EAAenlB,EAAAI,aAAA,CAI7D;;;0EAA4E,EAAeJ,EAAAolB,WAAA,CAC3F;0EAA4E,EAAeplB,EAAA8lB,eAAA,CAC3F;0EAA4E,EAAe9lB,EAAA+lB,gBAAA,CAC3F;0EAA4E,EAAe/lB,EAAAgmB,eAAA,CAC3F;0EAA4E,EAAehmB,EAAAC,cAAA,CAC3F;6DAA4E,EAAEinB,EAC9E;6DAA4E,EAAEF,EAC9E;6DAA4E,EAAEC,EAE9E;;UAAA,EAA2BjnB,EAAA6lB,eAAA,CAAsB;;;;;;;;;;;;;;;;;;;;AAAA,CAvBA,CAycjD,yBC5nCA,IAAA7lB,EAActP,EAAQ,OACtB2O,EAAkB3O,EAAQ,OAC1B07B,EAAgB17B,EAAQ,OACxBuK,EAAWvK,EAAQ,OAEnBwO,EAAA,iBAIAmtB,EAAA,SAAA1gC,CAAA,CAAAu0B,CAAA,CAAAvsB,CAAA,MACAmM,EACA,IAAAD,EAAAqgB,EAEA,QACA,GAAAv0B,GAAA,GACAkU,EAAA,EACAC,EAAA,EACA,KACA,CACA,oBAAAD,EAAA,CACAA,EAAA,EACAC,EAAAnU,EACA,KACA,CACA,GAAAkU,GAAAlU,EAAA,CACAkU,EAAAlU,EACAmU,EAAAnU,EACA,KACA,CACA,oBAAAgI,EAAA,CACAmM,EAAAnU,EACA,KACA,CACAmU,CAAAA,EAAAD,EAAAlM,CAAA,EACAhI,GACAmU,CAAAA,EAAAnU,CAAA,EAGA,KACA,CACA,OACAkU,IAAAA,EACAC,IAAAA,CACA,CACA,CAIAlT,CAAAA,EAAAg5B,UAAkB,UAAAtlB,CAAA,CAAAgsB,CAAA,MAClBjrB,EACA,oBAAAf,EACA,eAAuBpB,EAAa,gDAGpCmC,EADA,iBAAAirB,EACA,aAEAA,EAcAC,CAPA;;;;OAAA,EAAoBlrB,EAAM;;AAAA,EAE1B+qB,kCAGA,MAAgB,IAAAh0B,KAAW;AAAA,EAC3BkI,EACA,oBAEA,EAkBA1T,EAAA4/B,kBAA0B,UAAA7vB,CAAA,CAAAmf,CAAA,EAC1B,IAIAjf,EACA1J,EALAs5B,EAAA,IACA,kBAAA3Q,GAAAA,KAAAA,GACA2Q,CAAAA,EAAA3Q,CAAA,EAKAjf,EADAF,CAAA,IAAAA,EAAAE,OAAA,CACA,gBAA8BmD,EAAAolB,WAAA,CAAkB,eAEhD,gBAA8BplB,EAAAI,aAAA,CAAoB,gBAGlDjN,EADAwJ,EAAAxJ,KAAA,GAAA8H,EAAA0X,KAAA,CACA,gBAA4B3S,EAAAmlB,WAAA,CAAkB,gBAC1CxoB,EAAAxJ,KAAA,GAAA8H,EAAA4X,KAAA,CACJ,gBAA4B7S,EAAAolB,WAAA,CAAkB,gBAC1CzoB,EAAAxJ,KAAA,GAAA8H,EAAA2X,OAAA,CACJ,gBAA4B5S,EAAAI,aAAA,CAAoB,kBAEhD,gBAA4BJ,EAAAI,aAAA,CAAoB,uBAEhD,IAAAE,EAAA,GAwBA,OAvBAA,GAAA,iBAA2BN,EAAAqmB,WAAA,CAAkB;AAAA,EAC7CoG,GACAnsB,CAAAA,GAAA,YAAwBmsB,EAAI;AAAA,GAoB5BnsB,GAjBA;+BAAA,EAA4CzD,EAC5C;iBAAA,EAA8BmD,EAAAolB,WAAA,CAC9B;cAAA,EAA2BplB,EAAAI,aAAA,CAE3B;6BAAA,EAA0CjN,EAC1C;iBAAA,EAA8B6M,EAAAmlB,WAAA,CAC9B,+BAA0BnlB,EAAAolB,WAAA,CAC1B;aAAA,EAA0BplB,EAAAI,aAAA,CAC1B;8BAAA,EAA2CzD,EAAAhR,MAAA,CAC3C;+BAAA,EAA4CgR,EAAAmkB,OAAA,CAC5C;4BAAA,EAAyCnkB,EAAAuhB,UAAA,CACzC;+BAAA,EAA4CvhB,EAAAkhB,YAAA,CAC5C;0BAAA,EAAuClhB,EAAAmhB,QAAA,CACvC;6BAAA,EAA0CnhB,EAAAokB,WAAA,CAC1C;iCAAA,EAA8CpkB,EAAAqkB,QAAA,CAC9C;+BAAA,EAA4CrkB,EAAAskB,MAAA,CAC5C;kCAAA,EAA+CtkB,EAAAukB,SAAA,CAAiB;;AAAA,CAhBZ,EAsBpDt0B,EAAAgP,aAAqB,UAAAP,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACrB,IAAAsE,EACAC,EACA,oBAAAxE,EAAA,CACA,GAAAA,GAAAD,EAAA1P,MAAA,CACA,SAEAkU,EAAAvE,EAAA,IAAAA,CACA,MACAuE,EAAA,EAEA,oBAAAtE,EAAA,CACA,GAAAA,GAAA,EACA,SAEAuE,EAAAvE,EAAAF,EAAA1P,MAAA,CAAAkU,EAAAxE,EAAA1P,MAAA,CAAAkU,EAAAtE,CACA,MACAuE,EAAAzE,EAAA1P,MAAA,QAEA,EAAAmU,EACAT,EAAA5G,MAAA,WAAA4C,EAAAqB,KAAA,CAAAmD,EAAAC,IAAAlJ,QAAA,YAEA,EACA,EAEAhK,EAAAyzB,aAAqB,UAAAnW,CAAA,EACrB,OAAA7K,EAAA6C,MAAA,UAAAgI,EACA,EAEAtd,EAAAm8B,cAAsB,UAAAxhB,CAAA,EACtB,IAAA/L,EAAA,UACA,OAAA+L,GACA,KAAAtM,EAAAuM,GAAA,CACAhM,EAAA,MACA,KACA,MAAAP,EAAAyM,GAAA,CACAlM,EAAA,MACA,KACA,MAAAP,EAAAuO,GAAA,CACAhO,EAAA,MACA,KACA,MAAAP,EAAAwO,GAAA,CACAjO,EAAA,MACA,KACA,MAAAP,EAAAyO,GAAA,CACAlO,EAAA,MACA,KACA,MAAAP,EAAA0O,GAAA,CACAnO,EAAA,MACA,KACA,MAAAP,EAAA0M,GAAA,CACAnM,EAAA,MACA,KACA,MAAAP,EAAAmP,GAAA,CACA5O,EAAA,MACA,KACA,MAAAP,EAAAkP,GAAA,CACA3O,EAAA,MACA,KACA,MAAAP,EAAAgP,GAAA,CACAzO,EAAA,MACA,KACA,MAAAP,EAAA6O,GAAA,CACAtO,EAAA,MACA,KACA,MAAAP,EAAA2O,GAAA,CACApO,EAAA,MACA,KACA,MAAAP,EAAA4O,GAAA,CACArO,EAAA,MACA,KACA,MAAAP,EAAA8O,GAAA,CACAvO,EAAA,MACA,KACA,MAAAP,EAAA+O,GAAA,CACAxO,EAAA,MACA,KACA,SACA,kCACA,CACA,OAAAA,CACA,EAEA5O,EAAAy8B,aAAqB,UAAAl2B,CAAA,EACrB,IAAAqI,EAAA,UACA,OAAArI,GACA,KAAA8H,EAAAyX,MAAA,CACAlX,EAAA,SACA,KACA,MAAAP,EAAA4X,KAAA,CACArX,EAAA,QACA,KACA,MAAAP,EAAA0X,KAAA,CACAnX,EAAA,QACA,KACA,MAAAP,EAAA2X,OAAA,CACApX,EAAA,UACA,KACA,SACA,iCACA,CACA,OAAAA,CACA,EAEA5O,EAAAk+B,UAAkB,EAClB,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,KACA,MACA,KACA,KACA,KACA,KACA,KACA,KACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,KACA,MACA,MACA,KACA,KACA,KACA,KACA,SACA,IACA,QACA,IACA,IACA,IACA,QACA,QACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,QACA,IACA,QACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,QACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,MACA,CAEAl+B,EAAA+T,SAAiB,UAAApJ,CAAA,EACjB,IAAAiJ,EAAAjJ,EAAAX,QAAA,KAAA8H,WAAA,GACA,OAAA8B,EAAA7U,MAAA,EACA,OACA,OACA,OACA6U,EAAA,IAAeA,EAAG,EAClB,KACA,QACA,OACAA,EAAA,KAAgBA,EAAG,EACnB,KACA,QACA,KACA,QACAA,EAAA,MAAiBA,EAAG,EACpB,KACA,SACA,kCACA,CACA,OAAAA,CACA,EAEA5T,EAAAivB,UAAkB,UAAAxgB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EAClB,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,iDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,GAAA+4B,EAAA5sB,GAAA,CAAA4sB,EAAA7sB,GAAA,EACArE,GAAAH,CAAA,CAAAqxB,EAAA7sB,GAAA,EACA,QAAAhR,EAAA69B,EAAA7sB,GAAA,GAAiChR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,EACjD2M,GAAA,IAAiBH,CAAA,CAAAxM,EAAA,CAAS,EAG1B,OAAA2M,CACA,EAEA5O,EAAAqvB,UAAkB,UAAA5gB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EAClB,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,iDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,GAAA+4B,EAAA5sB,GAAA,CAAA4sB,EAAA7sB,GAAA,EACArE,GAAA,MAAiB5O,EAAA+T,SAAA,CAAAtF,CAAA,CAAAqxB,EAAA7sB,GAAA,GAAqC,EACtD,QAAAhR,EAAA69B,EAAA7sB,GAAA,GAAiChR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,EACjD2M,GAAA,OAAoB5O,EAAA+T,SAAA,CAAAtF,CAAA,CAAAxM,EAAA,EAA4B,EAGhD,OAAA2M,CACA,EACA5O,EAAA+/B,mBAA2B,UAAAtxB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EAC3B,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,iDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,GAAA+4B,EAAA5sB,GAAA,CAAA4sB,EAAA7sB,GAAA,CACA,QAAAhR,EAAA69B,EAAA7sB,GAAA,CAA6BhR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,EAC7C2M,GAAA,MAAmBH,CAAA,CAAAxM,EAAA,CAAA+H,QAAA,MAAuB,EAG1C,OAAA4E,CACA,EAWA5O,EAAAsvB,cAAsB,UAAA7gB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACtB,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,qDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,GAAA+4B,EAAA5sB,GAAA,CAAA4sB,EAAA7sB,GAAA,CACA,QAAAhR,EAAA69B,EAAA7sB,GAAA,CAA6BhR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,OAhB7C0I,EACA,EADAA,EAiBA8D,CAAA,CAAAxM,EAAA,GAhBA,OAAA0I,GAAA,OAGAA,EAAA,QAFA,EAKA,CAJA,EAiBAiE,GAAA,MAAqB5O,EAAA+T,SAAA,CAAAtF,CAAA,CAAAxM,EAAA,EAA4B,EAFjD2M,GAAA,KAAoBH,CAAA,CAAAxM,EAAA,EAAU,EAM9B,OAAA2M,CACA,EAEA5O,EAAAggC,gBAAwB,UAAAvxB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACxB,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,uDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,GAAA+4B,EAAA5sB,GAAA,CAAA4sB,EAAA7sB,GAAA,EACArE,GAAA,MAAiB5O,EAAA+T,SAAA,CAAAtF,CAAA,CAAAqxB,EAAA7sB,GAAA,GAAqC,EACtD,QAAAhR,EAAA69B,EAAA7sB,GAAA,GAAiChR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,EACjD2M,GAAA,OAAoB5O,EAAA+T,SAAA,CAAAtF,CAAA,CAAAxM,EAAA,EAA4B,EAGhD,OAAA2M,CACA,EAEA5O,EAAAovB,YAAoB,UAAA3gB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,EACpB,IAAA6H,EAAA,GACA,IAAA/E,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,mDAEpC,IAAAwtB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,QAAA9E,EAAA69B,EAAA7sB,GAAA,CAA2BhR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,GAC3C,IAAA0I,EAAA8D,CAAA,CAAAxM,EAAA,CACA0I,GAAA,IAAAA,GAAA,IACAiE,GAAAiF,OAAAC,YAAA,CAAAnJ,GAEAiE,GAAA,MAAmB5O,EAAA+T,SAAA,CAAApJ,GAAwB,EAG3C,OAAAiE,CACA,EAEA5O,EAAAs+B,gBAAwB,UAAA7vB,CAAA,CAAAwE,CAAA,CAAAlM,CAAA,MAKxB4D,EAJA,IAAAd,MAAA8J,OAAA,CAAAlF,GACA,eAAuB6D,EAAa,uDAEpC,IAAAoB,EAAA,GAEAosB,EAAAL,EAAAhxB,EAAA1P,MAAA,CAAAkU,EAAAlM,GACA,QAAA9E,EAAA69B,EAAA7sB,GAAA,CAA2BhR,EAAA69B,EAAA5sB,GAAA,CAAgBjR,GAAA,EAE3C0I,CADAA,EAAA8D,CAAA,CAAAxM,EAAA,EACA,IAAA0I,MAAAA,EAEA+I,GAAA,gBAA8BN,EAAAC,cAAA,CAAqB,IAAIrT,EAAAk+B,UAAA,CAAAvzB,EAAA,CAAyB,SAC1EA,EAAA,IAEN+I,GAAA,gBAA8BN,EAAAC,cAAA,CAAqB,MAAMrT,EAAA+T,SAAA,CAAApJ,GAAwB,SAGjF+I,GAAA1T,EAAAk+B,UAAA,CAAAvzB,EAAA,CAGA,OAAA+I,CACA,EAEA1T,EAAA+U,iBAAyB,UAAApJ,CAAA,EACzB,IAAA8C,EAAAgE,EAAA6C,MAAA,UAAA3J,GACA,YAAA2yB,gBAAA,CAAA7vB,EACA,sCCrhBA3O,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAigC,WAAmB,CAAGjgC,EAAAkgC,OAAe,QAErC,IAAAC,EAAer8B,EAAQ,OACvBqJ,EAAgBrJ,EAAQ,OACxBs8B,EAAyBt8B,EAAQ,OAEjC,SAAAo8B,EAAAjhC,CAAA,EACA,OACAA,KAAAA,EACAohC,KAAA,CAAAhwB,EAAA,GAAAiwB,IAAA,GAAAH,EAAAE,IAAA,EAAAphC,EAAAoR,EAAA,GAAAlD,EAAA3E,WAAA,KAAA83B,IACAj4B,YAAA8E,EAAA9E,WAAA,CAEA,CACArI,EAAAkgC,OAAe,CAAAA,EAKflgC,EAAAigC,WAAmB,CAJnB,SAAAM,CAAA,CAAAC,CAAA,EACA,IAAArhC,EAAA,MAAAihC,EAAAK,WAAA,GAAiE,GAAAF,CAAA,IAAAL,EAAAjhC,EAAA,GACjE,OAAAa,OAAA4gC,MAAA,EAA2B,GAAAvhC,EAAAqhC,EAAA,CAAArhC,OAAAA,CAAA,EAC3B,sCClBAW,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2gC,aAAqB,CAAG3gC,EAAA4gC,IAAY,QAGpC,IAAAC,EAAqB/8B,EAAQ,OAC7BE,EAAmBF,EAAQ,OAC3BM,EAAA3C,OAAA,GACA4C,EAAA5C,OAAA,EAoIAzB,CAAAA,EAAA4gC,IAAY,CAxHZ,SAAA/V,CAAA,CAAAiW,CAAA,EACA,IAAAC,EAAA,CAAAC,EAAA7Q,KACA,IAAA8Q,EAAA9Q,EAAA+Q,MAAA,GACA,OAAAF,EAAAC,EAAA9Q,CACA,EACAhoB,EAAA,GAGA,EAAiBg5B,QAFjBj6B,KAAA4oB,IAAA,CAAAgR,EAAAM,GAAA,EAEiBC,WADjB,GAAAD,CAAAA,EAAA,EACiB,GAEjB,OACAL,gBAAAA,EAEAO,aAAAC,CAAA,CAAApjC,CAAA,EACA,IAAAkT,EAAAwZ,EAAA2W,IAAA,CACAC,EAAAF,EACA,KAAApjC,EAAAiG,GACAjG,EAAAkG,GACAgN,CAAAA,EAAAA,EAAA7Q,GAAA,CAAAihC,EAAA,EACAA,EAAAA,EAAAC,MAAA,GACAvjC,IAAAkG,EAEA,OAAAgN,CACA,EAWAswB,iBAAAJ,CAAA,CAAAH,CAAA,EACA,IAAoBD,QAAAA,CAAA,CAAAE,WAAAA,CAAA,EAAsBl5B,EAAAi5B,GAC1CQ,EAAA,GACAvwB,EAAAkwB,EACAtD,EAAA5sB,EACA,QAAAwwB,EAAA,EAAiCA,EAAAV,EAAkBU,IAAA,CACnD5D,EAAA5sB,EACAuwB,EAAA98B,IAAA,CAAAm5B,GAEA,QAAAh8B,EAAA,EAAgCA,EAAAo/B,EAAgBp/B,IAChDg8B,EAAAA,EAAAz9B,GAAA,CAAA6Q,GACAuwB,EAAA98B,IAAA,CAAAm5B,GAEA5sB,EAAA4sB,EAAAyD,MAAA,EACA,CACA,OAAAE,CACA,EAQAhB,KAAAQ,CAAA,CAAAU,CAAA,CAAA3jC,CAAA,EAGA,IAAoBgjC,QAAAA,CAAA,CAAAE,WAAAA,CAAA,EAAsBl5B,EAAAi5B,GAC1C/vB,EAAAwZ,EAAA2W,IAAA,CACAO,EAAAlX,EAAAmX,IAAA,CACAC,EAAAxgC,OAAA,GAAA2/B,EAAA,GACAc,EAAA,GAAAd,EACAe,EAAA1gC,OAAA2/B,GACA,QAAAS,EAAA,EAAiCA,EAAAV,EAAkBU,IAAA,CACnD,IAAAzG,EAAAyG,EAAAR,EAEAe,EAAAhkC,OAAAD,EAAA8jC,GAEA9jC,IAAAgkC,EAGAC,EAAAf,IACAe,GAAAF,EACA/jC,GAAAkG,GAUA,IAAAg+B,EAAAjH,EAAAl0B,KAAAo7B,GAAA,CAAAF,GAAA,EACAG,EAAAV,EAAA,KACAW,EAAAJ,EAAA,CACAA,CAAA,IAAAA,EAEAL,EAAAA,EAAAvhC,GAAA,CAAAugC,EAAAwB,EAAAT,CAAA,CANA1G,EAMA,GAGA/pB,EAAAA,EAAA7Q,GAAA,CAAAugC,EAAAyB,EAAAV,CAAA,CAAAO,EAAA,EAEA,CAMA,OAAqBhxB,EAAAA,EAAA0wB,EAAAA,CAAA,CACrB,EACAU,WAAAC,CAAA,CAAAC,CAAA,CAAAxkC,CAAA,CAAAykC,CAAA,EAEA,IAAAxB,EAAAsB,EAAAG,YAAA,IAEAC,EAAAH,EAAAxxB,GAAA,CAAAuxB,GAOA,OANAI,IACAA,EAAA,KAAAnB,gBAAA,CAAAe,EAAAtB,GACA,IAAAA,GACAuB,EAAAr7B,GAAA,CAAAo7B,EAAAE,EAAAE,KAGA,KAAAlC,IAAA,CAAAQ,EAAA0B,EAAA3kC,EACA,CACA,CACA,EAoBA6B,EAAA2gC,aAAqB,CAlBrB,SAAAoC,CAAA,EAYA,MAXA,GAAAlC,EAAAmC,aAAA,EAAAD,EAAAE,EAAA,EACA,GAAAj/B,EAAAk/B,cAAA,EAAAH,EAAA,CACA5kC,EAAA,SACAe,EAAA,SACAikC,GAAA,QACAC,GAAA,OACA,EAAK,CACLC,WAAA,gBACAC,YAAA,eACA,GAEAxjC,OAAA4gC,MAAA,EACA,MAAAG,EAAA0C,OAAA,EAAAR,EAAA5kC,CAAA,CAAA4kC,EAAAM,UAAA,EACA,GAAAN,CAAA,CACa1xB,EAAA0xB,EAAAE,EAAA,CAAAO,KAAA,EAEb,sCC7JA1jC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAyjC,YAAoB,CAAGzjC,EAAA0jC,UAAkB,CAAG1jC,EAAA2jC,aAAqB,CAAG3jC,EAAA4jC,kBAA0B,CAAG5jC,EAAA6jC,kBAA0B,QAC3H,IAAAhD,EAAqB/8B,EAAQ,OAC7BE,EAAmBF,EAAQ,OAS3BggC,EAAA9/B,EAAA+/B,eAAA,CAEA,SAAAC,EAAA/jC,CAAA,CAAAlB,CAAA,EACA,GAAAkB,EAAA,GAAAA,GAAA,KAAAlB,EACA,qCAAiDkB,EAAA,QAAO,EAASlB,EAAO,GAExE,IAAAiN,EAAAnC,MAAAC,IAAA,EAA6B/K,OAAAA,CAAA,GAAQkH,IAAA,IACrC,QAAAhE,EAAAlD,EAAA,EAA6BkD,GAAA,EAAQA,IACrC+J,CAAA,CAAA/J,EAAA,CAAAhC,IAAAA,EACAA,KAAA,EAEA,WAAAvB,WAAAsN,EACA,CAQA,SAAAxN,EAAA2xB,CAAA,EACA,IAAAA,CAAAA,aAAAzxB,UAAA,EACA,kCACA,CACA,SAAAulC,EAAA9T,CAAA,EACA,IAAA/xB,OAAAC,aAAA,CAAA8xB,GACA,8BACA,CAGA,SAAA0T,EAAAp3B,CAAA,CAAAy3B,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA5lC,EAAAiO,GACAjO,EAAA0lC,GACAD,EAAAE,GAEAD,EAAAnlC,MAAA,MACAmlC,CAAAA,EAAAE,EAAA,GAAApgC,EAAAwE,WAAA,KAAAxE,EAAAyE,WAAA,uBAAAy7B,GAAA,EACA,IAAY9kC,UAAAilC,CAAA,CAAAhlC,SAAAilC,CAAA,EAA8CF,EAC1DG,EAAAr9B,KAAA4oB,IAAA,CAAAqU,EAAAE,GACA,GAAAE,EAAA,IACA,kCACA,IAAAC,EAAA,GAAAxgC,EAAAwE,WAAA,EAAA07B,EAAAF,EAAAE,EAAAnlC,MAAA,KACA0lC,EAAAT,EAAA,EAAAM,GACAI,EAAAV,EAAAG,EAAA,GACA5lC,EAAA,MAAAgmC,GACAI,EAAAP,EAAA,GAAApgC,EAAAwE,WAAA,EAAAi8B,EAAAh4B,EAAAi4B,EAAAV,EAAA,KAAAQ,GACAjmC,CAAAA,CAAA,IAAA6lC,EAAA,GAAApgC,EAAAwE,WAAA,EAAAm8B,EAAAX,EAAA,KAAAQ,IACA,QAAAviC,EAAA,EAAoBA,GAAAsiC,EAAUtiC,IAAA,CAC9B,IAAA2iC,EAAA,CAAAC,SAnCApmC,CAAA,CAAAF,CAAA,EACA,IAAA8K,EAAA,IAAA3K,WAAAD,EAAAM,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAxD,EAAAM,MAAA,CAAckD,IAClCoH,CAAA,CAAApH,EAAA,CAAAxD,CAAA,CAAAwD,EAAA,CAAA1D,CAAA,CAAA0D,EAAA,CAEA,OAAAoH,CACA,EA6BAs7B,EAAApmC,CAAA,CAAA0D,EAAA,IAAA+hC,EAAA/hC,EAAA,KAAAuiC,EAAA,CACAjmC,CAAA,CAAA0D,EAAA,CAAAmiC,EAAA,GAAApgC,EAAAwE,WAAA,KAAAo8B,GACA,CAEA,MAAAE,CADA,EAAA9gC,EAAAwE,WAAA,KAAAjK,GACAuR,KAAA,GAAAq0B,EACA,CAOA,SAAAP,EAAAn3B,CAAA,CAAAy3B,CAAA,CAAAC,CAAA,CAAAvzB,CAAA,CAAAwzB,CAAA,EAUA,GATA5lC,EAAAiO,GACAjO,EAAA0lC,GACAD,EAAAE,GAGAD,EAAAnlC,MAAA,MAEAmlC,CAAAA,EAAAE,EAAAjlC,MAAA,EAAyBiJ,MADzBlB,KAAA4oB,IAAA,GAAAlf,EAAA,EACyB,GAAO/J,MAAA,IAAA7C,EAAAyE,WAAA,wBAAA5B,MAAA,CAAAq9B,GAAAt8B,MAAA,IAEhCu8B,EAAA,OAAAD,EAAAnlC,MAAA,KACA,sDACA,OAAAqlC,EAAAjlC,MAAA,EAAuBiJ,MAAA+7B,CAAA,GACvBt9B,MAAA,CAAA4F,GACA5F,MAAA,CAAAm9B,EAAAG,EAAA,IAEAt9B,MAAA,CAAAq9B,GACAr9B,MAAA,CAAAm9B,EAAAE,EAAAnlC,MAAA,KACA6I,MAAA,EACA,CAUA,SAAA+7B,EAAAl3B,CAAA,CAAAkT,CAAA,CAAAolB,CAAA,MAeAC,EAdA,GAAAhhC,EAAAk/B,cAAA,EAAA6B,EAAA,CACAb,IAAA,qBACA7yB,EAAA,SACAV,EAAA,gBACAC,EAAA,gBACA3R,KAAA,MACA,GACA,IAAYoS,EAAAA,CAAA,CAAAT,EAAAA,CAAA,CAAAD,EAAAA,CAAA,CAAA1R,KAAAA,CAAA,CAAAgmC,OAAAA,CAAA,CAAAf,IAAAgB,CAAA,EAAmCH,EAC/CvmC,EAAAiO,GACAw3B,EAAAtkB,GACA,IAAAukB,EAAAiB,SA5GAnsB,CAAA,EACA,GAAAA,aAAAta,WACA,OAAAsa,EACA,oBAAAA,EACA,SAAAhV,EAAAyE,WAAA,EAAAuQ,EACA,gDACA,EAsGAksB,GAEAE,EAAAl+B,KAAA4oB,IAAA,EAAAuV,EADAr7B,QAAA,IAAAjL,MAAA,CACA6R,CAAAA,EAAA,GACA00B,EAAA3lB,EAAAhP,EAAAy0B,EAEA,GAAAH,QAAAA,EACAD,EAAAnB,EAAAp3B,EAAAy3B,EAAAoB,EAAArmC,QAEA,GAAAgmC,QAAAA,EACAD,EAAApB,EAAAn3B,EAAAy3B,EAAAoB,EAAA10B,EAAA3R,QAEA,GAAAgmC,mBAAAA,EAEAD,EAAAv4B,OAGA,6CAEA,IAAA6e,EAAA,MAAA3L,GACA,QAAA1d,EAAA,EAAoBA,EAAA0d,EAAW1d,IAAA,CAC/B,IAAAsjC,EAAA,MAAA50B,GACA,QAAA3L,EAAA,EAAwBA,EAAA2L,EAAO3L,IAAA,CAC/B,IAAAwgC,EAAAJ,EAAApgC,CAAAA,EAAA/C,EAAA0O,CAAAA,EACA80B,EAAAT,EAAAz9B,QAAA,CAAAi+B,EAAAA,EAAAJ,EACAG,CAAAA,CAAA,CAAAvgC,EAAA,IAAA67B,EAAA/zB,GAAA,EAAAg3B,EAAA2B,GAAAp0B,EACA,CACAia,CAAA,CAAArpB,EAAA,CAAAsjC,CACA,CACA,OAAAja,CACA,CA3EAtrB,EAAA6jC,kBAA0B,CAAAA,EA0B1B7jC,EAAA4jC,kBAA0B,CAAAA,EAkD1B5jC,EAAA2jC,aAAqB,CAAAA,EAWrB3jC,EAAA0jC,UAAkB,CAVlB,SAAAgC,CAAA,CAAArrB,CAAA,EAEA,IAAAsrB,EAAAtrB,EAAAA,GAAA,IAAAxQ,MAAAC,IAAA,CAAA7H,GAAA2jC,OAAA,IACA,OAAAhhC,EAAAC,KACA,IAAAghC,EAAAC,EAAAC,EAAAC,EAAA,CAAAL,EAAAtrB,GAAA,IAAAlG,EAAA8xB,MAAA,EAAAC,EAAAjkC,IAAAyjC,EAAAllC,GAAA,CAAAklC,EAAAS,GAAA,CAAAD,EAAAthC,GAAA3C,KAGA,OAFA2C,EAAA8gC,EAAAU,GAAA,CAAAP,EAAAC,GACAjhC,EAAA6gC,EAAAS,GAAA,CAAAthC,EAAA6gC,EAAAU,GAAA,CAAAL,EAAAC,IACA,CAAiBphC,EAAAA,EAAAC,EAAAA,CAAA,CACjB,CACA,EA0BA7E,EAAAyjC,YAAoB,CAxBpB,SAAA4C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,sBAAAD,EACA,4CACA,OAGAE,YAAA/5B,CAAA,CAAAs4B,CAAA,EACA,IAAAzZ,EAAAqY,EAAAl3B,EAAA,GAA8C,GAAA85B,CAAA,CAAArC,IAAAqC,EAAArC,GAAA,IAAAa,CAAA,GAC9C0B,EAAAJ,EAAAK,UAAA,CAAAJ,EAAAhb,CAAA,MACAqb,EAAAN,EAAAK,UAAA,CAAAJ,EAAAhb,CAAA,MACAoX,EAAA+D,EAAAjmC,GAAA,CAAAmmC,GAAAC,aAAA,GAEA,OADAlE,EAAAmE,cAAA,GACAnE,CACA,EAGAoE,cAAAr6B,CAAA,CAAAs4B,CAAA,EACA,IAAAzZ,EAAAqY,EAAAl3B,EAAA,GAA8C,GAAA85B,CAAA,CAAArC,IAAAqC,EAAAQ,SAAA,IAAAhC,CAAA,GAC9CrC,EAAA2D,EAAAK,UAAA,CAAAJ,EAAAhb,CAAA,MAAAsb,aAAA,GAEA,OADAlE,EAAAmE,cAAA,GACAnE,CACA,CACA,CACA,sCCjLA5iC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAgnC,cAAsB,CAAGhnC,EAAAinC,gBAAwB,CAAGjnC,EAAAknC,mBAA2B,CAAGlnC,EAAAmnC,mBAA2B,CAAGnnC,EAAAonC,UAAkB,CAAGpnC,EAAAqnC,SAAiB,CAAGrnC,EAAAsnC,KAAa,CAAGtnC,EAAAujC,OAAe,CAAGvjC,EAAAunC,UAAkB,CAAGvnC,EAAAwnC,KAAa,CAAGxnC,EAAAynC,aAAqB,CAAGznC,EAAA0nC,KAAa,CAAG1nC,EAAAgjC,aAAqB,CAAGhjC,EAAA2nC,YAAoB,CAAG3nC,EAAA4nC,MAAc,CAAG5nC,EAAA6nC,aAAqB,CAAG7nC,EAAA8nC,MAAc,CAAG9nC,EAAA+nC,IAAY,CAAG/nC,EAAAgoC,GAAW,CAAGhoC,EAAA8M,GAAW,QAGzZ,IAAA9I,EAAmBF,EAAQ,OAE3BM,EAAA3C,OAAA,GAAA4C,EAAA5C,OAAA,GAAA6C,EAAA7C,OAAA,GAAAwmC,EAAAxmC,OAAA,GAEAymC,EAAAzmC,OAAA,GAAA0mC,EAAA1mC,OAAA,GAAA2mC,EAAA3mC,OAAA,GAIA,SAAAqL,EAAArO,CAAA,CAAAF,CAAA,EACA,IAAAwR,EAAAtR,EAAAF,EACA,OAAAwR,GAAA3L,EAAA2L,EAAAxR,EAAAwR,CACA,CASA,SAAAi4B,EAAAhmB,CAAA,CAAAqmB,CAAA,CAAAC,CAAA,EACA,GAAAA,GAAAlkC,GAAAikC,EAAAjkC,EACA,yCACA,GAAAkkC,IAAAjkC,EACA,OAAAD,EACA,IAAA4H,EAAA3H,EACA,KAAAgkC,EAAAjkC,GACAikC,EAAAhkC,GACA2H,CAAAA,EAAA,EAAAgW,EAAAsmB,CAAA,EACAtmB,EAAA,EAAAA,EAAAsmB,EACAD,IAAAhkC,EAEA,OAAA2H,CACA,CAaA,SAAA87B,EAAA5pC,CAAA,CAAAoqC,CAAA,EACA,GAAApqC,IAAAkG,GAAAkkC,GAAAlkC,EACA,yDAAqElG,EAAA,KAAQ,EAAMoqC,EAAO,GAI1F,IAAA7pC,EAAAqO,EAAA5O,EAAAoqC,GACA/pC,EAAA+pC,EAEA1jC,EAAAR,EAAAS,EAAAR,EAAAinB,EAAAjnB,EAAAkkC,EAAAnkC,EACA,KAAA3F,IAAA2F,GAAA,CAEA,IAAAokC,EAAAjqC,EAAAE,EACAgqC,EAAAlqC,EAAAE,EACAkS,EAAA/L,EAAA0mB,EAAAkd,EACArqC,EAAA0G,EAAA0jC,EAAAC,CAEAjqC,CAAAA,EAAAE,EAAAA,EAAAgqC,EAAA7jC,EAAA0mB,EAAAzmB,EAAA0jC,EAAAjd,EAAA3a,EAAA43B,EAAApqC,CACA,CAEA,GAAAuqC,IAAArkC,EACA,sCACA,OAAAyI,EAAAlI,EAAA0jC,EACA,CAUA,SAAAT,EAAAnF,CAAA,MAOAiG,EAAAC,EAAAC,EADA,IAAAC,EAAA,CAAApG,EAAAr+B,CAAA,EAAAC,EAIA,IAAAqkC,EAAAjG,EAAAr+B,EAAAukC,EAAA,EAA6BD,EAAArkC,IAAAF,EAAiBukC,GAAArkC,EAAAskC,KAG9C,IAAAC,EAAAvkC,EAAkBukC,EAAAnG,GAAAsF,EAAAa,EAAAC,EAAApG,KAAAA,EAAAr+B,EAA2CwkC,KAG7D,GAAAD,IAAAA,EAAA,CACA,IAAAG,EAAA,CAAArG,EAAAr+B,CAAA,EAAA6jC,EACA,gBAAAjF,CAAA,CAAA9kC,CAAA,EACA,IAAAy9B,EAAAqH,EAAA+E,GAAA,CAAA7pC,EAAA4qC,GACA,IAAA9F,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAEA,IAAAsN,EAAA,CAAAP,EAAAtkC,CAAA,EAAAC,EACA,gBAAA2+B,CAAA,CAAA9kC,CAAA,EAEA,GAAA8kC,EAAA+E,GAAA,CAAA7pC,EAAA2qC,KAAA7F,EAAAhC,GAAA,CAAAgC,EAAAkG,GAAA,EACA,uCACA,IAAAV,EAAAG,EAEAQ,EAAAnG,EAAA+E,GAAA,CAAA/E,EAAAkD,GAAA,CAAAlD,EAAAkG,GAAA,CAAAN,GAAAF,GACA/jC,EAAAq+B,EAAA+E,GAAA,CAAA7pC,EAAA+qC,GACA3qC,EAAA0kC,EAAA+E,GAAA,CAAA7pC,EAAAwqC,GACA,MAAA1F,EAAA+F,GAAA,CAAAzqC,EAAA0kC,EAAAkG,GAAA,IACA,GAAAlG,EAAA+F,GAAA,CAAAzqC,EAAA0kC,EAAAzB,IAAA,EACA,OAAAyB,EAAAzB,IAAA,CAEA,IAAA7wB,EAAA,EACA,QAAA04B,EAAApG,EAAAgG,GAAA,CAAA1qC,GACA,EADqCkqC,IACrCxF,EAAA+F,GAAA,CAAAK,EAAApG,EAAAkG,GAAA,EAD4Cx4B,IAG5C04B,EAAApG,EAAAgG,GAAA,CAAAI,GAGA,IAAAC,EAAArG,EAAA+E,GAAA,CAAAoB,EAAA/kC,GAAA5C,OAAAgnC,EAAA93B,EAAA,IACAy4B,EAAAnG,EAAAgG,GAAA,CAAAK,GACA1kC,EAAAq+B,EAAAkD,GAAA,CAAAvhC,EAAA0kC,GACA/qC,EAAA0kC,EAAAkD,GAAA,CAAA5nC,EAAA6qC,GACAX,EAAA93B,CACA,CACA,OAAA/L,CACA,CACA,CAEA,SAAAgjC,EAAAlF,CAAA,EAKA,GAAAA,EAAAwF,IAAAD,EAAA,CAKA,IAAAc,EAAA,CAAArG,EAAAr+B,CAAA,EAAA6jC,EACA,gBAAAjF,CAAA,CAAA9kC,CAAA,EACA,IAAAy9B,EAAAqH,EAAA+E,GAAA,CAAA7pC,EAAA4qC,GAEA,IAAA9F,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAEA,GAAA8G,EAAA0F,IAAAD,EAAA,CACA,IAAAhb,EAAA,CAAAuV,EAAAyF,CAAA,EAAAC,EACA,gBAAAnF,CAAA,CAAA9kC,CAAA,EACA,IAAAgN,EAAA83B,EAAAkD,GAAA,CAAAhoC,EAAAmG,GACAikC,EAAAtF,EAAA+E,GAAA,CAAA78B,EAAAgiB,GACAoc,EAAAtG,EAAAkD,GAAA,CAAAhoC,EAAAoqC,GACAtmC,EAAAghC,EAAAkD,GAAA,CAAAlD,EAAAkD,GAAA,CAAAoD,EAAAjlC,GAAAikC,GACA3M,EAAAqH,EAAAkD,GAAA,CAAAoD,EAAAtG,EAAAuG,GAAA,CAAAvnC,EAAAghC,EAAAkG,GAAA,GACA,IAAAlG,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAwBA,OAAAiM,EAAAnF,EACA,CA3LAjhC,OAAA,GAAAA,OAAA,IAMAzB,EAAA8M,GAAW,CAAAA,EAsBX9M,EAAAgoC,GAAW,CAAAA,EAUXhoC,EAAA+nC,IAAY,CARZ,SAAAnjC,CAAA,CAAAyjC,CAAA,CAAAC,CAAA,EACA,IAAAt8B,EAAApH,EACA,KAAAyjC,KAAAjkC,GACA4H,GAAAA,EACAA,GAAAs8B,EAEA,OAAAt8B,CACA,EA2BAhM,EAAA8nC,MAAc,CAAAA,EAiEd9nC,EAAA6nC,aAAqB,CAAAA,EA2DrB7nC,EAAA4nC,MAAc,CAAAA,EAGd5nC,EAAA2nC,YAAoB,CADpB,CAAA3lB,EAAAsmB,IAAA,CAAAx7B,EAAAkV,EAAAsmB,GAAAjkC,CAAA,IAAAA,EAGA,IAAAolC,EAAA,CACA,kDACA,oCACA,4BACA,CAoBA,SAAA/B,EAAA3F,CAAA,CAAA/f,CAAA,CAAAqmB,CAAA,EAGA,GAAAA,EAAAjkC,EACA,kCACA,GAAAikC,IAAAjkC,EACA,OAAA29B,EAAAoH,GAAA,CACA,GAAAd,IAAAhkC,EACA,OAAA2d,EACA,IAAA3Q,EAAA0wB,EAAAoH,GAAA,CACA1H,EAAAzf,EACA,KAAAqmB,EAAAjkC,GACAikC,EAAAhkC,GACAgN,CAAAA,EAAA0wB,EAAAoE,GAAA,CAAA90B,EAAAowB,EAAA,EACAA,EAAAM,EAAAkH,GAAA,CAAAxH,GACA4G,IAAAhkC,EAEA,OAAAgN,CACA,CAMA,SAAAo2B,EAAA1F,CAAA,CAAA2H,CAAA,EACA,IAAAh9B,EAAA,MAAAg9B,EAAA3qC,MAAA,EAEA4qC,EAAAD,EAAAzD,MAAA,EAAAC,EAAAlkB,EAAA/f,IACA,EAAA2nC,GAAA,CAAA5nB,GACAkkB,GACAx5B,CAAA,CAAAzK,EAAA,CAAAikC,EACAnE,EAAAoE,GAAA,CAAAD,EAAAlkB,IACK+f,EAAAoH,GAAA,EAELU,EAAA9H,EAAA+H,GAAA,CAAAH,GAQA,OANAD,EAAAK,WAAA,EAAA7D,EAAAlkB,EAAA/f,IACA,EAAA2nC,GAAA,CAAA5nB,GACAkkB,GACAx5B,CAAA,CAAAzK,EAAA,CAAA8/B,EAAAoE,GAAA,CAAAD,EAAAx5B,CAAA,CAAAzK,EAAA,EACA8/B,EAAAoE,GAAA,CAAAD,EAAAlkB,IACK6nB,GACLn9B,CACA,CAgBA,SAAA62B,EAAAplC,CAAA,CAAAklC,CAAA,EAEA,IAAA2G,EAAA3G,KAAArgC,IAAAqgC,EAAAA,EAAAllC,EAAA6L,QAAA,IAAAjL,MAAA,CAEA,OAAaskC,WAAA2G,EAAA1G,YADbp8B,KAAA4oB,IAAA,CAAAka,EAAA,EACa,CACb,CAqGA,SAAA9C,EAAA+C,CAAA,EACA,oBAAAA,EACA,0CAEA,OAAA/iC,KAAA4oB,IAAA,CAAAoa,EADAlgC,QAAA,IAAAjL,MAAA,CACA,EACA,CASA,SAAAkoC,EAAAgD,CAAA,EACA,IAAAlrC,EAAAmoC,EAAA+C,GACA,OAAAlrC,EAAAmI,KAAA4oB,IAAA,CAAA/wB,EAAA,EACA,CA5LAiB,EAAAgjC,aAAqB,CAbrB,SAAA0C,CAAA,EAOA,IAAAv9B,EAAAshC,EAAAxD,MAAA,EAAA5rB,EAAAlG,KACAkG,CAAA,CAAAlG,EAAA,YACAkG,GARA,CACAmpB,MAAA,SACA2G,KAAA,SACAC,MAAA,gBACAC,KAAA,eACA,GAKA,SAAArmC,EAAAk/B,cAAA,EAAAwC,EAAAv9B,EACA,EA0BAnI,EAAA0nC,KAAa,CAAAA,EAyBb1nC,EAAAynC,aAAqB,CAAAA,EAIrBznC,EAAAwnC,KAAa,CAHb,SAAAzF,CAAA,CAAApK,CAAA,CAAAC,CAAA,EACA,OAAAmK,EAAAoE,GAAA,CAAAxO,EAAA,iBAAAC,EAAAkQ,EAAAlQ,EAAAmK,EAAAyB,KAAA,EAAAzB,EAAA+H,GAAA,CAAAlS,GACA,EAUA53B,EAAAunC,UAAkB,CAPlB,SAAAxF,CAAA,EACA,IAAAuI,EAAA,CAAAvI,EAAAyB,KAAA,CAAAn/B,CAAA,EAAAC,EACA,WACA,IAAA+M,EAAA0wB,EAAAiG,GAAA,CAAApjC,EAAA0lC,GACA,OAAAvI,EAAAiH,GAAA,CAAA33B,EAAA0wB,EAAAP,IAAA,GAAAO,EAAAiH,GAAA,CAAA33B,EAAA0wB,EAAAoH,GAAA,CACA,CACA,EASAnpC,EAAAujC,OAAe,CAAAA,EA+DfvjC,EAAAsnC,KAAa,CAlDb,SAAA9D,CAAA,CAAA+G,CAAA,CAAA5jC,EAAA,GAAA6jC,EAAA,EAAsD,EACtD,GAAAhH,GAAAp/B,EACA,6CAAyDo/B,EAAM,GAC/D,IAAYH,WAAAgH,CAAA,CAAA/G,YAAA8G,CAAA,EAAuC7G,EAAAC,EAAA+G,GACnD,GAAAH,EAAA,KACA,+DACA,IAAAK,EAAA7C,EAAApE,GACAzB,EAAAjiC,OAAA4gC,MAAA,EACA8C,MAAAA,EACA6G,KAAAA,EACAD,MAAAA,EACAD,KAAA,GAAAnmC,EAAA0mC,OAAA,EAAAL,GACA7I,KAAAp9B,EACA+kC,IAAA9kC,EACAlF,OAAA,GAAA2N,EAAAkV,EAAAwhB,GACAmH,QAAA,IACA,oBAAA3oB,EACA,2DAA+E,OAAAA,EAAW,GAC1F,OAAA5d,GAAA4d,GAAAA,EAAAwhB,CACA,EACAoG,IAAA,GAAA5nB,IAAA5d,EACAwmC,MAAA,IAAA5oB,EAAA3d,CAAA,IAAAA,EACA48B,IAAA,GAAAn0B,EAAA,CAAAkV,EAAAwhB,GACAwF,IAAA,CAAArR,EAAAC,IAAAD,IAAAC,EACAqR,IAAA,GAAAn8B,EAAAkV,EAAAA,EAAAwhB,GACAhjC,IAAA,CAAAm3B,EAAAC,IAAA9qB,EAAA6qB,EAAAC,EAAA4L,GACAgG,IAAA,CAAA7R,EAAAC,IAAA9qB,EAAA6qB,EAAAC,EAAA4L,GACA2C,IAAA,CAAAxO,EAAAC,IAAA9qB,EAAA6qB,EAAAC,EAAA4L,GACAwE,IAAA,CAAAhmB,EAAAqmB,IAAAX,EAAA3F,EAAA/f,EAAAqmB,GACAjC,IAAA,CAAAzO,EAAAC,IAAA9qB,EAAA6qB,EAAAmQ,EAAAlQ,EAAA4L,GAAAA,GAEAqH,KAAA,GAAA7oB,EAAAA,EACA8oB,KAAA,CAAAnT,EAAAC,IAAAD,EAAAC,EACAmT,KAAA,CAAApT,EAAAC,IAAAD,EAAAC,EACAoT,KAAA,CAAArT,EAAAC,IAAAD,EAAAC,EACAkS,IAAA,GAAAhC,EAAA9lB,EAAAwhB,GACAyH,KAAAT,EAAAS,IAAA,MAAAR,EAAA1I,EAAA5jC,EAAA,EACA+sC,YAAA,GAAAzD,EAAA1F,EAAAlgC,GAGAspC,KAAA,CAAA1sC,EAAAF,EAAAssB,IAAAA,EAAAtsB,EAAAE,EACAuI,QAAA,GAAAL,EAAA,GAAA3C,EAAAonC,eAAA,EAAAppB,EAAAooB,GAAA,GAAApmC,EAAAqnC,eAAA,EAAArpB,EAAAooB,GACAkB,UAAA,IACA,GAAAzsC,EAAAE,MAAA,GAAAqrC,EACA,sCAA0DA,EAAM,QAAQvrC,EAAAE,MAAA,CAAa,GACrF,OAAA4H,EAAA,GAAA3C,EAAAunC,eAAA,EAAA1sC,GAAA,GAAAmF,EAAA+/B,eAAA,EAAAllC,EACA,CACA,GACA,OAAAiB,OAAA4gC,MAAA,CAAAqB,EACA,EAQA/hC,EAAAqnC,SAAiB,CANjB,SAAApE,CAAA,CAAA1B,CAAA,EACA,IAAA0B,EAAA2H,KAAA,CACA,wCACA,IAAAhP,EAAAqH,EAAAgI,IAAA,CAAA1J,GACA,OAAA0B,EAAA2H,KAAA,CAAAhP,GAAAA,EAAAqH,EAAAhC,GAAA,CAAArF,EACA,EAQA57B,EAAAonC,UAAkB,CANlB,SAAAnE,CAAA,CAAA1B,CAAA,EACA,IAAA0B,EAAA2H,KAAA,CACA,wCACA,IAAAhP,EAAAqH,EAAAgI,IAAA,CAAA1J,GACA,OAAA0B,EAAA2H,KAAA,CAAAhP,GAAAqH,EAAAhC,GAAA,CAAArF,GAAAA,CACA,EAiBA57B,EAAAmnC,mBAA2B,CAT3B,SAAAloC,CAAA,CAAAusC,CAAA,CAAA7kC,EAAA,IAEA,IAAA8kC,EAAAxsC,CADAA,EAAA,GAAA+E,EAAA0nC,WAAA,gBAAAzsC,EAAA,EACAF,MAAA,CACA4sC,EAAApI,EAAAiI,GAAAlI,WAAA,GACA,GAAAqI,EAAA,IAAAF,EAAAE,GAAAF,EAAA,KACA,6CAAyDE,EAAO,4BAA4BF,EAAQ,GAEpG,OAAA3+B,EADAnG,EAAA,GAAA3C,EAAAunC,eAAA,EAAAtsC,GAAA,GAAA+E,EAAA+/B,eAAA,EAAA9kC,GACAusC,EAAAnnC,GAAAA,CACA,EAcArE,EAAAknC,mBAA2B,CAAAA,EAY3BlnC,EAAAinC,gBAAwB,CAAAA,EA0BxBjnC,EAAAgnC,cAAsB,CAZtB,SAAA32B,CAAA,CAAA45B,CAAA,CAAAtjC,EAAA,IACA,IAAAI,EAAAsJ,EAAAtR,MAAA,CACA6sC,EAAA1E,EAAA+C,GACA0B,EAAA1E,EAAAgD,GAEA,GAAAljC,EAAA,IAAAA,EAAA4kC,GAAA5kC,EAAA,KACA,wBAAoC4kC,EAAO,4BAA4B5kC,EAAI,GAG3E,IAAA8kC,EAAA/+B,EAFAnG,EAAA,GAAA3C,EAAA+/B,eAAA,EAAA1zB,GAAA,GAAArM,EAAAunC,eAAA,EAAAl7B,GAEA45B,EAAA5lC,GAAAA,EACA,OAAAsC,EAAA,GAAA3C,EAAAonC,eAAA,EAAAS,EAAAD,GAAA,GAAA5nC,EAAAqnC,eAAA,EAAAQ,EAAAD,EACA,oCCnbA9rC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAkjC,cAAsB,CAAGljC,EAAA8rC,cAAsB,CAAG9rC,EAAA0qC,OAAe,CAAG1qC,EAAA+rC,MAAc,CAAG/rC,EAAAgsC,MAAc,CAAGhsC,EAAAuqC,MAAc,CAAGvqC,EAAAyI,WAAmB,CAAGzI,EAAAisC,UAAkB,CAAGjsC,EAAAwI,WAAmB,CAAGxI,EAAA0rC,WAAmB,CAAG1rC,EAAAksC,kBAA0B,CAAGlsC,EAAAorC,eAAuB,CAAGprC,EAAAqrC,eAAuB,CAAGrrC,EAAAurC,eAAuB,CAAGvrC,EAAA+jC,eAAuB,CAAG/jC,EAAA4I,UAAkB,CAAG5I,EAAAmsC,WAAmB,CAAGnsC,EAAAosC,mBAA2B,CAAGpsC,EAAA6I,UAAkB,QAM9a,IAAAzE,EAAA3C,OAAA,GACA4C,EAAA5C,OAAA,GACA6C,EAAA7C,OAAA,GACA4qC,EAAA,GAAA5tC,aAAAC,WACAkL,EAAAC,MAAAC,IAAA,EAA2C/K,OAAA,KAAa,CAAAgL,EAAA9H,IAAAA,EAAA+H,QAAA,KAAAC,QAAA,SAIxD,SAAApB,EAAAhK,CAAA,EACA,IAAAwtC,EAAAxtC,GACA,mCAEA,IAAAqL,EAAA,GACA,QAAAjI,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IACtCiI,GAAAN,CAAA,CAAA/K,CAAA,CAAAoD,EAAA,EAEA,OAAAiI,CACA,CAEA,SAAAkiC,EAAApqB,CAAA,EACA,IAAA9X,EAAA8X,EAAAhY,QAAA,KACA,OAAAE,EAAAA,EAAAnL,MAAA,KAAgCmL,EAAI,EAAAA,CACpC,CAEA,SAAAiiC,EAAAjiC,CAAA,EACA,oBAAAA,EACA,+CAAAA,GAEA,OAAAzI,OAAAyI,KAAAA,EAAA,SAA0CA,EAAI,EAC9C,CAKA,SAAAtB,EAAAsB,CAAA,EACA,oBAAAA,EACA,+CAAAA,GACA,IAAAnD,EAAAmD,EAAAnL,MAAA,CACA,GAAAgI,EAAA,EACA,sEAAAA,GACA,IAAA+D,EAAA,IAAApM,WAAAqI,EAAA,GACA,QAAA9E,EAAA,EAAoBA,EAAA6I,EAAA/L,MAAA,CAAkBkD,IAAA,CACtC,IAAA+C,EAAA/C,EAAAA,EAEAqqC,EAAAluC,OAAAyT,QAAA,CADA3H,EAAA4F,KAAA,CAAA9K,EAAAA,EAAA,GACA,IACA,GAAA5G,OAAA4T,KAAA,CAAAs6B,IAAAA,EAAA,EACA,oCACAxhC,CAAAA,CAAA,CAAA7I,EAAA,CAAAqqC,CACA,CACA,OAAAxhC,CACA,CAaA,SAAAugC,EAAAltC,CAAA,CAAA4I,CAAA,EACA,OAAA6B,EAAAzK,EAAA6L,QAAA,KAAAC,QAAA,CAAAlD,EAAAA,EAAA,KACA,CA+CA,SAAAyB,EAAA,GAAAsD,CAAA,EACA,IAAA28B,EAAA,IAAA/pC,WAAAoN,EAAAm6B,MAAA,EAAAl6B,EAAAtN,IAAAsN,EAAAtN,EAAAM,MAAA,KACAkN,EAAA,EAOA,OANAH,EAAAoI,OAAA,KACA,IAAAm4B,EAAA5tC,GACA,mCACAgqC,EAAAnhC,GAAA,CAAA7I,EAAAwN,GACAA,GAAAxN,EAAAM,MAAA,GAEA0pC,CACA,CAxGAzoC,EAAA6I,UAAkB,CAAAA,EAKlB7I,EAAAosC,mBAA2B,CAAAA,EAO3BpsC,EAAAmsC,WAAmB,CAAAA,EAqBnBnsC,EAAA4I,UAAkB,CAAAA,EAKlB5I,EAAA+jC,eAAuB,CAHvB,SAAAllC,CAAA,EACA,OAAAstC,EAAAtjC,EAAAhK,GACA,EAOAmB,EAAAurC,eAAuB,CALvB,SAAA1sC,CAAA,EACA,IAAAwtC,EAAAxtC,GACA,mCACA,OAAAstC,EAAAtjC,EAAAnK,WAAAoL,IAAA,CAAAjL,GAAA+mC,OAAA,IACA,EAKA5lC,EAAAqrC,eAAuB,CAAAA,EAIvBrrC,EAAAorC,eAAuB,CAHvB,SAAAjtC,CAAA,CAAA4I,CAAA,EACA,OAAAskC,EAAAltC,EAAA4I,GAAA6+B,OAAA,EACA,EAMA5lC,EAAAksC,kBAA0B,CAH1B,SAAA/tC,CAAA,EACA,OAAAyK,EAAAwjC,EAAAjuC,GACA,EAkCA6B,EAAA0rC,WAAmB,CAvBnB,SAAAj3B,CAAA,CAAAvK,CAAA,CAAAqiC,CAAA,MACAvgC,EACA,oBAAA9B,EACA,IACA8B,EAAApD,EAAAsB,EACA,CACA,MAAAq7B,EAAA,CACA,eAA+B9wB,EAAA,gCAAO,EAAiCvK,EAAI,YAAYq7B,EAAE,EACzF,MAEA,GAAA8G,EAAAniC,GAGA8B,EAAAtN,WAAAoL,IAAA,CAAAI,QAGA,eAA2BuK,EAAA,iCAAO,GAElC,IAAA1N,EAAAiF,EAAAjN,MAAA,CACA,oBAAAwtC,GAAAxlC,IAAAwlC,EACA,eAA2B93B,EAAA,UAAO,EAAW83B,EAAA,YAAgB,EAAaxlC,EAAI,GAC9E,OAAAiF,CACA,EAgBAhM,EAAAwI,WAAmB,CAAAA,EAUnBxI,EAAAisC,UAAkB,CATlB,SAAA1gB,CAAA,CAAAM,CAAA,EAEA,GAAAN,EAAAxsB,MAAA,GAAA8sB,EAAA9sB,MAAA,CACA,SACA,QAAAkD,EAAA,EAAoBA,EAAAspB,EAAAxsB,MAAA,CAAekD,IACnC,GAAAspB,CAAA,CAAAtpB,EAAA,GAAA4pB,CAAA,CAAA5pB,EAAA,CACA,SACA,QACA,EAUAjC,EAAAyI,WAAmB,CALnB,SAAAkD,CAAA,EACA,oBAAAA,EACA,gDAA4D,OAAAA,EAAW,GACvE,WAAAjN,WAAA,IAAAkN,cAAAC,MAAA,CAAAF,GACA,EAaA3L,EAAAuqC,MAAc,CANd,SAAApsC,CAAA,EACA,IAAA4I,EACA,IAAAA,EAAA,EAAkB5I,EAAAiG,EAASjG,IAAAkG,EAAA0C,GAAA,GAE3B,OAAAA,CACA,EAUA/G,EAAAgsC,MAAc,CAHd,SAAA7tC,CAAA,CAAAkI,CAAA,EACA,UAAA5E,OAAA4E,GAAAhC,CACA,EAQArE,EAAA+rC,MAAc,CAHd,CAAA5tC,EAAAkI,EAAApG,IACA9B,EAAA,CAAA8B,EAAAoE,EAAAD,CAAA,GAAA3C,OAAA4E,GAQArG,EAAA0qC,OAAe,CADf,IAAApmC,GAAA7C,OAAAtD,EAAA,IAAAkG,EAGA,IAAAmoC,EAAA,OAAA9tC,WAAAoI,GACA2lC,EAAA,GAAA/tC,WAAAoL,IAAA,CAAAT,EA2DArJ,CAAAA,EAAA8rC,cAAsB,CAnDtB,SAAAL,CAAA,CAAAiB,CAAA,CAAAC,CAAA,EACA,oBAAAlB,GAAAA,EAAA,EACA,wCACA,oBAAAiB,GAAAA,EAAA,EACA,yCACA,sBAAAC,EACA,yCAEA,IAAApE,EAAAiE,EAAAf,GACA76B,EAAA47B,EAAAf,GACAxpC,EAAA,EACA2qC,EAAA,KACArE,EAAAtiC,IAAA,IACA2K,EAAA3K,IAAA,IACAhE,EAAA,CACA,EACA/C,EAAA,IAAAX,IAAAouC,EAAA/7B,EAAA23B,KAAAhqC,GACAsuC,EAAA,CAAAC,EAAAN,GAAA,IAEA57B,EAAA1R,EAAAutC,EAAA,KAAAK,GACAvE,EAAArpC,IACA,IAAA4tC,EAAA/tC,MAAA,GAEA6R,EAAA1R,EAAAutC,EAAA,KAAAK,GACAvE,EAAArpC,IACA,EACA6I,EAAA,KAEA,GAAA9F,KAAA,IACA,uCACA,IAAA8E,EAAA,EACAnH,EAAA,GACA,KAAAmH,EAAA2lC,GAAA,CAEA,IAAAK,EAAAxE,CADAA,EAAArpC,GAAA,EACA4Q,KAAA,GACAlQ,EAAAkF,IAAA,CAAAioC,GACAhmC,GAAAwhC,EAAAxpC,MAAA,CAEA,OAAAyJ,KAAA5I,EACA,EAUA,MATA,CAAAktC,EAAAE,SAGAhhC,EACA,IAHA4gC,IACAC,EAAAC,GAEA,CAAA9gC,CAAAA,EAAAghC,EAAAjlC,IAAA,GACA8kC,IAEA,OADAD,IACA5gC,CACA,CAEA,EAGA,IAAAihC,EAAA,CACAC,OAAA,oBAAA/4B,EACAg5B,SAAA,sBAAAh5B,EACAi5B,QAAA,qBAAAj5B,EACAmJ,OAAA,oBAAAnJ,EACAk5B,mBAAA,oBAAAl5B,GAAAA,aAAAzV,WACAL,cAAA,GAAAD,OAAAC,aAAA,CAAA8V,GACArJ,MAAA,GAAAjB,MAAA8J,OAAA,CAAAQ,GACAuxB,MAAA,CAAAvxB,EAAAm5B,IAAAA,EAAArK,EAAA,CAAA0H,OAAA,CAAAx2B,GACAlV,KAAA,sBAAAkV,GAAA/V,OAAAC,aAAA,CAAA8V,EAAA/U,SAAA,CACA,CAoBAY,CAAAA,EAAAkjC,cAAsB,CAlBtB,SAAAoK,CAAA,CAAAC,CAAA,CAAAC,EAAA,EAA8D,EAC9D,IAAAC,EAAA,CAAAC,EAAA/yB,EAAAgzB,KACA,IAAAC,EAAAX,CAAA,CAAAtyB,EAAA,CACA,sBAAAizB,EACA,kCAAkDjzB,EAAK,uBACvD,IAAAxG,EAAAm5B,CAAA,CAAAI,EAAA,CACA,GAAAC,CAAAA,CAAAA,GAAAx5B,KAAAnR,IAAAmR,CAAA,GAEA,CAAAy5B,EAAAz5B,EAAAm5B,GACA,6BAA6Cz5B,OAAA65B,GAAkB,GAAGv5B,EAAA,EAAK,EAAG,OAAAA,EAAW,cAAcwG,EAAK,EAExG,EACA,QAAA+yB,EAAA/yB,EAAA,GAAA7a,OAAAyQ,OAAA,CAAAg9B,GACAE,EAAAC,EAAA/yB,EAAA,IACA,QAAA+yB,EAAA/yB,EAAA,GAAA7a,OAAAyQ,OAAA,CAAAi9B,GACAC,EAAAC,EAAA/yB,EAAA,IACA,OAAA2yB,CACA,sCCpRAxtC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA6tC,mBAA2B,CAAG7tC,EAAA8tC,cAAsB,CAAG9tC,EAAAygC,WAAmB,CAAGzgC,EAAA+tC,iBAAyB,CAAG/tC,EAAAguC,GAAW,QAGpH,IAAAlhC,EAAYhJ,EAAQ,OACpBmqC,EAAWnqC,EAAQ,OACnBE,EAAmBF,EAAQ,OAC3BoqC,EAAmBpqC,EAAQ,OA6B3B,CAAQigC,gBAAAoK,CAAA,CAAAvlC,WAAAwlC,CAAA,EAAwCH,CAChDjuC,CAAAA,EAAAguC,GAAW,EAEXK,IAAA,cAAAC,MACA3vC,YAAAgS,EAAA,IACA,MAAAA,EACA,CACA,EACA49B,UAAAznC,CAAA,EACA,IAAgBunC,IAAAG,CAAA,EAASxuC,EAAAguC,GAAA,CACzB,GAAAlnC,EAAA/H,MAAA,IAAA+H,IAAAA,CAAA,IACA,UAAA0nC,EAAA,iCACA,IAAAznC,EAAAD,CAAA,IACAkF,EAAAlF,EAAAS,QAAA,GAAAR,EAAA,GACA,IAAAA,GAAAiF,EAAAjN,MAAA,GAAAgI,EACA,UAAAynC,EAAA,2CAKA,GAAAxiC,IAAAA,CAAA,IACA,UAAAwiC,EAAA,uCACA,GAAAxiC,IAAAA,CAAA,MAAAA,CAAAA,IAAAA,CAAA,KACA,UAAAwiC,EAAA,uDACA,OAAiB/M,EAAA0M,EAAAniC,GAAApK,EAAAkF,EAAAS,QAAA,CAAAR,EAAA,GACjB,EACA0nC,MAAAvkC,CAAA,EAEA,IAAgBmkC,IAAAG,CAAA,EAASxuC,EAAAguC,GAAA,CACzBlnC,EAAA,iBAAAoD,EAAAkkC,EAAAlkC,GAAAA,EACA,IAAApD,CAAAA,aAAApI,UAAA,EACA,6BACA,IAAAkD,EAAAkF,EAAA/H,MAAA,CACA,GAAA6C,EAAA,GAAAkF,IAAAA,CAAA,IACA,UAAA0nC,EAAA,yBACA,GAAA1nC,CAAA,MAAAlF,EAAA,EACA,UAAA4sC,EAAA,uCACA,IAAgB/M,EAAAgH,CAAA,CAAA7mC,EAAA8sC,CAAA,EAAkB1uC,EAAAguC,GAAA,CAAAO,SAAA,CAAAznC,EAAAS,QAAA,KAClC,CAAgBk6B,EAAAt/B,CAAA,CAAAP,EAAA+sC,CAAA,EAAsB3uC,EAAAguC,GAAA,CAAAO,SAAA,CAAAG,GACtC,GAAAC,EAAA5vC,MAAA,CACA,UAAAyvC,EAAA,+CACA,OAAiB/F,EAAAA,EAAAtmC,EAAAA,CAAA,CACjB,EACAysC,WAAAC,CAAA,EAEA,IAAA/+B,EAAA,GAAA1R,EAAAA,OAAAyT,QAAA,CAAA1P,CAAA,aAAAA,EAAAA,EACAjD,EAAA,IACA,IAAAgL,EAAA8X,EAAAhY,QAAA,KACA,OAAAE,EAAAA,EAAAnL,MAAA,KAAwCmL,EAAI,EAAAA,CAC5C,EACA/H,EAAA2N,EAAA5Q,EAAA2vC,EAAA1sC,CAAA,GACAsmC,EAAA34B,EAAA5Q,EAAA2vC,EAAApG,CAAA,GACAqG,EAAA3sC,EAAApD,MAAA,GACAgwC,EAAAtG,EAAA1pC,MAAA,GACAguC,EAAA7tC,EAAA4vC,GACAE,EAAA9vC,EAAA6vC,GACA,WAAoB7vC,EAAA6vC,EAAAD,EAAA,GAAiB,IAAIE,EAAG,EAAEvG,EAAE,IAAIsE,EAAG,EAAE5qC,EAAE,EAE3D,EAGA,IAAAiC,EAAA3C,OAAA,GAAA4C,EAAA5C,OAAA,GAAA6C,EAAA7C,OAAA,GAAAwmC,EAAAxmC,OAAA,GAAAymC,EAAAzmC,OAAA,GACA,SAAAssC,EAAA5lC,CAAA,EACA,IAAA8mC,EAAAC,SA3FAnM,CAAA,EACA,IAAA56B,EAAA,GAAA+lC,EAAAvN,aAAA,EAAAoC,GACAkL,EAAA/K,cAAA,CAAA/6B,EAAA,CACA1J,EAAA,QACAF,EAAA,OACA,EAAK,CACL4wC,yBAAA,QACAC,eAAA,UACAC,cAAA,WACAzI,cAAA,WACA0I,mBAAA,UACAhE,UAAA,WACAtkC,QAAA,UACA,GACA,IAAYuoC,KAAAA,CAAA,CAAAtM,GAAAA,CAAA,CAAAxkC,CAAA,EAAc0J,EAC1B,GAAAonC,EAAA,CACA,IAAAtM,EAAA+F,GAAA,CAAAvqC,EAAAwkC,EAAAzB,IAAA,EACA,iFAEA,oBAAA+N,GACA,iBAAAA,EAAAC,IAAA,EACA,mBAAAD,EAAAE,WAAA,CACA,gFAEA,CACA,OAAA3vC,OAAA4gC,MAAA,EAA2B,GAAAv4B,CAAA,EAC3B,EAiEAA,GACA,CAAY86B,GAAAA,CAAA,EAAKgM,EACjBjoC,EAAAioC,EAAAjoC,OAAA,EACA,EAAA0oC,EAAAC,EAAAC,KACA,IAAAnxC,EAAAkxC,EAAAE,QAAA,GACA,OAAA5B,EAAAzlC,WAAA,CAAA9J,WAAAoL,IAAA,MAAAm5B,EAAAj8B,OAAA,CAAAvI,EAAAmG,CAAA,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAoG,CAAA,EACA,GACAymC,EAAA2D,EAAA3D,SAAA,EACA,KAEA,IAAAze,EAAAhuB,EAAA0I,QAAA,IAIA,OAAqB3C,EAFrBq+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,GAAA07B,EAAAmH,KAAA,GAEqBvlC,EADrBo+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,CAAA07B,EAAAmH,KAAA,GAAAnH,EAAAmH,KAAA,EACqB,CACrB,GAKA,SAAA0F,EAAAlrC,CAAA,EACA,IAAgBnG,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAO0wC,EACvBc,EAAA9M,EAAAgG,GAAA,CAAArkC,GACAorC,EAAA/M,EAAAkD,GAAA,CAAA4J,EAAAnrC,GACA,OAAAq+B,EAAAziC,GAAA,CAAAyiC,EAAAziC,GAAA,CAAAwvC,EAAA/M,EAAAkD,GAAA,CAAAvhC,EAAAnG,IAAAF,EACA,CAKA,IAAA0kC,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAAgG,EAAA7L,EAAA,EAAA0M,EAAAb,EAAA9L,EAAA,GACA,2DAEA,SAAA8M,EAAAjuB,CAAA,EACA,uBAAAA,GAAA5d,EAAA4d,GAAAA,EAAAitB,EAAA9wC,CAAA,CAEA,SAAA+xC,EAAAluB,CAAA,EACA,IAAAiuB,EAAAjuB,GACA,0DACA,CAGA,SAAAmuB,EAAA9/B,CAAA,MAUA2R,EATA,IAAgBmtB,yBAAArwC,CAAA,CAAAwkC,YAAAA,CAAA,CAAA8L,eAAAA,CAAA,CAAAjxC,EAAAA,CAAA,EAAoE8wC,EACpF,GAAAnwC,GAAA,iBAAAuR,EAAA,CAIA,GAHAA,aAAA3R,YACA2R,CAAAA,EAAA49B,EAAAplC,UAAA,CAAAwH,EAAA,EAEA,iBAAAA,GAAA,CAAAvR,EAAAE,QAAA,CAAAqR,EAAAtR,MAAA,EACA,2BACAsR,EAAAA,EAAApG,QAAA,CAAAq5B,EAAAA,EAAA,IACA,CAEA,IACAthB,EACA,iBAAA3R,EACAA,EACA49B,EAAAlK,eAAA,IAAA//B,EAAA0nC,WAAA,gBAAAr7B,EAAAizB,GACA,CACA,MAAA11B,EAAA,CACA,mCAAmD01B,EAAA,2BAAa,EAA4B,OAAAjzB,EAAW,EACvG,CAIA,OAHA++B,GACAptB,CAAAA,EAAAlV,EAAAA,GAAA,CAAAkV,EAAA7jB,EAAA,EACA+xC,EAAAluB,GACAA,CACA,CACA,IAAAouB,EAAA,IAAAC,IACA,SAAAC,EAAAC,CAAA,EACA,IAAAA,CAAAA,aAAAlK,CAAA,EACA,uCACA,CAMA,MAAAA,EACA1nC,YAAA6xC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAIA,GAHA,KAAAF,EAAA,CAAAA,EACA,KAAAC,EAAA,CAAAA,EACA,KAAAC,EAAA,CAAAA,EACAF,MAAAA,GAAA,CAAAvN,EAAA0H,OAAA,CAAA6F,GACA,0BACA,GAAAC,MAAAA,GAAA,CAAAxN,EAAA0H,OAAA,CAAA8F,GACA,0BACA,GAAAC,MAAAA,GAAA,CAAAzN,EAAA0H,OAAA,CAAA+F,GACA,yBACA,CAGA,OAAAhK,WAAAr1B,CAAA,EACA,IAAoBzM,EAAAA,CAAA,CAAAC,EAAAA,CAAA,EAAOwM,GAAA,GAC3B,IAAAA,GAAA,CAAA4xB,EAAA0H,OAAA,CAAA/lC,IAAA,CAAAq+B,EAAA0H,OAAA,CAAA9lC,GACA,oCACA,GAAAwM,aAAAg1B,EACA,4CACA,IAAAuD,EAAA,GAAA3G,EAAA+F,GAAA,CAAA/mC,EAAAghC,EAAAzB,IAAA,SAEA,EAAA58B,IAAAglC,EAAA/kC,GACAwhC,EAAA7E,IAAA,CACA,IAAA6E,EAAAzhC,EAAAC,EAAAo+B,EAAAkG,GAAA,CACA,CACA,IAAAvkC,GAAA,CACA,YAAAirC,QAAA,GAAAjrC,CAAA,CAEA,IAAAC,GAAA,CACA,YAAAgrC,QAAA,GAAAhrC,CAAA,CAQA,OAAA8rC,WAAA/O,CAAA,EACA,IAAAgP,EAAA3N,EAAAiI,WAAA,CAAAtJ,EAAAvnB,GAAA,IAAAhJ,EAAAq/B,EAAA,GACA,OAAA9O,EAAAvnB,GAAA,EAAAhJ,EAAApP,IAAAoP,EAAAw+B,QAAA,CAAAe,CAAA,CAAA3uC,EAAA,GAAAoY,GAAA,CAAAgsB,EAAAK,UAAA,CACA,CAKA,OAAAmK,QAAA3mC,CAAA,EACA,IAAAw4B,EAAA2D,EAAAK,UAAA,CAAA4E,EAAA,GAAAtnC,EAAA0nC,WAAA,aAAAxhC,KAEA,OADAw4B,EAAAmE,cAAA,GACAnE,CACA,CAEA,OAAAoO,eAAAC,CAAA,EACA,OAAA1K,EAAArE,IAAA,CAAAgP,QAAA,CAAAb,EAAAY,GACA,CAEAE,eAAA5P,CAAA,EACA,KAAAwB,YAAA,CAAAxB,EACA+O,EAAAc,MAAA,MACA,CAEArK,gBAAA,CACA,QAAA+C,GAAA,IAIA,GAAAqF,EAAAK,kBAAA,GAAArM,EAAA2G,GAAA,MAAA6G,EAAA,EACA,MACA,+BACA,CAEA,IAAoB7rC,EAAAA,CAAA,CAAAC,EAAAA,CAAA,EAAO,KAAAgrC,QAAA,GAE3B,IAAA5M,EAAA0H,OAAA,CAAA/lC,IAAA,CAAAq+B,EAAA0H,OAAA,CAAA9lC,GACA,wCACA,IAAAuT,EAAA6qB,EAAAgG,GAAA,CAAApkC,GACAyT,EAAAw3B,EAAAlrC,GACA,IAAAq+B,EAAA+F,GAAA,CAAA5wB,EAAAE,GACA,iDACA,SAAA+2B,aAAA,GACA,qDACA,CACA8B,UAAA,CACA,IAAoBtsC,EAAAA,CAAA,EAAI,KAAAgrC,QAAA,GACxB,GAAA5M,EAAA2H,KAAA,CACA,OAAA3H,EAAA2H,KAAA,CAAA/lC,EACA,2CACA,CAIAusC,OAAAb,CAAA,EACAD,EAAAC,GACA,IAAoBC,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7C,CAAoBf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,EAAyBnB,EAC7CoB,EAAA1O,EAAA+F,GAAA,CAAA/F,EAAAkD,GAAA,CAAAkL,EAAAK,GAAAzO,EAAAkD,GAAA,CAAAqL,EAAAD,IACAK,EAAA3O,EAAA+F,GAAA,CAAA/F,EAAAkD,GAAA,CAAAmL,EAAAI,GAAAzO,EAAAkD,GAAA,CAAAsL,EAAAF,IACA,OAAAI,GAAAC,CACA,CAIA1Q,QAAA,CACA,WAAAmF,EAAA,KAAAmK,EAAA,CAAAvN,EAAAhC,GAAA,MAAAwP,EAAA,OAAAC,EAAA,CACA,CAKAhP,QAAA,CACA,IAAoBjjC,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAO0wC,EAC3BljB,EAAAkX,EAAAkD,GAAA,CAAA5nC,EAAA0pC,GACA,CAAoBuI,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7CM,EAAA5O,EAAAzB,IAAA,CAAAsQ,EAAA7O,EAAAzB,IAAA,CAAAuQ,EAAA9O,EAAAzB,IAAA,CACAwQ,EAAA/O,EAAAkD,GAAA,CAAAkL,EAAAA,GACAY,EAAAhP,EAAAkD,GAAA,CAAAmL,EAAAA,GACAjI,EAAApG,EAAAkD,GAAA,CAAAoL,EAAAA,GACAW,EAAAjP,EAAAkD,GAAA,CAAAkL,EAAAC,GA4BA,OA3BAY,EAAAjP,EAAAziC,GAAA,CAAA0xC,EAAAA,GACAH,EAAA9O,EAAAkD,GAAA,CAAAkL,EAAAE,GACAQ,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GACAF,EAAA5O,EAAAkD,GAAA,CAAA1nC,EAAAszC,GACAD,EAAA7O,EAAAkD,GAAA,CAAApa,EAAAsd,GACAyI,EAAA7O,EAAAziC,GAAA,CAAAqxC,EAAAC,GACAD,EAAA5O,EAAAuG,GAAA,CAAAyI,EAAAH,GACAA,EAAA7O,EAAAziC,GAAA,CAAAyxC,EAAAH,GACAA,EAAA7O,EAAAkD,GAAA,CAAA0L,EAAAC,GACAD,EAAA5O,EAAAkD,GAAA,CAAA+L,EAAAL,GACAE,EAAA9O,EAAAkD,GAAA,CAAApa,EAAAgmB,GACA1I,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA6I,EAAAjP,EAAAuG,GAAA,CAAAwI,EAAA3I,GACA6I,EAAAjP,EAAAkD,GAAA,CAAA1nC,EAAAyzC,GACAA,EAAAjP,EAAAziC,GAAA,CAAA0xC,EAAAH,GACAA,EAAA9O,EAAAziC,GAAA,CAAAwxC,EAAAA,GACAA,EAAA/O,EAAAziC,GAAA,CAAAuxC,EAAAC,GACAA,EAAA/O,EAAAziC,GAAA,CAAAwxC,EAAA3I,GACA2I,EAAA/O,EAAAkD,GAAA,CAAA6L,EAAAE,GACAJ,EAAA7O,EAAAziC,GAAA,CAAAsxC,EAAAE,GACA3I,EAAApG,EAAAkD,GAAA,CAAAmL,EAAAC,GACAlI,EAAApG,EAAAziC,GAAA,CAAA6oC,EAAAA,GACA2I,EAAA/O,EAAAkD,GAAA,CAAAkD,EAAA6I,GACAL,EAAA5O,EAAAuG,GAAA,CAAAqI,EAAAG,GACAD,EAAA9O,EAAAkD,GAAA,CAAAkD,EAAA4I,GACAF,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GAEA,IAAA1L,EAAAwL,EAAAC,EADAC,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GAEA,CAKAvxC,IAAA+vC,CAAA,EACAD,EAAAC,GACA,IAAoBC,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7C,CAAoBf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,EAAyBnB,EAC7CsB,EAAA5O,EAAAzB,IAAA,CAAAsQ,EAAA7O,EAAAzB,IAAA,CAAAuQ,EAAA9O,EAAAzB,IAAA,CACA/iC,EAAAwwC,EAAAxwC,CAAA,CACAstB,EAAAkX,EAAAkD,GAAA,CAAA8I,EAAA1wC,CAAA,CAAA0pC,GACA+J,EAAA/O,EAAAkD,GAAA,CAAAkL,EAAAG,GACAS,EAAAhP,EAAAkD,GAAA,CAAAmL,EAAAG,GACApI,EAAApG,EAAAkD,GAAA,CAAAoL,EAAAG,GACAQ,EAAAjP,EAAAziC,GAAA,CAAA6wC,EAAAC,GACAa,EAAAlP,EAAAziC,GAAA,CAAAgxC,EAAAC,GACAS,EAAAjP,EAAAkD,GAAA,CAAA+L,EAAAC,GACAA,EAAAlP,EAAAziC,GAAA,CAAAwxC,EAAAC,GACAC,EAAAjP,EAAAuG,GAAA,CAAA0I,EAAAC,GACAA,EAAAlP,EAAAziC,GAAA,CAAA6wC,EAAAE,GACA,IAAAa,EAAAnP,EAAAziC,GAAA,CAAAgxC,EAAAE,GA+BA,OA9BAS,EAAAlP,EAAAkD,GAAA,CAAAgM,EAAAC,GACAA,EAAAnP,EAAAziC,GAAA,CAAAwxC,EAAA3I,GACA8I,EAAAlP,EAAAuG,GAAA,CAAA2I,EAAAC,GACAA,EAAAnP,EAAAziC,GAAA,CAAA8wC,EAAAC,GACAM,EAAA5O,EAAAziC,GAAA,CAAAixC,EAAAC,GACAU,EAAAnP,EAAAkD,GAAA,CAAAiM,EAAAP,GACAA,EAAA5O,EAAAziC,GAAA,CAAAyxC,EAAA5I,GACA+I,EAAAnP,EAAAuG,GAAA,CAAA4I,EAAAP,GACAE,EAAA9O,EAAAkD,GAAA,CAAA1nC,EAAA0zC,GACAN,EAAA5O,EAAAkD,GAAA,CAAApa,EAAAsd,GACA0I,EAAA9O,EAAAziC,GAAA,CAAAqxC,EAAAE,GACAF,EAAA5O,EAAAuG,GAAA,CAAAyI,EAAAF,GACAA,EAAA9O,EAAAziC,GAAA,CAAAyxC,EAAAF,GACAD,EAAA7O,EAAAkD,GAAA,CAAA0L,EAAAE,GACAE,EAAAhP,EAAAziC,GAAA,CAAAwxC,EAAAA,GACAC,EAAAhP,EAAAziC,GAAA,CAAAyxC,EAAAD,GACA3I,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA8I,EAAAlP,EAAAkD,GAAA,CAAApa,EAAAomB,GACAF,EAAAhP,EAAAziC,GAAA,CAAAyxC,EAAA5I,GACAA,EAAApG,EAAAuG,GAAA,CAAAwI,EAAA3I,GACAA,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA8I,EAAAlP,EAAAziC,GAAA,CAAA2xC,EAAA9I,GACA2I,EAAA/O,EAAAkD,GAAA,CAAA8L,EAAAE,GACAL,EAAA7O,EAAAziC,GAAA,CAAAsxC,EAAAE,GACAA,EAAA/O,EAAAkD,GAAA,CAAAiM,EAAAD,GACAN,EAAA5O,EAAAkD,GAAA,CAAA+L,EAAAL,GACAA,EAAA5O,EAAAuG,GAAA,CAAAqI,EAAAG,GACAA,EAAA/O,EAAAkD,GAAA,CAAA+L,EAAAD,GACAF,EAAA9O,EAAAkD,GAAA,CAAAiM,EAAAL,GAEA,IAAA1L,EAAAwL,EAAAC,EADAC,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAC,GAEA,CACAK,SAAA9B,CAAA,EACA,YAAA/vC,GAAA,CAAA+vC,EAAArP,MAAA,GACA,CACA0I,KAAA,CACA,YAAAwH,MAAA,CAAA/K,EAAA7E,IAAA,CACA,CACAZ,KAAAziC,CAAA,EACA,OAAAm0C,EAAA7P,UAAA,MAAA2N,EAAAjyC,EAAA,IACA,IAAAyyC,EAAA3N,EAAAiI,WAAA,CAAApI,EAAAzoB,GAAA,IAAAhJ,EAAAq/B,EAAA,GACA,OAAA5N,EAAAzoB,GAAA,EAAAhJ,EAAApP,IAAAoP,EAAAw+B,QAAA,CAAAe,CAAA,CAAA3uC,EAAA,GAAAoY,GAAA,CAAAgsB,EAAAK,UAAA,CACA,EACA,CAMA6L,eAAAp0C,CAAA,EACA,IAAAq0C,EAAAnM,EAAA7E,IAAA,CACA,GAAArjC,IAAAiG,EACA,OAAAouC,EAEA,GADAtC,EAAA/xC,GACAA,IAAAkG,EACA,YACA,IAAoBkrC,KAAAA,CAAA,EAAON,EAC3B,IAAAM,EACA,OAAA+C,EAAAhR,YAAA,MAAAnjC,GAEA,IAAkBs0C,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAA,CAAA9hC,GAAAA,CAAA,EAAuB0+B,EAAAE,WAAA,CAAAtxC,GACzCy0C,EAAAJ,EACAK,EAAAL,EACA/Q,EAAA,KACA,KAAAiR,EAAAtuC,GAAAyM,EAAAzM,GACAsuC,EAAAruC,GACAuuC,CAAAA,EAAAA,EAAApyC,GAAA,CAAAihC,EAAA,EACA5wB,EAAAxM,GACAwuC,CAAAA,EAAAA,EAAAryC,GAAA,CAAAihC,EAAA,EACAA,EAAAA,EAAAC,MAAA,GACAgR,IAAAruC,EACAwM,IAAAxM,EAOA,OALAouC,GACAG,CAAAA,EAAAA,EAAA1R,MAAA,IACAyR,GACAE,CAAAA,EAAAA,EAAA3R,MAAA,IACA2R,EAAA,IAAAxM,EAAApD,EAAAkD,GAAA,CAAA0M,EAAArC,EAAA,CAAAjB,EAAAC,IAAA,EAAAqD,EAAApC,EAAA,CAAAoC,EAAAnC,EAAA,EACAkC,EAAApyC,GAAA,CAAAqyC,EACA,CAUA7B,SAAA8B,CAAA,MAGAnD,EAAAoD,EAFA7C,EAAA4C,GAGA,IAAoBvD,KAAAA,CAAA,EAAON,EAC3B,GAAAM,EAAA,CACA,IAAwBkD,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAA,CAAA9hC,GAAAA,CAAA,EAAuB0+B,EAAAE,WAAA,CAJ/CqD,GAKA,CAAsBzhC,EAAAuhC,CAAA,CAAA7Q,EAAAiR,CAAA,EAAiB,KAAApS,IAAA,CAAA8R,GACvC,CAAsBrhC,EAAAwhC,CAAA,CAAA9Q,EAAAkR,CAAA,EAAiB,KAAArS,IAAA,CAAA/vB,GACvC+hC,EAAAN,EAAAvR,eAAA,CAAA0R,EAAAG,GACAC,EAAAP,EAAAvR,eAAA,CAAA4R,EAAAE,GACAA,EAAA,IAAAxM,EAAApD,EAAAkD,GAAA,CAAA0M,EAAArC,EAAA,CAAAjB,EAAAC,IAAA,EAAAqD,EAAApC,EAAA,CAAAoC,EAAAnC,EAAA,EACAf,EAAAiD,EAAApyC,GAAA,CAAAqyC,GACAE,EAAAC,EAAAxyC,GAAA,CAAAyyC,EACA,KACA,CACA,IAAwB5hC,EAAAA,CAAA,CAAA0wB,EAAAA,CAAA,EAAO,KAAAnB,IAAA,CAd/BkS,GAeAnD,EAAAt+B,EACA0hC,EAAAhR,CACA,CAEA,OAAAsE,EAAAsK,UAAA,EAAAhB,EAAAoD,EAAA,KAQAG,qBAAAvK,CAAA,CAAAlqC,CAAA,CAAAF,CAAA,EACA,IAAA40C,EAAA9M,EAAArE,IAAA,CACAmE,EAAA,CAAAzD,EAAAjkC,IACAA,IAAA2F,GAAA3F,IAAA4F,GAAAq+B,EAAA0O,MAAA,CAAA+B,GAAAzQ,EAAAsO,QAAA,CAAAvyC,GAAAikC,EAAA6P,cAAA,CAAA9zC,GACAsN,EAAAo6B,EAAA,KAAA1nC,GAAA+B,GAAA,CAAA2lC,EAAAwC,EAAApqC,IACA,OAAAwN,EAAA69B,GAAA,GAAA5mC,KAAAA,EAAA+I,CACA,CAIA8jC,SAAAuD,CAAA,EACA,IAAoB5C,GAAA5rC,CAAA,CAAA6rC,GAAA5rC,CAAA,CAAA6rC,GAAA2C,CAAA,EAAsB,KAC1CzJ,EAAA,KAAAA,GAAA,EAGA,OAAAwJ,GACAA,CAAAA,EAAAxJ,EAAA3G,EAAAkG,GAAA,CAAAlG,EAAA6G,GAAA,CAAAuJ,EAAA,EACA,IAAAC,EAAArQ,EAAAkD,GAAA,CAAAvhC,EAAAwuC,GACAG,EAAAtQ,EAAAkD,GAAA,CAAAthC,EAAAuuC,GACAI,EAAAvQ,EAAAkD,GAAA,CAAAkN,EAAAD,GACA,GAAAxJ,EACA,OAAyBhlC,EAAAq+B,EAAAzB,IAAA,CAAA38B,EAAAo+B,EAAAzB,IAAA,EACzB,IAAAyB,EAAA+F,GAAA,CAAAwK,EAAAvQ,EAAAkG,GAAA,EACA,gCACA,OAAqBvkC,EAAA0uC,EAAAzuC,EAAA0uC,CAAA,CACrB,CACAlE,eAAA,CACA,IAAoBnwC,EAAAu0C,CAAA,CAAApE,cAAAA,CAAA,EAA6BJ,EACjD,GAAAwE,IAAApvC,EACA,SACA,GAAAgrC,EACA,OAAAA,EAAAhJ,EAAA,KACA,4EACA,CACAO,eAAA,CACA,IAAoB1nC,EAAAu0C,CAAA,CAAA7M,cAAAA,CAAA,EAA6BqI,SACjD,IAAA5qC,EACA,KACAuiC,EACAA,EAAAP,EAAA,MACA,KAAAkM,cAAA,CAAAtD,EAAA/vC,CAAA,CACA,CACAw0C,WAAAC,EAAA,IAEA,OADA,KAAA9M,cAAA,GACA7/B,EAAAq/B,EAAA,KAAAsN,EACA,CACAC,MAAAD,EAAA,IACA,OAAA1F,EAAAplC,UAAA,MAAA6qC,UAAA,CAAAC,GACA,CACA,CACAtN,EAAArE,IAAA,KAAAqE,EAAA4I,EAAA9L,EAAA,CAAA8L,EAAA7L,EAAA,CAAAH,EAAAkG,GAAA,EACA9C,EAAA7E,IAAA,KAAA6E,EAAApD,EAAAzB,IAAA,CAAAyB,EAAAkG,GAAA,CAAAlG,EAAAzB,IAAA,EACA,IAAAqS,EAAA5E,EAAA5L,UAAA,CACAiP,EAAA,GAAApE,EAAAtN,IAAA,EAAAyF,EAAA4I,EAAAM,IAAA,CAAAroC,KAAA4oB,IAAA,CAAA+jB,EAAA,GAAAA,GAEA,OACA5E,MAAAA,EACA6E,gBAAAzN,EACA8J,uBAAAA,EACAL,oBAAAA,EACAG,mBAAAA,CACA,CACA,CAsaA,SAAAnC,EAAA7K,CAAA,CAAA4F,CAAA,EAEA,IAAAL,EAAAvF,EAAAO,KAAA,CACA5hC,EAAAwC,EACA,QAAAsM,EAAA83B,EAAAnkC,EAA0BqM,EAAApM,IAAAF,EAAiBsM,GAAApM,EAC3C1C,GAAAyC,EACA,IAAA8oB,EAAAvrB,EAGAmyC,EAAAzvC,GAAA6oB,EAAA9oB,EAAAA,EACA2vC,EAAAD,EAAAzvC,EACA8oB,EAAA,CAAAob,EAAAnkC,CAAA,EAAA2vC,EACA3mB,EAAA,CAAAD,EAAA/oB,CAAA,EAAAC,EACAgpB,EAAA0mB,EAAA3vC,EAEA4vC,EAAAhR,EAAA+E,GAAA,CAAAa,EAAAzb,GACA8mB,EAAAjR,EAAA+E,GAAA,CAAAa,EAAA,CAAAzb,EAAA/oB,CAAA,EAAAC,GACA6vC,EAAA,CAAA7oB,EAAAid,KACA,IAAA6L,EAAAH,EACAI,EAAApR,EAAA+E,GAAA,CAAAO,EAAAjb,GACAgnB,EAAArR,EAAAgG,GAAA,CAAAoL,GACAC,EAAArR,EAAAkD,GAAA,CAAAmO,EAAA/L,GACA,IAAAgM,EAAAtR,EAAAkD,GAAA,CAAA7a,EAAAgpB,GACAC,EAAAtR,EAAA+E,GAAA,CAAAuM,EAAAlnB,GACAknB,EAAAtR,EAAAkD,GAAA,CAAAoO,EAAAF,GACAA,EAAApR,EAAAkD,GAAA,CAAAoO,EAAAhM,GACA+L,EAAArR,EAAAkD,GAAA,CAAAoO,EAAAjpB,GACA,IAAAkpB,EAAAvR,EAAAkD,GAAA,CAAAmO,EAAAD,GACAE,EAAAtR,EAAA+E,GAAA,CAAAwM,EAdAT,GAeA,IAAAU,EAAAxR,EAAA+F,GAAA,CAAAuL,EAAAtR,EAAAkG,GAAA,EACAkL,EAAApR,EAAAkD,GAAA,CAAAmO,EAAAJ,GACAK,EAAAtR,EAAAkD,GAAA,CAAAqO,EAAAJ,GACAE,EAAArR,EAAAkI,IAAA,CAAAkJ,EAAAC,EAAAG,GACAD,EAAAvR,EAAAkI,IAAA,CAAAoJ,EAAAC,EAAAC,GAEA,QAAAxyC,EAAAkrB,EAAyBlrB,EAAAoC,EAASpC,IAAA,CAClC,IAAAsyC,EAAAtyC,EAAAqC,EACAiwC,EAAAjwC,GAAAiwC,EAAAlwC,EACA,IAAAqwC,EAAAzR,EAAA+E,GAAA,CAAAwM,EAAAD,GACAI,EAAA1R,EAAA+F,GAAA,CAAA0L,EAAAzR,EAAAkG,GAAA,EACAkL,EAAApR,EAAAkD,GAAA,CAAAmO,EAAAF,GACAA,EAAAnR,EAAAkD,GAAA,CAAAiO,EAAAA,GACAM,EAAAzR,EAAAkD,GAAA,CAAAqO,EAAAJ,GACAE,EAAArR,EAAAkI,IAAA,CAAAkJ,EAAAC,EAAAK,GACAH,EAAAvR,EAAAkI,IAAA,CAAAuJ,EAAAF,EAAAG,EACA,CACA,OAAiBhK,QAAA8J,EAAAx0C,MAAAq0C,CAAA,CACjB,EACA,GAAArR,EAAAO,KAAA,CAAA0E,IAAAD,EAAA,CAEA,IAAA9a,EAAA,CAAA8V,EAAAO,KAAA,CAAAyE,CAAA,EAAAC,EACA9a,EAAA6V,EAAAgI,IAAA,CAAAhI,EAAAhC,GAAA,CAAA4H,IACAsL,EAAA,CAAA7oB,EAAAid,KACA,IAAA6L,EAAAnR,EAAAgG,GAAA,CAAAV,GACA8L,EAAApR,EAAAkD,GAAA,CAAA7a,EAAAid,GACA6L,EAAAnR,EAAAkD,GAAA,CAAAiO,EAAAC,GACA,IAAAO,EAAA3R,EAAA+E,GAAA,CAAAoM,EAAAjnB,GACAynB,EAAA3R,EAAAkD,GAAA,CAAAyO,EAAAP,GACA,IAAAQ,EAAA5R,EAAAkD,GAAA,CAAAyO,EAAAxnB,GACAknB,EAAArR,EAAAkD,GAAA,CAAAlD,EAAAgG,GAAA,CAAA2L,GAAArM,GACAkM,EAAAxR,EAAA+F,GAAA,CAAAsL,EAAAhpB,GACAzmB,EAAAo+B,EAAAkI,IAAA,CAAA0J,EAAAD,EAAAH,GACA,OAAqB9J,QAAA8J,EAAAx0C,MAAA4E,CAAA,CACrB,CACA,CAGA,OAAAsvC,CACA,CAzeAn0C,EAAA+tC,iBAAyB,CAAAA,EA2ZzB/tC,EAAAygC,WAAmB,CA7YnB,SAAAF,CAAA,EACA,IAAA0O,EAAA6F,SAdA/R,CAAA,EACA,IAAA56B,EAAA,GAAA+lC,EAAAvN,aAAA,EAAAoC,GAUA,OATAkL,EAAA/K,cAAA,CAAA/6B,EAAA,CACAlJ,KAAA,OACAohC,KAAA,WACAh4B,YAAA,UACA,EAAK,CACL0sC,SAAA,WACAC,cAAA,WACAC,KAAA,SACA,GACAn1C,OAAA4gC,MAAA,EAA2BuU,KAAA,MAAA9sC,CAAA,EAC3B,EAEAo4B,GACA,CAAY0C,GAAAA,CAAA,CAAA9kC,EAAA+2C,CAAA,EAAqBjG,EACjCkG,EAAAlS,EAAAmH,KAAA,GACAgL,EAAA,EAAAnS,EAAAmH,KAAA,GAIA,SAAAiL,EAAA52C,CAAA,EACA,OAAAqO,EAAAA,GAAA,CAAArO,EAAAy2C,EACA,CACA,SAAAI,EAAA72C,CAAA,EACA,OAAAqO,EAAAg7B,MAAA,CAAArpC,EAAAy2C,EACA,CACA,IAAYpB,gBAAAzN,CAAA,CAAA8J,uBAAAA,CAAA,CAAAL,oBAAAA,CAAA,CAAAG,mBAAAA,CAAA,EAA2FlC,EAAA,CACvG,GAAAkB,CAAA,CACAjoC,QAAA0oC,CAAA,CAAAC,CAAA,CAAAgE,CAAA,EACA,IAAAl1C,EAAAkxC,EAAAE,QAAA,GACAjrC,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAmG,CAAA,EACAkX,EAAAmyB,EAAAzlC,WAAA,QACA,EACAsT,EAAApd,WAAAoL,IAAA,EAAA6lC,EAAAwB,QAAA,SAAAvsC,GAGAkX,EAAApd,WAAAoL,IAAA,MAAAlF,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAoG,CAAA,EAEA,EACAymC,UAAAzsC,CAAA,EACA,IAAAkI,EAAAlI,EAAAE,MAAA,CACAw2C,EAAA12C,CAAA,IACAguB,EAAAhuB,EAAA0I,QAAA,IAEA,GAAAR,IAAAouC,GAAAI,CAAAA,IAAAA,GAAAA,IAAAA,CAAA,GACA,IAAA3wC,EAAAqpC,EAAAlK,eAAA,CAAAlX,GACA,IA5BAzoB,CAAAA,EA4BAQ,GA5BAod,EAAAihB,EAAAO,KAAA,EA6BA,qCACA,IAAAqR,EAAA/E,EAAAlrC,GACAC,EAAAo+B,EAAAgI,IAAA,CAAA4J,GAMA,MAHAU,CAAAA,EAAAA,CAAA,MAFA,EAAA1wC,EAAAR,CAAA,IAAAA,CAAA,GAIAQ,CAAAA,EAAAo+B,EAAAhC,GAAA,CAAAp8B,EAAA,EACA,CAAyBD,EAAAA,EAAAC,EAAAA,CAAA,CACzB,CACA,GAAAkC,IAAAquC,GAAAG,IAAAA,EAGA,OAAyB3wC,EAFzBq+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,GAAA07B,EAAAmH,KAAA,GAEyBvlC,EADzBo+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,CAAA07B,EAAAmH,KAAA,GAAAnH,EAAAmH,KAAA,EACyB,CAGzB,gCAAmDrjC,EAAA,uBAAK,EAAwBouC,EAAA,qBAAe,EAAsBC,EAAA,mBAAiB,EAEtI,CACA,GACAI,EAAA,GAAAvH,EAAAplC,UAAA,CAAAolC,EAAA5C,eAAA,CAAArpB,EAAAitB,EAAA3L,WAAA,GASAmS,EAAA,CAAAl3C,EAAAuL,EAAAhC,IAAAmmC,EAAAlK,eAAA,CAAAxlC,EAAAuR,KAAA,CAAAhG,EAAAhC,GAIA,OAAA4tC,EACA/2C,YAAA8pC,CAAA,CAAAtmC,CAAA,CAAAwzC,CAAA,EACA,KAAAlN,CAAA,CAAAA,EACA,KAAAtmC,CAAA,CAAAA,EACA,KAAAwzC,QAAA,CAAAA,EACA,KAAA9O,cAAA,EACA,CAEA,OAAA+O,YAAA1rC,CAAA,EACA,IAAAtI,EAAAqtC,EAAA3L,WAAA,CAEA,WAAAoS,EAAAD,EADAvrC,EAAA,GAAAlG,EAAA0nC,WAAA,qBAAAxhC,EAAAtI,EAAAA,GACA,EAAAA,GAAA6zC,EAAAvrC,EAAAtI,EAAA,EAAAA,GACA,CAGA,OAAAi0C,QAAA3rC,CAAA,EACA,IAAoBu+B,EAAAA,CAAA,CAAAtmC,CAAA,EAAOnC,EAAAguC,GAAA,CAAAS,KAAA,IAAAzqC,EAAA0nC,WAAA,QAAAxhC,IAC3B,WAAAwrC,EAAAjN,EAAAtmC,EACA,CACA0kC,gBAAA,CAEA,IAAAoJ,EAAA,KAAAxH,CAAA,EACA,yCACA,IAAAwH,EAAA,KAAA9tC,CAAA,EACA,wCACA,CACA2zC,eAAAH,CAAA,EACA,WAAAD,EAAA,KAAAjN,CAAA,MAAAtmC,CAAA,CAAAwzC,EACA,CACAI,iBAAAC,CAAA,EACA,IAAoBvN,EAAAA,CAAA,CAAAtmC,CAAA,CAAAwzC,SAAAlmB,CAAA,EAAsB,KAC1CvwB,EAAA81C,EAAA,GAAAhxC,EAAA0nC,WAAA,YAAAsK,IACA,GAAAvmB,MAAAA,GAAA,WAAAzwB,QAAA,CAAAywB,GACA,mCACA,IAAAwmB,EAAAxmB,IAAAA,GAAAA,IAAAA,EAAAgZ,EAAAwG,EAAA9wC,CAAA,CAAAsqC,EACA,GAAAwN,GAAAhT,EAAAO,KAAA,CACA,0CACA,IAAA1uB,EAAA,CAAA2a,EAAAA,CAAA,eACA9qB,EAAA0hC,EAAAwK,OAAA,CAAA/7B,EAAA0gC,EAAAS,IACAC,EAAAZ,EAAAW,GACAtP,EAAA0O,EAAA,CAAAn2C,EAAAg3C,GACAC,EAAAd,EAAAlzC,EAAA+zC,GACAvN,EAAAtC,EAAArE,IAAA,CAAAkR,oBAAA,CAAAvuC,EAAAgiC,EAAAwP,GACA,IAAAxN,EACA,iCAEA,OADAA,EAAA9B,cAAA,GACA8B,CACA,CAEAyN,UAAA,CACA,OA5DAl4C,IA4DA,CAAAiE,CAAA,CA7DA+yC,GAAA7wC,CA8DA,CACAgyC,YAAA,CACA,YAAAD,QAAA,OAAAV,EAAA,KAAAjN,CAAA,CAAA4M,EAAA,MAAAlzC,CAAA,OAAAwzC,QAAA,OAGAW,eAAA,CACA,OAAArI,EAAArlC,UAAA,MAAA2tC,QAAA,GACA,CACAA,UAAA,CACA,OAAAv2C,EAAAguC,GAAA,CAAAY,UAAA,EAA4CnG,EAAA,KAAAA,CAAA,CAAAtmC,EAAA,KAAAA,CAAA,EAC5C,CAEAq0C,mBAAA,CACA,OAAAvI,EAAArlC,UAAA,MAAA6tC,YAAA,GACA,CACAA,cAAA,CACA,OAAAjB,EAAA,KAAA/M,CAAA,EAAA+M,EAAA,KAAArzC,CAAA,CACA,CACA,CA8CA,SAAAu0C,EAAAvmB,CAAA,EACA,IAAA9mB,EAAA8mB,aAAAzxB,WACAiN,EAAA,iBAAAwkB,EACAppB,EAAA,CAAAsC,GAAAsC,CAAA,GAAAwkB,EAAApxB,MAAA,QACA,EACAgI,IAAAouC,GAAApuC,IAAAquC,EACAzpC,EACA5E,IAAA,EAAAouC,GAAApuC,IAAA,EAAAquC,EACAjlB,aAAAkW,CAGA,CAuBA,IAAA0O,EAAA9F,EAAA8F,QAAA,EACA,SAAAl2C,CAAA,EAGA,IAAAmjB,EAAAisB,EAAAlK,eAAA,CAAAllC,GACA83C,EAAA93C,EAAAA,EAAAE,MAAA,CAAAkwC,EAAA5L,UAAA,CACA,OAAAsT,EAAA,EAAA30B,GAAAvgB,OAAAk1C,GAAA30B,CACA,EACAgzB,EAAA/F,EAAA+F,aAAA,EACA,SAAAn2C,CAAA,EACA,OAAAw2C,EAAAN,EAAAl2C,GACA,EAEA+3C,EAAA3I,EAAAvD,OAAA,CAAAuE,EAAA5L,UAAA,EAIA,SAAAwT,EAAA70B,CAAA,EACA,oBAAAA,EACA,+BACA,IAAA5d,CAAAA,GAAA4d,GAAAA,EAAA40B,CAAA,EACA,mCAAmD3H,EAAA5L,UAAA,CAAiB,GAEpE,OAAA4K,EAAA5C,eAAA,CAAArpB,EAAAitB,EAAA3L,WAAA,CACA,CAyDA,IAAAwT,EAAA,CAA6B7B,KAAAhG,EAAAgG,IAAA,CAAA8B,QAAA,IAC7BC,EAAA,CAA6B/B,KAAAhG,EAAAgG,IAAA,CAAA8B,QAAA,WAqB7B1Q,EAAArE,IAAA,CAAAiP,cAAA,IAkEA,CACAhC,MAAAA,EACAgI,aAnNA,SAAAlG,CAAA,CAAA4C,EAAA,IACA,OAAAtN,EAAAyK,cAAA,CAAAC,GAAA2C,UAAA,CAAAC,EACA,EAkNAuD,gBAxLA,SAAAC,CAAA,CAAAC,CAAA,CAAAzD,EAAA,IACA,GAAA+C,EAAAS,GACA,6CACA,IAAAT,EAAAU,GACA,6CAEA,OAAA74C,EADAsyC,OAAA,CAAAuG,GACApG,QAAA,CAAAb,EAAAgH,IAAAzD,UAAA,CAAAC,EACA,EAkLA0D,KA7EA,SAAArB,CAAA,CAAAsB,CAAA,CAAAnvC,EAAA2uC,CAAA,EACA,IAAgBhK,KAAAA,CAAA,CAAAyK,MAAAA,CAAA,EAAcC,SAnE9BxB,CAAA,CAAAjF,CAAA,CAAA5oC,EAAA2uC,CAAA,EACA,6BAAAW,IAAA,IAAA7mC,KAAAzI,GACA,mDACA,IAAgBlJ,KAAAA,CAAA,CAAAoJ,YAAAA,CAAA,EAAoB4mC,EACpC,CAAcgG,KAAAA,CAAA,CAAA8B,QAAAA,CAAA,CAAAW,aAAAC,CAAA,EAAmCxvC,CACjD,OAAA8sC,GACAA,CAAAA,EAAA,IACAe,EAAA,GAAAhyC,EAAA0nC,WAAA,YAAAsK,GACAe,GACAf,CAAAA,EAAA,GAAAhyC,EAAA0nC,WAAA,sBAAAzsC,EAAA+2C,GAAA,EAIA,IAAA4B,EAAA5C,EAAAgB,GACAvU,EAAA0O,EAAAY,GACA8G,EAAA,CAAAhB,EAAApV,GAAAoV,EAAAe,GAAA,CAEA,GAAAD,MAAAA,EAAA,CAEA,IAAApS,EAAAoS,CAAA,IAAAA,EAAAtvC,EAAA46B,EAAAmH,KAAA,EAAAuN,EACAE,EAAA/yC,IAAA,IAAAd,EAAA0nC,WAAA,iBAAAnG,GACA,CA4BA,OAAiBuH,KA3BjBmB,EAAAzlC,WAAA,IAAAqvC,GA2BiBN,MAxBjB,SAAAO,CAAA,EAEA,IAAAlnC,EAAAmkC,EAAA+C,GACA,IAAA7H,EAAAr/B,GACA,OACA,IAAAmnC,EAAAzC,EAAA1kC,GACA43B,EAAAnC,EAAArE,IAAA,CAAAgP,QAAA,CAAApgC,GAAAi/B,QAAA,GACApH,EAAA4M,EAAA7M,EAAA5jC,CAAA,EACA,GAAA6jC,IAAArkC,EACA,OAIA,IAAAjC,EAAAkzC,EAAA0C,EAAA1C,EAAA1kC,EAAA83B,EAAAhH,IACA,GAAAt/B,IAAAiC,EACA,OACA,IAAAuxC,EAAA,CAAAnN,EAAA5jC,CAAA,GAAA6jC,EAAA,KAAArqC,OAAAoqC,EAAA3jC,CAAA,CAAAR,GACA2zC,EAAA71C,EACA,GAAA8yC,GAxOA/2C,EADAg3C,GAAA7wC,EA0OA2zC,EAtOAC,EAJA/C,GAAA7wC,EAIAgxC,EAAA,CAsOAlzC,GAAAA,EACAwzC,GAAA,EAEA,WAAAD,EAAAjN,EAAAuP,EAAArC,EACA,CACiB,CACjB,EAiB8BK,EAAAsB,EAAAnvC,GAG9B,OAAA+vC,EADApM,cAAA,CAAAqM,EAAAl5C,IAAA,CAAAG,SAAA,CAAA+4C,EAAA7U,WAAA,CAAA6U,EAAA9X,IAAA,EACAyM,EAAAyK,EACA,EAyEAa,OAxDA,SAAAC,CAAA,CAAArC,CAAA,CAAAsC,CAAA,CAAAnwC,EAAA6uC,CAAA,MAQAtU,EADA6V,EAHA,GAFAvC,EAAA,GAAAhyC,EAAA0nC,WAAA,YAAAsK,GACAsC,EAAA,GAAAt0C,EAAA0nC,WAAA,cAAA4M,GACA,WAAAnwC,EACA,kDACA,IAAgB8sC,KAAAA,CAAA,CAAA8B,QAAAA,CAAA,EAAgB5uC,EAGhC,IACA,oBATAkwC,GASAG,aAAA95C,WAGA,IACA65C,EAAA7C,EAAAG,OAAA,CAbAwC,EAcA,CACA,MAAAI,EAAA,CACA,IAAAA,CAAAA,aAAAz4C,EAAAguC,GAAA,CAAAK,GAAA,EACA,MAAAoK,EACAF,EAAA7C,EAAAE,WAAA,CAlBAyC,EAmBA,MAEA,oBArBAA,GAqBA,iBAAAG,EAAA/P,CAAA,mBAAA+P,EAAAr2C,CAAA,EACA,IAAwBsmC,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,EAtBxBk2C,EAuBAE,EAAA,IAAA7C,EAAAjN,EAAAtmC,EACA,MAEA,qBAEAugC,EAAA2D,EAAAwK,OAAA,CAAAyH,EACA,CACA,MAAA1qC,EAAA,CACA,GAAAA,UAAAA,EAAA8qC,OAAA,CACA,8EACA,QACA,CACA,GAAAzD,GAAAsD,EAAAnC,QAAA,GACA,SACAW,GACAf,CAAAA,EAAA/G,EAAAhwC,IAAA,CAAA+2C,EAAA,EACA,IAAgBvN,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,EAAOo2C,EACvBr5C,EAAA81C,EAAAgB,GACA2C,EAAArD,EAAAnzC,GACAwkC,EAAA0O,EAAAn2C,EAAAy5C,GACAxC,EAAAd,EAAA5M,EAAAkQ,GACAh0C,EAAA0hC,EAAArE,IAAA,CAAAkR,oBAAA,CAAAxQ,EAAAiE,EAAAwP,IAAAtG,iBACA,EAAAlrC,GAGA4jC,EADA5jC,EAAAC,CAAA,IACA6jC,CACA,EAOAqL,gBAAAzN,EACAqP,UAAAA,EACA3mC,MAhQA,CACA6pC,kBAAA7H,CAAA,EACA,IAEA,OADAZ,EAAAY,GACA,EACA,CACA,MAAAnjC,EAAA,CACA,QACA,CACA,EACAuiC,uBAAAA,EAKA0I,iBAAA,KACA,IAAA95C,EAAA+N,EAAAm6B,gBAAA,CAAAgI,EAAA9wC,CAAA,EACA,OAAA2O,EAAAk6B,cAAA,CAAAiI,EAAA5mC,WAAA,CAAAtJ,GAAAkwC,EAAA9wC,CAAA,CACA,EASA26C,WAAAA,CAAAzX,EAAA,EAAAsO,EAAAtJ,EAAArE,IAAA,IACA2N,EAAAsB,cAAA,CAAA5P,GACAsO,EAAAqB,QAAA,CAAAvvC,OAAA,IACAkuC,EAEA,CAiOA,CACA,EAgFA3vC,EAAA8tC,cAAsB,CAAAA,EA6CtB9tC,EAAA6tC,mBAA2B,CAxC3B,SAAA5K,CAAA,CAAA96B,CAAA,EAEA,GADA2E,EAAAk2B,aAAA,CAAAC,GACA,CAAAA,EAAA0H,OAAA,CAAAxiC,EAAA4wC,CAAA,IAAA9V,EAAA0H,OAAA,CAAAxiC,EAAA7C,CAAA,IAAA29B,EAAA0H,OAAA,CAAAxiC,EAAA0gC,CAAA,EACA,iDACA,IAAAsL,EAAArG,EAAA7K,EAAA96B,EAAA0gC,CAAA,EACA,IAAA5F,EAAA2H,KAAA,CACA,4CAGA,eAEAwJ,EAAAC,EAAAC,EAAAE,EAAAD,EAAAyE,EAAAp0C,EAAAC,EACAuvC,EAAAnR,EAAAgG,GAAA,CAAA3d,GACA8oB,EAAAnR,EAAAkD,GAAA,CAAAiO,EAAAjsC,EAAA0gC,CAAA,EACAwL,EAAApR,EAAAgG,GAAA,CAAAmL,GACAC,EAAApR,EAAAziC,GAAA,CAAA6zC,EAAAD,GACAE,EAAArR,EAAAziC,GAAA,CAAA6zC,EAAApR,EAAAkG,GAAA,EACAmL,EAAArR,EAAAkD,GAAA,CAAAmO,EAAAnsC,EAAA7C,CAAA,EACAkvC,EAAAvR,EAAAkI,IAAA,CAAAhjC,EAAA0gC,CAAA,CAAA5F,EAAAhC,GAAA,CAAAoT,GAAA,CAAApR,EAAA+F,GAAA,CAAAqL,EAAApR,EAAAzB,IAAA,GACAgT,EAAAvR,EAAAkD,GAAA,CAAAqO,EAAArsC,EAAA4wC,CAAA,EACA1E,EAAApR,EAAAgG,GAAA,CAAAqL,GACA0E,EAAA/V,EAAAgG,GAAA,CAAAuL,GACAD,EAAAtR,EAAAkD,GAAA,CAAA6S,EAAA7wC,EAAA4wC,CAAA,EACA1E,EAAApR,EAAAziC,GAAA,CAAA6zC,EAAAE,GACAF,EAAApR,EAAAkD,GAAA,CAAAkO,EAAAC,GACA0E,EAAA/V,EAAAkD,GAAA,CAAA6S,EAAAxE,GACAD,EAAAtR,EAAAkD,GAAA,CAAA6S,EAAA7wC,EAAA7C,CAAA,EACA+uC,EAAApR,EAAAziC,GAAA,CAAA6zC,EAAAE,GACA3vC,EAAAq+B,EAAAkD,GAAA,CAAAiO,EAAAE,GACA,IAAgB3J,QAAAA,CAAA,CAAA1qC,MAAAA,CAAA,EAAiBk0C,EAAAE,EAAA2E,GACjCn0C,EAAAo+B,EAAAkD,GAAA,CAAAiO,EAAA9oB,GACAzmB,EAAAo+B,EAAAkD,GAAA,CAAAthC,EAAA5E,GACA2E,EAAAq+B,EAAAkI,IAAA,CAAAvmC,EAAA0vC,EAAA3J,GACA9lC,EAAAo+B,EAAAkI,IAAA,CAAAtmC,EAAA5E,EAAA0qC,GACA,IAAAgK,EAAA1R,EAAA2H,KAAA,CAAAtf,KAAA2X,EAAA2H,KAAA,CAAA/lC,GAGA,OAFAA,EAAAo+B,EAAAkI,IAAA,CAAAlI,EAAAhC,GAAA,CAAAp8B,GAAAA,EAAA8vC,GAEA,CAAiB/vC,EADjBA,EAAAq+B,EAAAmD,GAAA,CAAAxhC,EAAA4vC,GACiB3vC,EAAAA,CAAA,CACjB,CACA,sCCniCA/E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8mC,aAAqB,CAAG9mC,EAAAwmC,WAAmB,CAAGxmC,EAAAi5C,OAAe,CAAGj5C,EAAAk5C,SAAiB,QAEjF,IAAAC,EAAiBr1C,EAAQ,OACzBqJ,EAAgBrJ,EAAQ,OACxB+8B,EAAqB/8B,EAAQ,OAC7Bs8B,EAAyBt8B,EAAQ,OACjCE,EAAmBF,EAAQ,OAC3Bs1C,EAA2Bt1C,EAAQ,OACnCu1C,EAA2Bv1C,EAAQ,OACnCw1C,EAAA73C,OAAA,sEACA83C,EAAA93C,OAAA,sEACA4C,EAAA5C,OAAA,GACA6C,EAAA7C,OAAA,GACA+3C,EAAA,CAAA/6C,EAAAF,IAAA,CAAAE,EAAAF,EAAA+F,CAAA,EAAA/F,EAKA,SAAAk7C,EAAA50C,CAAA,EAGA,IAAAojC,EAAAxmC,OAAA,GAAAi4C,EAAAj4C,OAAA,GAAAk4C,EAAAl4C,OAAA,IAAAm4C,EAAAn4C,OAAA,IAEAo4C,EAAAp4C,OAAA,IAAAq4C,EAAAr4C,OAAA,IAAAs4C,EAAAt4C,OAAA,IACAoqB,EAAA,EAAAhnB,EAAAA,EALAy0C,EAMAvtB,EAAA,EAAAF,EAAAhnB,EANAy0C,EAOAU,EAAA,GAAAnZ,EAAAkH,IAAA,EAAAhc,EAAAkc,EAPAqR,GAOAvtB,EAPAutB,EAQAW,EAAA,GAAApZ,EAAAkH,IAAA,EAAAiS,EAAA/R,EARAqR,GAQAvtB,EARAutB,EASAY,EAAA,GAAArZ,EAAAkH,IAAA,EAAAkS,EAAA31C,EATAg1C,GASAztB,EATAytB,EAUAa,EAAA,GAAAtZ,EAAAkH,IAAA,EAAAmS,EAAAP,EAVAL,GAUAY,EAVAZ,EAWAc,EAAA,GAAAvZ,EAAAkH,IAAA,EAAAoS,EAAAP,EAXAN,GAWAa,EAXAb,EAYAe,EAAA,GAAAxZ,EAAAkH,IAAA,EAAAqS,EAAAN,EAZAR,GAYAc,EAZAd,EAaAgB,EAAA,GAAAzZ,EAAAkH,IAAA,EAAAsS,EAAAN,EAbAT,GAaAe,EAbAf,EAcAiB,EAAA,GAAA1Z,EAAAkH,IAAA,EAAAuS,EAAAR,EAdAR,GAcAc,EAdAd,EAeAkB,EAAA,GAAA3Z,EAAAkH,IAAA,EAAAwS,EAAAtS,EAfAqR,GAeAvtB,EAfAutB,EAgBArH,EAAA,GAAApR,EAAAkH,IAAA,EAAAyS,EAAAX,EAhBAP,GAgBAa,EAhBAb,EAiBAjQ,EAAA,GAAAxI,EAAAkH,IAAA,EAAAkK,EAAAyH,EAjBAJ,GAiBAztB,EAjBAytB,EAkBA1d,EAAA,GAAAiF,EAAAkH,IAAA,EAAAsB,EAAA/kC,EAlBAg1C,GAmBA,IAAArW,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAA/2B,GACA,uCACA,OAAA+2B,CACA,CACA,IAAAqH,EAAA,GAAApC,EAAAyG,KAAA,EAAAgS,EAAAt2C,KAAAA,EAAAA,KAAAA,EAAA,CAAuEioC,KAAAwO,CAAA,EACvEz5C,CAAAA,EAAAk5C,SAAiB,IAAAG,EAAApZ,WAAA,GACjBxhC,EAAAgD,OAAA,GACAlD,EAAAkD,OAAA,GACAwhC,GAAAA,EACA9kC,EAAAo7C,EAEApW,GAAA1hC,OAAA,iFACA2hC,GAAA3hC,OAAA,iFACAvC,EAAAuC,OAAA,GACAwzC,KAAA,GAOA1F,KAAA,CACAC,KAAA/tC,OAAA,sEACAguC,YAAA,IAEA,IAAAgL,EAAAh5C,OAAA,sCACA8pB,EAAA,CAAAlnB,EAAA5C,OAAA,sCACAi5C,EAAAj5C,OAAA,uCAEAk5C,EAAAl5C,OAAA,uCACA0rB,EAAAqsB,EAAA3tB,EAAAjb,EANA2oC,GAOAnsB,EAAAosB,EAAA,CAAAjuB,EAAA3a,EAPA2oC,GAQA7G,EAAA,GAAA7R,EAAA/zB,GAAA,EAAA8D,EAAAuc,EAAAstB,EAAArtB,EAAAstB,EARAnB,GASA1oC,EAAA,GAAAgwB,EAAA/zB,GAAA,GAAAqgB,EAAA5B,EAAA6B,EALAqtB,EAJAlB,GAUA9G,EAAAC,EAAAiI,EACAhI,EAAA9hC,EAAA8pC,EAKA,GAJAlI,GACAC,CAAAA,EAAAv0C,EAAAu0C,CAAA,EACAC,GACA9hC,CAAAA,EAAA1S,EAAA0S,CAAA,EACA6hC,EAAAiI,GAAA9pC,EAAA8pC,EACA,mDAAA/pC,GAEA,OAAqB6hC,MAAAA,EAAAC,GAAAA,EAAAC,MAAAA,EAAA9hC,GAAAA,CAAA,CACrB,CACA,CACA,EAACsoC,EAAAyB,MAAA,EAGD,IAAAx2C,EAAA3C,OAAA,GACAo5C,EAAA,oBAAAj2C,GAAAR,EAAAQ,GAAAA,EAAA00C,EACAhQ,EAAA,oBAAA1kC,GAAAR,EAAAQ,GAAAA,EAAA20C,EAEAuB,EAAA,GACA,SAAAC,EAAAC,CAAA,IAAAC,CAAA,EACA,IAAAC,EAAAJ,CAAA,CAAAE,EAAA,CACA,GAAAE,KAAAl4C,IAAAk4C,EAAA,CACA,IAAAC,EAAA,GAAAhC,EAAAyB,MAAA,EAAAl8C,WAAAoL,IAAA,CAAAkxC,EAAA,GAAAnwB,EAAA3f,UAAA,MACAgwC,EAAA,GAAAl3C,EAAAwE,WAAA,EAAA2yC,EAAAA,GACAL,CAAA,CAAAE,EAAA,CAAAE,CACA,CACA,SAAA/B,EAAAyB,MAAA,KAAA52C,EAAAwE,WAAA,EAAA0yC,KAAAD,GACA,CAEA,IAAAG,EAAA,GAAAzL,EAAA+D,UAAA,KAAA5jC,KAAA,IACAurC,EAAA,MAAAr3C,EAAAqnC,eAAA,EAAAltC,EAAA,IACAm9C,EAAA,MAAAza,EAAA/zB,GAAA,EAAAlI,EAAA00C,GACAjE,EAAA,MAAAxU,EAAA/zB,GAAA,EAAAlI,EAAA20C,GACAlT,EAAArmC,EAAAk5C,SAAA,CAAApF,eAAA,CACAyH,EAAA,CAAA5S,EAAAlqC,EAAAF,IAAA8nC,EAAArE,IAAA,CAAAkR,oBAAA,CAAAvK,EAAAlqC,EAAAF,GAEA,SAAAi9C,EAAAC,CAAA,EACA,IAAAC,EAAA17C,EAAAk5C,SAAA,CAAAnqC,KAAA,CAAAohC,sBAAA,CAAAsL,GACApqC,EAAAg1B,EAAAyK,cAAA,CAAA4K,GAEA,OAAa5I,OADbzhC,EAAA8/B,QAAA,GAAAuK,EAAArG,EAAA,CAAAqG,GACa78C,MAAAu8C,EAAA/pC,EAAA,CACb,CAKA,SAAAsqC,EAAA/2C,CAAA,EACA,IAAAi2C,EAAAj2C,GACA,qCACA,IAAAg3C,EAAAN,EAAA12C,EAAAA,GAEAC,EAAA40C,EADA6B,EAAAM,EAAAh3C,EAAAnD,OAAA,KAEAoD,EAAAP,IAAAF,GACAS,CAAAA,EAAAy2C,EAAA,CAAAz2C,EAAA,EACA,IAAAwM,EAAA,IAAAg1B,EAAAzhC,EAAAC,EAAAR,GAEA,OADAgN,EAAAw1B,cAAA,GACAx1B,CACA,CAIA,SAAAwqC,EAAA,GAAAjX,CAAA,EACA,OAAAyQ,EAAA,GAAArxC,EAAA+/B,eAAA,EAAAgX,EAAA,uBAAAnW,IACA,CAkCA,SAAAkX,EAAAzD,CAAA,CAAAK,CAAA,CAAAJ,CAAA,EACA,IAAAzJ,EAAA,GAAA7qC,EAAA0nC,WAAA,cAAA2M,EAAA,IACA1nC,EAAA,GAAA3M,EAAA0nC,WAAA,YAAAgN,GACAqD,EAAA,GAAA/3C,EAAA0nC,WAAA,cAAA4M,EAAA,IACA,IACA,IAAA5V,EAAAiZ,EAAA,GAAA33C,EAAA+/B,eAAA,EAAAgY,IACAtT,EAAA,GAAAzkC,EAAA+/B,eAAA,EAAA8K,EAAAtnC,QAAA,QACA,IAAAszC,EAAApS,GACA,SACA,IAAAtmC,EAAA,GAAA6B,EAAA+/B,eAAA,EAAA8K,EAAAtnC,QAAA,SACA,IAAA+hC,EAAAnnC,GACA,SACA,IAAAojC,EAAAsW,EAAAR,EAAA5S,GAAA2S,EAAA1Y,GAAA/xB,GACAhM,EAAA42C,EAAA7Y,EAAAvgC,EAAAkzC,EAAA,CAAA9P,IACA,IAAA5gC,GAAA,CAAAA,EAAAwsC,QAAA,IAAAxsC,EAAAkrC,QAAA,GAAAjrC,CAAA,GAAA6jC,EACA,SACA,QACA,CACA,MAAA76B,EAAA,CACA,QACA,CACA,CACA5N,EAAAi5C,OAAe,EACfhC,aArDA,SAAAlG,CAAA,EACA,OAAAyK,EAAAzK,GAAAlyC,KAAA,EAqDAw4C,KA/CA,SAAAqB,CAAA,CAAA3H,CAAA,CAAAiL,EAAA,GAAA7uC,EAAA9E,WAAA,OACA,IAAAsI,EAAA,GAAA3M,EAAA0nC,WAAA,YAAAgN,GACA,CAAY75C,MAAA2xC,CAAA,CAAAsC,OAAArR,CAAA,EAAuB+Z,EAAAzK,GACnCtyC,EAAA,GAAAuF,EAAA0nC,WAAA,YAAAsQ,EAAA,IACAj3C,EAAAs2C,EAAA5Z,EAAA,GAAAz9B,EAAA+/B,eAAA,EAAAgX,EAAA,cAAAt8C,KACAw9C,EAAAlB,EAAA,gBAAAh2C,EAAAyrC,EAAA7/B,GACAurC,EAAA7G,EAAA,GAAArxC,EAAA+/B,eAAA,EAAAkY,IACA,GAAAC,IAAA93C,EACA,sCACA,IAAYvF,MAAA+qB,CAAA,CAAAkpB,OAAAliC,CAAA,EAAuB4qC,EAAAU,GACnC3W,EAAAsW,EAAAjyB,EAAA4mB,EAAA7/B,GACAk+B,EAAA,IAAAnwC,WAAA,IAIA,GAHAmwC,EAAAvnC,GAAA,CAAAsiB,EAAA,GACAilB,EAAAvnC,GAAA,CAAA+zC,EAAAhG,EAAAzkC,EAAA20B,EAAA9D,IAAA,IAEA,CAAAqa,EAAAjN,EAAAl+B,EAAA6/B,GACA,gDACA,OAAA3B,CACA,EA8BAuJ,OAAA0D,EACA/sC,MAAA,CACA8pC,iBAAA74C,EAAAk5C,SAAA,CAAAnqC,KAAA,CAAA8pC,gBAAA,CACA8C,OAAAA,EACAP,aAAAA,EACA/P,gBAAArnC,EAAAqnC,eAAA,CACAtH,gBAAA//B,EAAA+/B,eAAA,CACAgX,WAAAA,EACAjuC,IAAA+zB,EAAA/zB,GAAA,CAEA,EACA,IAAAqvC,EAAA,GAAA/C,EAAA1V,UAAA,EAAAT,EAAA,CAEA,CACA,qEACA,oEACA,qEACA,qEACA,CAEA,CACA,qEACA,qEACA,qEACA,CAEA,CACA,qEACA,qEACA,qEACA,qEACA,CAEA,CACA,qEACA,qEACA,qEACA,qEACA,CACA,CAAA5oB,GAAA,IAAApY,EAAAoY,GAAA,IAAA5Y,OAAAuD,MACAo3C,EAAA,GAAAhc,EAAAyN,mBAAA,EAAA5K,EAAA,CACA8V,EAAAt3C,OAAA,sEACA6D,EAAA7D,OAAA,QACAonC,EAAA5F,EAAA9jC,MAAA,CAAAsC,OAAA,OACA,GACA46C,EAAA,GAAAjD,EAAA3V,YAAA,EAAAzjC,EAAAk5C,SAAA,CAAApF,eAAA,KACA,IAAYlvC,EAAAA,CAAA,CAAAC,EAAAA,CAAA,EAAOu3C,EAAAnZ,EAAA9jC,MAAA,CAAAm9C,CAAA,MACnB,OAAAH,EAAAv3C,EAAAC,EACA,EAAC,CACDq/B,IAAA,iCACA6C,UAAA,iCACA11B,EAAA4xB,EAAAO,KAAA,CACA7yB,EAAA,EACAC,EAAA,IACAq0B,OAAA,MACAhmC,KAAAk6C,EAAAyB,MAAA,EAEA56C,CAAAA,EAAAwmC,WAAmB,CAAA6V,EAAA7V,WAAA,CACnBxmC,EAAA8mC,aAAqB,CAAAuV,EAAAvV,aAAA,mCC5PrB,SAAA5oC,EAAAC,CAAA,EACA,IAAAC,OAAAC,aAAA,CAAAF,IAAAA,EAAA,EACA,uCAAmDA,EAAE,EACrD,CAEA,SAAAG,EAAAC,CAAA,EACA,qBAAAA,EACA,qCAAiDA,EAAE,EACnD,CAEA,SAAAM,EAAAN,CAAA,IAAAO,CAAA,EACA,IAAAP,CAAAA,aAAAG,UAAA,EACA,mCACA,GAAAI,EAAAC,MAAA,KAAAD,EAAAE,QAAA,CAAAT,EAAAQ,MAAA,EACA,6CAAyDD,EAAQ,kBAAkBP,EAAAQ,MAAA,CAAS,EAC5F,CAEA,SAAAE,EAAAA,CAAA,EACA,sBAAAA,GAAA,mBAAAA,EAAAE,MAAA,CACA,+DACAjB,EAAAe,EAAAG,SAAA,EACAlB,EAAAe,EAAAI,QAAA,CACA,CAEA,SAAAC,EAAAC,CAAA,CAAAC,EAAA,IACA,GAAAD,EAAAE,SAAA,CACA,gDACA,GAAAD,GAAAD,EAAAG,QAAA,CACA,oDACA,CAEA,SAAAC,EAAAC,CAAA,CAAAL,CAAA,EACAV,EAAAe,GACA,IAAAC,EAAAN,EAAAH,SAAA,CACA,GAAAQ,EAAAb,MAAA,CAAAc,EACA,qEAAiFA,EAAI,EAErF,CAvCAC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAL,MAAc,CAAGK,EAAAV,MAAc,CAAGU,EAAAf,IAAY,CAAGe,EAAAnB,KAAa,CAAGmB,EAAA1B,IAAY,CAAG0B,EAAA9B,MAAc,QAK9F8B,EAAA9B,MAAc,CAAAA,EAKd8B,EAAA1B,IAAY,CAAAA,EAOZ0B,EAAAnB,KAAa,CAAAA,EAObmB,EAAAf,IAAY,CAAAA,EAOZe,EAAAV,MAAc,CAAAA,EAQdU,EAAAL,MAAc,CAAAA,EAEdK,EAAA,OAAe,CADf,CAAiB9B,OAAAA,EAAAI,KAAAA,EAAAO,MAAAA,EAAAI,KAAAA,EAAAK,OAAAA,EAAAK,OAAAA,CAAA,sCCzCjBG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAu8C,IAAY,QACZ,IAAA14C,EAAqBC,EAAQ,OAC7BE,EAAmBF,EAAQ,MAe3B,OAAAy4C,UAAAv4C,EAAAkC,IAAA,CACAvH,YAAAU,CAAA,CAAAD,CAAA,CAAAo9C,CAAA,CAAA71C,CAAA,EACA,QACA,KAAAtH,QAAA,CAAAA,EACA,KAAAD,SAAA,CAAAA,EACA,KAAAo9C,SAAA,CAAAA,EACA,KAAA71C,IAAA,CAAAA,EACA,KAAAjH,QAAA,IACA,KAAAX,MAAA,GACA,KAAAsH,GAAA,GACA,KAAA5G,SAAA,IACA,KAAA6J,MAAA,KAAA5K,WAAAW,GACA,KAAAo9C,IAAA,IAAAz4C,EAAAkF,UAAA,OAAAI,MAAA,CACA,CACAzC,OAAAC,CAAA,EACA,GAAAjD,EAAAvE,MAAA,QACA,IAAgBm9C,KAAAA,CAAA,CAAAnzC,OAAAA,CAAA,CAAAjK,SAAAA,CAAA,EAAyB,KAEzC0H,EAAAD,CADAA,EAAA,GAAA9C,EAAAgD,OAAA,EAAAF,EAAA,EACA/H,MAAA,CACA,QAAAsH,EAAA,EAA0BA,EAAAU,GAAU,CACpC,IAAAE,EAAAC,KAAArH,GAAA,CAAAR,EAAA,KAAAgH,GAAA,CAAAU,EAAAV,GAEA,GAAAY,IAAA5H,EAAA,CACA,IAAAq9C,EAAA,GAAA14C,EAAAkF,UAAA,EAAApC,GACA,KAAuBzH,GAAA0H,EAAAV,EAAuBA,GAAAhH,EAC9C,KAAAs9C,OAAA,CAAAD,EAAAr2C,GACA,QACA,CACAiD,EAAAhC,GAAA,CAAAR,EAAAS,QAAA,CAAAlB,EAAAA,EAAAY,GAAA,KAAAZ,GAAA,EACA,KAAAA,GAAA,EAAAY,EACAZ,GAAAY,EACA,KAAAZ,GAAA,GAAAhH,IACA,KAAAs9C,OAAA,CAAAF,EAAA,GACA,KAAAp2C,GAAA,GAEA,CAGA,OAFA,KAAAtH,MAAA,EAAA+H,EAAA/H,MAAA,CACA,KAAA69C,UAAA,GACA,KAEAl1C,WAAA9H,CAAA,EACA,GAAAiE,EAAAvE,MAAA,QACA,GAAAuE,EAAAlE,MAAA,EAAAC,EAAA,MACA,KAAAF,QAAA,IAIA,IAAgB4J,OAAAA,CAAA,CAAAmzC,KAAAA,CAAA,CAAAp9C,SAAAA,CAAA,CAAAsH,KAAAA,CAAA,EAA+B,KAC/C,CAAcN,IAAAA,CAAA,EAAM,KAEpBiD,CAAA,CAAAjD,IAAA,KACA,KAAAiD,MAAA,CAAA/B,QAAA,CAAAlB,GAAAJ,IAAA,IAEA,KAAAu2C,SAAA,CAAAn9C,EAAAgH,IACA,KAAAs2C,OAAA,CAAAF,EAAA,GACAp2C,EAAA,GAGA,QAAApE,EAAAoE,EAA0BpE,EAAA5C,EAAc4C,IACxCqH,CAAA,CAAArH,EAAA,IAIA46C,SA5EAJ,CAAA,CAAAlzC,CAAA,CAAAtJ,CAAA,CAAA0G,CAAA,EACA,sBAAA81C,EAAAI,YAAA,CACA,OAAAJ,EAAAI,YAAA,CAAAtzC,EAAAtJ,EAAA0G,GACA,IAAAjF,EAAAD,OAAA,IACAq7C,EAAAr7C,OAAA,YACAs7C,EAAA3+C,OAAA,GAAAsD,EAAAo7C,GACAE,EAAA5+C,OAAA6B,EAAA68C,GACA59C,EAAAyH,EAAA,IACA/E,EAAA+E,EAAA,IACA81C,EAAAQ,SAAA,CAAA1zC,EAAArK,EAAA69C,EAAAp2C,GACA81C,EAAAQ,SAAA,CAAA1zC,EAAA3H,EAAAo7C,EAAAr2C,EACA,EAiEA81C,EAAAp9C,EAAA,EAAAoC,OAAA,OAAA1C,MAAA,EAAA4H,GACA,KAAAg2C,OAAA,CAAAF,EAAA,GACA,IAAAS,EAAA,GAAAl5C,EAAAkF,UAAA,EAAAtJ,GACAmH,EAAA,KAAA3H,SAAA,CAEA,GAAA2H,EAAA,EACA,2DACA,IAAAo2C,EAAAp2C,EAAA,EACAR,EAAA,KAAA4K,GAAA,GACA,GAAAgsC,EAAA52C,EAAAxH,MAAA,CACA,kDACA,QAAAkD,EAAA,EAAwBA,EAAAk7C,EAAYl7C,IACpCi7C,EAAAD,SAAA,GAAAh7C,EAAAsE,CAAA,CAAAtE,EAAA,CAAA0E,EACA,CACAiB,QAAA,CACA,IAAgB0B,OAAAA,CAAA,CAAAlK,UAAAA,CAAA,EAAoB,KACpC,KAAAsI,UAAA,CAAA4B,GACA,IAAA0C,EAAA1C,EAAAwG,KAAA,GAAA1Q,GAEA,OADA,KAAAuI,OAAA,GACAqE,CACA,CACAnE,WAAAC,CAAA,EACAA,GAAAA,CAAAA,EAAA,SAAAnJ,WAAA,EACAmJ,EAAAR,GAAA,SAAA6J,GAAA,IACA,IAAgB9R,SAAAA,CAAA,CAAAiK,OAAAA,CAAA,CAAAvK,OAAAA,CAAA,CAAAW,SAAAA,CAAA,CAAAD,UAAAA,CAAA,CAAA4G,IAAAA,CAAA,EAAqD,KAOrE,OANAyB,EAAA/I,MAAA,CAAAA,EACA+I,EAAAzB,GAAA,CAAAA,EACAyB,EAAApI,QAAA,CAAAA,EACAoI,EAAArI,SAAA,CAAAA,EACAV,EAAAM,GACAyI,EAAAwB,MAAA,CAAAhC,GAAA,CAAAgC,GACAxB,CACA,CACA,CACA9H,EAAAu8C,IAAY,CAAAA,oCCnHZz8C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAE,KAAa,CAAGF,EAAAG,KAAa,CAAGH,EAAAI,KAAa,CAAGJ,EAAAK,KAAa,CAAGL,EAAAM,KAAa,CAAGN,EAAAO,KAAa,CAAGP,EAAAQ,GAAW,CAAGR,EAAAS,MAAc,CAAGT,EAAAU,MAAc,CAAGV,EAAAW,MAAc,CAAGX,EAAAY,MAAc,CAAGZ,EAAAa,OAAe,CAAGb,EAAAc,OAAe,CAAGd,EAAAe,MAAc,CAAGf,EAAAgB,MAAc,CAAGhB,EAAAiB,MAAc,CAAGjB,EAAAkB,MAAc,CAAGlB,EAAAmB,KAAa,CAAGnB,EAAAoB,KAAa,CAAGpB,EAAAqB,KAAa,CAAGrB,EAAAsB,KAAa,CAAGtB,EAAAuB,OAAe,QACzW,IAAAC,EAAAC,OAAA,cACAC,EAAAD,OAAA,IAEA,SAAAF,EAAApD,CAAA,CAAAwD,EAAA,WACA,EACA,CAAiBzC,EAAAd,OAAAD,EAAAqD,GAAAI,EAAAxD,OAAA,GAAAsD,EAAAF,EAAA,EACjB,CAAatC,EAAAd,EAAAA,OAAA,GAAAsD,EAAAF,GAAAI,EAAAxD,EAAAA,OAAAD,EAAAqD,EAAA,CACb,CAEA,SAAAF,EAAAO,CAAA,CAAAF,EAAA,IACA,IAAAG,EAAA,IAAAC,YAAAF,EAAA9C,MAAA,EACAiD,EAAA,IAAAD,YAAAF,EAAA9C,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAJ,EAAA9C,MAAA,CAAgBkD,IAAA,CACpC,IAAgB/C,EAAAA,CAAA,CAAA0C,CAAA,EAAOL,EAAAM,CAAA,CAAAI,EAAA,CAAAN,EACvB,EAAAG,CAAA,CAAAG,EAAA,CAAAD,CAAA,CAAAC,EAAA,GAAA/C,EAAA0C,EAAA,CAEA,OAAAE,EAAAE,EAAA,CARAhC,EAAAuB,OAAe,CAAAA,EAUfvB,EAAAsB,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAnC,EAAA0C,IAAA,OAAA1C,IAAA,IAAAwC,EAAAD,OAAAG,IAAA,EACA5B,CAAAA,EAAAqB,KAAa,CAAAA,EAEb,IAAAD,EAAA,CAAAlC,EAAAgD,EAAAC,IAAAjD,IAAAiD,CACAnC,CAAAA,EAAAoB,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAjC,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,CACAnC,CAAAA,EAAAmB,KAAa,CAAAA,EAEb,IAAAD,EAAA,CAAAhC,EAAA0C,EAAAO,IAAA,IAAAA,EAAAP,GAAA,GAAAO,CACAnC,CAAAA,EAAAkB,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAA/B,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,CACAnC,CAAAA,EAAAiB,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAA9B,EAAA0C,EAAAO,IAAA,MAAAA,EAAAP,IAAAO,EAAA,EACAnC,CAAAA,EAAAgB,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAA7B,EAAA0C,EAAAO,IAAA,IAAAA,EAAA,GAAAP,GAAA,GAAAO,CACAnC,CAAAA,EAAAe,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAAsB,EAAAR,IAAAA,CACA5B,CAAAA,EAAAc,OAAe,CAAAA,EACf,IAAAD,EAAA,CAAA3B,EAAAgD,IAAAhD,CACAc,CAAAA,EAAAa,OAAe,CAAAA,EAEf,IAAAD,EAAA,CAAA1B,EAAA0C,EAAAO,IAAA,GAAAA,EAAAP,IAAA,GAAAO,CACAnC,CAAAA,EAAAY,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAAzB,EAAA0C,EAAAO,IAAA,GAAAA,EAAAjD,IAAA,GAAAiD,CACAnC,CAAAA,EAAAW,MAAc,CAAAA,EAEd,IAAAD,EAAA,CAAAxB,EAAA0C,EAAAO,IAAA,GAAAA,EAAA,GAAAjD,IAAA,GAAAiD,CACAnC,CAAAA,EAAAU,MAAc,CAAAA,EACd,IAAAD,EAAA,CAAAvB,EAAA0C,EAAAO,IAAA,GAAAA,EAAA,GAAAP,IAAA,GAAAO,EAIA,SAAA3B,EAAAsB,CAAA,CAAAE,CAAA,CAAAK,CAAA,CAAAC,CAAA,EACA,IAAAV,EAAA,CAAAI,IAAA,GAAAM,CAAAA,IAAA,GACA,OAAapD,EAAA,EAAAmD,EAAA,mBAAAT,EAAAA,EAAAA,CAAA,CACb,CANA5B,EAAAS,MAAc,CAAAA,EAOdT,EAAAQ,GAAW,CAAAA,EAEX,IAAAD,EAAA,CAAAyB,EAAAM,EAAAC,IAAA,CAAAP,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,EACAvC,CAAAA,EAAAO,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAkC,EAAAV,EAAAO,EAAAI,IAAA,EAAAJ,EAAAI,EAAA,kBACAzC,CAAAA,EAAAM,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAA2B,EAAAM,EAAAC,EAAAG,IAAA,CAAAV,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,GAAAG,CAAAA,IAAA,EACA1C,CAAAA,EAAAK,KAAa,CAAAA,EACb,IAAAD,EAAA,CAAAoC,EAAAV,EAAAO,EAAAI,EAAAE,IAAA,EAAAN,EAAAI,EAAAE,EAAA,kBACA3C,CAAAA,EAAAI,KAAa,CAAAA,EACb,IAAAF,EAAA,CAAA8B,EAAAM,EAAAC,EAAAG,EAAAE,IAAA,CAAAZ,IAAA,GAAAM,CAAAA,IAAA,GAAAC,CAAAA,IAAA,GAAAG,CAAAA,IAAA,GAAAE,CAAAA,IAAA,EACA5C,CAAAA,EAAAE,KAAa,CAAAA,EACb,IAAAC,EAAA,CAAAqC,EAAAV,EAAAO,EAAAI,EAAAE,EAAAE,IAAA,EAAAR,EAAAI,EAAAE,EAAAE,EAAA,kBACA7C,CAAAA,EAAAG,KAAa,CAAAA,EAUbH,EAAA,OAAe,CARf,CACAuB,QAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EACAD,MAAAA,EAAAD,MAAAA,EACAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EACAD,QAAAA,EAAAD,QAAAA,EACAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EAAAD,OAAAA,EACAD,IAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,EAAAD,MAAAA,CACA,oCCjFAJ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8C,MAAc,QACd9C,EAAA8C,MAAc,kBAAAC,YAAA,WAAAA,WAAAA,WAAAD,MAAA,CAAAE,KAAAA,sCCFdlD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqgC,IAAY,CAAGrgC,EAAAo9C,IAAY,QAC3B,IAAAv5C,EAAqBC,EAAQ,OAC7BE,EAAmBF,EAAQ,MAE3B,OAAAs5C,UAAAp5C,EAAAkC,IAAA,CACAvH,YAAAM,CAAA,CAAAo+C,CAAA,EACA,QACA,KAAA39C,QAAA,IACA,KAAAD,SAAA,IACA,GAAAoE,EAAA5E,IAAA,EAAAA,GACA,IAAAoR,EAAA,GAAArM,EAAAgD,OAAA,EAAAq2C,GAEA,GADA,KAAAC,KAAA,CAAAr+C,EAAAE,MAAA,GACA,wBAAAm+C,KAAA,CAAAz2C,MAAA,CACA,kEACA,MAAAxH,QAAA,MAAAi+C,KAAA,CAAAj+C,QAAA,CACA,KAAAD,SAAA,MAAAk+C,KAAA,CAAAl+C,SAAA,CACA,IAAAC,EAAA,KAAAA,QAAA,CACA4M,EAAA,IAAAvN,WAAAW,GAEA4M,EAAA3E,GAAA,CAAA+I,EAAAtR,MAAA,CAAAM,EAAAJ,EAAAE,MAAA,GAAA0H,MAAA,CAAAwJ,GAAAzI,MAAA,GAAAyI,GACA,QAAApO,EAAA,EAAwBA,EAAAgK,EAAAlN,MAAA,CAAgBkD,IACxCgK,CAAA,CAAAhK,EAAA,KACA,KAAAq7C,KAAA,CAAAz2C,MAAA,CAAAoF,GAEA,KAAAsxC,KAAA,CAAAt+C,EAAAE,MAAA,GAEA,QAAA8C,EAAA,EAAwBA,EAAAgK,EAAAlN,MAAA,CAAgBkD,IACxCgK,CAAA,CAAAhK,EAAA,MACA,KAAAs7C,KAAA,CAAA12C,MAAA,CAAAoF,GACAA,EAAAhG,IAAA,GACA,CACAY,OAAAuiB,CAAA,EAGA,MAFA,GAAAvlB,EAAAvE,MAAA,QACA,KAAAg+C,KAAA,CAAAz2C,MAAA,CAAAuiB,GACA,KAEA1hB,WAAA9H,CAAA,EACA,GAAAiE,EAAAvE,MAAA,QACA,GAAAuE,EAAAhF,KAAA,EAAAe,EAAA,KAAAR,SAAA,EACA,KAAAM,QAAA,IACA,KAAA49C,KAAA,CAAA51C,UAAA,CAAA9H,GACA,KAAA29C,KAAA,CAAA12C,MAAA,CAAAjH,GACA,KAAA29C,KAAA,CAAA71C,UAAA,CAAA9H,GACA,KAAA+H,OAAA,EACA,CACAC,QAAA,CACA,IAAAhI,EAAA,IAAAlB,WAAA,KAAA6+C,KAAA,CAAAn+C,SAAA,EAEA,OADA,KAAAsI,UAAA,CAAA9H,GACAA,CACA,CACAiI,WAAAC,CAAA,EAEAA,GAAAA,CAAAA,EAAAhI,OAAAX,MAAA,CAAAW,OAAA09C,cAAA,UAAiE,EACjE,IAAgBD,MAAAA,CAAA,CAAAD,MAAAA,CAAA,CAAA59C,SAAAA,CAAA,CAAAD,UAAAA,CAAA,CAAAJ,SAAAA,CAAA,CAAAD,UAAAA,CAAA,EAAyD,KAQzE,OANA0I,EAAApI,QAAA,CAAAA,EACAoI,EAAArI,SAAA,CAAAA,EACAqI,EAAAzI,QAAA,CAAAA,EACAyI,EAAA1I,SAAA,CAAAA,EACA0I,EAAAy1C,KAAA,CAAAA,EAAA11C,UAAA,CAAAC,EAAAy1C,KAAA,EACAz1C,EAAAw1C,KAAA,CAAAA,EAAAz1C,UAAA,CAAAC,EAAAw1C,KAAA,EACAx1C,CACA,CACAH,SAAA,CACA,KAAAlI,SAAA,IACA,KAAA89C,KAAA,CAAA51C,OAAA,GACA,KAAA21C,KAAA,CAAA31C,OAAA,EACA,CACA,CACA3H,EAAAo9C,IAAY,CAAAA,EAQZp9C,EAAAqgC,IAAY,CADZ,CAAAphC,EAAAoR,EAAAqoC,IAAA,IAAA0E,EAAAn+C,EAAAoR,GAAAxJ,MAAA,CAAA6xC,GAAA9wC,MAAA,GAEA5H,EAAAqgC,IAAA,CAAAlhC,MAAmB,EAAAF,EAAAoR,IAAA,IAAA+sC,EAAAn+C,EAAAoR,uCC/EnBvQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAy9C,WAAmB,CAAGz9C,EAAA09C,MAAc,QACpC,IAAA75C,EAAqBC,EAAQ,OAC7B65C,EAAkB75C,EAAQ,OAC1BE,EAAmBF,EAAQ,OAE3B,SAAA85C,EAAA3+C,CAAA,CAAA4+C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,GAAAl6C,EAAA5E,IAAA,EAAAA,GAEA,IAAY4rB,EAAAA,CAAA,CAAAziB,MAAAA,CAAA,CAAA41C,UAAAA,CAAA,EADZ,GAAAh6C,EAAAuE,SAAA,GAA6CH,MAAA,GAAA41C,UAAA,IAA0BD,GAKvE,GAHA,GAAAl6C,EAAA3F,MAAA,EAAA2sB,GACA,GAAAhnB,EAAA3F,MAAA,EAAAkK,GACA,GAAAvE,EAAA3F,MAAA,EAAA8/C,GACAnzB,EAAA,EACA,qDACA,IAAAozB,EAAA,GAAAj6C,EAAAgD,OAAA,EAAA62C,GACAK,EAAA,GAAAl6C,EAAAgD,OAAA,EAAA82C,GAEAK,EAAA,IAAAz/C,WAAA0J,GAEAg2C,EAAAT,EAAAtd,IAAA,CAAAlhC,MAAA,CAAAF,EAAAg/C,GACAI,EAAAD,EAAAv2C,UAAA,GAAAhB,MAAA,CAAAq3C,GACA,OAAarzB,EAAAA,EAAAziB,MAAAA,EAAA41C,UAAAA,EAAAG,GAAAA,EAAAC,IAAAA,EAAAC,QAAAA,CAAA,CACb,CACA,SAAAC,EAAAF,CAAA,CAAAC,CAAA,CAAAF,CAAA,CAAAI,CAAA,CAAAjzB,CAAA,EAMA,OALA8yB,EAAAz2C,OAAA,GACA02C,EAAA12C,OAAA,GACA42C,GACAA,EAAA52C,OAAA,GACA2jB,EAAArlB,IAAA,IACAk4C,CACA,CAiCA,eAAAV,EAAAx+C,CAAA,CAAAg/C,CAAA,CAAAC,CAAA,CAAA/1C,CAAA,MAEAo2C,EADA,IAAY1zB,EAAAA,CAAA,CAAAziB,MAAAA,CAAA,CAAA41C,UAAAA,CAAA,CAAAG,GAAAA,CAAA,CAAAC,IAAAA,CAAA,CAAAC,QAAAA,CAAA,EAAwCT,EAAA3+C,EAAAg/C,EAAAC,EAAA/1C,GAEpDkB,EAAA,IAAA3K,WAAA,GACA+9C,EAAA,GAAAz4C,EAAAkF,UAAA,EAAAG,GACAiiB,EAAA,IAAA5sB,WAAA0/C,EAAAh/C,SAAA,EAEA,QAAAo/C,EAAA,EAAAn4C,EAAA,EAA8BA,EAAA+B,EAAao2C,IAAAn4C,GAAA+3C,EAAAh/C,SAAA,EAE3C,IAAAq/C,EAAAN,EAAA52C,QAAA,CAAAlB,EAAAA,EAAA+3C,EAAAh/C,SAAA,EACAq9C,EAAAiC,QAAA,GAAAF,EAAA,IAGA,CAAAD,EAAAF,EAAAx2C,UAAA,CAAA02C,EAAA,EAAA13C,MAAA,CAAAwC,GAAA3B,UAAA,CAAA4jB,GACAmzB,EAAAn3C,GAAA,CAAAgkB,EAAA/jB,QAAA,GAAAk3C,EAAA1/C,MAAA,GACA,SAAAiF,EAAA0E,SAAA,EAAAmiB,EAAA,EAAAmzB,EAAA,KAEAI,EAAAv2C,UAAA,CAAA02C,GAAA13C,MAAA,CAAAykB,GAAA5jB,UAAA,CAAA4jB,GACA,QAAArpB,EAAA,EAA4BA,EAAAw8C,EAAA1/C,MAAA,CAAekD,IAC3Cw8C,CAAA,CAAAx8C,EAAA,EAAAqpB,CAAA,CAAArpB,EAAA,EAEA,CACA,OAAAq8C,EAAAF,EAAAC,EAAAF,EAAAI,EAAAjzB,EACA,CAxBAtrB,EAAA09C,MAAc,CAxBd,SAAAz+C,CAAA,CAAAg/C,CAAA,CAAAC,CAAA,CAAA/1C,CAAA,MAEAo2C,EADA,IAAY1zB,EAAAA,CAAA,CAAAziB,MAAAA,CAAA,CAAA+1C,GAAAA,CAAA,CAAAC,IAAAA,CAAA,CAAAC,QAAAA,CAAA,EAA6BT,EAAA3+C,EAAAg/C,EAAAC,EAAA/1C,GAEzCkB,EAAA,IAAA3K,WAAA,GACA+9C,EAAA,GAAAz4C,EAAAkF,UAAA,EAAAG,GACAiiB,EAAA,IAAA5sB,WAAA0/C,EAAAh/C,SAAA,EAEA,QAAAo/C,EAAA,EAAAn4C,EAAA,EAA8BA,EAAA+B,EAAao2C,IAAAn4C,GAAA+3C,EAAAh/C,SAAA,EAE3C,IAAAq/C,EAAAN,EAAA52C,QAAA,CAAAlB,EAAAA,EAAA+3C,EAAAh/C,SAAA,EACAq9C,EAAAiC,QAAA,GAAAF,EAAA,IAGA,CAAAD,EAAAF,EAAAx2C,UAAA,CAAA02C,EAAA,EAAA13C,MAAA,CAAAwC,GAAA3B,UAAA,CAAA4jB,GACAmzB,EAAAn3C,GAAA,CAAAgkB,EAAA/jB,QAAA,GAAAk3C,EAAA1/C,MAAA,GACA,QAAA4/C,EAAA,EAAyBA,EAAA9zB,EAAQ8zB,IAAA,CAEjCP,EAAAv2C,UAAA,CAAA02C,GAAA13C,MAAA,CAAAykB,GAAA5jB,UAAA,CAAA4jB,GACA,QAAArpB,EAAA,EAA4BA,EAAAw8C,EAAA1/C,MAAA,CAAekD,IAC3Cw8C,CAAA,CAAAx8C,EAAA,EAAAqpB,CAAA,CAAArpB,EAAA,CAEA,CACA,OAAAq8C,EAAAF,EAAAC,EAAAF,EAAAI,EAAAjzB,EACA,EA0BAtrB,EAAAy9C,WAAmB,CAAAA,sCCxFnB39C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4+C,SAAiB,CAAG5+C,EAAA6+C,SAAiB,QACrC,IAAAC,EAAmBh7C,EAAQ,OAC3BE,EAAmBF,EAAQ,OAG3Bi7C,EAAA,IAAArgD,WAAA,yCACAsgD,EAAAtgD,WAAAoL,IAAA,EAA6C/K,OAAA,IAAY,CAAAgL,EAAA9H,IAAAA,GACzDg9C,EAAAD,EAAA3kC,GAAA,OAAApY,EAAA,OACAi9C,EAAA,CAAAF,EAAA,CACAG,EAAA,CAAAF,EAAA,CACA,QAAAh9C,EAAA,EAAgBA,EAAA,EAAOA,IACvB,QAAA+C,IAAA,CAAAk6C,EAAAC,EAAA,CACAn6C,EAAAF,IAAA,CAAAE,CAAA,CAAA/C,EAAA,CAAAoY,GAAA,IAAA0kC,CAAA,CAAAnuC,EAAA,GACA,IAAAwuC,EAAA,CACA,0CACA,0CACA,0CACA,0CACA,0CACA,CAAA/kC,GAAA,QAAA3b,WAAAuD,IACAo9C,EAAAH,EAAA7kC,GAAA,EAAAilC,EAAAr9C,IAAAq9C,EAAAjlC,GAAA,IAAA+kC,CAAA,CAAAn9C,EAAA,CAAA+C,EAAA,GACAu6C,EAAAJ,EAAA9kC,GAAA,EAAAilC,EAAAr9C,IAAAq9C,EAAAjlC,GAAA,IAAA+kC,CAAA,CAAAn9C,EAAA,CAAA+C,EAAA,GACAw6C,EAAA,IAAAz9C,YAAA,CACA,8CACA,EACA09C,EAAA,IAAA19C,YAAA,CACA,8CACA,EAEAiH,EAAA,CAAAW,EAAA5D,IAAA,GAAAA,EAAA4D,IAAA,GAAA5D,EAEA,SAAAg8B,EAAA2d,CAAA,CAAA96C,CAAA,CAAAC,CAAA,CAAAwuC,CAAA,SACA,IAAAqM,EACA96C,EAAAC,EAAAwuC,EACAqM,IAAAA,EACA,EAAA76C,EAAA,CAAAD,EAAAyuC,EACAqM,IAAAA,EACA,CAAA96C,EAAA,CAAAC,CAAAA,EAAAwuC,EACAqM,IAAAA,EACA,EAAArM,EAAAxuC,EAAA,CAAAwuC,EAEAzuC,EAAAC,CAAAA,EAAA,CAAAwuC,CAAAA,CACA,CAEA,IAAAsM,EAAA,IAAA59C,YAAA,GACA,OAAA88C,UAAAC,EAAAvC,IAAA,CACA59C,aAAA,CACA,kBACA,KAAAihD,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,aACA,KAAAC,EAAA,WACA,KAAAC,EAAA,YACA,CACA7uC,KAAA,CACA,IAAgByuC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,EAAqB,KACrC,OAAAJ,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,CAEA14C,IAAAs4C,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,KAAAJ,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,CACA,CACArD,QAAAF,CAAA,CAAArhB,CAAA,EACA,QAAAn5B,EAAA,EAAwBA,EAAA,GAAQA,IAAAm5B,GAAA,EAChCukB,CAAA,CAAA19C,EAAA,CAAAw6C,EAAAwD,SAAA,CAAA7kB,EAAA,IAEA,IAAAvwB,EAAA,OAAA+0C,EAAA,CAAAM,EAAAr1C,EAAAs1C,EAAA,OAAAN,EAAA,CAAAO,EAAAD,EAAAE,EAAA,OAAAP,EAAA,CAAAr+B,EAAA4+B,EAAAC,EAAA,OAAAP,EAAA,CAAAQ,EAAAD,EAAAE,EAAA,OAAAR,EAAA,CAAAS,EAAAD,EAGA,QAAAd,EAAA,EAA4BA,EAAA,EAAWA,IAAA,CACvC,IAAAgB,EAAA,EAAAhB,EACAiB,EAAAnB,CAAA,CAAAE,EAAA,CAAAkB,EAAAnB,CAAA,CAAAC,EAAA,CACA1Q,EAAAkQ,CAAA,CAAAQ,EAAA,CAAAmB,EAAA1B,CAAA,CAAAO,EAAA,CACA3S,EAAAsS,CAAA,CAAAK,EAAA,CAAAoB,EAAAvB,CAAA,CAAAG,EAAA,CACA,QAAAz9C,EAAA,EAA4BA,EAAA,GAAQA,IAAA,CACpC,IAAA8+C,EAAA,EAAAl2C,EAAAk3B,EAAA2d,EAAAS,EAAAE,EAAAC,GAAAX,CAAA,CAAA3Q,CAAA,CAAA/sC,EAAA,EAAA0+C,EAAA5T,CAAA,CAAA9qC,EAAA,EAAAu+C,EAAA,CACA31C,CAAAA,EAAA21C,EAAAA,EAAAF,EAAAA,EAAAt3C,EAAAA,EAAAq3C,EAAA,IAAAA,EAAAF,EAAAA,EAAAY,CACA,CAEA,QAAA9+C,EAAA,EAA4BA,EAAA,GAAQA,IAAA,CACpC,IAAA++C,EAAA,EAAAd,EAAAne,EAAA2e,EAAAN,EAAA3+B,EAAA8+B,GAAAZ,CAAA,CAAAkB,CAAA,CAAA5+C,EAAA,EAAA2+C,EAAAE,CAAA,CAAA7+C,EAAA,EAAAw+C,EAAA,CACAP,CAAAA,EAAAO,EAAAA,EAAAF,EAAAA,EAAAv3C,EAAAA,EAAAyY,EAAA,IAAAA,EAAA2+B,EAAAA,EAAAY,CACA,CACA,CAEA,KAAA15C,GAAA,MAAAu4C,EAAA,CAAAQ,EAAAE,EAAA,OAAAT,EAAA,CAAAQ,EAAAG,EAAA,OAAAV,EAAA,CAAAS,EAAAN,EAAA,OAAAF,EAAA,CAAAn1C,EAAAu1C,EAAA,OAAAR,EAAA,CAAAO,EAAA1+B,EAAA,EACA,CACAm7B,YAAA,CACA+C,EAAA15C,IAAA,GACA,CACA0B,SAAA,CACA,KAAAlI,SAAA,IACA,KAAA6J,MAAA,CAAArD,IAAA,IACA,KAAAqB,GAAA,WACA,CACA,CACAtH,EAAA6+C,SAAiB,CAAAA,EAKjB7+C,EAAA4+C,SAAiB,IAAA56C,EAAAgE,eAAA,UAAA62C,uCCzGjB/+C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAihD,WAAmB,CAAGjhD,EAAAkhD,MAAc,QACpC,IAAAr9C,EAAqBC,EAAQ,OAC7Bq9C,EAAoBr9C,EAAQ,OAC5Bs9C,EAAoBt9C,EAAQ,OAC5BE,EAAmBF,EAAQ,OAG3BkF,EAAA,CAAAvK,EAAAF,IAAA,GAAAA,EAAAE,IAAA,GAAAF,EAIA,SAAA8iD,EAAApkB,CAAA,CAAAqkB,CAAA,CAAA9tB,CAAA,CAAA5V,CAAA,CAAAhe,CAAA,CAAA2hD,CAAA,EAGA,IAAAC,EAAAvkB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAA6jC,EAAAxkB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACA8jC,EAAAzkB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAA+jC,EAAA1kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACAgkC,EAAA3kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAAikC,EAAA5kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACAkkC,EAAA7kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAAmkC,EAAA9kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACAokC,EAAA/kB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAAqkC,EAAAhlB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACAskC,EAAAjlB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAAukC,EAAAllB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACAwkC,EAAAnlB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAAykC,EAAAplB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CACA0kC,EAAArlB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAAA2kC,EAAAtlB,CAAA,CAAAqkB,IAAA,CAAA9tB,CAAA,CAAA5V,IAAA,CAEA4kC,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAAAiB,EAAAhB,EAEA,QAAAtgD,EAAA,EAAoBA,EAAA,EAAOA,GAAA,EAC3B2gD,GAAA55C,EAAAw5C,EAAAY,EAAA,KACAJ,GAAAh6C,EAAA45C,EAAAJ,EAAA,KACAY,GAAAp6C,EAAAg6C,EAAAJ,EAAA,MACAJ,GAAAx5C,EAAAo6C,EAAAJ,EAAA,MACAC,GAAAj6C,EAAA65C,EAAAJ,EAAA,KACAY,GAAAr6C,EAAAi6C,EAAAJ,EAAA,KACAJ,GAAAz5C,EAAAq6C,EAAAJ,EAAA,MACAJ,GAAA75C,EAAAy5C,EAAAY,EAAA,MACAC,GAAAt6C,EAAAk6C,EAAAJ,EAAA,KACAJ,GAAA15C,EAAAs6C,EAAAJ,EAAA,KACAJ,GAAA95C,EAAA05C,EAAAY,EAAA,MACAJ,GAAAl6C,EAAA85C,EAAAJ,EAAA,MACAC,GAAA35C,EAAAu6C,EAAAJ,EAAA,KACAJ,GAAA/5C,EAAA25C,EAAAY,EAAA,KACAJ,GAAAn6C,EAAA+5C,EAAAJ,EAAA,MACAY,GAAAv6C,EAAAm6C,EAAAJ,EAAA,MACAN,GAAAz5C,EAAAw5C,EAAAG,EAAA,KACAD,GAAA15C,EAAAy5C,EAAAD,EAAA,KACAG,GAAA35C,EAAA05C,EAAAD,EAAA,MACAD,GAAAx5C,EAAA25C,EAAAD,EAAA,MACAI,GAAA95C,EAAA65C,EAAAD,EAAA,KACAG,GAAA/5C,EAAA85C,EAAAD,EAAA,KACAD,GAAA55C,EAAA+5C,EAAAD,EAAA,MACAD,GAAA75C,EAAA45C,EAAAG,EAAA,MACAI,GAAAn6C,EAAAk6C,EAAAD,EAAA,KACAD,GAAAh6C,EAAAm6C,EAAAD,EAAA,KACAD,GAAAj6C,EAAAg6C,EAAAG,EAAA,MACAD,GAAAl6C,EAAAi6C,EAAAD,EAAA,MACAI,GAAAp6C,EAAAu6C,EAAAD,EAAA,KACAD,GAAAr6C,EAAAo6C,EAAAG,EAAA,KACAD,GAAAt6C,EAAAq6C,EAAAD,EAAA,MACAG,GAAAv6C,EAAAs6C,EAAAD,EAAA,KAGAzjD,CAAAA,CAAA,CAAA2hD,IAAA,GAAAiB,EAAA,EACA5iD,CAAA,CAAA2hD,IAAA,GAAAkB,EAAA,EACA7iD,CAAA,CAAA2hD,IAAA,GAAAmB,EAAA,EACA9iD,CAAA,CAAA2hD,IAAA,GAAAoB,EAAA,EACA/iD,CAAA,CAAA2hD,IAAA,GAAAqB,EAAA,EACAhjD,CAAA,CAAA2hD,IAAA,GAAAsB,EAAA,EACAjjD,CAAA,CAAA2hD,IAAA,GAAAuB,EAAA,EACAljD,CAAA,CAAA2hD,IAAA,GAAAwB,EAAA,EACAnjD,CAAA,CAAA2hD,IAAA,GAAAyB,EAAA,EACApjD,CAAA,CAAA2hD,IAAA,GAAA0B,EAAA,EACArjD,CAAA,CAAA2hD,IAAA,GAAA2B,EAAA,EACAtjD,CAAA,CAAA2hD,IAAA,GAAA4B,EAAA,EACAvjD,CAAA,CAAA2hD,IAAA,GAAA6B,EAAA,EACAxjD,CAAA,CAAA2hD,IAAA,GAAA8B,EAAA,EACAzjD,CAAA,CAAA2hD,IAAA,GAAA+B,EAAA,EACA1jD,CAAA,CAAA2hD,IAAA,GAAAgC,EAAA,CACA,CACA,SAAAC,EAAAhwB,CAAA,CAAA5V,CAAA,CAAAhe,CAAA,CAAA2hD,CAAA,CAAA9Y,CAAA,EAEA,IAAA8M,EAAAgM,EAAA,EACA10B,EAAA00B,EAAA,GAAA9Y,EACA,QAAAxmC,EAAA,EAAoBA,EAAA,GAAQA,IAC5BrC,CAAA,CAAAitB,EAAA5qB,EAAA,CAAAuxB,CAAA,CAAA5V,EAAA,GAAA6qB,EAAA,MAAAxmC,EAAA,CACA,QAAAA,EAAA,EAAoBA,EAAAwmC,EAAOxmC,IAAAszC,GAAA,GAAA33B,GAAA,GAE3ByjC,EAAAzhD,EAAAitB,EAAA2G,EAAA5V,EAAAhe,EAAA21C,GACAtzC,EAAA,GACA4qB,CAAAA,GAAA,IACAw0B,EAAAzhD,EAAA21C,EAAA/hB,EAAA5V,GAAA,GAAAhe,EAAAitB,EAEA,CAEA,SAAA42B,EAAAxF,CAAA,CAAAC,CAAA,CAAAH,CAAA,EAOA,IAAY2F,EAAAA,CAAA,CAAAjb,EAAAA,CAAA,CAAAp3B,EAAAA,CAAA,CAAAjJ,MAAAA,CAAA,CAAA41C,UAAAA,CAAA,CAAA2F,OAAAA,CAAA,CAAAC,WAAAA,CAAA,EALZ,GAAA5/C,EAAAuE,SAAA,GACAH,MAAA,GACA41C,UAAA,GACA2F,OAAA,UACA,EAAK5F,GAQL,GANA,GAAAl6C,EAAA3F,MAAA,EAAAwlD,GACA,GAAA7/C,EAAA3F,MAAA,EAAAuqC,GACA,GAAA5kC,EAAA3F,MAAA,EAAAmT,GACA,GAAAxN,EAAA3F,MAAA,EAAAkK,GACA,GAAAvE,EAAA3F,MAAA,EAAA8/C,GACA,GAAAn6C,EAAA3F,MAAA,EAAAylD,GACAC,KAAA5gD,IAAA4gD,GAAA,mBAAAA,EACA,6CACA,IAAAC,EAAA,IAAApb,EACAqb,EAAAD,EAAA,EACA,GAAAH,GAAA,IAAAA,EAAAA,EAAA,OAAAA,GAAA,GAAAG,CAAAA,EAAA,IAAAH,EAAA,WAGA,2GAEA,GAAAryC,EAAA,GAAAA,EAAA,kBAAAwyC,EACA,wGAEA,GAAAz7C,EAAA,GAAAA,EAAA,kBACA,8FAEA,IAAA27C,EAAAF,EAAAH,CAAAA,EAAAryC,CAAAA,EACA,GAAA0yC,EAAAJ,EACA,6CAAyDI,EAAA,uBAAS,EAAwBJ,EAAA,SAAQ,GAIlG,IAAAr+C,EAAA,GAAA87C,EAAA1D,MAAA,EAAAyD,EAAAvG,MAAA,CAAAqD,EAAAC,EAAA,CAA4ErzB,EAAA,EAAAziB,MAAAy7C,EAAAxyC,CAAA,GAC5E2yC,EAAA,GAAAhgD,EAAAyC,GAAA,EAAAnB,GAEA2+C,EAAA,GAAAjgD,EAAAyC,GAAA,MAAA/H,WAAAmlD,EAAAH,IACAh3C,EAAA,GAAA1I,EAAAyC,GAAA,MAAA/H,WAAAmlD,IACAK,EAAA,OACA,GAAAN,EAAA,CACA,IAAAO,EAAA,EAAAT,EAAAryC,EAGA+yC,EAAAl9C,KAAA8T,GAAA,CAAA9T,KAAAuC,KAAA,CAAA06C,EAAA,QACAE,EAAA,EACAH,EAAA,KACAG,IACAT,GAAA,EAAAS,CAAAA,EAAAD,CAAA,GAAAC,IAAAF,CAAA,GACAP,EAAAS,EAAAF,EACA,CACA,CACA,OAAaT,EAAAA,EAAAjb,EAAAA,EAAAp3B,EAAAA,EAAAjJ,MAAAA,EAAA07C,YAAAA,EAAAG,EAAAA,EAAAD,IAAAA,EAAA1+C,EAAAA,EAAAoH,IAAAA,EAAAw3C,WAAAA,EAAAlG,UAAAA,CAAA,CACb,CACA,SAAAsG,EAAArG,CAAA,CAAA71C,CAAA,CAAA9C,CAAA,CAAA2+C,CAAA,CAAAv3C,CAAA,EACA,IAAAV,EAAA,GAAAo1C,EAAA1D,MAAA,EAAAyD,EAAAvG,MAAA,CAAAqD,EAAA34C,EAAA,CAA2EulB,EAAA,EAAAziB,MAAAA,CAAA,GAI3E,OAHA9C,EAAAW,IAAA,IACAg+C,EAAAh+C,IAAA,IACAyG,EAAAzG,IAAA,IACA+F,CACA,CA0CA,eAAAi1C,EAAAhD,CAAA,CAAAC,CAAA,CAAA/1C,CAAA,EACA,IAAYu7C,EAAAA,CAAA,CAAAjb,EAAAA,CAAA,CAAAp3B,EAAAA,CAAA,CAAAjJ,MAAAA,CAAA,CAAA07C,YAAAA,CAAA,CAAAG,EAAAA,CAAA,CAAAD,IAAAA,CAAA,CAAA1+C,EAAAA,CAAA,CAAAoH,IAAAA,CAAA,CAAAw3C,WAAAA,CAAA,CAAAlG,UAAAA,CAAA,EAAqEyF,EAAAxF,EAAAC,EAAA/1C,GACjF,QAAAm5C,EAAA,EAAqBA,EAAAjwC,EAAQiwC,IAAA,CAC7B,IAAArC,EAAA6E,EAAAxC,EACA,QAAAr/C,EAAA,EAAwBA,EAAA6hD,EAAiB7hD,IACzCgiD,CAAA,CAAAhiD,EAAA,CAAA+hD,CAAA,CAAA/E,EAAAh9C,EAAA,CACA,IAAAoE,EAAA,CACA,UAAArC,EAAA0E,SAAA,EAAAg7C,EAAA,EAAA1F,EAAA,KACAwF,EAAAS,EAAA59C,EAAA49C,EAAA59C,GAAAy9C,EAAArb,GACAyb,GACA,GACAV,EAAAS,EAAA,CAAAP,EAAA,GAAAI,EAAAE,EAAA/E,EAAAxW,GACAyb,IACA,SAAAlgD,EAAA0E,SAAA,EAAAg7C,EAAA1F,EAAA,KAEA,IAAAh5C,EAAAg/C,CAAA,CAAA/E,EAAA6E,EAAA,IAAAJ,EACA,QAAA9yC,EAAA,EAA4BA,EAAAkzC,EAAiBlzC,IAC7ClE,CAAA,CAAAkE,EAAA,CAAAozC,CAAA,CAAA/E,EAAAruC,EAAA,CAAAqzC,CAAA,CAAAj/C,EAAA8+C,EAAAlzC,EAAA,CACA4yC,EAAA92C,EAAA,EAAAs3C,EAAA/E,EAAAxW,GACAyb,GACA,EACA,CACA,OAAAI,EAAArG,EAAA71C,EAAA9C,EAAA2+C,EAAAv3C,EACA,CA3BA1M,EAAAkhD,MAAc,CAvBd,SAAAjD,CAAA,CAAAC,CAAA,CAAA/1C,CAAA,EACA,IAAYu7C,EAAAA,CAAA,CAAAjb,EAAAA,CAAA,CAAAp3B,EAAAA,CAAA,CAAAjJ,MAAAA,CAAA,CAAA07C,YAAAA,CAAA,CAAAG,EAAAA,CAAA,CAAAD,IAAAA,CAAA,CAAA1+C,EAAAA,CAAA,CAAAoH,IAAAA,CAAA,CAAAw3C,WAAAA,CAAA,EAA0DT,EAAAxF,EAAAC,EAAA/1C,GACtE,QAAAm5C,EAAA,EAAqBA,EAAAjwC,EAAQiwC,IAAA,CAC7B,IAAArC,EAAA6E,EAAAxC,EACA,QAAAr/C,EAAA,EAAwBA,EAAA6hD,EAAiB7hD,IACzCgiD,CAAA,CAAAhiD,EAAA,CAAA+hD,CAAA,CAAA/E,EAAAh9C,EAAA,CACA,QAAAA,EAAA,EAAAoE,EAAA,EAAiCpE,EAAAyhD,EAAA,EAAWzhD,IAC5CuhD,EAAAS,EAAA59C,EAAA49C,EAAA59C,GAAAy9C,EAAArb,GACAyb,IAEAV,EAAAS,EAAA,CAAAP,EAAA,GAAAI,EAAAE,EAAA/E,EAAAxW,GACAyb,IACA,QAAAjiD,EAAA,EAAwBA,EAAAyhD,EAAOzhD,IAAA,CAE/B,IAAA+C,EAAAg/C,CAAA,CAAA/E,EAAA6E,EAAA,IAAAJ,EACA,QAAA9yC,EAAA,EAA4BA,EAAAkzC,EAAiBlzC,IAC7ClE,CAAA,CAAAkE,EAAA,CAAAozC,CAAA,CAAA/E,EAAAruC,EAAA,CAAAqzC,CAAA,CAAAj/C,EAAA8+C,EAAAlzC,EAAA,CACA4yC,EAAA92C,EAAA,EAAAs3C,EAAA/E,EAAAxW,GACAyb,GACA,CACA,CACA,OAAAI,EAAArG,EAAA71C,EAAA9C,EAAA2+C,EAAAv3C,EACA,EA6BA1M,EAAAihD,WAAmB,CAAAA,sCC5NnBnhD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAukD,MAAc,CAAGvkD,EAAA46C,MAAc,QAC/B,IAAAkE,EAAmBh7C,EAAQ,OAC3BE,EAAmBF,EAAQ,OAI3B0gD,EAAA,CAAA/lD,EAAAF,EAAAssB,IAAA,EAAAtsB,EAAA,CAAAE,EAAAosB,EAEA45B,EAAA,CAAAhmD,EAAAF,EAAAssB,IAAA,EAAAtsB,EAAAE,EAAAosB,EAAAtsB,EAAAssB,EAIA65B,EAAA,IAAA3iD,YAAA,CACA,uFACA,sFACA,qFACA,sFACA,sFACA,uFACA,mFACA,wFACA,EAGA4iD,EAAA,IAAA5iD,YAAA,CACA,uFACA,EAGA6iD,EAAA,IAAA7iD,YAAA,GACA,OAAA8iD,UAAA/F,EAAAvC,IAAA,CACA59C,aAAA,CACA,kBAGA,KAAAo6C,CAAA,CAAA4L,EAAAA,CAAA,IACA,KAAAr/C,CAAA,CAAAq/C,EAAAA,CAAA,IACA,KAAAxM,CAAA,CAAAwM,EAAAA,CAAA,IACA,KAAAG,CAAA,CAAAH,EAAAA,CAAA,IACA,KAAAnW,CAAA,CAAAmW,EAAAA,CAAA,IACA,KAAAI,CAAA,CAAAJ,EAAAA,CAAA,IACA,KAAAxR,CAAA,CAAAwR,EAAAA,CAAA,IACA,KAAAvgB,CAAA,CAAAugB,EAAAA,CAAA,IAEAxzC,KAAA,CACA,IAAgB4nC,EAAAA,CAAA,CAAAzzC,EAAAA,CAAA,CAAA6yC,EAAAA,CAAA,CAAA2M,EAAAA,CAAA,CAAAtW,EAAAA,CAAA,CAAAuW,EAAAA,CAAA,CAAA5R,EAAAA,CAAA,CAAA/O,EAAAA,CAAA,EAAyB,KACzC,OAAA2U,EAAAzzC,EAAA6yC,EAAA2M,EAAAtW,EAAAuW,EAAA5R,EAAA/O,EAAA,CAGA98B,IAAAyxC,CAAA,CAAAzzC,CAAA,CAAA6yC,CAAA,CAAA2M,CAAA,CAAAtW,CAAA,CAAAuW,CAAA,CAAA5R,CAAA,CAAA/O,CAAA,EACA,KAAA2U,CAAA,CAAAA,EAAAA,EACA,KAAAzzC,CAAA,CAAAA,EAAAA,EACA,KAAA6yC,CAAA,CAAAA,EAAAA,EACA,KAAA2M,CAAA,CAAAA,EAAAA,EACA,KAAAtW,CAAA,CAAAA,EAAAA,EACA,KAAAuW,CAAA,CAAAA,EAAAA,EACA,KAAA5R,CAAA,CAAAA,EAAAA,EACA,KAAA/O,CAAA,CAAAA,EAAAA,CACA,CACAuY,QAAAF,CAAA,CAAArhB,CAAA,EAEA,QAAAn5B,EAAA,EAAwBA,EAAA,GAAQA,IAAAm5B,GAAA,EAChCwpB,CAAA,CAAA3iD,EAAA,CAAAw6C,EAAAwD,SAAA,CAAA7kB,EAAA,IACA,QAAAn5B,EAAA,GAAyBA,EAAA,GAAQA,IAAA,CACjC,IAAA+iD,EAAAJ,CAAA,CAAA3iD,EAAA,IACAgjD,EAAAL,CAAA,CAAA3iD,EAAA,GACAijD,EAAA,GAAAlhD,EAAAiF,IAAA,EAAA+7C,EAAA,MAAAhhD,EAAAiF,IAAA,EAAA+7C,EAAA,IAAAA,IAAA,EACAG,EAAA,GAAAnhD,EAAAiF,IAAA,EAAAg8C,EAAA,OAAAjhD,EAAAiF,IAAA,EAAAg8C,EAAA,IAAAA,IAAA,EACAL,CAAAA,CAAA,CAAA3iD,EAAA,GAAA2iD,CAAA,CAAA3iD,EAAA,GAAAijD,EAAAN,CAAA,CAAA3iD,EAAA,KACA,CAEA,IAAc82C,EAAAA,CAAA,CAAAzzC,EAAAA,CAAA,CAAA6yC,EAAAA,CAAA,CAAA2M,EAAAA,CAAA,CAAAtW,EAAAA,CAAA,CAAAuW,EAAAA,CAAA,CAAA5R,EAAAA,CAAA,CAAA/O,EAAAA,CAAA,EAAyB,KACvC,QAAAniC,EAAA,EAAwBA,EAAA,GAAQA,IAAA,CAEhC,IAAAmjD,EAAA,EADA,IAAAphD,EAAAiF,IAAA,EAAAulC,EAAA,MAAAxqC,EAAAiF,IAAA,EAAAulC,EAAA,OAAAxqC,EAAAiF,IAAA,EAAAulC,EAAA,KACAgW,EAAAhW,EAAAuW,EAAA5R,GAAAuR,CAAA,CAAAziD,EAAA,CAAA2iD,CAAA,CAAA3iD,EAAA,GAEAojD,EAAA,CADA,GAAArhD,EAAAiF,IAAA,EAAA8vC,EAAA,MAAA/0C,EAAAiF,IAAA,EAAA8vC,EAAA,OAAA/0C,EAAAiF,IAAA,EAAA8vC,EAAA,KACA0L,EAAA1L,EAAAzzC,EAAA6yC,GAAA,EACA/T,EAAA+O,EACAA,EAAA4R,EACAA,EAAAvW,EACAA,EAAA,EAAA4W,EAAA,EACAN,EAAA3M,EACAA,EAAA7yC,EACAA,EAAAyzC,EACAA,EAAA,EAAAsM,EAAA,CACA,CAEAtM,EAAA,OAAAA,CAAA,GACAzzC,EAAA,OAAAA,CAAA,GACA6yC,EAAA,OAAAA,CAAA,GACA2M,EAAA,OAAAA,CAAA,GACAtW,EAAA,OAAAA,CAAA,GACAuW,EAAA,OAAAA,CAAA,GACA5R,EAAA,OAAAA,CAAA,GACA/O,EAAA,OAAAA,CAAA,GACA,KAAA98B,GAAA,CAAAyxC,EAAAzzC,EAAA6yC,EAAA2M,EAAAtW,EAAAuW,EAAA5R,EAAA/O,EACA,CACAwY,YAAA,CACAgI,EAAA3+C,IAAA,GACA,CACA0B,SAAA,CACA,KAAAL,GAAA,kBACA,KAAAgC,MAAA,CAAArD,IAAA,GACA,CACA,CAEA,MAAAq/C,UAAAT,EACAlmD,aAAA,CACA,QACA,KAAAo6C,CAAA,aACA,KAAAzzC,CAAA,WACA,KAAA6yC,CAAA,WACA,KAAA2M,CAAA,YACA,KAAAtW,CAAA,UACA,KAAAuW,CAAA,YACA,KAAA5R,CAAA,YACA,KAAA/O,CAAA,aACA,KAAAhlC,SAAA,GACA,CACA,CAKAY,EAAA46C,MAAc,IAAA52C,EAAAgE,eAAA,UAAA68C,GACd7kD,EAAAukD,MAAc,IAAAvgD,EAAAgE,eAAA,UAAAs9C,uCC9HdxlD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAiD,QAAgB,CAAGjD,EAAAkD,QAAgB,CAAGlD,EAAAmD,UAAkB,CAAGnD,EAAAoD,UAAkB,CAAGpD,EAAAqD,UAAkB,CAAGrD,EAAAsD,UAAkB,CAAGtD,EAAAuD,QAAgB,CAAGvD,EAAAwD,QAAgB,CAAGxD,EAAAyD,QAAgB,CAAGzD,EAAA0D,QAAgB,CAAG1D,EAAA2D,MAAc,CAAG3D,EAAA4D,OAAe,QACtO,IAAAC,EAAqBC,EAAQ,OAC7BC,EAAkBD,EAAQ,OAC1BE,EAAmBF,EAAQ,OAI3B,CAAAG,EAAAC,EAAAC,EAAA,YACAC,EAAA3C,OAAA,GACA4C,EAAA5C,OAAA,GACA6C,EAAA7C,OAAA,GACA8C,EAAA9C,OAAA,GACA+C,EAAA/C,OAAA,KACAgD,EAAAhD,OAAA,KACA,QAAAiD,EAAA,EAAAC,EAAAN,EAAAO,EAAA,EAAAC,EAAA,EAA2CH,EAAA,GAAYA,IAAA,CAEvD,CAAAE,EAAAC,EAAA,EAAAA,EAAA,GAAAD,EAAA,EAAAC,CAAAA,EAAA,GACAZ,EAAAa,IAAA,MAAAD,EAAAD,CAAAA,GAEAV,EAAAY,IAAA,EAAAJ,EAAA,GAAAA,CAAAA,EAAA,SAEA,IAAAK,EAAAX,EACA,QAAAY,EAAA,EAAoBA,EAAA,EAAOA,IAC3BL,CAAAA,EAAA,IAAAN,EAAA,CAAAM,GAAAJ,CAAA,EAAAE,CAAA,EAAAD,CAAA,EACAF,GACAS,CAAAA,GAAAV,GAAA,CAAAA,GAAA5C,OAAAuD,EAAA,EAAAX,CAAA,EAEAF,EAAAW,IAAA,CAAAC,EACA,CACA,IAAAE,EAAAC,EAAA,IAAAnB,EAAAzC,KAAA,EAAA6C,EAAA,IAEAgB,EAAA,CAAAjG,EAAA0C,EAAAO,IAAAA,EAAA,MAAA4B,EAAArD,MAAA,EAAAxB,EAAA0C,EAAAO,GAAA,GAAA4B,EAAAnD,MAAA,EAAA1B,EAAA0C,EAAAO,GACAiD,EAAA,CAAAlG,EAAA0C,EAAAO,IAAAA,EAAA,MAAA4B,EAAAtD,MAAA,EAAAvB,EAAA0C,EAAAO,GAAA,GAAA4B,EAAApD,MAAA,EAAAzB,EAAA0C,EAAAO,GAEA,SAAAyB,EAAAzB,CAAA,CAAAkD,EAAA,IACA,IAAAC,EAAA,IAAAvD,YAAA,IAEA,QAAA2C,EAAA,GAAAW,EAAkCX,EAAA,GAAYA,IAAA,CAE9C,QAAAE,EAAA,EAAwBA,EAAA,GAAQA,IAChCU,CAAA,CAAAV,EAAA,CAAAzC,CAAA,CAAAyC,EAAA,CAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IAAAzC,CAAA,CAAAyC,EAAA,IACA,QAAAA,EAAA,EAAwBA,EAAA,GAAQA,GAAA,GAChC,IAAAW,EAAA,CAAAX,EAAA,MACAY,EAAA,CAAAZ,EAAA,MACAa,EAAAH,CAAA,CAAAE,EAAA,CACAE,EAAAJ,CAAA,CAAAE,EAAA,GACAG,EAAAR,EAAAM,EAAAC,EAAA,GAAAJ,CAAA,CAAAC,EAAA,CACAK,EAAAR,EAAAK,EAAAC,EAAA,GAAAJ,CAAA,CAAAC,EAAA,GACA,QAAAV,EAAA,EAA4BA,EAAA,GAAQA,GAAA,GACpC1C,CAAA,CAAAyC,EAAAC,EAAA,EAAAc,EACAxD,CAAA,CAAAyC,EAAAC,EAAA,IAAAe,CAEA,CAEA,IAAAC,EAAA1D,CAAA,IACA2D,EAAA3D,CAAA,IACA,QAAA4C,EAAA,EAAwBA,EAAA,GAAQA,IAAA,CAChC,IAAAgB,EAAA7B,CAAA,CAAAa,EAAA,CACAY,EAAAR,EAAAU,EAAAC,EAAAC,GACAH,EAAAR,EAAAS,EAAAC,EAAAC,GACAC,EAAA/B,CAAA,CAAAc,EAAA,CACAc,EAAA1D,CAAA,CAAA6D,EAAA,CACAF,EAAA3D,CAAA,CAAA6D,EAAA,GACA7D,CAAA,CAAA6D,EAAA,CAAAL,EACAxD,CAAA,CAAA6D,EAAA,GAAAJ,CACA,CAEA,QAAAf,EAAA,EAAwBA,EAAA,GAAQA,GAAA,IAChC,QAAAD,EAAA,EAA4BA,EAAA,GAAQA,IACpCU,CAAA,CAAAV,EAAA,CAAAzC,CAAA,CAAA0C,EAAAD,EAAA,CACA,QAAAA,EAAA,EAA4BA,EAAA,GAAQA,IACpCzC,CAAA,CAAA0C,EAAAD,EAAA,GAAAU,CAAA,EAAAV,EAAA,OAAAU,CAAA,EAAAV,EAAA,OAGAzC,CAAA,KAAA8C,CAAA,CAAAP,EAAA,CACAvC,CAAA,KAAA+C,CAAA,CAAAR,EAAA,CAEAY,EAAAW,IAAA,GACA,CACAjG,EAAA4D,OAAe,CAAAA,CACf,OAAAD,UAAAK,EAAAkC,IAAA,CAEAvH,YAAAU,CAAA,CAAA8G,CAAA,CAAA/G,CAAA,CAAAgH,EAAA,GAAAf,EAAA,IAcA,GAbA,QACA,KAAAhG,QAAA,CAAAA,EACA,KAAA8G,MAAA,CAAAA,EACA,KAAA/G,SAAA,CAAAA,EACA,KAAAgH,SAAA,CAAAA,EACA,KAAAf,MAAA,CAAAA,EACA,KAAAgB,GAAA,GACA,KAAAC,MAAA,GACA,KAAA5G,QAAA,IACA,KAAAD,SAAA,IAEA,GAAAoE,EAAA3F,MAAA,EAAAkB,GAEA,QAAAC,QAAA,OAAAA,QAAA,MACA,uDACA,MAAAkH,KAAA,KAAA7H,WAAA,KACA,KAAA8H,OAAA,IAAAxC,EAAAyC,GAAA,OAAAF,KAAA,CACA,CACAG,QAAA,CACA9C,EAAA,KAAA4C,OAAA,MAAAnB,MAAA,EACA,KAAAiB,MAAA,GACA,KAAAD,GAAA,EACA,CACAQ,OAAAC,CAAA,EACA,GAAAjD,EAAAvE,MAAA,QACA,IAAgBD,SAAAA,CAAA,CAAAkH,MAAAA,CAAA,EAAkB,KAElCQ,EAAAD,CADAA,EAAA,GAAA9C,EAAAgD,OAAA,EAAAF,EAAA,EACA/H,MAAA,CACA,QAAAsH,EAAA,EAA0BA,EAAAU,GAAU,CACpC,IAAAE,EAAAC,KAAArH,GAAA,CAAAR,EAAA,KAAAgH,GAAA,CAAAU,EAAAV,GACA,QAAApE,EAAA,EAA4BA,EAAAgF,EAAUhF,IACtCsE,CAAA,MAAAF,GAAA,KAAAS,CAAA,CAAAT,IAAA,CACA,KAAAA,GAAA,GAAAhH,GACA,KAAAqH,MAAA,EACA,CACA,YAEAS,QAAA,CACA,QAAAzH,QAAA,CACA,MACA,MAAAA,QAAA,IACA,IAAgB6G,MAAAA,CAAA,CAAAJ,OAAAA,CAAA,CAAAE,IAAAA,CAAA,CAAAhH,SAAAA,CAAA,EAA+B,KAE/CkH,CAAA,CAAAF,EAAA,EAAAF,EACAA,CAAAA,IAAAA,CAAA,MAAAE,IAAAhH,EAAA,GACA,KAAAqH,MAAA,GACAH,CAAA,CAAAlH,EAAA,QACA,KAAAqH,MAAA,EACA,CACAU,UAAAxH,CAAA,EACA,GAAAiE,EAAAvE,MAAA,WACA,GAAAuE,EAAAhF,KAAA,EAAAe,GACA,KAAAuH,MAAA,GACA,IAAAE,EAAA,KAAAd,KAAA,CACA,CAAgBlH,SAAAA,CAAA,EAAW,KAC3B,QAAAgH,EAAA,EAAAU,EAAAnH,EAAAb,MAAA,CAA4CsH,EAAAU,GAAU,CACtD,KAAAT,MAAA,EAAAjH,GACA,KAAAqH,MAAA,GACA,IAAAO,EAAAC,KAAArH,GAAA,CAAAR,EAAA,KAAAiH,MAAA,CAAAS,EAAAV,GACAzG,EAAA0H,GAAA,CAAAD,EAAAE,QAAA,MAAAjB,MAAA,MAAAA,MAAA,CAAAW,GAAAZ,GACA,KAAAC,MAAA,EAAAW,EACAZ,GAAAY,CACA,CACA,OAAArH,CACA,CACA4H,QAAA5H,CAAA,EAEA,SAAAwG,SAAA,CACA,qDACA,YAAAgB,SAAA,CAAAxH,EACA,CACA6H,IAAA5I,CAAA,EAEA,MADA,GAAAgF,EAAA3F,MAAA,EAAAW,GACA,KAAA2I,OAAA,KAAA9I,WAAAG,GACA,CACA6I,WAAA9H,CAAA,EAEA,GADA,GAAAiE,EAAAlE,MAAA,EAAAC,EAAA,MACA,KAAAF,QAAA,CACA,2CAGA,OAFA,KAAA0H,SAAA,CAAAxH,GACA,KAAA+H,OAAA,GACA/H,CACA,CACAgI,QAAA,CACA,YAAAF,UAAA,KAAAhJ,WAAA,KAAAU,SAAA,EACA,CACAuI,SAAA,CACA,KAAAlI,SAAA,IACA,KAAA8G,KAAA,CAAAN,IAAA,GACA,CACA4B,WAAAC,CAAA,EACA,IAAgBzI,SAAAA,CAAA,CAAA8G,OAAAA,CAAA,CAAA/G,UAAAA,CAAA,CAAAiG,OAAAA,CAAA,CAAAe,UAAAA,CAAA,EAAiD,KAYjE,OAXA0B,GAAAA,CAAAA,EAAA,IAAAnE,EAAAtE,EAAA8G,EAAA/G,EAAAgH,EAAAf,EAAA,EACAyC,EAAAtB,OAAA,CAAAc,GAAA,MAAAd,OAAA,EACAsB,EAAAzB,GAAA,MAAAA,GAAA,CACAyB,EAAAxB,MAAA,MAAAA,MAAA,CACAwB,EAAApI,QAAA,MAAAA,QAAA,CACAoI,EAAAzC,MAAA,CAAAA,EAEAyC,EAAA3B,MAAA,CAAAA,EACA2B,EAAA1I,SAAA,CAAAA,EACA0I,EAAA1B,SAAA,CAAAA,EACA0B,EAAArI,SAAA,MAAAA,SAAA,CACAqI,CACA,CACA,CACA9H,EAAA2D,MAAc,CAAAA,EACd,IAAAoE,EAAA,CAAA5B,EAAA9G,EAAAD,IAAA,GAAA4E,EAAAgE,eAAA,UAAArE,EAAAtE,EAAA8G,EAAA/G,GACAY,CAAAA,EAAA0D,QAAgB,CAAAqE,EAAA,UAKhB/H,EAAAyD,QAAgB,CAAAsE,EAAA,UAChB/H,EAAAwD,QAAgB,CAAAuE,EAAA,UAChB/H,EAAAuD,QAAgB,CAAAwE,EAAA,SAChB/H,EAAAsD,UAAkB,CAAAyE,EAAA,UAKlB/H,EAAAqD,UAAkB,CAAA0E,EAAA,UAClB/H,EAAAoD,UAAkB,CAAA2E,EAAA,UAClB/H,EAAAmD,UAAkB,CAAA4E,EAAA,SAClB,IAAAE,EAAA,CAAA9B,EAAA9G,EAAAD,IAAA,GAAA4E,EAAAkE,0BAAA,GAAAC,EAAA,EAAuG,OAAAxE,EAAAtE,EAAA8G,EAAAgC,KAAAnF,IAAAmF,EAAAC,KAAA,CAAAhJ,EAAA+I,EAAAC,KAAA,KACvGpI,CAAAA,EAAAkD,QAAgB,CAAA+E,EAAA,WAChBjI,EAAAiD,QAAgB,CAAAgF,EAAA,+CClNhBnI,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAulD,MAAc,CAAGvlD,EAAAwlD,UAAkB,CAAGxlD,EAAAylD,UAAkB,CAAGzlD,EAAA0lD,MAAc,CAAG1lD,EAAA2lD,MAAc,QAC1F,IAAA7G,EAAmBh7C,EAAQ,OAC3BC,EAAkBD,EAAQ,OAC1BE,EAAmBF,EAAQ,OAG3B,CAAA8hD,EAAAC,EAAA,CAAA9hD,EAAAyJ,OAAA,CAAAlM,KAAA,EACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,oFACA,CAAA+Y,GAAA,CAAAlc,GAAAsD,OAAAtD,KAEA2nD,EAAA,IAAA/jD,YAAA,IACAgkD,EAAA,IAAAhkD,YAAA,GACA,OAAA4jD,UAAA7G,EAAAvC,IAAA,CACA59C,aAAA,CACA,oBAKA,KAAAmD,EAAA,YACA,KAAAE,EAAA,YACA,KAAAK,EAAA,aACA,KAAAC,EAAA,aACA,KAAAG,EAAA,YACA,KAAAF,EAAA,WACA,KAAAI,EAAA,aACA,KAAAD,EAAA,YACA,KAAAG,EAAA,YACA,KAAAD,EAAA,aACA,KAAAojD,EAAA,aACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,YACA,KAAAC,EAAA,UACA,CAEAl1C,KAAA,CACA,IAAgBrP,GAAAA,CAAA,CAAAE,GAAAA,CAAA,CAAAK,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAG,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAI,GAAAA,CAAA,CAAAD,GAAAA,CAAA,CAAAG,GAAAA,CAAA,CAAAD,GAAAA,CAAA,CAAAojD,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,EAAiE,KACjF,OAAAvkD,EAAAE,EAAAK,EAAAC,EAAAG,EAAAF,EAAAI,EAAAD,EAAAG,EAAAD,EAAAojD,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,CAGA/+C,IAAAxF,CAAA,CAAAE,CAAA,CAAAK,CAAA,CAAAC,CAAA,CAAAG,CAAA,CAAAF,CAAA,CAAAI,CAAA,CAAAD,CAAA,CAAAG,CAAA,CAAAD,CAAA,CAAAojD,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,KAAAvkD,EAAA,CAAAA,EAAAA,EACA,KAAAE,EAAA,CAAAA,EAAAA,EACA,KAAAK,EAAA,CAAAA,EAAAA,EACA,KAAAC,EAAA,CAAAA,EAAAA,EACA,KAAAG,EAAA,CAAAA,EAAAA,EACA,KAAAF,EAAA,CAAAA,EAAAA,EACA,KAAAI,EAAA,CAAAA,EAAAA,EACA,KAAAD,EAAA,CAAAA,EAAAA,EACA,KAAAG,EAAA,CAAAA,EAAAA,EACA,KAAAD,EAAA,CAAAA,EAAAA,EACA,KAAAojD,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,CACA1J,QAAAF,CAAA,CAAArhB,CAAA,EAEA,QAAAn5B,EAAA,EAAwBA,EAAA,GAAQA,IAAAm5B,GAAA,EAChC0qB,CAAA,CAAA7jD,EAAA,CAAAw6C,EAAAwD,SAAA,CAAA7kB,GACA2qB,CAAA,CAAA9jD,EAAA,CAAAw6C,EAAAwD,SAAA,CAAA7kB,GAAA,GAEA,QAAAn5B,EAAA,GAAyBA,EAAA,GAAQA,IAAA,CAEjC,IAAAqkD,EAAAR,EAAAA,CAAA,CAAA7jD,EAAA,IACAskD,EAAAR,EAAAA,CAAA,CAAA9jD,EAAA,IACAukD,EAAAziD,EAAAyJ,OAAA,CAAAtM,MAAA,CAAAolD,EAAAC,EAAA,GAAAxiD,EAAAyJ,OAAA,CAAAtM,MAAA,CAAAolD,EAAAC,EAAA,GAAAxiD,EAAAyJ,OAAA,CAAApM,KAAA,CAAAklD,EAAAC,EAAA,GACAE,EAAA1iD,EAAAyJ,OAAA,CAAAvM,MAAA,CAAAqlD,EAAAC,EAAA,GAAAxiD,EAAAyJ,OAAA,CAAAvM,MAAA,CAAAqlD,EAAAC,EAAA,GAAAxiD,EAAAyJ,OAAA,CAAArM,KAAA,CAAAmlD,EAAAC,EAAA,GAEAG,EAAAZ,EAAAA,CAAA,CAAA7jD,EAAA,GACA0kD,EAAAZ,EAAAA,CAAA,CAAA9jD,EAAA,GACA2kD,EAAA7iD,EAAAyJ,OAAA,CAAAtM,MAAA,CAAAwlD,EAAAC,EAAA,IAAA5iD,EAAAyJ,OAAA,CAAAxM,MAAA,CAAA0lD,EAAAC,EAAA,IAAA5iD,EAAAyJ,OAAA,CAAApM,KAAA,CAAAslD,EAAAC,EAAA,GACAE,EAAA9iD,EAAAyJ,OAAA,CAAAvM,MAAA,CAAAylD,EAAAC,EAAA,IAAA5iD,EAAAyJ,OAAA,CAAAzM,MAAA,CAAA2lD,EAAAC,EAAA,IAAA5iD,EAAAyJ,OAAA,CAAArM,KAAA,CAAAulD,EAAAC,EAAA,GAEAG,EAAA/iD,EAAAyJ,OAAA,CAAAnN,KAAA,CAAAomD,EAAAI,EAAAd,CAAA,CAAA9jD,EAAA,GAAA8jD,CAAA,CAAA9jD,EAAA,KACA8kD,EAAAhjD,EAAAyJ,OAAA,CAAApN,KAAA,CAAA0mD,EAAAN,EAAAI,EAAAd,CAAA,CAAA7jD,EAAA,GAAA6jD,CAAA,CAAA7jD,EAAA,IACA6jD,CAAAA,CAAA,CAAA7jD,EAAA,CAAA8kD,EAAAA,EACAhB,CAAA,CAAA9jD,EAAA,CAAA6kD,EAAAA,CACA,CACA,IAAchlD,GAAAA,CAAA,CAAAE,GAAAA,CAAA,CAAAK,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAG,GAAAA,CAAA,CAAAF,GAAAA,CAAA,CAAAI,GAAAA,CAAA,CAAAD,GAAAA,CAAA,CAAAG,GAAAA,CAAA,CAAAD,GAAAA,CAAA,CAAAojD,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,GAAAA,CAAA,EAAiE,KAE/E,QAAApkD,EAAA,EAAwBA,EAAA,GAAQA,IAAA,CAEhC,IAAA+kD,EAAAjjD,EAAAyJ,OAAA,CAAAtM,MAAA,CAAA2B,EAAAD,EAAA,IAAAmB,EAAAyJ,OAAA,CAAAtM,MAAA,CAAA2B,EAAAD,EAAA,IAAAmB,EAAAyJ,OAAA,CAAAxM,MAAA,CAAA6B,EAAAD,EAAA,IACAqkD,EAAAljD,EAAAyJ,OAAA,CAAAvM,MAAA,CAAA4B,EAAAD,EAAA,IAAAmB,EAAAyJ,OAAA,CAAAvM,MAAA,CAAA4B,EAAAD,EAAA,IAAAmB,EAAAyJ,OAAA,CAAAzM,MAAA,CAAA8B,EAAAD,EAAA,IAEAskD,EAAA,EAAAlB,EAAA,CAAAnjD,EAAAqjD,EACAiB,EAAA,EAAAlB,EAAA,CAAArjD,EAAAujD,EAGAiB,EAAArjD,EAAAyJ,OAAA,CAAAtN,KAAA,CAAAmmD,EAAAY,EAAAE,EAAAtB,CAAA,CAAA5jD,EAAA,CAAA8jD,CAAA,CAAA9jD,EAAA,EACAolD,EAAAtjD,EAAAyJ,OAAA,CAAArN,KAAA,CAAAinD,EAAAhB,EAAAY,EAAAE,EAAAtB,CAAA,CAAA3jD,EAAA,CAAA6jD,CAAA,CAAA7jD,EAAA,EACAqlD,EAAAF,EAAAA,EAEAG,EAAAxjD,EAAAyJ,OAAA,CAAAtM,MAAA,CAAAY,EAAAE,EAAA,IAAA+B,EAAAyJ,OAAA,CAAAxM,MAAA,CAAAc,EAAAE,EAAA,IAAA+B,EAAAyJ,OAAA,CAAAxM,MAAA,CAAAc,EAAAE,EAAA,IACAwlD,EAAAzjD,EAAAyJ,OAAA,CAAAvM,MAAA,CAAAa,EAAAE,EAAA,IAAA+B,EAAAyJ,OAAA,CAAAzM,MAAA,CAAAe,EAAAE,EAAA,IAAA+B,EAAAyJ,OAAA,CAAAzM,MAAA,CAAAe,EAAAE,EAAA,IACAylD,EAAA,EAAAplD,EAAAP,EAAAW,EAAAJ,EAAAI,EACAilD,EAAA,EAAAplD,EAAAN,EAAAO,EAAAD,EAAAC,EACA6jD,EAAAF,EAAAA,EACAG,EAAAF,EAAAA,EACAD,EAAAF,EAAAA,EACAG,EAAAF,EAAAA,EACAD,EAAAnjD,EAAAA,EACAojD,EAAArjD,EAAAA,EACA,EAAe1D,EAAA2D,CAAA,CAAAjB,EAAAgB,CAAA,EAAemB,EAAAyJ,OAAA,CAAAhN,GAAA,CAAAmC,EAAAA,EAAAD,EAAAA,EAAA2kD,EAAAA,EAAAC,EAAAA,EAAA,EAC9B3kD,EAAAF,EAAAA,EACAC,EAAAH,EAAAA,EACAE,EAAAJ,EAAAA,EACAE,EAAAD,EAAAA,EACAD,EAAAP,EAAAA,EACAQ,EAAAN,EAAAA,EACA,IAAA2lD,EAAA5jD,EAAAyJ,OAAA,CAAAjN,KAAA,CAAA+mD,EAAAE,EAAAE,GACA5lD,EAAAiC,EAAAyJ,OAAA,CAAAlN,KAAA,CAAAqnD,EAAAN,EAAAE,EAAAE,GACAzlD,EAAA2lD,EAAAA,CACA,CAEA,EAAWzoD,EAAA4C,CAAA,CAAAF,EAAAI,CAAA,EAAe+B,EAAAyJ,OAAA,CAAAhN,GAAA,QAAAsB,EAAA,QAAAE,EAAA,CAAAF,EAAAA,EAAAE,EAAAA,EAAA,EAC1B,EAAW9C,EAAAmD,CAAA,CAAAT,EAAAU,CAAA,EAAeyB,EAAAyJ,OAAA,CAAAhN,GAAA,QAAA6B,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EAC1B,EAAWpD,EAAAuD,CAAA,CAAAb,EAAAW,CAAA,EAAewB,EAAAyJ,OAAA,CAAAhN,GAAA,QAAAiC,EAAA,QAAAF,EAAA,CAAAE,EAAAA,EAAAF,EAAAA,EAAA,EAC1B,EAAWrD,EAAAyD,CAAA,CAAAf,EAAAc,CAAA,EAAeqB,EAAAyJ,OAAA,CAAAhN,GAAA,QAAAmC,EAAA,QAAAD,EAAA,CAAAC,EAAAA,EAAAD,EAAAA,EAAA,EAC1B,EAAWxD,EAAA2D,CAAA,CAAAjB,EAAAgB,CAAA,EAAemB,EAAAyJ,OAAA,CAAAhN,GAAA,QAAAqC,EAAA,QAAAD,EAAA,CAAAC,EAAAA,EAAAD,EAAAA,EAAA,EAC1B,EAAW1D,EAAA8mD,CAAA,CAAApkD,EAAAqkD,CAAA,EAAeliD,EAAAyJ,OAAA,CAAAhN,GAAA,QAAAwlD,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EAC1B,EAAW/mD,EAAAgnD,CAAA,CAAAtkD,EAAAukD,CAAA,EAAepiD,EAAAyJ,OAAA,CAAAhN,GAAA,QAAA0lD,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EAC1B,EAAWjnD,EAAAknD,CAAA,CAAAxkD,EAAAykD,CAAA,EAAetiD,EAAAyJ,OAAA,CAAAhN,GAAA,QAAA4lD,EAAA,QAAAC,EAAA,CAAAD,EAAAA,EAAAC,EAAAA,EAAA,EAC1B,KAAA/+C,GAAA,CAAAxF,EAAAE,EAAAK,EAAAC,EAAAG,EAAAF,EAAAI,EAAAD,EAAAG,EAAAD,EAAAojD,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EACA,CACAzJ,YAAA,CACAkJ,EAAA7/C,IAAA,IACA8/C,EAAA9/C,IAAA,GACA,CACA0B,SAAA,CACA,KAAA2B,MAAA,CAAArD,IAAA,IACA,KAAAqB,GAAA,iCACA,CACA,CACAtH,EAAA2lD,MAAc,CAAAA,CACd,OAAAiC,UAAAjC,EACAhnD,aAAA,CACA,QAEA,KAAAmD,EAAA,aACA,KAAAE,EAAA,WACA,KAAAK,EAAA,YACA,KAAAC,EAAA,aACA,KAAAG,EAAA,WACA,KAAAF,EAAA,WACA,KAAAI,EAAA,YACA,KAAAD,EAAA,YACA,KAAAG,EAAA,WACA,KAAAD,EAAA,YACA,KAAAojD,EAAA,YACA,KAAAC,EAAA,UACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,WACA,KAAAC,EAAA,aACA,KAAAjnD,SAAA,GACA,CACA,CACA,MAAAyoD,UAAAlC,EACAhnD,aAAA,CACA,QAEA,KAAAmD,EAAA,WACA,KAAAE,EAAA,WACA,KAAAK,EAAA,aACA,KAAAC,EAAA,YACA,KAAAG,EAAA,WACA,KAAAF,EAAA,YACA,KAAAI,EAAA,aACA,KAAAD,EAAA,YACA,KAAAG,EAAA,aACA,KAAAD,EAAA,aACA,KAAAojD,EAAA,aACA,KAAAC,EAAA,YACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,WACA,KAAAC,EAAA,aACA,KAAAjnD,SAAA,GACA,CACA,CACA,MAAA0oD,UAAAnC,EACAhnD,aAAA,CACA,QAEA,KAAAmD,EAAA,YACA,KAAAE,EAAA,aACA,KAAAK,EAAA,YACA,KAAAC,EAAA,WACA,KAAAG,EAAA,aACA,KAAAF,EAAA,WACA,KAAAI,EAAA,WACA,KAAAD,EAAA,YACA,KAAAG,EAAA,YACA,KAAAD,EAAA,UACA,KAAAojD,EAAA,aACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,YACA,KAAAC,EAAA,aACA,KAAAjnD,SAAA,GACA,CACA,CACAY,EAAA0lD,MAAc,IAAA1hD,EAAAgE,eAAA,UAAA29C,GACd3lD,EAAAylD,UAAkB,IAAAzhD,EAAAgE,eAAA,UAAA4/C,GAClB5nD,EAAAwlD,UAAkB,IAAAxhD,EAAAgE,eAAA,UAAA6/C,GAClB7nD,EAAAulD,MAAc,IAAAvhD,EAAAgE,eAAA,UAAA8/C,uCCvOdhoD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqI,WAAmB,CAAGrI,EAAAkI,0BAAkC,CAAGlI,EAAAsI,uBAA+B,CAAGtI,EAAAgI,eAAuB,CAAGhI,EAAAuI,SAAiB,CAAGvI,EAAAkG,IAAY,CAAGlG,EAAAwI,WAAmB,CAAGxI,EAAAgH,OAAe,CAAGhH,EAAAyI,WAAmB,CAAGzI,EAAA0I,SAAiB,CAAG1I,EAAA2I,QAAgB,CAAG3I,EAAA4I,UAAkB,CAAG5I,EAAA6I,UAAkB,CAAG7I,EAAA2G,IAAY,CAAG3G,EAAAiJ,IAAY,CAAGjJ,EAAAkJ,UAAkB,CAAGlJ,EAAAyG,GAAW,CAAGzG,EAAAmJ,EAAU,QAOpX,IAAAC,EAAiBtF,EAAQ,OACzBuoC,EAAA,GAAA5tC,aAAAC,WAeA,GAZAsB,EAAAmJ,EAAU,CADV,OAAAzK,WAAA2K,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAAF,EAAAG,UAAA,EAGAxJ,EAAAyG,GAAW,CADX,OAAA1E,YAAAsH,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAArC,KAAAuC,KAAA,CAAAJ,EAAAG,UAAA,KAIAxJ,EAAAkJ,UAAkB,CADlB,OAAAQ,SAAAL,EAAAC,MAAA,CAAAD,EAAAE,UAAA,CAAAF,EAAAG,UAAA,EAIAxJ,EAAAiJ,IAAY,CADZ,CAAAU,EAAA5D,IAAA,MAAAA,EAAA4D,IAAA5D,EAIA/F,EAAA2G,IAAY,UAAAjI,WAAA,IAAAqD,YAAA,aAAAuH,MAAA,KACZ,CAAAtJ,EAAA2G,IAAA,CACA,2DACA,IAAAiD,EAAAC,MAAAC,IAAA,EAA2C/K,OAAA,KAAa,CAAAgL,EAAA9H,IAAAA,EAAA+H,QAAA,KAAAC,QAAA,QAcxDjK,CAAAA,EAAA6I,UAAkB,CAVlB,SAAAhK,CAAA,EACA,IAAAwtC,EAAAxtC,GACA,mCAEA,IAAAqL,EAAA,GACA,QAAAjI,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IACtCiI,GAAAN,CAAA,CAAA/K,CAAA,CAAAoD,EAAA,EAEA,OAAAiI,CACA,EAsBAlK,EAAA4I,UAAkB,CAjBlB,SAAAsB,CAAA,EACA,oBAAAA,EACA,+CAAAA,GACA,IAAAnD,EAAAmD,EAAAnL,MAAA,CACA,GAAAgI,EAAA,EACA,sEAAAA,GACA,IAAA+D,EAAA,IAAApM,WAAAqI,EAAA,GACA,QAAA9E,EAAA,EAAoBA,EAAA6I,EAAA/L,MAAA,CAAkBkD,IAAA,CACtC,IAAA+C,EAAA/C,EAAAA,EAEAqqC,EAAAluC,OAAAyT,QAAA,CADA3H,EAAA4F,KAAA,CAAA9K,EAAAA,EAAA,GACA,IACA,GAAA5G,OAAA4T,KAAA,CAAAs6B,IAAAA,EAAA,EACA,oCACAxhC,CAAAA,CAAA,CAAA7I,EAAA,CAAAqqC,CACA,CACA,OAAAxhC,CACA,EAKA,IAAAnC,EAAA,YAGA,eAAAD,EAAA0C,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAC,KAAAC,GAAA,GACA,QAAAxJ,EAAA,EAAoBA,EAAAmJ,EAAWnJ,IAAA,CAC/BqJ,EAAArJ,GAEA,IAAAyJ,EAAAF,KAAAC,GAAA,GAAAF,EACAG,GAAA,GAAAA,EAAAL,IAEA,SAAArL,EAAA2I,QAAA,IACA4C,GAAAG,EACA,CACA,CAKA,SAAAjD,EAAAkD,CAAA,EACA,oBAAAA,EACA,gDAA4D,OAAAA,EAAW,GACvE,WAAAjN,WAAA,IAAAkN,cAAAC,MAAA,CAAAF,GACA,CAOA,SAAA3E,EAAAF,CAAA,EAGA,GAFA,iBAAAA,GACAA,CAAAA,EAAA2B,EAAA3B,EAAA,EACA,CAAAulC,EAAAvlC,GACA,wCAAoD,OAAAA,EAAY,GAChE,OAAAA,CACA,CAnCA9G,EAAA2I,QAAgB,CAAAA,EAchB3I,EAAA0I,SAAiB,CAAAA,EASjB1I,EAAAyI,WAAmB,CAAAA,EAanBzI,EAAAgH,OAAe,CAAAA,EAefhH,EAAAwI,WAAmB,CAXnB,YAAAsD,CAAA,EACA,IAAA28B,EAAA,IAAA/pC,WAAAoN,EAAAm6B,MAAA,EAAAl6B,EAAAtN,IAAAsN,EAAAtN,EAAAM,MAAA,KACAkN,EAAA,EAOA,OANAH,EAAAoI,OAAA,KACA,IAAAm4B,EAAA5tC,GACA,mCACAgqC,EAAAnhC,GAAA,CAAA7I,EAAAwN,GACAA,GAAAxN,EAAAM,MAAA,GAEA0pC,CACA,CAGA,OAAAviC,EAEAgG,OAAA,CACA,YAAArE,UAAA,EACA,CACA,CACA7H,EAAAkG,IAAY,CAAAA,EACZ,IAAAiG,EAAA,GAAgBnC,QAAA,CAOhBhK,EAAAuI,SAAiB,CANjB,SAAA6D,CAAA,CAAAjE,CAAA,EACA,GAAAA,KAAAnF,IAAAmF,GAAAgE,oBAAAA,EAAAE,IAAA,CAAAlE,GACA,qDAEA,OADArI,OAAAwM,MAAA,CAAAF,EAAAjE,EAEA,EAUAnI,EAAAgI,eAAuB,CARvB,SAAAuE,CAAA,EACA,IAAAC,EAAA,GAAAD,IAAA1F,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,KAAAoN,IACAC,CACA,EAUAxM,EAAAsI,uBAA+B,CAR/B,SAAAiE,CAAA,EACA,IAAAC,EAAA,CAAAC,EAAAtE,IAAAoE,EAAApE,GAAAtB,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,EAAA,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,IAAAoN,EAAApE,GACAqE,CACA,EAUAxM,EAAAkI,0BAAkC,CARlC,SAAAqE,CAAA,EACA,IAAAC,EAAA,CAAAC,EAAAtE,IAAAoE,EAAApE,GAAAtB,MAAA,CAAAG,EAAAyF,IAAA7E,MAAA,GACA8E,EAAAH,EAAA,IAIA,OAHAC,EAAApN,SAAA,CAAAsN,EAAAtN,SAAA,CACAoN,EAAAnN,QAAA,CAAAqN,EAAArN,QAAA,CACAmN,EAAArN,MAAA,IAAAoN,EAAApE,GACAqE,CACA,EAWAxM,EAAAqI,WAAmB,CANnB,SAAAsE,EAAA,IACA,GAAAvD,EAAAtG,MAAA,qBAAAsG,EAAAtG,MAAA,CAAA8J,eAAA,CACA,OAAAxD,EAAAtG,MAAA,CAAA8J,eAAA,KAAAlO,WAAAiO,GAEA,sDACA,k5BC3JA,IAAAo7C,EAAA,SAAAtmB,CAAA,CAAAljC,CAAA,EAIA,MAAAwpD,CAHAA,EAAAjoD,OAAAkoD,cAAA,EACA,EAAWC,UAAA,eAAgBp+C,OAAA,SAAA43B,CAAA,CAAAljC,CAAA,EAAsCkjC,EAAAwmB,SAAA,CAAA1pD,CAAA,GACjE,SAAAkjC,CAAA,CAAAljC,CAAA,EAA0B,QAAA8S,KAAA9S,EAAAuB,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAA9N,EAAA8S,IAAAowB,CAAAA,CAAA,CAAApwB,EAAA,CAAA9S,CAAA,CAAA8S,EAAA,IAC1BowB,EAAAljC,EACA,EAEO,SAAA2pD,EAAAzmB,CAAA,CAAAljC,CAAA,EACP,sBAAAA,GAAAA,OAAAA,EACA,uCAAAsV,OAAAtV,GAAA,iCAEA,SAAA4pD,IAAoB,KAAAxpD,WAAA,CAAA8iC,CAAA,CADpBsmB,EAAAtmB,EAAAljC,GAEAkjC,EAAAnwB,SAAA,CAAA/S,OAAAA,EAAAuB,OAAAX,MAAA,CAAAZ,GAAA4pD,CAAAA,EAAA72C,SAAA,CAAA/S,EAAA+S,SAAA,KAAA62C,CAAA,CACA,CAEO,IAAAC,EAAA,WAQP,MAAAA,CAPAA,EAAAtoD,OAAAwM,MAAA,WAAAvH,CAAA,EACA,QAAA5C,EAAAF,EAAA,EAAA9D,EAAAkqD,UAAAtpD,MAAA,CAAiDkD,EAAA9D,EAAO8D,IAExD,QAAAoP,KADAlP,EAAAkmD,SAAA,CAAApmD,EAAA,CACAnC,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAlK,EAAAkP,IAAAtM,CAAAA,CAAA,CAAAsM,EAAA,CAAAlP,CAAA,CAAAkP,EAAA,EAEA,OAAAtM,CACA,GACAujD,KAAA,MAAAD,UACA,EAEO,SAAAE,EAAApmD,CAAA,CAAAojC,CAAA,EACP,IAAAxgC,EAAA,GACA,QAAAsM,KAAAlP,EAAArC,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAlK,EAAAkP,IAAAk0B,EAAAA,EAAArX,OAAA,CAAA7c,IACAtM,CAAAA,CAAA,CAAAsM,EAAA,CAAAlP,CAAA,CAAAkP,EAAA,EACA,GAAAlP,MAAAA,GAAA,mBAAArC,OAAA0oD,qBAAA,CACA,QAAAvmD,EAAA,EAAAoP,EAAAvR,OAAA0oD,qBAAA,CAAArmD,GAA6DF,EAAAoP,EAAAtS,MAAA,CAAckD,IAC3E,EAAAsjC,EAAArX,OAAA,CAAA7c,CAAA,CAAApP,EAAA,GAAAnC,OAAAwR,SAAA,CAAAm3C,oBAAA,CAAAp8C,IAAA,CAAAlK,EAAAkP,CAAA,CAAApP,EAAA,GACA8C,CAAAA,CAAA,CAAAsM,CAAA,CAAApP,EAAA,EAAAE,CAAA,CAAAkP,CAAA,CAAApP,EAAA,GAEA,OAAA8C,CACA,CAEO,SAAA2jD,EAAAC,CAAA,CAAAC,CAAA,CAAAv4C,CAAA,CAAAS,CAAA,EACP,IAAA2wB,EAAA5W,EAAAw9B,UAAAtpD,MAAA,CAAA0pC,EAAA5d,EAAA,EAAA+9B,EAAA93C,OAAAA,EAAAA,EAAAhR,OAAAiR,wBAAA,CAAA63C,EAAAv4C,GAAAS,EACA,oBAAA+3C,SAAA,mBAAAA,QAAAC,QAAA,CAAArgB,EAAAogB,QAAAC,QAAA,CAAAH,EAAAC,EAAAv4C,EAAAS,QACA,QAAA7O,EAAA0mD,EAAA5pD,MAAA,GAA6CkD,GAAA,EAAQA,IAAAw/B,CAAAA,EAAAknB,CAAA,CAAA1mD,EAAA,GAAAwmC,CAAAA,EAAA,CAAA5d,EAAA,EAAA4W,EAAAgH,GAAA5d,EAAA,EAAA4W,EAAAmnB,EAAAv4C,EAAAo4B,GAAAhH,EAAAmnB,EAAAv4C,EAAA,GAAAo4B,CAAAA,EACrD,OAAA5d,EAAA,GAAA4d,GAAA3oC,OAAAC,cAAA,CAAA6oD,EAAAv4C,EAAAo4B,GAAAA,CACA,CAEO,SAAAsgB,EAAAC,CAAA,CAAAC,CAAA,EACP,gBAAAL,CAAA,CAAAv4C,CAAA,EAAoC44C,EAAAL,EAAAv4C,EAAA24C,EAAA,CACpC,CAEO,SAAAE,EAAAC,CAAA,CAAAC,CAAA,EACP,oBAAAP,SAAA,mBAAAA,QAAAQ,QAAA,QAAAR,QAAAQ,QAAA,CAAAF,EAAAC,EACA,CAEO,SAAAE,EAAAC,CAAA,CAAAC,CAAA,CAAA9mB,CAAA,CAAA+mB,CAAA,EAEP,UAAA/mB,CAAAA,GAAAA,CAAAA,EAAAgnB,OAAA,YAAAC,CAAA,CAAAC,CAAA,EACA,SAAAC,EAAA5pD,CAAA,EAAoC,IAAM6pD,EAAAL,EAAAM,IAAA,CAAA9pD,GAAA,CAA+B,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACrF,SAAAykB,EAAA/pD,CAAA,EAAmC,IAAM6pD,EAAAL,EAAA,MAAAxpD,GAAA,CAAmC,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACxF,SAAAukB,EAAA/5C,CAAA,MAJA9P,CAIgC8P,CAAAA,EAAAk6C,IAAA,CAAAN,EAAA55C,EAAA9P,KAAA,EAAAiqD,CAJJjqD,CAA5BA,EAIgC8P,EAAA9P,KAAA,YAJJyiC,EAAAziC,EAAA,IAAAyiC,EAAA,SAAAinB,CAAA,EAA+DA,EAAA1pD,EAAA,EAAiB,EAI5EkqD,IAAA,CAAAN,EAAAG,EAAA,CAChCF,EAAA,CAAAL,EAAAA,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,KAAAO,IAAA,GACA,EACA,CAEO,SAAAK,EAAAb,CAAA,CAAAc,CAAA,EACP,IAAwGtoB,EAAAl9B,EAAAE,EAAAqkC,EAAxGr/B,EAAA,CAAcugD,MAAA,EAAAC,KAAA,WAA6B,GAAAxlD,EAAAA,CAAA,UAAAA,CAAA,IAA0B,OAAAA,CAAA,KAAcylD,KAAA,GAAAC,IAAA,IACnF,OAAArhB,EAAA,CAAiB2gB,KAAAW,EAAA,SAAAA,EAAA,UAAAA,EAAA,IAAoD,mBAAAC,QAAAvhB,CAAAA,CAAA,CAAAuhB,OAAAC,QAAA,aAAqE,cAAcxhB,EACxJ,SAAAshB,EAAAvsD,CAAA,EAAuB,gBAAAoqC,CAAA,EAAsB,OAAAuhB,SAC7CpvC,CAAA,EACA,GAAAqnB,EAAA,mDACA,KAAAh4B,GAAA,IACA,GAAAg4B,EAAA,EAAAl9B,GAAAE,CAAAA,EAAA2V,EAAAA,CAAA,IAAA7V,EAAA,OAAA6V,CAAA,IAAA7V,EAAA,SAAAE,EAAAF,EAAA,SAAAE,EAAAsH,IAAA,CAAAxH,GAAA,GAAAA,EAAAklD,IAAA,KAAAhlD,EAAAA,EAAAsH,IAAA,CAAAxH,EAAA6V,CAAA,MAAAuvC,IAAA,QAAAllD,EAEA,OADAF,EAAA,EAAAA,GAAA6V,CAAAA,EAAA,CAAAA,EAAAA,CAAA,IAAA3V,EAAA9E,KAAA,GACAya,CAAA,KACA,cAAA3V,EAAA2V,EAAwC,KACxC,QAAmC,OAAnC3Q,EAAAugD,KAAA,GAAmC,CAASrqD,MAAAya,CAAA,IAAAuvC,KAAA,GAC5C,QAAAlgD,EAAAugD,KAAA,GAAmCzlD,EAAA6V,CAAA,IAAWA,EAAA,IAAU,QACxD,QAAAA,EAAA3Q,EAAA0gD,GAAA,CAAA9nC,GAAA,GAA0C5Y,EAAAygD,IAAA,CAAA7nC,GAAA,GAAc,QACxD,SACA,GAAA5d,CAAAA,CAAAA,EAAAA,CAAAA,EAAAgF,EAAAygD,IAAA,EAAAzrD,MAAA,IAAAgG,CAAA,CAAAA,EAAAhG,MAAA,MAAA2b,CAAAA,IAAAA,CAAA,KAAAA,IAAAA,CAAA,MAA8G3Q,EAAA,EAAO,SACrH,GAAA2Q,IAAAA,CAAA,OAAA3V,GAAA2V,CAAA,IAAA3V,CAAA,KAAA2V,CAAA,IAAA3V,CAAA,MAAiFgF,EAAAugD,KAAA,CAAA5vC,CAAA,IAAiB,MAClG,GAAAA,IAAAA,CAAA,KAAA3Q,EAAAugD,KAAA,CAAAvlD,CAAA,KAAyDgF,EAAAugD,KAAA,CAAAvlD,CAAA,IAAgBA,EAAA2V,EAAQ,MACjF,GAAA3V,GAAAgF,EAAAugD,KAAA,CAAAvlD,CAAA,KAA+CgF,EAAAugD,KAAA,CAAAvlD,CAAA,IAAgBgF,EAAA0gD,GAAA,CAAA3lD,IAAA,CAAA4V,GAAgB,MAC/E3V,CAAA,KAAAgF,EAAA0gD,GAAA,CAAA9nC,GAAA,GACA5Y,EAAAygD,IAAA,CAAA7nC,GAAA,GAAkC,QAClC,CACAjI,EAAA2vC,EAAAh+C,IAAA,CAAAk9C,EAAAx/C,EACA,CAAU,MAAAw7B,EAAA,CAAY7qB,EAAA,GAAA6qB,EAAA,CAAa1gC,EAAA,SAAS,CAAUk9B,EAAAh9B,EAAA,EACtD,GAAA2V,EAAAA,CAAA,UAAAA,CAAA,IAAoC,OAASza,MAAAya,CAAA,IAAAA,CAAA,WAAAuvC,KAAA,GAC7C,EAtB6C,CAAA9rD,EAAAoqC,EAAA,GAuB7C,CAEO,IAAA93B,EAAA3Q,OAAAX,MAAA,UAAAuR,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACP7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACA,IAAAE,EAAAhR,OAAAiR,wBAAA,CAAAJ,EAAAC,GACA,EAAAE,GAAA,SAAAA,EAAA,CAAAH,EAAA5D,UAAA,CAAA+D,EAAAE,QAAA,EAAAF,EAAAG,YAAA,IACAH,CAAAA,EAAA,CAAiBI,WAAA,GAAAC,IAAA,WAAoC,OAAAR,CAAA,CAAAC,EAAA,IAErD9Q,OAAAC,cAAA,CAAA2Q,EAAAG,EAAAC,EACA,EAAC,SAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACD7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACAF,CAAA,CAAAG,EAAA,CAAAF,CAAA,CAAAC,EAAA,EAGO,SAAAQ,EAAAT,CAAA,CAAAD,CAAA,EACP,QAAAW,KAAAV,EAAA,YAAAU,GAAAvR,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAqE,EAAAW,IAAAZ,EAAAC,EAAAC,EAAAU,EACA,CAEO,SAAAw5C,EAAAn6C,CAAA,EACP,IAAAvO,EAAA,mBAAAwoD,QAAAA,OAAAC,QAAA,CAAAj6C,EAAAxO,GAAAuO,CAAA,CAAAvO,EAAA,CAAAF,EAAA,EACA,GAAA0O,EAAA,OAAAA,EAAAtE,IAAA,CAAAqE,GACA,GAAAA,GAAA,iBAAAA,EAAA3R,MAAA,QACAgrD,KAAA,WAEA,OADAr5C,GAAAzO,GAAAyO,EAAA3R,MAAA,EAAA2R,CAAAA,EAAA,QACA,CAAqBzQ,MAAAyQ,GAAAA,CAAA,CAAAzO,IAAA,CAAAgoD,KAAA,CAAAv5C,CAAA,CACrB,CACA,CACA,iBAAAvO,EAAA,4DACA,CAEO,SAAA2oD,EAAAp6C,CAAA,CAAAvS,CAAA,EACP,IAAAwS,EAAA,mBAAAg6C,QAAAj6C,CAAA,CAAAi6C,OAAAC,QAAA,EACA,IAAAj6C,EAAA,OAAAD,EACA,IAAA+3B,EAAAlD,EAAAtjC,EAAA0O,EAAAtE,IAAA,CAAAqE,GAAAwvC,EAAA,GACA,IACA,MAAA/hD,KAAA,IAAAA,GAAAA,KAAA,MAAAsqC,EAAAxmC,EAAA8nD,IAAA,IAAAE,IAAA,EAAA/J,EAAAp7C,IAAA,CAAA2jC,EAAAxoC,KAAA,CACA,CACA,MAAA2N,EAAA,CAAoB23B,EAAA,CAAM33B,MAAAA,CAAA,SAC1B,CACA,IACA66B,GAAA,CAAAA,EAAAwhB,IAAA,EAAAt5C,CAAAA,EAAA1O,EAAA,SAAA0O,EAAAtE,IAAA,CAAApK,EACA,QACA,CAAkB,GAAAsjC,EAAA,MAAAA,EAAA33B,KAAA,CAClB,CACA,OAAAsyC,CACA,CAGO,SAAA6K,IACP,QAAA7K,EAAA,GAAAj+C,EAAA,EAA6BA,EAAAomD,UAAAtpD,MAAA,CAAsBkD,IACnDi+C,EAAAA,EAAA8K,MAAA,CAAAF,EAAAzC,SAAA,CAAApmD,EAAA,GACA,OAAAi+C,CACA,CAGO,SAAA+K,IACP,QAAA9oD,EAAA,EAAAF,EAAA,EAAAipD,EAAA7C,UAAAtpD,MAAA,CAAkDkD,EAAAipD,EAAQjpD,IAAAE,GAAAkmD,SAAA,CAAApmD,EAAA,CAAAlD,MAAA,CAC1D,QAAA0pC,EAAA5+B,MAAA1H,GAAAyO,EAAA,EAAA3O,EAAA,EAAyCA,EAAAipD,EAAQjpD,IACjD,QAAAxD,EAAA4pD,SAAA,CAAApmD,EAAA,CAAA+C,EAAA,EAAAmmD,EAAA1sD,EAAAM,MAAA,CAAyDiG,EAAAmmD,EAAQnmD,IAAA4L,IACjE63B,CAAA,CAAA73B,EAAA,CAAAnS,CAAA,CAAAuG,EAAA,CACA,OAAAyjC,CACA,CAEO,SAAA2iB,EAAAtjD,CAAA,CAAAgC,CAAA,CAAAuhD,CAAA,EACP,GAAAA,GAAAhD,GAAAA,UAAAtpD,MAAA,SAAAmhD,EAAAj+C,EAAA,EAAAL,EAAAkI,EAAA/K,MAAA,CAA6EkD,EAAAL,EAAOK,KACpFi+C,GAAAj+C,KAAA6H,IACAo2C,GAAAA,CAAAA,EAAAr2C,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,CAAAvC,EAAA,EAAA7H,EAAA,EACAi+C,CAAA,CAAAj+C,EAAA,CAAA6H,CAAA,CAAA7H,EAAA,EAGA,OAAA6F,EAAAkjD,MAAA,CAAA9K,GAAAr2C,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,CAAAvC,GACA,CAEO,SAAAwhD,EAAA/iB,CAAA,EACP,uBAAA+iB,EAAA,MAAA/iB,CAAA,CAAAA,EAAA,UAAA+iB,EAAA/iB,EACA,CAEO,SAAAgjB,EAAAhC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACP,IAAAkB,OAAAa,aAAA,yDACA,IAAAvpD,EAAAmnC,EAAAqgB,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,IAAAhhB,EAAA,GACA,OAAAvmC,EAAA,GAAiByoD,EAAA,QAAAA,EAAA,SAAAA,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAa,aAAA,aAAuF,aAAcvpD,EACtH,SAAAyoD,EAAAvsD,CAAA,EAAuBirC,CAAA,CAAAjrC,EAAA,EAAA8D,CAAAA,CAAA,CAAA9D,EAAA,UAAAoqC,CAAA,EAAgC,WAAAmhB,QAAA,SAAAjrD,CAAA,CAAAF,CAAA,EAAqCiqC,EAAA1jC,IAAA,EAAA3G,EAAAoqC,EAAA9pC,EAAAF,EAAA,KAAAktD,EAAAttD,EAAAoqC,EAAA,EAA2C,GACvI,SAAAkjB,EAAAttD,CAAA,CAAAoqC,CAAA,EAA4B,QAC5BE,CAAuBA,EAAvBA,EADkCW,CAAA,CAAAjrC,EAAA,CAAAoqC,IACXtoC,KAAA,YAAAqrD,EAAA5B,QAAAC,OAAA,CAAAlhB,EAAAxoC,KAAA,CAAAsoC,CAAA,EAAA4hB,IAAA,CAAAuB,EAAA9B,GAAA+B,EAAAnjB,CAAA,OAAAC,EADW,CAAiB,MAAAlD,EAAA,CAAYomB,EAAAnjB,CAAA,OAAAjD,EAAA,EAE/D,SAAAmmB,EAAAzrD,CAAA,EAA8BwrD,EAAA,OAAAxrD,EAAA,CAC9B,SAAA2pD,EAAA3pD,CAAA,EAA6BwrD,EAAA,QAAAxrD,EAAA,CAC7B,SAAA0rD,EAAA5pB,CAAA,CAAAwG,CAAA,EAA4BxG,EAAAwG,GAAAC,EAAAziC,KAAA,GAAAg8B,EAAAhjC,MAAA,EAAA0sD,EAAAjjB,CAAA,OAAAA,CAAA,QAC5B,CAEO,SAAAojB,EAAAl7C,CAAA,EACP,IAAAzO,EAAAoP,EACA,OAAApP,EAAA,GAAiByoD,EAAA,QAAAA,EAAA,iBAAAnlB,CAAA,EAA6C,MAAAA,CAAA,GAAUmlB,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAC,QAAA,aAAsD,aAAc3oD,EAC5I,SAAAyoD,EAAAvsD,CAAA,CAAA4jC,CAAA,EAA0B9/B,CAAA,CAAA9D,EAAA,CAAAuS,CAAA,CAAAvS,EAAA,UAAAoqC,CAAA,EAA6B,OAAAl3B,EAAA,CAAAA,CAAAA,EAAA,CAAoBpR,MAAAqrD,EAAA56C,CAAA,CAAAvS,EAAA,CAAAoqC,IAAA0hB,KAAA9rD,WAAAA,CAAA,EAAgD4jC,EAAAA,EAAAwG,GAAAA,CAAA,EAAkBxG,CAAA,CAC7I,CAEO,SAAA8pB,EAAAn7C,CAAA,EACP,IAAAi6C,OAAAa,aAAA,yDACA,IAAAvpD,EAAA0O,EAAAD,CAAA,CAAAi6C,OAAAa,aAAA,EACA,OAAA76C,EAAAA,EAAAtE,IAAA,CAAAqE,GAAAA,CAAAA,EAAAm6C,EAAAn6C,GAAAzO,EAAA,GAA2GyoD,EAAA,QAAAA,EAAA,SAAAA,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAa,aAAA,aAAuF,aAAcvpD,CAAAA,EAChN,SAAAyoD,EAAAvsD,CAAA,EAAuB8D,CAAA,CAAA9D,EAAA,CAAAuS,CAAA,CAAAvS,EAAA,WAAAoqC,CAAA,EAA8B,WAAAmhB,QAAA,SAAAC,CAAA,CAAAC,CAAA,GAAgD+B,SACrGhC,CAAA,CAAAC,CAAA,CAAAnoB,CAAA,CAAA8G,CAAA,EAA6CmhB,QAAAC,OAAA,CAAAphB,GAAA4hB,IAAA,UAAA5hB,CAAA,EAAsCohB,EAAA,CAAU1pD,MAAAsoC,EAAA0hB,KAAAxoB,CAAA,EAAmB,EAAImoB,EAAA,EADfD,EAAAC,EAAArhB,CAAAA,EAAA73B,CAAA,CAAAvS,EAAA,CAAAoqC,EAAA,EAAA0hB,IAAA,CAAA1hB,EAAAtoC,KAAA,GAAwD,EAE7J,CAEO,SAAA6rD,EAAAC,CAAA,CAAAC,CAAA,EAEP,OADAlsD,OAAAC,cAAA,CAAiCD,OAAAC,cAAA,CAAAgsD,EAAA,OAAuC9rD,MAAA+rD,CAAA,GAAwBD,EAAAC,GAAA,CAAAA,EAChGD,CACA,CAEA,IAAAE,EAAAnsD,OAAAX,MAAA,UAAAuR,CAAA,CAAA63B,CAAA,EACAzoC,OAAAC,cAAA,CAAA2Q,EAAA,WAA0CQ,WAAA,GAAAjR,MAAAsoC,CAAA,EAC1C,EAAC,SAAA73B,CAAA,CAAA63B,CAAA,EACD73B,EAAA,QAAA63B,CACA,EAEO,SAAA2jB,EAAAp/C,CAAA,EACP,GAAAA,GAAAA,EAAAC,UAAA,QAAAD,EACA,IAAAiD,EAAA,GACA,GAAAjD,MAAAA,EAAA,QAAA8D,KAAA9D,EAAA,YAAA8D,GAAA9Q,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAS,EAAA8D,IAAAH,EAAAV,EAAAjD,EAAA8D,GAEA,OADAq7C,EAAAl8C,EAAAjD,GACAiD,CACA,CAEO,SAAAlD,EAAAC,CAAA,EACP,UAAAA,EAAAC,UAAA,CAAAD,EAAA,CAA6CU,QAAAV,CAAA,CAC7C,CAEO,SAAAq/C,EAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACP,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,CAEO,SAAAG,EAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACP,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,CAEO,SAAAusD,EAAAjmD,CAAA,CAAA6lD,CAAA,EACP,GAAAA,OAAAA,GAAA,iBAAAA,GAAA,mBAAAA,EAAA,0DACA,yBAAA7lD,EAAA6lD,IAAA7lD,EAAAA,EAAA+lD,GAAA,CAAAF,EACA,sCCtPA,IAAA37C,EAAA,WAAAA,eAAA,EAAA3Q,CAAAA,OAAAX,MAAA,UAAAuR,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACA,IAAAE,EAAAhR,OAAAiR,wBAAA,CAAAJ,EAAAC,GACA,EAAAE,GAAA,SAAAA,EAAA,CAAAH,EAAA5D,UAAA,CAAA+D,EAAAE,QAAA,EAAAF,EAAAG,YAAA,IACAH,CAAAA,EAAA,CAAeI,WAAA,GAAAC,IAAA,WAAoC,OAAAR,CAAA,CAAAC,EAAA,IAEnD9Q,OAAAC,cAAA,CAAA2Q,EAAAG,EAAAC,EACA,EAAC,SAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACD7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACAF,CAAA,CAAAG,EAAA,CAAAF,CAAA,CAAAC,EAAA,CACC,EACDq7C,EAAA,WAAAA,kBAAA,EAAAnsD,CAAAA,OAAAX,MAAA,UAAAuR,CAAA,CAAA63B,CAAA,EACAzoC,OAAAC,cAAA,CAAA2Q,EAAA,WAA0CQ,WAAA,GAAAjR,MAAAsoC,CAAA,EAC1C,EAAC,SAAA73B,CAAA,CAAA63B,CAAA,EACD73B,EAAA,QAAA63B,CACA,GACA2jB,EAAA,WAAAA,YAAA,WAAAp/C,CAAA,EACA,GAAAA,GAAAA,EAAAC,UAAA,QAAAD,EACA,IAAAiD,EAAA,GACA,GAAAjD,MAAAA,EAAA,QAAA8D,KAAA9D,EAAA,YAAA8D,GAAA9Q,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAS,EAAA8D,IAAAH,EAAAV,EAAAjD,EAAA8D,GAEA,OADAq7C,EAAAl8C,EAAAjD,GACAiD,CACA,EACAu5C,EAAA,WAAAA,SAAA,WAAAC,CAAA,CAAAC,CAAA,CAAA9mB,CAAA,CAAA+mB,CAAA,EAEA,UAAA/mB,CAAAA,GAAAA,CAAAA,EAAAgnB,OAAA,YAAAC,CAAA,CAAAC,CAAA,EACA,SAAAC,EAAA5pD,CAAA,EAAoC,IAAM6pD,EAAAL,EAAAM,IAAA,CAAA9pD,GAAA,CAA+B,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACrF,SAAAykB,EAAA/pD,CAAA,EAAmC,IAAM6pD,EAAAL,EAAA,MAAAxpD,GAAA,CAAmC,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACxF,SAAAukB,EAAA/5C,CAAA,MAJA9P,CAIgC8P,CAAAA,EAAAk6C,IAAA,CAAAN,EAAA55C,EAAA9P,KAAA,EAAAiqD,CAJJjqD,CAA5BA,EAIgC8P,EAAA9P,KAAA,YAJJyiC,EAAAziC,EAAA,IAAAyiC,EAAA,SAAAinB,CAAA,EAA+DA,EAAA1pD,EAAA,EAAiB,EAI5EkqD,IAAA,CAAAN,EAAAG,EAAA,CAChCF,EAAA,CAAAL,EAAAA,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,KAAAO,IAAA,GACA,EACA,EACAjqD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAysD,WAAmB,QAEnB,IAAAC,EAAsB5oD,EAAQ,OAC9BsL,EAAA88C,EAAyBpoD,EAAQ,OACjC6oD,EAAuB7oD,EAAQ,OAC/B8oD,EAAgB9oD,EAAQ,KACxBqJ,EAAgBrJ,EAAQ,MACxB,OAAA2oD,EAOA9tD,YAAAkuD,CAAA,EACA,oBAAAA,EAAA,CACA,IAAAC,EAAA,IAAAJ,EAAA1/C,aAAA,CAAA6/C,EACA,MAAAr+C,MAAA,CAAAs+C,EAAAt+C,MAAA,CACA,KAAAS,MAAA,CAAA69C,EAAA79C,MAAA,CACA,KAAAC,OAAA,CAAA49C,EAAA59C,OAAA,CACA,KAAAC,SAAA,CAAA29C,EAAA39C,SAAA,CACA,KAAAC,GAAA,CAAA09C,EAAA19C,GAAA,CACA,KAAAC,OAAA,CAAAy9C,EAAAz9C,OAAA,CACA,KAAAG,KAAA,CAAAs9C,EAAAt9C,KAAA,CACA,KAAAC,QAAA,CAAAq9C,EAAAr9C,QAAA,CACA,KAAAC,cAAA,CAAAo9C,EAAAp9C,cAAA,CACA,KAAAC,SAAA,CAAAm9C,EAAAn9C,SAAA,CACA,KAAAC,SAAA,CAAAk9C,EAAAl9C,SAAA,CACA,KAAAN,OAAA,CAAAw9C,EAAAx9C,OAAA,CACA,KAAAO,SAAA,CAAAi9C,EAAAj9C,SAAA,MAGA,KAAArB,MAAA,CAAAq+C,MAAAA,EAAA,OAAAA,EAAAr+C,MAAA,CACA,KAAAS,MAAA,CAAA49C,EAAA59C,MAAA,CACA,KAAAC,OAAA,CAAA29C,EAAA39C,OAAA,CACA,KAAAC,SAAA,CAAA09C,MAAAA,EAAA,OAAAA,EAAA19C,SAAA,CACA,KAAAC,GAAA,CAAAy9C,EAAAz9C,GAAA,CACA,KAAAC,OAAA,CAAAw9C,EAAAx9C,OAAA,CACA,KAAAC,OAAA,CAAAu9C,EAAAv9C,OAAA,CACA,KAAAE,KAAA,CAAAq9C,EAAAr9C,KAAA,CACA,KAAAC,QAAA,CAAAo9C,MAAAA,EAAA,OAAAA,EAAAp9C,QAAA,CACA,KAAAC,cAAA,CAAAm9C,MAAAA,EAAA,OAAAA,EAAAn9C,cAAA,CACA,KAAAC,SAAA,CAAAk9C,MAAAA,EAAA,OAAAA,EAAAl9C,SAAA,CACA,KAAAC,SAAA,CAAAi9C,MAAAA,EAAA,OAAAA,EAAAj9C,SAAA,CACA,KAAAC,SAAA,CAAAg9C,MAAAA,EAAA,OAAAA,EAAAh9C,SAAA,CACA,sBAAAP,OAAA,EACA,MAAAA,OAAA,IAAAo9C,EAAAn9C,kBAAA,OAAAD,OAAA,EAGA,MAAAE,KAAA,MAAAA,KAAA,KAAArC,EAAA4/C,aAAA,IACA,KAAAC,eAAA,EACA,CASAC,WAAA,CAEA,KAAAD,eAAA,GACA,IAAAE,EAAA,KAAA1+C,MAAA,IAA6C,KAAAA,MAAA,CAAY,KAAK,KAAAS,MAAA,CAAY,OAAAA,MAAA,CAC1EwuB,EAAA,GAA0ByvB,EAAA,iDAAa,EACvCC,EAAA,QAAiC,KAAA/9C,GAAA,CAAS,EAC1C0F,EAAA,CAAA2oB,EAAA,KAAAvuB,OAAA,EAAAk+C,IAAA,OACAC,EAAA,YAAyC,KAAAh+C,OAAA,CAAa,EACtD,KAAAG,KAAA,EACA,MAAAA,KAAA,IAAArC,EAAA4/C,aAAA,KAEA,IAEAO,EAAA,CAAAH,EAAAE,EAFA,kBAAA/9C,OAAA,CACA,UAAqC,KAAAE,KAAA,CAAW,EAChD,CAGA,GAFA,KAAAC,QAAA,MAAAA,QAAA,MAAAjE,OAAA+hD,WAAA,GACAD,EAAAxoD,IAAA,eAAuC,KAAA2K,QAAA,CAAc,GACrD,KAAAC,cAAA,EACA,IAAA89C,EAAA,oBAAoD,KAAA99C,cAAA,CAAoB,EACxE49C,EAAAxoD,IAAA,CAAA0oD,EACA,CACA,KAAA79C,SAAA,EACA29C,EAAAxoD,IAAA,gBAA4C,KAAA6K,SAAA,CAAe,GAE3D,KAAAC,SAAA,EACA09C,EAAAxoD,IAAA,gBAA4C,KAAA8K,SAAA,CAAe,GAE3D,KAAAC,SAAA,EACAy9C,EAAAxoD,IAAA,uBAAA+K,SAAA,CAAAwK,GAAA,CAAAzV,GAAA,KAA4EA,EAAE,IAAAwoD,IAAA,QAE9E,IAAAjnD,EAAAmnD,EAAAF,IAAA,OAKA,OAJAt4C,EAAA,CAAAA,EAAA,KAAA3F,SAAA,EAAAi+C,IAAA,SACA,KAAAj+C,SAAA,EACA2F,CAAAA,GAAA,MAEA,CAAAA,EAAA3O,EAAA,CAAAinD,IAAA,MACA,CAOAK,gBAAA,CACA,IAAA/U,EAWA,OAVA,KAAArpC,OAAA,CAEA,KAAA49C,SAAA,EASA,CAOAjgC,SAAAqrB,CAAA,CAAAqV,CAAA,EACA,OAAApE,EAAA,+BAEA,OADA37C,QAAAggD,IAAA,2HACA,KAAAvV,MAAA,EAAiCC,UAAAA,CAAA,EAAW,CAAIqV,SAAAA,EAAAE,mBAAA,KAChDzD,IAAA,GAAyBrjD,KAAAA,CAAA,CAAM,GAAAA,GAC/B+mD,KAAA,GAA0BjgD,MAAAA,CAAA,CAAO,IACjC,MAAAA,CACA,EACA,EACA,CAMAwqC,OAAA0V,CAAA,CAAA3lD,EAAA,CAA4BylD,mBAAA,GAA2B,EACvD,OAAAtE,EAAA,+BACA,WAAAI,QAAA,CAAAC,EAAAC,SACAp/C,EAAAujD,EAAAre,MA0EAse,EAYAC,EArFA,IAAAC,EAAAn+C,GACA,EAAA69C,kBAAA,CACAjE,EAAA55C,GAGA65C,EAAA75C,GAGAo+C,EAAA,GAAAhhD,EAAAihD,gBAAA,EAAAN,EAAAlB,EAAAyB,gBAAA,CACAF,CAAAA,EAAApvD,MAAA,IACAmvD,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,SAA4CugD,EAAAf,IAAA,iDAA0B,EACtE,GAEA,IAAAkB,EAAA,GAAAnhD,EAAAihD,gBAAA,EAAAjmD,EAAAykD,EAAA2B,cAAA,CACAJ,CAAAA,EAAApvD,MAAA,IACAmvD,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,SAA4C0gD,EAAAlB,IAAA,+CAAwB,EACpE,GAEA,IAAwB/U,UAAAA,CAAA,CAAA7pC,OAAAA,CAAA,CAAAS,OAAAA,CAAA,CAAAO,MAAAA,CAAA,CAAAg/C,KAAAA,CAAA,EAAyCV,EAEjEt/C,GAAAA,IAAA,KAAAA,MAAA,EACA0/C,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAC,eAAA,CAAAngD,EAAA,KAAAA,MAAA,CACA,GAGAS,GAAAA,IAAA,KAAAA,MAAA,EACAi/C,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAE,eAAA,CAAA3/C,EAAA,KAAAA,MAAA,CACA,GAGAO,GAAAA,IAAA,KAAAA,KAAA,EACA0+C,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAG,cAAA,CAAAr/C,EAAA,KAAAA,KAAA,CACA,GAGA,IAAAs/C,EAAA,IAAAtjD,KAAAgjD,GAAA,IAAAhjD,MAEA,QAAAkE,cAAA,EACA,IAAAq/C,EAAA,IAAAvjD,KAAA,KAAAkE,cAAA,EACAo/C,EAAAE,OAAA,IAAAD,EAAAC,OAAA,IACAd,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAO,eAAA,IAAmGH,EAAAvB,WAAA,MAAyB,EAAIwB,EAAAxB,WAAA,GAA6B,KAAMuB,EAAAvB,WAAA,OAAyB,EAAKwB,EAAAxB,WAAA,GAA6B,EAC9N,EAEA,CAEA,QAAA59C,SAAA,EACA,IAAAA,EAAA,IAAAnE,KAAA,KAAAmE,SAAA,EACAm/C,EAAAE,OAAA,GAAAr/C,EAAAq/C,OAAA,IACAd,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAQ,qBAAA,IAAyGJ,EAAAvB,WAAA,OAAyB,EAAK59C,EAAA49C,WAAA,GAAwB,KAAMuB,EAAAvB,WAAA,MAAyB,EAAI59C,EAAA49C,WAAA,GAAwB,EAC1N,EAEA,CAEA,IACAS,EAAA,KAAAP,cAAA,EACA,CACA,MAAAloB,EAAA,CACA2oB,EAAA,CACAj+C,QAAA,GACAnJ,KAAA,KACA8G,MAAA23B,CACA,EACA,CAGA,IACA0oB,EAAA,GAAAtB,EAAAwC,aAAA,EAAAnB,EAAA3V,EACA,CACA,MAAA9S,EAAA,CACA53B,QAAAC,KAAA,CAAA23B,EACA,CAEA,GAAA0oB,IAAA,KAAA/+C,OAAA,CACA,OAAAy6C,EAAA,CACA15C,QAAA,GACAnJ,KAAA,MAGA,EACA,IAAAsoD,EAAA,GAAAjiD,EAAAkiD,4BAAA,OAAAhX,EAAAlwC,EAAAulD,QAAA,EACAvD,IAAA,CAAAxf,GACA,EAOA,CACA16B,QAAA,GACAnJ,KAAA,MARA,CACAmJ,QAAA,GACAnJ,KAAA,KACA8G,MAAA,IAAAg/C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAY,iBAAA,CAAArB,EAAA,0BAAsI,KAAA/+C,OAAA,CAAa,EACnJ,GAOA2+C,KAAA,CAAAjgD,GACA,EACAqC,QAAA,GACAnJ,KAAA,KACA8G,MAAAA,CACA,IAEA87C,QAAA6F,GAAA,EACAH,EACA,OAAA1f,CAAAA,EAAA,OAAAqe,CAAAA,EAAA,OAAAvjD,CAAAA,EAAArC,MAAAA,EAAA,OAAAA,EAAAqnD,oBAAA,GAAAhlD,KAAA,IAAAA,EAAA,OAAAA,EAAA6B,IAAA,CAAAlE,EAAA2lD,EAAA3lD,EAAA,KAAAinD,EAAA,GAAArB,KAAA,IAAAA,EAAA,OAAAA,EAAA5D,IAAA,CAAAn+C,GAAAA,EAAA,GAAA0jC,KAAA,IAAAA,EAAA,OAAAA,EAAAme,KAAA,IAAA7hD,GACA,EAAAm+C,IAAA,GAAAsF,EAAAC,EAAA,IACA,GAAAA,EAAA,CACA,GAAAA,EAAAz/C,OAAA,CACA,OAAA05C,EAAA+F,GAGAxB,EAAAwB,EAEA,KACA,CACA,GAAAD,EAAAx/C,OAAA,CACA,OAAA05C,EAAA8F,GAGAvB,EAAAuB,EAEA,CACA,EACA,CACA,EACA,EACA,CAKAzC,gBAAA,GAAApoB,CAAA,EACA,IAAAp6B,EAEA,GAAAo6B,EAAA7lC,MAAA,GACA,UAAA6tD,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAiB,eAAA,yDAGA,SAAA1gD,MAAA,EACA,SAAAA,MAAA,CAAAlQ,MAAA,EACA,UAAA6iB,IAAA,MAAA3S,MAAA,EACA,UAAA29C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAkB,cAAA,IAAiF,KAAA3gD,MAAA,uBAAa,GAG9F,OAAAy9C,EAAAl8C,cAAA,OAAAtB,OAAA,EACA,UAAA09C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAmB,eAAA,IAAAlD,EAAAmD,UAAA,OAAA5gD,OAAA,OAAAA,OAAA,EAGA,IAAAE,EAAA2gD,KAAA,MAAA3gD,GAAA,EACA,UAAAw9C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAsB,WAAA,IAA8E,KAAA5gD,GAAA,oBAAU,GAGxF,cAAAC,OAAA,CACA,UAAAu9C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAuB,uBAAA,UAAA5gD,OAAA,EAGA,IAAAG,EAAA,OAAAhF,CAAAA,EAAA,uCAAAgF,KAAA,GAAAhF,KAAA,IAAAA,EAAA,OAAAA,EAAAytB,KAAA,oBACA,IAAAzoB,GAAA,KAAAA,KAAA,CAAAzQ,MAAA,IAAAyQ,CAAA,WAAAA,KAAA,CACA,UAAAo9C,EAAA6B,SAAA,CAAA7B,EAAA8B,aAAA,CAAAwB,aAAA,gBAA4F1gD,EAAAzQ,MAAA,CAAa,uBAAAyQ,KAAA,EAGzG,QAAAC,QAAA,EACA,IAAAtC,EAAAgjD,kBAAA,OAAA1gD,QAAA,GAKA,KAAAC,cAAA,EACA,IAAAvC,EAAAgjD,kBAAA,OAAAzgD,cAAA,GAKA,KAAAC,SAAA,EACA,IAAAxC,EAAAgjD,kBAAA,OAAAxgD,SAAA,EAXA,YAAAi9C,EAAA8B,aAAA,CAAA0B,mBAAA,CAeA,CACA,CACApwD,EAAAysD,WAAmB,CAAAA,sCCrXnB3sD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8vD,UAAkB,CAAG9vD,EAAAqwD,WAAmB,CAAGrwD,EAAAmvD,aAAqB,QAChE,IAAAmB,EAAiBxsD,EAAQ,OACzBysD,EAAA,KACAC,EAAA,KACAC,EAAA,KACA,IAEAF,EAAAD,EAAAI,MAAA,CAAA3hD,KAAA,CAAAogD,aAAA,CAEAqB,EAAAF,EAAAI,MAAA,CAAA3hD,KAAA,CAAAshD,WAAA,CAEAI,EAAAH,EAAAI,MAAA,CAAA3hD,KAAA,CAAA+gD,UAAA,CAEA,MAAAtlD,EAAA,CACA+lD,EAAAD,EAAAI,MAAA,CAAAvB,aAAA,CACAqB,EAAAF,EAAAI,MAAA,CAAAL,WAAA,CACAI,EAAAH,EAAAI,MAAA,CAAAZ,UAAA,CAEA9vD,EAAAmvD,aAAqB,CAAAoB,EACrBvwD,EAAAqwD,WAAmB,CAAAG,EACnBxwD,EAAA8vD,UAAkB,CAAAW,sCCrBlB,IAAAhgD,EAAA,WAAAA,eAAA,EAAA3Q,CAAAA,OAAAX,MAAA,UAAAuR,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACA,IAAAE,EAAAhR,OAAAiR,wBAAA,CAAAJ,EAAAC,GACA,EAAAE,GAAA,SAAAA,EAAA,CAAAH,EAAA5D,UAAA,CAAA+D,EAAAE,QAAA,EAAAF,EAAAG,YAAA,IACAH,CAAAA,EAAA,CAAeI,WAAA,GAAAC,IAAA,WAAoC,OAAAR,CAAA,CAAAC,EAAA,IAEnD9Q,OAAAC,cAAA,CAAA2Q,EAAAG,EAAAC,EACA,EAAC,SAAAJ,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACD7N,KAAAA,IAAA6N,GAAAA,CAAAA,EAAAD,CAAAA,EACAF,CAAA,CAAAG,EAAA,CAAAF,CAAA,CAAAC,EAAA,CACC,EACDQ,EAAA,WAAAA,YAAA,WAAAT,CAAA,CAAA3Q,CAAA,EACA,QAAAqR,KAAAV,EAAA,YAAAU,GAAAvR,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAArM,EAAAqR,IAAAZ,EAAAzQ,EAAA2Q,EAAAU,EACA,EACAvR,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CmR,EAAatN,EAAQ,OAAU9D,GAC/BoR,EAAatN,EAAQ,KAAS9D,GAC9BoR,EAAatN,EAAQ,OAAS9D,uCCY9B0uD,EA7BA5uD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0uD,aAAqB,CAAG1uD,EAAAyuD,SAAiB,CAAGzuD,EAAAuuD,cAAsB,CAAGvuD,EAAAquD,gBAAwB,QAC7FruD,EAAAquD,gBAAwB,EACxB,YACA,SACA,SACA,QACA,OACA,CACAruD,EAAAuuD,cAAsB,EACtB,WACA,qBACA,uBACA,OAIAE,EACA9vD,YAAAgc,CAAA,CAAAg2C,CAAA,CAAAC,CAAA,EACA,KAAAj2C,IAAA,CAAAA,EACA,KAAAg2C,QAAA,CAAAA,EACA,KAAAC,QAAA,CAAAA,CACA,CACA,CACA5wD,EAAAyuD,SAAiB,CAAAA,EAOjBC,CAFAA,EA2BC1uD,EAAA0uD,aAAA,EAA4C1uD,CAAAA,EAAA0uD,aAAqB,MAzBlE,mCAEAA,EAAA,iCAEAA,EAAA,0EAEAA,EAAA,0EAEAA,EAAA,uEAEAA,EAAA,mCAEAA,EAAA,gDAEAA,EAAA,6EAEAA,EAAA,kDAEAA,EAAA,qEAEAA,EAAA,2CAEAA,EAAA,mDAEAA,EAAA,mFCvDA,IAAApF,EAAA,WAAAA,SAAA,WAAAC,CAAA,CAAAC,CAAA,CAAA9mB,CAAA,CAAA+mB,CAAA,EAEA,UAAA/mB,CAAAA,GAAAA,CAAAA,EAAAgnB,OAAA,YAAAC,CAAA,CAAAC,CAAA,EACA,SAAAC,EAAA5pD,CAAA,EAAoC,IAAM6pD,EAAAL,EAAAM,IAAA,CAAA9pD,GAAA,CAA+B,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACrF,SAAAykB,EAAA/pD,CAAA,EAAmC,IAAM6pD,EAAAL,EAAA,MAAAxpD,GAAA,CAAmC,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACxF,SAAAukB,EAAA/5C,CAAA,MAJA9P,CAIgC8P,CAAAA,EAAAk6C,IAAA,CAAAN,EAAA55C,EAAA9P,KAAA,EAAAiqD,CAJJjqD,CAA5BA,EAIgC8P,EAAA9P,KAAA,YAJJyiC,EAAAziC,EAAA,IAAAyiC,EAAA,SAAAinB,CAAA,EAA+DA,EAAA1pD,EAAA,EAAiB,EAI5EkqD,IAAA,CAAAN,EAAAG,EAAA,CAChCF,EAAA,CAAAL,EAAAA,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,KAAAO,IAAA,GACA,EACA,EACAjqD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAouD,gBAAwB,CAAGpuD,EAAAmwD,kBAA0B,CAAGnwD,EAAA+sD,aAAqB,CAAG/sD,EAAAqvD,4BAAoC,QACpH,IAAAwB,EAAiB/sD,EAAQ,OAEzBwsD,EAAiBxsD,EAAQ,OACzB6oD,EAAuB7oD,EAAQ,OAC/BgtD,EAAA,CACA,6FACA,CAEAC,EAAA,wKAiBA/wD,CAAAA,EAAAqvD,4BAAoC,CATpC,CAAA3W,EAAAL,EAAAqV,IAAApE,EAAA,iCACA,IAAAoE,EACA,SAEA,IAAAsD,EAAA,IAAAV,EAAAW,QAAA,CAAAvY,EAAAxpC,OAAA,CAAA4hD,EAAApD,GACAwD,EAAA,GAAAvE,EAAA0D,WAAA,EAAA3X,EAAA+U,cAAA,IAEA,MAAAzhD,CADA,MAAAglD,EAAAG,gBAAA,CAAAD,EAAA7Y,EAAA,IAfA,YAiBA,GAoBAr4C,EAAA+sD,aAAqB,CAPrB,KACA,IAAAv9C,EAAA,GAAAqhD,EAAAO,sBAAA,MACA,IAAA5hD,GAAAA,EAAAzQ,MAAA,GACA,4CAEA,OAAAyQ,CACA,EAsBAxP,EAAAmwD,kBAA0B,CAd1B,IAEA,IAAAkB,EAAAN,EAAAlnC,IAAA,CAAAynC,GAEA,IAAAA,EACA,SAGA,IAAAC,EAAA,IAAA/lD,KAAA6lD,EAAAG,MAAA,CAAAC,IAAA,EAAAlE,WAAA,GAEAmE,EAAAX,EAAAlnC,IAAA,CAAA0nC,GAEA,OAAAF,EAAAG,MAAA,CAAAC,IAAA,GAAAC,EAAAF,MAAA,CAAAC,IAAA,EAYAzxD,EAAAouD,gBAAwB,CATxB,CAAA7vC,EAAAozC,KACA,IAAAC,EAAA,GAMA,OALA9xD,OAAA6xD,IAAA,CAAApzC,GAAArK,OAAA,CAAA7D,IACAshD,EAAA3yD,QAAA,CAAAqR,IACAuhD,EAAA9sD,IAAA,CAAAuL,EAEA,GACAuhD,CACA,yBCtFA,SAAA1/C,CAAA,EACA,YAEAA,CAAAA,EAAAlS,OAAA,CAAA6xD,MAAA,CAAAC,EACA5/C,EAAAlS,OAAA,CAAA+xD,WAAA,CAAAC,EACA9/C,EAAAlS,OAAA,CAAAiyD,YAAA,CAAAC,EACAhgD,EAAAlS,OAAA,CAAAmyD,UAAA,CAAAC,EAEAlgD,EAAAlS,OAAA,CAAA+vD,KAAA,CAAA+B,EACA5/C,EAAAlS,OAAA,CAAAqyD,SAAA,CAAAL,EACA9/C,EAAAlS,OAAA,CAAAsyD,UAAA,CAAAJ,EACAhgD,EAAAlS,OAAA,CAAAuyD,QAAA,CAAAH,EAKA,IAAAI,EAAA,SAAApjD,CAAA,EAEA,OADAA,EAAA6oB,KAAA,wEAEA,EAEA,SAAA65B,EAAA7xD,CAAA,EACA,MAAAA,GAKA,2DAAuD2hB,IAAA,CAAA3hB,IAGvD,cAAA2hB,IAAA,CAAA3hB,IACA,4BAAA2hB,IAAA,CAAA3hB,KAEA,IAAAwyD,EAAA,GACAjkD,EAAA,GACAkkD,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAjzD,EAAA,GAWA,GAPA4O,EAAAikD,CADAA,EAAAD,EAAAvyD,EAAA,CACA,IACAyyD,EAAAD,CAAA,IACAE,EAAAF,CAAA,IACAG,EAAAH,CAAA,IACAI,EAAAJ,CAAA,IAGAjkD,GAAAA,EAAAzP,MAAA,EAAA4zD,EAAA5zD,MAAA,KAGA,GAAA2zD,GAAAA,EAAA3zD,MAAA,CACA,KAAA4zD,CAAAA,IAAAA,EAAA5zD,MAAA,QAAA6iB,IAAA,CAAA+wC,EAAA,cAGA,WAAA/wC,IAAA,CAAA+wC,GAAA,OAIA,4BAAA/wC,IAAA,CAAApT,EAAAmD,WAAA,IAkBA,OAfA/R,GAAA4O,EAAA,IACAkkD,GAAAA,EAAA3zD,MAAA,EACAa,CAAAA,GAAA,KAAA8yD,CAAA,EAGA9yD,GAAA+yD,EAEAC,GAAAA,EAAA7zD,MAAA,EACAa,CAAAA,GAAA,IAAAgzD,CAAA,EAGAC,GAAAA,EAAA9zD,MAAA,EACAa,CAAAA,GAAA,IAAAizD,CAAA,EAGAjzD,GACA,CAEA,SAAAoyD,EAAA/xD,CAAA,CAAA6yD,CAAA,EACA,GAAAhB,EAAA7xD,IAIA,IAAAwyD,EAAA,GACAjkD,EAAA,GACAkkD,EAAA,GACAC,EAAA,GACAI,EAAA,GACAH,EAAA,GACAC,EAAA,GACAjzD,EAAA,GAUA,GANA4O,EAAAikD,CADAA,EAAAD,EAAAvyD,EAAA,CACA,IACAyyD,EAAAD,CAAA,IACAE,EAAAF,CAAA,IACAG,EAAAH,CAAA,IACAI,EAAAJ,CAAA,IAEAjkD,GAEA,GAAAskD,EACA,IAAAtkD,SAAAA,EAAAmD,WAAA,eAEA,GAAAnD,QAAAA,EAAAmD,WAAA,UAKA,IAAA+gD,EACA,OA0BA,MAtBA,UAAA9wC,IAAA,CAAA8wC,KACAK,EAAAL,EAAAz6B,KAAA,eACAy6B,EAAAA,EAAA9gD,OAAA,cAIAhS,GADA4O,EAAAA,MACAkkD,EAEAK,GACAnzD,CAAAA,GAAAmzD,CAAA,EAGAnzD,GAAA+yD,EAEAC,GAAAA,EAAA7zD,MAAA,EACAa,CAAAA,GAAA,IAAAgzD,CAAA,EAGAC,GAAAA,EAAA9zD,MAAA,EACAa,CAAAA,GAAA,IAAAizD,CAAA,EAGAjzD,GACA,CAEA,SAAAsyD,EAAAjyD,CAAA,EACA,OAAA+xD,EAAA/xD,EAAA,GACA,CAEA,SAAAmyD,EAAAnyD,CAAA,EACA,OAAA+xD,EAAA/xD,IAAAiyD,EAAAjyD,EACA,CAEA,gDCtJA,IAWA+yD,EAAAC,EAAAC,EAXA/G,EAAA,WAAAA,sBAAA,WAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,EACAG,EAAA,WAAAA,sBAAA,WAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,EAEAH,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAmzD,GAAW,QAEX,IAAAC,EAAA,CAAyB,mBAEzBC,EAAA,wGAEAzqB,EAAA,o5BACA0qB,EAAA,o5BAEAlO,EAAA,yrFACAC,EAAA,0rFACAkO,EAAA,yrFACAC,EAAA,yrFAEAC,EAAA,0rFACAC,EAAA,0rFACAC,EAAA,yrFACAC,EAAA,yrFAEAjiB,EAAA,0rFACAC,EAAA,0rFACAiiB,EAAA,yrFACAC,EAAA,yrFACA,SAAAC,EAAAl1D,CAAA,EACA,IAAAkR,EAAA,GACA,QAAA9N,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,GAAA,EACtC8N,EAAAjL,IAAA,GAAA7C,EAAA,KAAApD,CAAA,CAAAoD,EAAA,OAAApD,CAAA,CAAAoD,EAAA,MAAApD,CAAA,CAAAoD,EAAA,IAEA,OAAA8N,CACA,CACA,MAAAojD,EACA,IAAA9iD,KAAA,CAAgB,OAAA87C,EAAA,KAAA6G,EAAA,KAAAljD,KAAA,GAChBnR,YAAA0R,CAAA,MAyBAiK,EArBA,GAHA04C,EAAA1rD,GAAA,cACA2rD,EAAA3rD,GAAA,cACA4rD,EAAA5rD,GAAA,cACA,kBAAA6rD,CAAA,EACA,MAAA7kB,MAAA,uCAEAie,EAAA,KAAAyG,EAAA,IAAAt0D,WAAA2R,GAAA,KACA,IAAAhL,EAAA+tD,CAAA,MAAA/iD,GAAA,CAAAtR,MAAA,EACA,GAAAsG,MAAAA,EACA,iEAGAknD,EAAA,KAAA2G,EAAA,QAEA3G,EAAA,KAAA0G,EAAA,QACA,QAAAhxD,EAAA,EAAwBA,GAAAoD,EAAapD,IACrCkqD,EAAA,KAAA+G,EAAA,KAAApuD,IAAA,YACAqnD,EAAA,KAAA8G,EAAA,KAAAnuD,IAAA,YAEA,IAAAkvD,EAAA,CAAA3uD,EAAA,KACA4uD,EAAA,KAAA5jD,GAAA,CAAAtR,MAAA,GAEAm1D,EAAAH,EAAA,KAAA1jD,GAAA,EAGA,QAAApO,EAAA,EAAwBA,EAAAgyD,EAAQhyD,IAChCqY,EAAArY,GAAA,EACAkqD,EAAA,KAAA+G,EAAA,KAAA54C,EAAA,CAAArY,EAAA,GAAAiyD,CAAA,CAAAjyD,EAAA,CACAkqD,EAAA,KAAA8G,EAAA,KAAA5tD,EAAAiV,EAAA,CAAArY,EAAA,GAAAiyD,CAAA,CAAAjyD,EAAA,CAGA,IAAAkyD,EAAA,EACApvD,EAAAkvD,EAAAG,EACA,KAAArvD,EAAAivD,GAAA,CASA,GARAI,EAAAF,CAAA,CAAAD,EAAA,GACAC,CAAA,sBACAtrB,CAAA,eACAA,CAAA,CAAAwrB,IAAAA,EAAA,IACAxrB,CAAA,YACAyqB,CAAA,CAAAc,EAAA,KACAA,GAAA,EAEAF,GAAAA,EACA,QAAAhyD,EAAA,EAAgCA,EAAAgyD,EAAQhyD,IACxCiyD,CAAA,CAAAjyD,EAAA,EAAAiyD,CAAA,CAAAjyD,EAAA,OAIA,CACA,QAAAA,EAAA,EAAgCA,EAAAgyD,EAAA,EAAchyD,IAC9CiyD,CAAA,CAAAjyD,EAAA,EAAAiyD,CAAA,CAAAjyD,EAAA,GAEAmyD,EAAAF,CAAA,QACAA,CAAA,CAAAD,EAAA,IAAArrB,CAAA,CAAAwrB,IAAAA,EAAA,CACAxrB,CAAA,cACAA,CAAA,gBACAA,CAAA,gBACA,QAAA3mC,EAAA,MAA2CA,EAAAgyD,EAAQhyD,IACnDiyD,CAAA,CAAAjyD,EAAA,EAAAiyD,CAAA,CAAAjyD,EAAA,GAIA,IAAAA,EAAA,EAAAwmC,EAAA5d,EACA,KAAA5oB,EAAAgyD,GAAAlvD,EAAAivD,GACAvrB,EAAA1jC,GAAA,EACA8lB,EAAA9lB,EAAA,EACAonD,EAAA,KAAA+G,EAAA,KAAAzqB,EAAA,CAAA5d,EAAA,CAAAqpC,CAAA,CAAAjyD,EAAA,CACAkqD,EAAA,KAAA8G,EAAA,KAAA5tD,EAAAojC,EAAA,CAAA5d,EAAA,CAAAqpC,CAAA,CAAAjyD,IAAA,CACA8C,GAEA,CAEA,QAAA0jC,EAAA,EAAwBA,EAAApjC,EAAYojC,IACpC,QAAA5d,EAAA,EAA4BA,EAAA,EAAOA,IACnCupC,EAAAjI,EAAA,KAAA8G,EAAA,KAAAxqB,EAAA,CAAA5d,EAAA,CACAshC,EAAA,KAAA8G,EAAA,KAAAxqB,EAAA,CAAA5d,EAAA,CAAA8mB,CAAA,YACAC,CAAA,YACAiiB,CAAA,WACAC,CAAA,CAAAM,IAAAA,EAAA,CAIAC,QAAAC,CAAA,EACA,GAAAA,IAAAA,EAAAv1D,MAAA,CACA,6DAEA,IAAAsG,EAAA8mD,EAAA,KAAA+G,EAAA,KAAAn0D,MAAA,GACAN,EAAA,UAEAsG,EAAAgvD,EAAAO,GACA,QAAAryD,EAAA,EAAwBA,EAAA,EAAOA,IAC/B8C,CAAA,CAAA9C,EAAA,EAAAkqD,EAAA,KAAA+G,EAAA,QAAAjxD,EAAA,CAGA,QAAAwmC,EAAA,EAAwBA,EAAApjC,EAAYojC,IAAA,CACpC,QAAAxmC,EAAA,EAA4BA,EAAA,EAAOA,IACnCxD,CAAA,CAAAwD,EAAA,CAAAmjD,CAAA,GAAAnjD,EAAA,UACAojD,CAAA,IAAApjD,EAAA,eACAsxD,CAAA,IAAAtxD,EAAA,cACAuxD,CAAA,CAAAzuD,IAAAA,CAAA,EAAA9C,EAAA,OACAkqD,EAAA,KAAA+G,EAAA,KAAAzqB,EAAA,CAAAxmC,EAAA,CAEA8C,EAAAtG,EAAAqR,KAAA,EACA,CAEA,IAAAC,EAAA,IAAArR,WAAA,IACA01D,EAAA,EACA,QAAAnyD,EAAA,EAAwBA,EAAA,EAAOA,IAC/BmyD,EAAAjI,EAAA,KAAA+G,EAAA,KAAA7tD,EAAA,CAAApD,EAAA,CACA8N,CAAA,GAAA9N,EAAA,EAAA2mC,CAAA,GAAA3mC,EAAA,UAAAmyD,GAAA,QACArkD,CAAA,GAAA9N,EAAA,IAAA2mC,CAAA,IAAA3mC,EAAA,eAAAmyD,GAAA,QACArkD,CAAA,GAAA9N,EAAA,IAAA2mC,CAAA,IAAA3mC,EAAA,cAAAmyD,GAAA,OACArkD,CAAA,GAAA9N,EAAA,IAAA2mC,CAAA,CAAA7jC,IAAAA,CAAA,EAAA9C,EAAA,OAAAmyD,CAAA,MAEA,OAAArkD,CACA,CACAwkD,QAAAC,CAAA,EACA,GAAAA,IAAAA,EAAAz1D,MAAA,CACA,8DAEA,IAAAsG,EAAA8mD,EAAA,KAAA8G,EAAA,KAAAl0D,MAAA,GACAN,EAAA,UAEAsG,EAAAgvD,EAAAS,GACA,QAAAvyD,EAAA,EAAwBA,EAAA,EAAOA,IAC/B8C,CAAA,CAAA9C,EAAA,EAAAkqD,EAAA,KAAA8G,EAAA,QAAAhxD,EAAA,CAGA,QAAAwmC,EAAA,EAAwBA,EAAApjC,EAAYojC,IAAA,CACpC,QAAAxmC,EAAA,EAA4BA,EAAA,EAAOA,IACnCxD,CAAA,CAAAwD,EAAA,CAAAwxD,CAAA,GAAAxxD,EAAA,UACAyxD,CAAA,IAAAzxD,EAAA,eACA0xD,CAAA,IAAA1xD,EAAA,cACA2xD,CAAA,CAAA7uD,IAAAA,CAAA,EAAA9C,EAAA,OACAkqD,EAAA,KAAA8G,EAAA,KAAAxqB,EAAA,CAAAxmC,EAAA,CAEA8C,EAAAtG,EAAAqR,KAAA,EACA,CAEA,IAAAC,EAAA,IAAArR,WAAA,IACA01D,EAAA,EACA,QAAAnyD,EAAA,EAAwBA,EAAA,EAAOA,IAC/BmyD,EAAAjI,EAAA,KAAA8G,EAAA,KAAA5tD,EAAA,CAAApD,EAAA,CACA8N,CAAA,GAAA9N,EAAA,EAAAqxD,CAAA,GAAArxD,EAAA,UAAAmyD,GAAA,QACArkD,CAAA,GAAA9N,EAAA,IAAAqxD,CAAA,IAAArxD,EAAA,eAAAmyD,GAAA,QACArkD,CAAA,GAAA9N,EAAA,IAAAqxD,CAAA,IAAArxD,EAAA,cAAAmyD,GAAA,OACArkD,CAAA,GAAA9N,EAAA,IAAAqxD,CAAA,CAAAvuD,IAAAA,CAAA,EAAA9C,EAAA,OAAAmyD,CAAA,MAEA,OAAArkD,CACA,CACA,CACA/P,EAAAmzD,GAAW,CAAAA,EACXH,EAAA,IAAAyB,QAAAxB,EAAA,IAAAwB,QAAAvB,EAAA,IAAAuB,4CCvMA30D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA00D,UAAkB,CAAG10D,EAAA20D,QAAgB,CAAG30D,EAAA40D,GAAW,CAAG50D,EAAA60D,GAAW,CAAG70D,EAAA80D,GAAW,CAAG90D,EAAA+0D,GAAW,CAAG/0D,EAAAg1D,GAAW,CAAGh1D,EAAAi1D,eAAuB,CAAGj1D,EAAAmzD,GAAW,QACnJ,IAAA+B,EAAepxD,EAAQ,OACvBhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+jD,EAAA/B,GAAA,IAC7E,IAAAgC,EAAgBrxD,EAAQ,OACxBhE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgkD,EAAAF,eAAA,IACzF,IAAAG,EAAoBtxD,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAikD,EAAAJ,GAAA,IAC7E,IAAAK,EAAoBvxD,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAkkD,EAAAN,GAAA,IAC7E,IAAAO,EAAoBxxD,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAmkD,EAAAR,GAAA,IAC7E,IAAAS,EAAoBzxD,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAokD,EAAAV,GAAA,IAC7E,IAAAW,EAAoB1xD,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqkD,EAAAZ,GAAA,IAC7E,IAAAa,EAAmB3xD,EAAQ,MAC3BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAskD,EAAAd,QAAA,IAClF70D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAskD,EAAAf,UAAA,wCCjBpF,IAWAgB,EAAAC,EAXApJ,EAAA,WAAAA,sBAAA,WAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,EACAksD,EAAA,WAAAA,sBAAA,WAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,EAEAtsD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAg1D,GAAW,QACX,IAAAG,EAAkBrxD,EAAQ,MAC1B,OAAAkxD,UAAAG,EAAAF,eAAA,CACAt2D,YAAA0R,CAAA,CAAAulD,CAAA,EAIA,GAHA,YAAAvlD,EAAA2kD,GACAU,EAAApuD,GAAA,cACAquD,EAAAruD,GAAA,cACAsuD,EAAA,CACA,GAAAA,EAAA72D,MAAA,IACA,sDAEAwtD,EAAA,KAAAmJ,EAAA,IAAAh3D,WAAAk3D,GAAA,IACA,MAEArJ,EAAA,KAAAmJ,EAAA,IAAAh3D,WAAA,SAEA6tD,EAAA,KAAAoJ,EAAA,KAAAC,EAAA,KACA,CACA,IAAAA,IAAA,CAAe,WAAAl3D,WAAAytD,EAAA,KAAAuJ,EAAA,MACfrB,QAAAC,CAAA,EACA,GAAAA,EAAAv1D,MAAA,IACA,yEAEA,IAAAy1D,EAAA,IAAA91D,WAAA41D,EAAAv1D,MAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAAqyD,EAAAv1D,MAAA,CAAsBkD,GAAA,IAC9C,QAAA+C,EAAA,EAA4BA,EAAA,GAAQA,IACpCmnD,EAAA,KAAAwJ,EAAA,KAAA3wD,EAAA,EAAAsvD,CAAA,CAAAryD,EAAA+C,EAAA,CAEAunD,EAAA,KAAAoJ,EAAA,KAAAE,GAAA,CAAAxB,OAAA,CAAAlI,EAAA,KAAAwJ,EAAA,WACAnB,EAAAltD,GAAA,CAAA6kD,EAAA,KAAAwJ,EAAA,KAAA1zD,EACA,CACA,OAAAuyD,CACA,CACAD,QAAAC,CAAA,EACA,GAAAA,EAAAz1D,MAAA,IACA,0EAEA,IAAAu1D,EAAA,IAAA51D,WAAA81D,EAAAz1D,MAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAAuyD,EAAAz1D,MAAA,CAAuBkD,GAAA,IAC/C,IAAA6zD,EAAA,KAAAD,GAAA,CAAAtB,OAAA,CAAAC,EAAAjtD,QAAA,CAAAtF,EAAAA,EAAA,KACA,QAAA+C,EAAA,EAA4BA,EAAA,GAAQA,IACpCsvD,CAAA,CAAAryD,EAAA+C,EAAA,CAAA8wD,CAAA,CAAA9wD,EAAA,CAAAmnD,EAAA,KAAAwJ,EAAA,KAAA3wD,EAAA,CACAmnD,EAAA,KAAAwJ,EAAA,KAAA3wD,EAAA,CAAAwvD,CAAA,CAAAvyD,EAAA+C,EAAA,CAGA,OAAAsvD,CACA,CACA,CACAt0D,EAAAg1D,GAAW,CAAAA,EACXU,EAAA,IAAAjB,QAAAkB,EAAA,IAAAlB,4CC9DA,IAWAsB,EAAAC,EAAAC,EAAAC,EAXA3J,EAAA,WAAAA,sBAAA,WAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,EACAksD,EAAA,WAAAA,sBAAA,WAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,EAEAtsD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+0D,GAAW,QACX,IAAAI,EAAkBrxD,EAAQ,MAC1B,OAAAixD,UAAAI,EAAAF,eAAA,CACAt2D,YAAA0R,CAAA,CAAAulD,CAAA,CAAAO,EAAA,GAMA,GALA,YAAA9lD,EAAA0kD,GACAgB,EAAAv1D,GAAA,OACAw1D,EAAA1uD,GAAA,cACA2uD,EAAA3uD,GAAA,cAEA,CAAAlJ,OAAAg4D,SAAA,CAAAD,IAAAA,EAAA,EACA,uCAKA,GAHAr2D,OAAAu2D,gBAAA,OACAF,YAAA,CAA2BjlD,WAAA,GAAAjR,MAAAk2D,CAAA,CAC3B,GACAP,EAAA,CACA,GAAAA,EAAA72D,MAAA,IACA,sDAEAwtD,EAAA,KAAAyJ,EAAA,IAAAt3D,WAAAk3D,GAAA,IACA,MAEArJ,EAAA,KAAAyJ,EAAA,IAAAt3D,WAAA,SAEA6tD,EAAA,KAAA0J,EAAA,KAAAL,EAAA,KACA,CACA,IAAAA,IAAA,CAAe,WAAAl3D,WAAAytD,EAAA,KAAA6J,EAAA,MACf3B,QAAAC,CAAA,EACA,KAAAA,EAAAv1D,MAAA,MAAAo3D,WAAA,CACA,kFAEA,IAAAA,EAAA,KAAAA,WAAA,GACA3B,EAAA,IAAA91D,WAAA41D,GACA,QAAAryD,EAAA,EAAwBA,EAAAuyD,EAAAz1D,MAAA,CAAuBkD,GAAAk0D,EAAA,CAC/C,IAAAG,EAAA,KAAAT,GAAA,CAAAxB,OAAA,CAAAlI,EAAA,KAAA8J,EAAA,MACA,QAAAjxD,EAAA,EAA4BA,EAAAmxD,EAAiBnxD,IAC7CwvD,CAAA,CAAAvyD,EAAA+C,EAAA,EAAAsxD,CAAA,CAAAtxD,EAAA,CAEAmnD,EAAA,KAAA4J,EAAA,IAAAG,GAAA7pD,IAAA,MAAAmoD,EAAAjtD,QAAA,CAAAtF,GACA,CACA,OAAAuyD,CACA,CACAD,QAAAC,CAAA,EACA,KAAAA,EAAAz1D,MAAA,MAAAo3D,WAAA,CACA,mFAEA,IAAAA,EAAA,KAAAA,WAAA,GACA7B,EAAA,IAAA51D,WAAA81D,GACA,QAAAvyD,EAAA,EAAwBA,EAAAqyD,EAAAv1D,MAAA,CAAsBkD,GAAAk0D,EAAA,CAC9C,IAAAG,EAAA,KAAAT,GAAA,CAAAxB,OAAA,CAAAlI,EAAA,KAAA8J,EAAA,MACA,QAAAjxD,EAAA,EAA4BA,EAAAmxD,EAAiBnxD,IAC7CsvD,CAAA,CAAAryD,EAAA+C,EAAA,EAAAsxD,CAAA,CAAAtxD,EAAA,CAEAmnD,EAAA,KAAA4J,EAAA,IAAAG,GAAA7pD,IAAA,MAAAmoD,EAAAjtD,QAAA,CAAAtF,GACA,CACA,OAAAqyD,CACA,CACA,CACAt0D,EAAA+0D,GAAW,CAAAA,EACXiB,EAAA,IAAAvB,QAAAwB,EAAA,IAAAxB,QAAAsB,EAAA,IAAAQ,QAAAL,EAAA,SAAApvD,CAAA,EACA,IAAAqvD,EAAA,KAAAA,WAAA,GAEAhK,EAAA,KAAA8J,EAAA,KAAA3uD,GAAA,CAAA6kD,EAAA,KAAA8J,EAAA,KAAA1uD,QAAA,CAAA4uD,IACAhK,EAAA,KAAA8J,EAAA,KAAA3uD,GAAA,CAAAR,EAAAS,QAAA,GAAA4uD,GAAA,GAAAA,EACA,sCC7EA,IAWAK,EAAAC,EAAAC,EAXAnK,EAAA,WAAAA,sBAAA,WAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,EACAksD,EAAA,WAAAA,sBAAA,WAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,EAEAtsD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA80D,GAAW,QACX,IAAAK,EAAkBrxD,EAAQ,MAC1B,OAAAgxD,UAAAK,EAAAF,eAAA,CACAt2D,YAAA0R,CAAA,CAAAsmD,CAAA,EACA,YAAAtmD,EAAAykD,GAEA0B,EAAAlvD,GAAA,cACAmvD,EAAAnvD,GAAA,cAEAovD,EAAApvD,GAAA,cACAilD,EAAA,KAAAmK,EAAA,IAAAh4D,WAAA,SACAytD,EAAA,KAAAuK,EAAA,KAAAzwD,IAAA,IACAsmD,EAAA,KAAAiK,EAAArK,EAAA,KAAAuK,EAAA,UACAnK,EAAA,KAAAkK,EAAA,QACA,MAAAE,GACAA,CAAAA,EAAA,GAEA,iBAAAA,EACA,KAAAC,eAAA,CAAAD,GAGA,KAAAE,eAAA,CAAAF,EAEA,CACA,IAAAG,SAAA,CAAoB,WAAAp4D,WAAAytD,EAAA,KAAAuK,EAAA,MACpBE,gBAAA32D,CAAA,EACA,IAAA7B,OAAAg4D,SAAA,CAAAn2D,IAAAA,EAAA,GAAAA,EAAA7B,OAAA24D,gBAAA,CACA,yDAEA,QAAAz8C,EAAA,GAA6BA,GAAA,EAAY,EAAAA,EACzC6xC,EAAA,KAAAuK,EAAA,KAAAp8C,EAAA,CAAAra,EAAA,IACAA,EAAAiH,KAAAuC,KAAA,CAAAxJ,EAAA,IAEA,CACA42D,gBAAA52D,CAAA,EACA,GAAAA,KAAAA,EAAAlB,MAAA,CACA,mEAEAotD,EAAA,KAAAuK,EAAA,KAAApvD,GAAA,CAAArH,EACA,CACA8vB,WAAA,CACA,QAAA9tB,EAAA,GAAyBA,GAAA,EAAQA,IACjC,GAAAkqD,MAAAA,EAAA,KAAAuK,EAAA,KAAAz0D,EAAA,CACAkqD,EAAA,KAAAuK,EAAA,KAAAz0D,EAAA,OAEA,CACAkqD,EAAA,KAAAuK,EAAA,KAAAz0D,EAAA,GACA,KACA,CAEA,CACAoyD,QAAAC,CAAA,EACA,IAAA9pD,EAAAujD,EACA,IAAAiJ,EAAA,IAAAt4D,WAAA41D,GACA,QAAAryD,EAAA,EAAwBA,EAAA+0D,EAAAj4D,MAAA,CAAsBkD,IAC9C,KAAAkqD,EAAA,KAAAsK,EAAA,OACAlK,EAAA,KAAAiK,EAAA,KAAAX,GAAA,CAAAxB,OAAA,CAAAlI,EAAA,KAAAuK,EAAA,WACAnK,EAAA,KAAAkK,EAAA,OACA,KAAA1mC,SAAA,IAEAinC,CAAA,CAAA/0D,EAAA,EAAAkqD,EAAA,KAAAqK,EAAA,KAAAjK,EAAA,KAAAkK,EAAA1I,CAAAA,EAAA5B,EAAA,KAAAsK,EAAA,KAAAjsD,EAAAujD,IAAAA,CAAA,OAAAvjD,EAAA,CAEA,OAAAwsD,CACA,CACAzC,QAAAC,CAAA,EACA,YAAAH,OAAA,CAAAG,EACA,CACA,CACAx0D,EAAA80D,GAAW,CAAAA,EACX0B,EAAA,IAAA/B,QAAAgC,EAAA,IAAAhC,QAAAiC,EAAA,IAAAjC,4CClFA30D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA60D,GAAW,QACX,IAAAM,EAAkBrxD,EAAQ,MAC1B,OAAA+wD,UAAAM,EAAAF,eAAA,CACAt2D,YAAA0R,CAAA,EACA,YAAAA,EAAAwkD,EACA,CACAR,QAAAC,CAAA,EACA,GAAAA,EAAAv1D,MAAA,IACA,yEAEA,IAAAi4D,EAAA,IAAAt4D,WAAA41D,EAAAv1D,MAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAAqyD,EAAAv1D,MAAA,CAAsBkD,GAAA,GAC9C+0D,EAAA1vD,GAAA,MAAAuuD,GAAA,CAAAxB,OAAA,CAAAC,EAAA/sD,QAAA,CAAAtF,EAAAA,EAAA,KAAAA,GAEA,OAAA+0D,CACA,CACAzC,QAAAyC,CAAA,EACA,GAAAA,EAAAj4D,MAAA,IACA,0EAEA,IAAAu1D,EAAA,IAAA51D,WAAAs4D,EAAAj4D,MAAA,EACA,QAAAkD,EAAA,EAAwBA,EAAA+0D,EAAAj4D,MAAA,CAAsBkD,GAAA,GAC9CqyD,EAAAhtD,GAAA,MAAAuuD,GAAA,CAAAtB,OAAA,CAAAyC,EAAAzvD,QAAA,CAAAtF,EAAAA,EAAA,KAAAA,GAEA,OAAAqyD,CACA,CACA,CACAt0D,EAAA60D,GAAW,CAAAA,sCC5BX,IAWAoC,EAAAC,EAAAC,EAXA5K,EAAA,WAAAA,sBAAA,WAAAH,CAAA,CAAA7lD,CAAA,CAAAtG,CAAA,CAAAosD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,EAAA,kDACA,GAAAA,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,2FACA,YAAAC,EAAAtqB,EAAA11B,IAAA,CAAA+/C,EAAAnsD,GAAA8hC,EAAAA,EAAA9hC,KAAA,CAAAA,EAAAsG,EAAAe,GAAA,CAAA8kD,EAAAnsD,GAAAA,CACA,EACAksD,EAAA,WAAAA,sBAAA,WAAAC,CAAA,CAAA7lD,CAAA,CAAA8lD,CAAA,CAAAtqB,CAAA,EACA,GAAAsqB,MAAAA,GAAA,CAAAtqB,EAAA,iEACA,sBAAAx7B,EAAA6lD,IAAA7lD,GAAA,CAAAw7B,EAAA,CAAAx7B,EAAA+lD,GAAA,CAAAF,GAAA,4FACA,MAAAC,MAAAA,EAAAtqB,EAAAsqB,MAAAA,EAAAtqB,EAAA11B,IAAA,CAAA+/C,GAAArqB,EAAAA,EAAA9hC,KAAA,CAAAsG,EAAA4K,GAAA,CAAAi7C,EACA,EAEAtsD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA40D,GAAW,QACX,IAAAO,EAAkBrxD,EAAQ,MAC1B,OAAA8wD,UAAAO,EAAAF,eAAA,CACAt2D,YAAA0R,CAAA,CAAAulD,CAAA,EAKA,GAJA,YAAAvlD,EAAAukD,GACAqC,EAAA3vD,GAAA,cACA4vD,EAAA5vD,GAAA,cACA6vD,EAAA7vD,GAAA,cACAsuD,EAAA,CACA,GAAAA,EAAA72D,MAAA,IACA,sDAEAwtD,EAAA,KAAA0K,EAAA,IAAAv4D,WAAAk3D,GAAA,IACA,MAEArJ,EAAA,KAAA0K,EAAA,IAAAv4D,WAAA,SAEA6tD,EAAA,KAAA2K,EAAA,KAAAtB,EAAA,MACArJ,EAAA,KAAA4K,EAAA,OACA,CACA,IAAAvB,IAAA,CAAe,WAAAl3D,WAAAytD,EAAA,KAAA8K,EAAA,MACf5C,QAAAC,CAAA,EACA,IAAA9pD,EAAAujD,EACA,GAAAuG,EAAAv1D,MAAA,IACA,yEAEA,IAAAy1D,EAAA,IAAA91D,WAAA41D,GACA,QAAAryD,EAAA,EAAwBA,EAAAuyD,EAAAz1D,MAAA,CAAuBkD,IAC/C,KAAAkqD,EAAA,KAAAgL,EAAA,OACA5K,EAAA,KAAA2K,EAAA,KAAArB,GAAA,CAAAxB,OAAA,CAAAlI,EAAA,KAAA+K,EAAA,WACA3K,EAAA,KAAA4K,EAAA,QAEA3C,CAAA,CAAAvyD,EAAA,EAAAkqD,EAAA,KAAA+K,EAAA,KAAA3K,EAAA,KAAA4K,EAAApJ,CAAAA,EAAA5B,EAAA,KAAAgL,EAAA,KAAA3sD,EAAAujD,IAAAA,CAAA,OAAAvjD,EAAA,CAEA,OAAAgqD,CACA,CACAD,QAAAC,CAAA,EACA,GAAAA,EAAAz1D,MAAA,IACA,0EAEA,YAAAs1D,OAAA,CAAAG,EACA,CACA,CACAx0D,EAAA40D,GAAW,CAAAA,EACXqC,EAAA,IAAAxC,QAAAyC,EAAA,IAAAzC,QAAA0C,EAAA,IAAA1C,4CC1DA30D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAi1D,eAAuB,QACvB,IAAAC,EAAiBpxD,EAAQ,MACzB,OAAAmxD,EACAt2D,YAAAC,CAAA,CAAAyR,CAAA,CAAA+mD,CAAA,EACA,GAAAA,GAAA,kBAAAA,CAAA,EACA,eAA+Bx4D,EAAA,gCAAM,GAErCkB,OAAAu2D,gBAAA,OACAR,IAAA,CAAmB3kD,WAAA,GAAAjR,MAAA,IAAAi1D,EAAA/B,GAAA,CAAA9iD,EAAA,EACnBzR,KAAA,CAAoBsS,WAAA,GAAAjR,MAAArB,CAAA,CACpB,EACA,CACA,CACAoB,EAAAi1D,eAAuB,CAAAA,mCCdvBn1D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA00D,UAAkB,CAAG10D,EAAA20D,QAAgB,QAUrC30D,EAAA20D,QAAgB,CAThB,SAAA7tD,CAAA,EACA,IAAAuwD,EAAA,GAAAvwD,EAAA/H,MAAA,IACAgR,EAAA,IAAArR,WAAAoI,EAAA/H,MAAA,CAAAs4D,GACAtnD,EAAAzI,GAAA,CAAAR,GACA,QAAA7E,EAAA6E,EAAA/H,MAAA,CAA8BkD,EAAA8N,EAAAhR,MAAA,CAAmBkD,IACjD8N,CAAA,CAAA9N,EAAA,CAAAo1D,EAEA,OAAAtnD,CACA,EAkBA/P,EAAA00D,UAAkB,CAhBlB,SAAA5tD,CAAA,EACA,GAAAA,EAAA/H,MAAA,IACA,yCAEA,IAAAs4D,EAAAvwD,CAAA,CAAAA,EAAA/H,MAAA,IACA,GAAAs4D,EAAA,GACA,oDAEA,IAAAt4D,EAAA+H,EAAA/H,MAAA,CAAAs4D,EACA,QAAAp1D,EAAA,EAAoBA,EAAAo1D,EAAYp1D,IAChC,GAAA6E,CAAA,CAAA/H,EAAAkD,EAAA,GAAAo1D,EACA,+CAGA,WAAA34D,WAAAoI,EAAAS,QAAA,GAAAxI,GACA,oCC1BAe,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqP,OAAe,QAIfrP,EAAAqP,OAAe,8CCMfvP,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAs3D,QAAgB,QAEhB,IAAAC,EAAmBzzD,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,OACpC2zD,EAAqB3zD,EAAQ,OAC7B4zD,EAAmB5zD,EAAQ,OAC3B6zD,EAAqB7zD,EAAQ,OAC7B8zD,EAAmB9zD,EAAQ,OAC3B+zD,EAAyB/zD,EAAQ,OACjCg0D,EAAkBh0D,EAAQ,OAC1Bi0D,EAAoBj0D,EAAQ,OAC5Bk0D,EAAoBl0D,EAAQ,OAC5Bm0D,EAAmBn0D,EAAQ,OAC3Bo0D,EAAuBp0D,EAAQ,OAC/Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAE3Bu0D,EAAA,IAAAhoB,IACAgoB,EAAA/wD,GAAA,oBACA+wD,EAAA/wD,GAAA,mBACA+wD,EAAA/wD,GAAA,gBACA+wD,EAAA/wD,GAAA,sBACA+wD,EAAA/wD,GAAA,wBACA+wD,EAAA/wD,GAAA,wBACA+wD,EAAA/wD,GAAA,uBACA+wD,EAAA/wD,GAAA,yBACA+wD,EAAA/wD,GAAA,qBACA+wD,EAAA/wD,GAAA,mCACA,IAAAgxD,EAAA,IAAAC,OAAA,mBACAC,EAAA,IAAAD,OAAA,qBACAE,EAAA,KACAC,EAAA,IAmEA,OAAApB,EACA,CAAAqB,CAAA,CAAA9L,CAAA,EACA,GAAAA,EAAAl5C,OAAA,GACA,WAAA+jD,EAAAkB,UAAA,OAAAD,CAAA,CAAA9L,EAAAgM,aAAA,EAAAhM,EAAAiM,WAAA,CAAAjM,EAAAjuD,IAAA,EAEA,GAAAiuD,EAAAkM,OAAA,GACA,WAAAd,EAAAe,UAAA,CAAAnM,EAAAoM,UAAA,CAAA5+C,GAAA,UAAAs+C,CAAA,CAAA9tC,IAAAgiC,EAAAjuD,IAAA,EAEA,OAAAiuD,EAAAqM,QAAA,EACA,cACA,WAAAzB,EAAA0B,YAAA,CAAAtM,EAAAjuD,IAAA,CACA,YACA,WAAA+4D,EAAAyB,YAAA,CAAAvM,EAAAjuD,IAAA,CACA,cACA,WAAAo5D,EAAAqB,WAAA,CAAAxM,EAAAjuD,IAAA,CACA,aACA,WAAAg5D,EAAA0B,UAAA,CAAAzM,EAAAjuD,IAAA,CACA,QACA,WAAAk5D,EAAAyB,SAAA,CAAA1M,EAAAjuD,IAAA,CACA,CAEA,IAAAq5B,EAAA40B,EAAAlyC,IAAA,CAAAsd,KAAA,CAAAugC,GACA,GAAAvgC,EAAA,CACA,IAAApI,EAAAhe,SAAAomB,CAAA,YAEA,MADA,GAAAs/B,EAAAiC,cAAA,EAAA3pC,IAAAA,GAAAA,GAAA,uBAAAoI,CAAA,0BAAA40B,GACA,IAAAkL,EAAA0B,WAAA,CAAA5pC,EAAA,EAAAoI,QAAAA,CAAA,IAAA40B,EAAAjuD,IAAA,CACA,CAGA,GADAq5B,EAAA40B,EAAAlyC,IAAA,CAAAsd,KAAA,CAAAqgC,GACA,CACA,IAAAzoC,EAAAhe,SAAAomB,CAAA,KAEA,MADA,GAAAs/B,EAAAiC,cAAA,EAAA3pC,IAAAA,GAAAA,GAAA,kCAAAg9B,GACA,IAAAgL,EAAA6B,eAAA,CAAA7pC,EAAAg9B,EAAAjuD,IAAA,CACA,CACA,GAAA24D,EAAAiC,cAAA,2BAAA3M,EAAAlyC,IAAA,CACA,CAOAg/C,gBAAAC,CAAA,EACA,IAAAC,EAAAD,EAAAv/C,GAAA,UAAAs+C,CAAA,CAAAT,EAAA4B,SAAA,CAAAhwD,IAAA,CAAA6Q,KAEA,OAAAo/C,IADA9B,EAAAe,UAAA,CAAAa,EAAA,KACAG,YAAA,EACA,CAMAnuD,OAAA+tD,CAAA,CAAAK,CAAA,EACA,GAAA1C,EAAA2C,mBAAA,EAAAD,EAAAl7D,MAAA,CAAA66D,EAAA76D,MAAA,iCACA,IAAA86D,EAAAD,EAAAv/C,GAAA,UAAAs+C,CAAA,CAAAT,EAAA4B,SAAA,CAAAhwD,IAAA,CAAA6Q,KACAo/C,EAAA,IAAA9B,EAAAe,UAAA,CAAAa,EAAA,KACAM,EAAA,IAAA3C,EAAA4C,MAAA,CAEA,OADAL,EAAAluD,MAAA,CAAAsuD,EAAAF,GACAE,EAAArzD,IAAA,CASAwO,OAAAskD,CAAA,CAAA9yD,CAAA,CAAAuzD,CAAA,EACA,IAAAR,EAAAD,EAAAv/C,GAAA,UAAAs+C,CAAA,CAAAT,EAAA4B,SAAA,CAAAhwD,IAAA,CAAA6Q,KAEA,OAAAo/C,IADA9B,EAAAe,UAAA,CAAAa,EAAA,KACAvkD,MAAA,KAAAkiD,EAAA8C,MAAA,CAAAxzD,EAAAuzD,EAAA3B,GACA,CACA,OAAA6B,wBAAAt6D,CAAA,EACA,GAAAs3D,EAAAiC,cAAA,mBAAAv5D,GAAA7B,OAAAg4D,SAAA,CAAAn2D,GAAA,6CAAAA,GACAy4D,EAAAz4D,CACA,CAMA,OAAAu6D,iBAAA,CAIA,OAHA,MAAA/B,GACAA,CAAAA,EAAA,IAAAnB,CAAA,EAEAmB,CACA,CAMA,OAAAgC,wBAAAC,CAAA,CAAAC,CAAA,CAAA7zD,CAAA,EACA,OAAA2zD,SA/JAC,CAAA,CAAAC,CAAA,CAAA7zD,CAAA,CAAA8zD,CAAA,EACA,IAAAliB,EAAA,sBACAmiB,EAAA,KAEAC,EAAA,KACA,GAAAh0D,EAAA,CACA4xC,EAAA,qBACA,IAAA75C,EAAA,GAAAu5D,EAAA2C,QAAA,EAAAj0D,GAEA,GADAA,EAAA,GAAAsxD,EAAA4C,OAAA,EAAAl0D,GACAjI,IAAAA,EAAAE,MAAA,CACA25C,GAAA,oDACAmiB,EAAA,sBAEA,GAAAh8D,EAAAE,MAAA,OACA25C,GAAA,uDAEA,qBAAA0f,EAAA4C,OAAA,EAAAn8D,EAAAiR,KAAA,OAEA,IACA+qD,EAAAD,EAAAtlD,MAAA,YAAAzW,EAAAiR,KAAA,QACAgrD,EAAA,CACAziB,UAAA,gBACAz5C,KAAA,QACAgmC,KAAA,CAAAi2B,EAAA,EAEAniB,GAAA,KAAgCxoC,KAAAC,SAAA,CAAA0qD,GAAuB,EAEvD,MAAAjtD,EAAA,CACA8qC,GAAA,iDACA,MAEA,qBAAA0f,EAAA4C,OAAA,EAAAn8D,EAAAiR,KAAA,OAEA,IACA,IAAAsmB,EAAAh4B,OAAAw8D,EAAAtlD,MAAA,aAAAzW,EAAAiR,KAAA,SACAgrD,EAAA,CACAziB,UAAA,iBACAz5C,KAAA,QACAgmC,KAAA,CAAAxO,EAAA,EAEAykC,EAAA,gBAAyCxC,EAAAlnD,GAAA,CAAAilB,IAAA,UAAoC,GAAGA,EAAK,GACrFsiB,GAAA,KAAgCmiB,EAAO,EAEvC,MAAAjtD,EAAA,CACA8qC,GAAA,gCACA,MAGAA,GAAA,yBAEA,CACA,IAAAuiB,EAAA,CACAnzD,GAAA6yD,EAAA7yD,EAAA,IAAAqwD,EAAArI,UAAA,EAAA6K,EAAA7yD,EAAA,OACAhB,KAAA6zD,EAAA7zD,IAAA,MACA,EAIA,OAHA6zD,EAAA7wD,IAAA,EACAmxD,CAAAA,EAAAnxD,IAAA,IAAAquD,EAAArI,UAAA,EAAA6K,EAAA7wD,IAAA,GAEA,GAAAsuD,EAAA8C,SAAA,EAAAxiB,EAAA,kBACAgiB,OAAAA,EAAA5zD,KAAAA,EAAA+zD,OAAAA,EAAAI,YAAAA,EAAAE,WAxDA,KAwDAL,OAAAA,CACA,EACA,EAkGAJ,EAAAC,EAAA7zD,EAAAwwD,EAAAkD,eAAA,GACA,CACA,CACAx6D,EAAAs3D,QAAgB,CAAAA,sCC1MhBx3D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAo7D,mBAA2B,CAAGp7D,EAAAq7D,mBAA2B,QACzD,IAAA9D,EAAmBzzD,EAAQ,MAc3B9D,CAAAA,EAAAq7D,mBAA2B,CAV3B,SAAAxmD,CAAA,EAEA,IAAAhW,EAAA,GAAA04D,EAAA+D,WAAA,EAAAzmD,GAEA,GAAAhW,EAAAE,MAAA,IACA,yDAGA,SAAAw4D,EAAAgE,YAAA,EAAA18D,EAAA,GACA,EAsBAmB,EAAAo7D,mBAA2B,CAjB3B,SAAAI,CAAA,EACA,IAAA10D,EAAA,GAAAywD,EAAAwD,QAAA,EAAAS,EAAA,SAEA,GAAA10D,KAAAA,EAAA/H,MAAA,CACA,mDAEA,GAAA+H,IAAAA,CAAA,KACA,2DAGA,IAAA/H,EAAA,GACA,KAAA+H,IAAAA,CAAA,CAAA/H,EAAA,IACAA,IAGA,SAAAw4D,EAAAkE,YAAA,EAAA30D,EAAAgJ,KAAA,GAAA/Q,GACA,sCCzCAe,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAs6D,MAAc,CAAGt6D,EAAAo6D,MAAc,CAAGp6D,EAAA07D,KAAa,CAAG17D,EAAA27D,iBAAyB,CAAG37D,EAAA47D,MAAc,CAAG57D,EAAA67D,QAAgB,QAC/G,IAAAtE,EAAmBzzD,EAAQ,MAI3B9D,CAAAA,EAAA67D,QAAgB,IAChB,IAAAC,EAAA,IAAAp9D,WAAAsB,EAAA67D,QAAA,EAGAE,EAAA,SACAC,EAAA,GACAC,EAAA,IAAAxH,QACA,SAAAyH,EAAAnsD,CAAA,EACA,OAAAksD,EAAA9qD,GAAA,CAAApB,EACA,CAIA,SAAAosD,EAAAv9D,CAAA,CAAAgP,CAAA,EACA,IAAAwuD,EAAA,gEAAwFx9D,EAAK,EAE7F,OADAw9D,EAAAxuD,KAAA,CAAAA,EACAwuD,CACA,CA4BA,MAAAR,UAAA/xD,MAIA,CAAAiY,CAAA,aAIA,GAAA8iB,CAAA,MA3CA9iB,EAAAA,EAkDA,IAAAu6C,EAAAz3B,CAAA,IACA3U,EAAA2U,CAAA,IACA9iB,EAAA,CAAA8iB,CAAA,SAAA90B,KAAA,GACAwsD,EAAA,GACAD,IAAAL,IACA/rC,EAAA2U,EACA9iB,EAAA,GACAw6C,EAAA,IAIA,MAAArsC,EAAAlxB,MAAA,EACAkxB,EAAA/b,OAAA,EAAAic,EAAA7V,KAAyC,KAAAA,EAAA,CAAA6V,CAAA,GAEzC,IAAAosC,EAAAz6C,EAAAmkB,MAAA,EAAAu2B,EAAA59D,KACA,iBAAAA,GACA49D,EAAAl1D,GAAA,CAAA1I,EAAA,CAAA49D,EAAArrD,GAAA,CAAAvS,IAAA,MAEA49D,GACS,IAAAnsB,KAcT,GAnFAvuB,EAuEAhiB,OAAA4gC,MAAA,CAAAzQ,EAAA5V,GAAA,EAAA8V,EAAA7V,KACA,IAAA1b,EAAAkjB,CAAA,CAAAxH,EAAA,QACA,MAAA1b,GAAA29D,IAAAA,EAAAprD,GAAA,CAAAvS,GACAA,EAEA,IACA,IA5EAq9D,EAAA30D,GAAA,CAsEA,KAtEAwa,GA8EA,MAAAA,CAAA,IACA,YAAAA,CAAA,EACA,MAAAA,CAAA,CAEA,CAAAw6C,EACA,OAGAx8D,OAAA4gC,MAAA,OAEA,IAAA+7B,EAAA,IAAAC,MAAA,MACAvrD,IAAA,CAAAy3C,EAAA+T,EAAAvQ,KACA,oBAAAuQ,EAAA,CAEA,GAAAA,EAAA1kC,KAAA,cACA,IAAA3d,EAAA,GAAAi9C,EAAAqF,SAAA,EAAAD,EAAA,UACA,GAAAriD,EAAA,GAAAA,GAAA,KAAAvb,MAAA,CACA,wCAEA,IAAAoxB,EAAAy4B,CAAA,CAAAtuC,EAAA,CAIA,OAHA6V,aAAAme,OACA6tB,EAAA,SAAgD7hD,EAAM,EAAA6V,GAEtDA,CACA,CAEA,GAAA4rC,EAAA7tC,OAAA,CAAAyuC,IAAA,EACA,OAAA9T,QAAA13C,GAAA,CAAAy3C,EAAA+T,EAAAvQ,GAEA,IAAAnsD,EAAA2oD,CAAA,CAAA+T,EAAA,CACA,GAAA18D,aAAA48D,SAGA,mBAAAj4B,CAAA,EACA,OAAA3kC,EAAAqoD,KAAA,QAAA8D,EAAAxD,EAAA,KAAAhkB,EACA,EAEA,IAAA+3B,CAAAA,KAAA/T,CAAA,EAEA,OAAAA,EAAAkU,QAAA,CAAAxU,KAAA,QAAA8D,EAAAxD,EAAA,MAAA+T,EAAA,CAEA,CACA,OAAA9T,QAAA13C,GAAA,CAAAy3C,EAAA+T,EAAAvQ,EACA,CACA,GAEA,OA7HAtqC,EA4HAo6C,EAAA,MA3HAD,EAAA30D,GAAA,CA2HAm1D,EA3HA36C,GA4HA26C,CACA,CAQAM,QAAAC,CAAA,EACA,IAAAjtD,EAAA,GAUA,OATA,KAAAmE,OAAA,EAAAic,EAAA7V,KACA6V,aAAAme,OACA6tB,EAAA,SAAoC7hD,EAAM,EAAA6V,GAE1C6sC,GAAA7sC,aAAAyrC,GACAzrC,CAAAA,EAAAA,EAAA4sC,OAAA,CAAAC,EAAA,EAEAjtD,EAAAjL,IAAA,CAAAqrB,EACA,GACApgB,CACA,CASA9B,SAAA+uD,CAAA,EACA,IAAAl7C,EAAAo6C,EAAA,MACA,OAAAp6C,EAAAmkB,MAAA,EAAAu2B,EAAA59D,EAAA0b,KACA,GAAAi9C,EAAA0F,MAAA,EAAAr+D,MAAAA,EAAA,kBAAmE0b,EAAA,QAAO,2BAC1E4iD,UAAA,YACA,GACAjvD,SAzJAA,EAAA6T,CAAA,CAAAmO,CAAA,CAAA+sC,CAAA,SACA,EAAA9uC,OAAA,UACA+B,EAAA5V,GAAA,EAAA8V,EAAA7V,IACA,aAAAshD,EACA3tD,EAAAiuD,EAAA/rC,GAAAA,EAAA6sC,GAEA7sC,GAGArO,EAAAmkB,MAAA,EAAAu2B,EAAA59D,EAAA0b,KACA,IAAA6V,EAAAF,EAAA6sC,QAAA,CAAAl+D,GAOA,OANAA,KAAA49D,IACAQ,GAAA7sC,aAAAyrC,GACAzrC,CAAAA,EAAAliB,EAAAiuD,EAAA/rC,GAAAA,EAAA6sC,EAAA,EAEAR,CAAA,CAAA59D,EAAA,CAAAuxB,GAEAqsC,CACA,EAAK,GACL,EAsIA16C,EAAA,KAAAk7C,IACS,GACT,CAIAltD,MAAAqjB,CAAA,CAAAjgB,CAAA,EACA,MAAAigB,GACAA,CAAAA,EAAA,GAEAA,EAAA,GAEAA,CADAA,GAAA,KAAAp0B,MAAA,EACA,GACAo0B,CAAAA,EAAA,GAGA,MAAAjgB,GACAA,CAAAA,EAAA,KAAAnU,MAAA,EAEAmU,EAAA,GAEAA,CADAA,GAAA,KAAAnU,MAAA,EACA,GACAmU,CAAAA,EAAA,GAGAA,EAAA,KAAAnU,MAAA,EACAmU,CAAAA,EAAA,KAAAnU,MAAA,EAEA,IAAAo+D,EAAAjB,EAAA,MACAnsD,EAAA,GAAA+R,EAAA,GACA,QAAA7f,EAAAkxB,EAA4BlxB,EAAAiR,EAASjR,IACrC8N,EAAAjL,IAAA,MAAA7C,EAAA,EACA6f,EAAAhd,IAAA,CAAAq4D,CAAA,CAAAl7D,EAAA,EAEA,WAAA25D,EAAAI,EAAAjsD,EAAA+R,EACA,CAIA2Y,OAAA/L,CAAA,CAAA66B,CAAA,EACA,IAAA4T,EAAAjB,EAAA,MACAnsD,EAAA,GAAA+R,EAAA,GACA,QAAA7f,EAAA,EAAwBA,EAAA,KAAAlD,MAAA,CAAiBkD,IAAA,CACzC,IAAAkuB,EAAA,KAAAluB,EAAA,CACAkuB,aAAAme,OACA6tB,EAAA,SAAoCl6D,EAAE,EAAAkuB,GAEtCzB,EAAAriB,IAAA,CAAAk9C,EAAAp5B,EAAAluB,EAAA,QACA8N,EAAAjL,IAAA,CAAAqrB,GACArO,EAAAhd,IAAA,CAAAq4D,CAAA,CAAAl7D,EAAA,EAEA,CACA,WAAA25D,EAAAI,EAAAjsD,EAAA+R,EACA,CAIAzH,IAAAqU,CAAA,CAAA66B,CAAA,EACA,IAAAx5C,EAAA,GACA,QAAA9N,EAAA,EAAwBA,EAAA,KAAAlD,MAAA,CAAiBkD,IAAA,CACzC,IAAAkuB,EAAA,KAAAluB,EAAA,CACAkuB,aAAAme,OACA6tB,EAAA,SAAoCl6D,EAAE,EAAAkuB,GAEtCpgB,EAAAjL,IAAA,CAAA4pB,EAAAriB,IAAA,CAAAk9C,EAAAp5B,EAAAluB,EAAA,MACA,CACA,OAAA8N,CACA,CASA+sD,SAAAl+D,CAAA,EACA,IAAA0b,EAAA4hD,EAAA,MAAAhuC,OAAA,CAAAtvB,GACA,GAAA0b,KAAAA,EACA,OAEA,IAAAra,EAAA,KAAAqa,EAAA,CAIA,OAHAra,aAAAquC,OACA6tB,EAAA,YAAmCjsD,KAAAC,SAAA,CAAAvR,GAAqB,EAAAqB,EAAA2N,KAAA,EAExD3N,CACA,CAKA,OAAAm9D,UAAAntC,CAAA,CAAA0hC,CAAA,EACA,WAAAiK,EAAAI,EAAA/rC,EAAA0hC,EACA,CACA,CAqCA,SAAAmL,EAAA78D,CAAA,EACA,IAAApB,EAAA,GAAA04D,EAAA8F,SAAA,EAAAp9D,GAKA,MAJA,GAAAs3D,EAAA0F,MAAA,EAAAp+D,EAAAE,MAAA,EAAAiB,EAAA67D,QAAA,yCAAwGvyD,OAAAzK,EAAAE,OAAAiB,EAAA67D,QAAA,CAAAzgC,OAAAv8B,EAAAE,MAAA,GACxGF,EAAAE,MAAA,GAAAiB,EAAA67D,QAAA,EACAh9D,CAAAA,EAAA,GAAA04D,EAAA+F,YAAA,KAAA/F,EAAAvM,MAAA,GAAA8Q,EAAAhsD,KAAA,CAAAjR,EAAAE,MAAA,CAAAiB,EAAA67D,QAAA,EAAAh9D,EAAA,IAEAA,CACA,CA3CAmB,EAAA47D,MAAc,CAAAA,EAmCd57D,EAAA27D,iBAAyB,CArBzB,SAAA5rD,CAAA,EAEA,IAAArC,EAAA,GACA6vD,EAAA,SAAA5K,CAAA,CAAArlB,CAAA,EACA,GAAAzjC,MAAA8J,OAAA,CAAA25B,GAGA,QAAAj9B,KAAAi9B,EAAA,CACA,IAAAkwB,EAAA7K,EAAA7iD,KAAA,GACA0tD,EAAA14D,IAAA,CAAAuL,GACA,IACAktD,EAAAC,EAAAlwB,CAAA,CAAAj9B,EAAA,CACA,CACA,MAAAzC,EAAA,CACAF,EAAA5I,IAAA,EAA8B6tD,KAAA6K,EAAA5vD,MAAAA,CAAA,EAC9B,CACA,CACA,EAEA,OADA2vD,EAAA,GAAAxtD,GACArC,CACA,CAaA,OAAAguD,EAGA98D,IAAA,CAGA+b,IAAA,CAGA8iD,SAAA,CAIAC,OAAA,aACA9+D,CAAA,CAAA+b,CAAA,CAAA8iD,CAAA,CAAAC,CAAA,EACA,GAAAnG,EAAAlB,gBAAA,QAAiDz3D,KAAAA,EAAA+b,KAAAA,EAAA8iD,UAAAA,EAAAC,QAAAA,CAAA,EAAgC,CACjF9+D,KAAA,SAAA+b,KAAA,SAAA8iD,UAAA,SAAAC,QAAA,SACA,EACA,CACAC,YAAAjlB,CAAA,CAAAz4C,CAAA,EACA,GAAAs3D,EAAAiC,cAAA,KAAA9gB,EAAA,KAAA+kB,SAAA,CAAAx9D,EACA,CACA,CACAD,EAAA07D,KAAa,CAAAA,CAIb,OAAAtB,EAEA,CAAAtzD,CAAA,EACA82D,CAAA,cACA,CACA,MAAA92D,CAAA,IACA,MAAA82D,CAAA,EACA,CACA,IAAA92D,MAAA,CACA,SAAAywD,EAAAvM,MAAA,QAAAlkD,CAAA,CACA,CACA,IAAA/H,QAAA,CAAmB,aAAA6+D,CAAA,CACnB,CAAAC,CAAA,CAAA/2D,CAAA,EAGA,OAFA,MAAAA,CAAA,CAAAhC,IAAA,CAAAgC,GACA,MAAA82D,CAAA,EAAA92D,EAAA/H,MAAA,CACA+H,EAAA/H,MAAA,CAEA++D,aAAA3D,CAAA,EACA,aAAA0D,CAAA,IAAAtG,EAAA+F,YAAA,EAAAnD,EAAArzD,IAAA,EACA,CAEAi3D,WAAA99D,CAAA,EACA,IAAApB,EAAA,GAAA04D,EAAA+F,YAAA,EAAAr9D,GACA+9D,EAAAn/D,EAAAE,MAAA,CAAAiB,EAAA67D,QAAA,CAIA,OAHAmC,GACAn/D,CAAAA,EAAA,GAAA04D,EAAA+F,YAAA,KAAA/F,EAAAvM,MAAA,GAAAnsD,EAAAi9D,EAAAhsD,KAAA,CAAAkuD,GAAA,IAEA,MAAAH,CAAA,CAAAh/D,EACA,CAEAo/D,WAAAh+D,CAAA,EACA,aAAA49D,CAAA,CAAAf,EAAA78D,GACA,CAGAi+D,qBAAA,CACA,IAAA9iC,EAAA,MAAAt0B,CAAA,CAAA/H,MAAA,CAGA,OAFA,MAAA+H,CAAA,CAAAhC,IAAA,CAAAg3D,GACA,MAAA8B,CAAA,EAAA59D,EAAA67D,QAAA,CACA,IACA,MAAA/0D,CAAA,CAAAs0B,EAAA,CAAA0hC,EAAA78D,EACA,CACA,CACA,CACAD,EAAAo6D,MAAc,CAAAA,CAId,OAAAE,EAKA6D,UAAA,EACAr3D,CAAA,EACAs0B,CAAA,EACAgjC,CAAA,EACAtiC,CAAA,EACAuiC,CAAA,aACAv3D,CAAA,CAAAq3D,CAAA,CAAAE,CAAA,EACA,GAAA9G,EAAAlB,gBAAA,QAAiD8H,WAAA,EAAAA,CAAA,GACjD,MAAAr3D,CAAA,IAAAywD,EAAA+F,YAAA,EAAAx2D,GACA,MAAAs3D,CAAA,GACA,MAAAtiC,CAAA,MACA,MAAAuiC,CAAA,OAAAA,EAAAA,EAAA,KACA,MAAAjjC,CAAA,EACA,CACA,IAAAt0B,MAAA,CAAiB,SAAAywD,EAAAyD,OAAA,QAAAl0D,CAAA,EACjB,IAAA82D,YAAA,CAAuB,aAAA92D,CAAA,CAAA/H,MAAA,CACvB,IAAAu/D,UAAA,CAAqB,aAAAljC,CAAA,CACrB,IAAAv8B,OAAA,CAAkB,WAAAH,WAAA,MAAAoI,CAAA,EAClB,CAAAy3D,CAAA,CAAA5+C,CAAA,EACA,SAAAmc,CAAA,CACA,aAAAA,CAAA,EAAAyiC,CAAA,CAAA5+C,EAEA,OAAAy+C,CAAA,EAAAz+C,EAEA,GAAA43C,EAAA0F,MAAA,QAAAoB,CAAA,UAAAD,CAAA,QAAAC,CAAA,MAAAT,UAAA,mDAAoK,MAAAS,CAAA,6DAAoB,oBACxL/0D,OAAA,GAAAiuD,EAAA+F,YAAA,QAAAx2D,CAAA,EAAAs0B,OAAA,MAAAA,CAAA,CACAr8B,OAAA4gB,EAAA6+C,KAAA,CACAJ,UAAA,MAAAA,CAAA,CACAR,WAAA,KAAAA,UAAA,CAEA,EACA,CACA,CAAAa,CAAA,CAAArjC,CAAA,CAAAr8B,CAAA,CAAAs7D,CAAA,EACA,IAAAqE,EAAAx3D,KAAA4oB,IAAA,CAAA/wB,EAAAiB,EAAA67D,QAAA,EAAA77D,EAAA67D,QAAA,CAaA,OAZA,MAAAzgC,CAAA,CAAAsjC,EAAA,MAAA53D,CAAA,CAAA/H,MAAA,GACA,KAAAo/D,UAAA,EAAA9D,GAAA,MAAAj/B,CAAA,CAAAr8B,GAAA,MAAA+H,CAAA,CAAA/H,MAAA,CACA2/D,EAAA3/D,EAGA,GAAAw4D,EAAA0F,MAAA,4CACA3zD,OAAA,GAAAiuD,EAAA+F,YAAA,QAAAx2D,CAAA,EACA/H,OAAA,MAAA+H,CAAA,CAAA/H,MAAA,CACAq8B,OAAA,MAAAA,CAAA,CAAAsjC,CACA,IAGA,MAAA53D,CAAA,CAAAgJ,KAAA,OAAAsrB,CAAA,OAAAA,CAAA,CAAAsjC,EACA,CAEAC,UAAAvjC,CAAA,EACA,IAAAwjC,EAAA,IAAAtE,EAAA,MAAAxzD,CAAA,CAAAgJ,KAAA,OAAAsrB,CAAA,CAAAA,GAAA,KAAA+iC,UAAA,OAAAE,CAAA,EAEA,OADAO,EAAA,CAAA9iC,CAAA,MACA8iC,CACA,CAEAC,UAAA9/D,CAAA,CAAAs7D,CAAA,EACA,IAAAx7D,EAAA,MAAA4/D,CAAA,GAAA1/D,EAAA,EAAAs7D,GAIA,OAHA,MAAAkE,CAAA,CAAAx/D,GACA,MAAAq8B,CAAA,EAAAv8B,EAAAE,MAAA,CAEAF,EAAAiR,KAAA,GAAA/Q,EACA,CAEA+/D,WAAA,CACA,SAAAvH,EAAAwH,QAAA,OAAAF,SAAA,CAAA7+D,EAAA67D,QAAA,EACA,CACAmD,WAAA,CACA,SAAAzH,EAAA0H,QAAA,OAAAJ,SAAA,CAAA7+D,EAAA67D,QAAA,EACA,CACA,CACA77D,EAAAs6D,MAAc,CAAAA,sCCrddx6D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAm5D,YAAoB,QACpB,IAAA5B,EAAmBzzD,EAAQ,OAC3Bo7D,EAAmBp7D,EAAQ,OAC3Bq7D,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,MAIpC,OAAAq1D,UAAA3B,EAAAkE,KAAA,CACA/8D,YAAA8+D,CAAA,EACA,0BAAAA,EAAA,GACA,CACAzD,cAAA,CACA,kDACA,CACAnuD,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAn/D,EAAAk/D,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,UACA,IACAn/D,EAAA,GAAAs3D,EAAAzH,UAAA,EAAA7vD,EACA,CACA,MAAA2N,EAAA,CACA,YAAA+vD,WAAA,CAAA/vD,EAAA8qC,OAAA,CAAA0mB,EACA,CACA,OAAAjF,EAAA8D,UAAA,CAAAh+D,EACA,CACAqV,OAAAspD,CAAA,EACA,SAAArH,EAAAzH,UAAA,KAAAoP,EAAAK,OAAA,EAAAX,EAAAE,SAAA,OACA,CACA,CACA9+D,EAAAm5D,YAAoB,CAAAA,sCC9BpBr5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAw/D,cAAsB,QACtB,IAAAhI,EAA4B1zD,EAAQ,MAMpC,OAAA07D,UAAAhI,EAAAkE,KAAA,CACA3B,KAAA,aACAA,CAAA,EACA,MAAAA,EAAAn7D,IAAA,CAAAm7D,EAAAp/C,IAAA,KAAAo/C,EAAA2D,OAAA,EACA,KAAA3D,KAAA,CAAAA,CACA,CACAC,cAAA,CACA,YAAAD,KAAA,CAAAC,YAAA,EACA,CACAnuD,OAAAsuD,CAAA,CAAAl6D,CAAA,EACA,YAAA85D,KAAA,CAAAluD,MAAA,CAAAsuD,EAAAl6D,EACA,CACAqV,OAAAspD,CAAA,EACA,YAAA7E,KAAA,CAAAzkD,MAAA,CAAAspD,EACA,CACA,CACA5+D,EAAAw/D,cAAsB,CAAAA,sCCxBtB1/D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA44D,UAAkB,CAAG54D,EAAAy/D,MAAc,CAAGz/D,EAAAqrD,IAAY,QAClD,IAAAkM,EAAmBzzD,EAAQ,OAC3Bq7D,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,OACpC47D,EAAuB57D,EAAQ,OAI/B,SAAAunD,EAAA8O,CAAA,CAAAN,CAAA,CAAAI,CAAA,EACA,IAAA0F,EAAA,GACA,GAAA91D,MAAA8J,OAAA,CAAAsmD,GACA0F,EAAA1F,OAEA,GAAAA,GAAA,iBAAAA,EAAA,CACA,IAAA2F,EAAA,GACAD,EAAA9F,EAAAx/C,GAAA,KACA,IAAAzb,EAAAm7D,EAAA0D,SAAA,CAIA,MAHA,GAAAlG,EAAA0F,MAAA,EAAAr+D,EAAA,4EAAwHihE,SAAA,SAAArB,KAAA,CAA4BzE,MAAAA,CAAA,EAAO95D,MAAAg6D,CAAA,GAC3J,GAAA1C,EAAA0F,MAAA,GAAA2C,CAAA,CAAAhhE,EAAA,+EAAmIihE,SAAA,SAAArB,KAAA,CAA4BzE,MAAAA,CAAA,EAAO95D,MAAAg6D,CAAA,GACtK2F,CAAA,CAAAhhE,EAAA,IACAq7D,CAAA,CAAAr7D,EAAA,EAEA,KAEA,GAAA24D,EAAAiC,cAAA,mCAAAS,GAEA,GAAA1C,EAAAiC,cAAA,EAAAK,EAAA96D,MAAA,GAAA4gE,EAAA5gE,MAAA,uCAAAk7D,GACA,IAAA6F,EAAA,IAAAtI,EAAA4C,MAAA,CACA2F,EAAA,IAAAvI,EAAA4C,MAAA,CACA4F,EAAA,GAsBA,OArBAnG,EAAA3lD,OAAA,EAAA6lD,EAAAz/C,KACA,IAAAra,EAAA0/D,CAAA,CAAArlD,EAAA,CACA,GAAAy/C,EAAA2D,OAAA,EAEA,IAAAuC,EAAAF,EAAAhhE,MAAA,CAEAg7D,EAAAluD,MAAA,CAAAk0D,EAAA9/D,GAEA,IAAAigE,EAAAJ,EAAA5B,mBAAA,GACA8B,EAAAl7D,IAAA,KACAo7D,EAAAC,EAAAF,EACA,EACA,MAEAlG,EAAAluD,MAAA,CAAAi0D,EAAA7/D,EAEA,GAEA+/D,EAAA9rD,OAAA,KAAoCyf,EAAAmsC,EAAA/gE,MAAA,IAEpCA,EADA++D,YAAA,CAAAgC,GACA3F,EAAA2D,YAAA,CAAAiC,EAEA,CAKA,SAAAN,EAAAb,CAAA,CAAA/E,CAAA,EACA,IAAAI,EAAA,GACAtI,EAAA,GAEAyO,EAAAxB,EAAAD,SAAA,IAyCA,OAxCA9E,EAAA3lD,OAAA,KACA,IAAAjU,EAAA,KACA,GAAA85D,EAAA2D,OAAA,EACA,IAAAtiC,EAAAwjC,EAAAI,SAAA,GACAqB,EAAAD,EAAAzB,SAAA,CAAAvjC,GACA,IACAn7B,EAAA85D,EAAAzkD,MAAA,CAAA+qD,EACA,CACA,MAAAzyD,EAAA,CAEA,MAAA2pD,EAAA+I,OAAA,EAAA1yD,EAAA,kBACA,MAAAA,CAGA3N,CADAA,CAAAA,EAAA2N,CAAA,EACAsrD,QAAA,CAAAa,EAAAn7D,IAAA,CACAqB,EAAArB,IAAA,CAAAm7D,EAAA0D,SAAA,CACAx9D,EAAA0a,IAAA,CAAAo/C,EAAAp/C,IAAA,CAEA,MAEA,IACA1a,EAAA85D,EAAAzkD,MAAA,CAAAspD,EACA,CACA,MAAAhxD,EAAA,CAEA,MAAA2pD,EAAA+I,OAAA,EAAA1yD,EAAA,kBACA,MAAAA,CAGA3N,CADAA,CAAAA,EAAA2N,CAAA,EACAsrD,QAAA,CAAAa,EAAAn7D,IAAA,CACAqB,EAAArB,IAAA,CAAAm7D,EAAA0D,SAAA,CACAx9D,EAAA0a,IAAA,CAAAo/C,EAAAp/C,IAAA,CAGA,GAAA1a,KAAA+C,GAAA/C,EACA,2BAEAg6D,EAAAn1D,IAAA,CAAA7E,GACA0xD,EAAA7sD,IAAA,CAAAi1D,EAAA0D,SAAA,OACA,GACAjG,EAAAoE,MAAA,CAAAwB,SAAA,CAAAnD,EAAAtI,EACA,CAlDA3xD,EAAAqrD,IAAY,CAAAA,EAmDZrrD,EAAAy/D,MAAc,CAAAA,CAId,OAAA7G,UAAApB,EAAAkE,KAAA,CACA3B,KAAA,CACAh7D,MAAA,aACAg7D,CAAA,CAAAh7D,CAAA,CAAA0+D,CAAA,EAGA,cAFA1D,EAAAp/C,IAAA,KAAA5b,CAAAA,GAAA,EAAAA,EAAA,QAEA0+D,EADA1+D,KAAAA,GAAAg7D,EAAA2D,OAAA,EAEA,GAAAnG,EAAAlB,gBAAA,QAAiD0D,MAAAA,EAAAh7D,OAAAA,CAAA,EACjD,CACAi7D,cAAA,CAEA,IAAAuG,EAAA,KAAAxG,KAAA,CAAAC,YAAA,GACAjqD,EAAA,GACA,QAAA9N,EAAA,EAAwBA,EAAA,KAAAlD,MAAA,CAAiBkD,IACzC8N,EAAAjL,IAAA,CAAAy7D,GAEA,OAAAxwD,CACA,CACAlE,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAn/D,EAAAk/D,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,SACAv1D,MAAA8J,OAAA,CAAA1T,IACA,KAAA09D,WAAA,wBAAA19D,GAEA,IAAA0f,EAAA,KAAA5gB,MAAA,CACA,KAAA4gB,IACAA,EAAA1f,EAAAlB,MAAA,CACAo7D,EAAA8D,UAAA,CAAAh+D,EAAAlB,MAAA,GAEA,GAAAw4D,EAAA2C,mBAAA,EAAAj6D,EAAAlB,MAAA,CAAA4gB,EAAA,oBAAA89C,SAAA,UAAAA,SAAA,MACA,IAAA5D,EAAA,GACA,QAAA53D,EAAA,EAAwBA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IAC1C43D,EAAA/0D,IAAA,MAAAi1D,KAAA,EAEA,OAAA1O,EAAA8O,EAAAN,EAAA55D,EACA,CACAqV,OAAAspD,CAAA,EACA,IAAAj/C,EAAA,KAAA5gB,MAAA,CACA,KAAA4gB,IACAA,EAAAi/C,EAAAI,SAAA,GAMA,GAAAzH,EAAA0F,MAAA,EAAAt9C,EAAA63C,EAAAqE,QAAA,EAAA+C,EAAAhB,UAAA,8CAA8It0D,OAAAs1D,EAAA//D,KAAA,CAAAu8B,OAAAzb,EAAA63C,EAAAqE,QAAA,CAAA98D,OAAA6/D,EAAAhB,UAAA,IAE9I,IAAA/D,EAAA,GACA,QAAA53D,EAAA,EAAwBA,EAAA0d,EAAW1d,IACnC43D,EAAA/0D,IAAA,KAAA46D,EAAAF,cAAA,MAAAzF,KAAA,GAEA,OAAA0F,EAAAb,EAAA/E,EACA,CACA,CACA75D,EAAA44D,UAAkB,CAAAA,sCClKlB94D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAo5D,YAAoB,QACpB,IAAA+F,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,MAIpC,OAAAs1D,UAAA5B,EAAAkE,KAAA,CACA/8D,YAAA8+D,CAAA,EACA,oBAAAA,EAAA,GACA,CACAzD,cAAA,CACA,QACA,CACAnuD,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAn/D,EAAAk/D,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,QACA,OAAAjF,EAAA8D,UAAA,CAAAh+D,EAAA,IACA,CACAqV,OAAAspD,CAAA,EACA,QAAAA,EAAAE,SAAA,EACA,CACA,CACA9+D,EAAAo5D,YAAoB,CAAAA,sCCtBpBt5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAs5D,UAAkB,CAAGt5D,EAAAwgE,iBAAyB,QAC9C,IAAAjJ,EAAmBzzD,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,MAIpC,OAAA08D,UAAAhJ,EAAAkE,KAAA,CACA/8D,YAAAgc,CAAA,CAAA8iD,CAAA,EACA,MAAA9iD,EAAAA,EAAA8iD,EAAA,GACA,CACAzD,cAAA,CACA,UACA,CACAnuD,OAAAsuD,CAAA,CAAAl6D,CAAA,EAIA,OAHAA,EAAA,GAAAs3D,EAAA+F,YAAA,EAAAr9D,GAEAlB,EADAk/D,UAAA,CAAAh+D,EAAAlB,MAAA,EACAo7D,EAAA4D,UAAA,CAAA99D,EAEA,CACAqV,OAAAspD,CAAA,EACA,OAAAA,EAAAC,SAAA,CAAAD,EAAAI,SAAA,MACA,CACA,CACAh/D,EAAAwgE,iBAAyB,CAAAA,CAIzB,OAAAlH,UAAAkH,EACA7hE,YAAA8+D,CAAA,EACA,cAAAA,EACA,CACAnoD,OAAAspD,CAAA,EACA,SAAArH,EAAAyD,OAAA,QAAA1lD,OAAAspD,GACA,CACA,CACA5+D,EAAAs5D,UAAkB,CAAAA,sCCpClBx5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA05D,eAAuB,QACvB,IAAAnC,EAAmBzzD,EAAQ,OAC3Bq7D,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,MAIpC,OAAA41D,UAAAlC,EAAAkE,KAAA,CACA7rC,IAAA,aACAA,CAAA,CAAA4tC,CAAA,EACA,IAAA7+D,EAAA,QAAAiV,OAAAgc,GACA,MAAAjxB,EAAAA,EAAA6+D,EAAA,IACA,GAAAlG,EAAAlB,gBAAA,QAAiDxmC,KAAAA,CAAA,EAAM,CAAIA,KAAA,UAC3D,CACAmqC,cAAA,CACA,2EAAAyG,SAAA,YAAA5wC,IAAA,CACA,CACAhkB,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAt4D,EAAA,GAAAywD,EAAA+F,YAAA,EAAA6B,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,KAAAzkD,IAAA,GAIA,OAHA7T,EAAA/H,MAAA,QAAA8wB,IAAA,EACA,KAAA8tC,WAAA,yBAAAyB,GAEAjF,EAAA4D,UAAA,CAAAj3D,EACA,CACAwO,OAAAspD,CAAA,EACA,SAAArH,EAAAyD,OAAA,EAAA4D,EAAAC,SAAA,MAAAhvC,IAAA,EACA,CACA,CACA7vB,EAAA05D,eAAuB,CAAAA,sCC7BvB55D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAu5D,SAAiB,QACjB,IAAA/B,EAA4B1zD,EAAQ,OACpC48D,EAAA,IAAAhiE,WAAA,GAIA,OAAA66D,UAAA/B,EAAAkE,KAAA,CACA/8D,YAAA8+D,CAAA,EACA,gBAAAA,EAAA,GACA,CACAzD,cAAA,CACA,WACA,CACAnuD,OAAAsuD,CAAA,CAAAl6D,CAAA,EAIA,OAHA,MAAAA,GACA,KAAA09D,WAAA,YAAA19D,GAEAk6D,EAAA4D,UAAA,CAAA2C,EACA,CACAprD,OAAAspD,CAAA,EAEA,OADAA,EAAAC,SAAA,IACA,IACA,CACA,CACA7+D,EAAAu5D,SAAiB,CAAAA,sCCzBjBz5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAy5D,WAAmB,QACnB,IAAAlC,EAAmBzzD,EAAQ,OAC3Bq7D,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,OACpC68D,EAAAl/D,OAAA,GACAm/D,EAAAn/D,OAAA,GACAo/D,EAAAp/D,OAAA,qEAIA,OAAAg4D,UAAAjC,EAAAkE,KAAA,CACA7rC,IAAA,CACAixC,MAAA,aACAjxC,CAAA,CAAAixC,CAAA,CAAArD,CAAA,EACA,IAAA7+D,EAAA,CAAAkiE,EAAA,cAAAjxC,EAAAA,EACA,MAAAjxB,EAAAA,EAAA6+D,EAAA,IACA,GAAAlG,EAAAlB,gBAAA,QAAiDxmC,KAAAA,EAAAixC,OAAAA,CAAA,EAAc,CAAIjxC,KAAA,SAAAixC,OAAA,WACnE,CACA9G,cAAA,CACA,QACA,CACAnuD,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAn/D,EAAA,GAAAs3D,EAAAwJ,SAAA,EAAA5B,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,KAAAzkD,IAAA,GAEAqmD,EAAA,GAAAzJ,EAAAt1B,IAAA,EAAA4+B,EAAArJ,EAAAA,EAAAqE,QAAA,EACA,QAAAiF,MAAA,EACA,IAAAhhC,EAAA,GAAAy3B,EAAAt1B,IAAA,EAAA++B,EAAA,OAAAnxC,IAAA,IACA5vB,CAAAA,EAAA6/B,GAAA7/B,EAAA,CAAA6/B,CAAAA,EAAA8gC,CAAA,IACA,KAAAjD,WAAA,uBAAAyB,GAEAn/D,EAAA,GAAAs3D,EAAA0J,MAAA,EAAAhhE,EAAA,EAAAu3D,EAAAqE,QAAA,CACA,KACA57D,CAAAA,EAAA0gE,GAAA1gE,EAAA,GAAAs3D,EAAAt1B,IAAA,EAAA++B,EAAA,OAAAnxC,IAAA,IACA,KAAA8tC,WAAA,uBAAAyB,GAEA,OAAAjF,EAAA8D,UAAA,CAAAh+D,EACA,CACAqV,OAAAspD,CAAA,EACA,IAAA3+D,EAAA,GAAAs3D,EAAAt1B,IAAA,EAAA28B,EAAAE,SAAA,UAAAjvC,IAAA,EAIA,OAHA,KAAAixC,MAAA,EACA7gE,CAAAA,EAAA,GAAAs3D,EAAA2J,QAAA,EAAAjhE,EAAA,OAAA4vB,IAAA,GAEA5vB,CACA,CACA,CACAD,EAAAy5D,WAAmB,CAAAA,sCC9CnB35D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq5D,WAAmB,QACnB,IAAA8H,EAAkBr9D,EAAQ,OAC1Bq7D,EAAmBr7D,EAAQ,OAC3B8zD,EAAmB9zD,EAAQ,MAI3B,OAAAu1D,UAAAzB,EAAA4I,iBAAA,CACA7hE,YAAA8+D,CAAA,EACA,eAAAA,EACA,CACAzD,cAAA,CACA,QACA,CACAnuD,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,aAAAvzD,OAAAsuD,EAAA,GAAAgH,EAAA7F,WAAA,EAAA6D,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,WACA,CACA9pD,OAAAspD,CAAA,EACA,SAAAuC,EAAA1F,YAAA,QAAAnmD,OAAAspD,GACA,CACA,CACA5+D,EAAAq5D,WAAmB,CAAAA,sCCtBnBv5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAg5D,UAAkB,QAClB,IAAAoI,EAAwBt9D,EAAQ,OAChCq7D,EAAmBr7D,EAAQ,OAC3B0zD,EAA4B1zD,EAAQ,OACpC4zD,EAAmB5zD,EAAQ,MAI3B,OAAAk1D,UAAAxB,EAAAkE,KAAA,CACA7B,MAAA,aACAA,CAAA,CAAA4D,CAAA,EACA,IAAAC,EAAA,GACA9D,EAAA,GACAC,EAAA3lD,OAAA,KACA6lD,EAAA2D,OAAA,EACAA,CAAAA,EAAA,IAEA9D,EAAA90D,IAAA,CAAAi1D,EAAAp/C,IAAA,CACA,GAEA,cADA,SAAAi/C,EAAAxM,IAAA,UACAqQ,EAAAC,GACA,GAAA0D,EAAA/K,gBAAA,QAAsDwD,OAAA/5D,OAAA4gC,MAAA,CAAAm5B,EAAA/pD,KAAA,KACtD,CACAkqD,cAAA,CACA,IAAAC,EAAA,GACA,KAAAJ,MAAA,CAAA3lD,OAAA,KACA+lD,EAAAn1D,IAAA,CAAAi1D,EAAAC,YAAA,GACA,GAEA,IAAAqH,EAAA,KAAAxH,MAAA,CAAA5zB,MAAA,EAAAu2B,EAAAzC,KACA,IAAAn7D,EAAAm7D,EAAA0D,SAAA,CAOA,OANA7+D,IACA49D,CAAA,CAAA59D,EAAA,EACA49D,CAAAA,CAAA,CAAA59D,EAAA,IAEA49D,CAAA,CAAA59D,EAAA,IAEA49D,CACA,EAAS,IAeT,OAbA,KAAA3C,MAAA,CAAA3lD,OAAA,EAAA6lD,EAAAz/C,KACA,IAAA1b,EAAAm7D,EAAA0D,SAAA,CACA7+D,GAAAyiE,IAAAA,CAAA,CAAAziE,EAAA,GAGA,WAAAA,GACAA,CAAAA,EAAA,WAEA,MAAAq7D,CAAA,CAAAr7D,EAAA,EAGAq7D,CAAAA,CAAA,CAAAr7D,EAAA,CAAAq7D,CAAA,CAAA3/C,EAAA,EACA,GACAxa,OAAA4gC,MAAA,CAAAu5B,EACA,CACApuD,OAAAsuD,CAAA,CAAAiF,CAAA,EACA,IAAAn/D,EAAAk/D,EAAAE,KAAA,CAAAC,WAAA,CAAAF,EAAA,SACA,SAAA1H,EAAArM,IAAA,EAAA8O,EAAA,KAAAN,MAAA,CAAA55D,EACA,CACAqV,OAAAspD,CAAA,EACA,SAAAlH,EAAA+H,MAAA,EAAAb,EAAA,KAAA/E,MAAA,CACA,CACA,CACA75D,EAAAg5D,UAAkB,CAAAA,sCCrDlBl5D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAshE,cAAsB,CAAGthE,EAAAuhE,gBAAwB,CAAGvhE,EAAAwhE,gBAAwB,CAAGxhE,EAAAyhE,mBAA2B,CAAGzhE,EAAA0hE,aAAqB,CAAG1hE,EAAA2hE,aAAqB,CAAG3hE,EAAA4hE,aAAqB,CAAG5hE,EAAA6hE,QAAgB,CAAG7hE,EAAA85D,SAAiB,QACzN,IAAAvC,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAG3B,SAAAg+D,EAAA7xC,CAAA,EACA,IAAAlgB,EAAA,IAAAgyD,IAEA,OADA9xC,EAAA/b,OAAA,IAAAnE,EAAAvP,GAAA,CAAAoQ,IACA9Q,OAAA4gC,MAAA,CAAA3wB,EACA,CAEA,IAAAiyD,EAAAF,EAAAG,mCAAA3gE,KAAA,OAEA4gE,EAAA,uEACAC,EAAAL,EAAAI,EAAA5gE,KAAA,OACA8gE,EAAA,2DACAC,EAAAP,EAAAM,EAAA9gE,KAAA,OACAghE,EAAA,0CACAC,EAAAT,EAAAQ,EAAAhhE,KAAA,OAIAkhE,EAAAV,EAAAW,CADAL,EAAAE,EAFA,gBAEAJ,EAAA,CAAA9U,IAAA,MACA9rD,KAAA,OAEAohE,EAAA,CACA,mCACA,uCACA,oBACA,EAEAC,EAAA,kBACAC,EAAA,oBACAC,EAAA,sCAEAC,EAAA,uCACAC,EAAA,6DACA,OAAAC,EACA,CAAA5nC,CAAA,EACA6nC,CAAA,KACA7nC,QAAA,CAAmB,aAAAA,CAAA,CACnB,IAAAr8B,QAAA,CAAmB,aAAAkkE,CAAA,CAAAlkE,MAAA,OAAAq8B,CAAA,CACnBz8B,YAAAskE,CAAA,EACA,MAAA7nC,CAAA,GACA,MAAA6nC,CAAA,CAAAA,EAAAnzD,KAAA,EACA,CACA5D,OAAA,CAAc,WAAA82D,EAAA,MAAAC,CAAA,EACdr2B,OAAA,CAAc,MAAAxR,CAAA,GACd,CAAA8nC,CAAA,CAAAp5D,EAAA,EAAAhC,EAAA,GACA,WAAAk7D,EAAA,MAAAC,CAAA,CAAAnzD,KAAA,CAAAhG,EAAAhC,GAAAuS,GAAA,IACAva,OAAA4gC,MAAA,CAAA5gC,OAAAwM,MAAA,IAAiDvH,EAAA,CACjDkzB,MAAAlzB,EAAAkzB,KAAA,CAAAnuB,EACAq5D,SAAAp+D,EAAAo+D,QAAA,CAAAr5D,EACAs5D,SAAAr+D,EAAAq+D,QAAA,CAAAt5D,CACA,KAEA,CAEAu5D,WAAAC,CAAA,EACA,IAAApxC,EAAA,KAAAqxC,IAAA,GACA,GAAArxC,YAAAA,EAAAvX,IAAA,GAAA2oD,EAAAhX,GAAA,CAAAp6B,EAAArd,IAAA,EACA,gCAAgDqd,EAAArd,IAAA,CAAS,GAEzD,YAAA8N,GAAA,GAAA9N,IAAA,CAGA2uD,QAAA7oD,CAAA,EACA,QAAA4oD,IAAA,GAAA5oD,IAAA,GAAAA,EAAA,CACA,IAAAuX,EAAA,KAAAqxC,IAAA,EACA,yBAAwC5oD,EAAA,MAAO,EAAMuX,EAAAvX,IAAA,EAAU,EAAEzK,KAAAC,SAAA,CAAA+hB,EAAArd,IAAA,EAAyB,EAC1F,CACA,YAAA8N,GAAA,GAAA9N,IAAA,CAGA4uD,UAAA,CACA,IAAAvxC,EAAA,KAAAqxC,IAAA,GACA,GAAArxC,eAAAA,EAAAvX,IAAA,CACA,yBAEA,IAAA5K,EAAA,MAAAmzD,CAAA,OAAA9nC,CAAA,GAAAlJ,EAAA+F,KAAA,IAEA,OADA,MAAAmD,CAAA,CAAAlJ,EAAA+F,KAAA,GACAloB,CACA,CAEA2zD,WAAA,CACA,IAAAxxC,EAAA,KAAAqxC,IAAA,GACA,GAAArxC,eAAAA,EAAAvX,IAAA,CACA,yBAEA,IAAA5K,EAAA,GACA,WAAAqrB,CAAA,CAAAlJ,EAAA+F,KAAA,KACA,IAAA0rC,EAAA,KAAAJ,IAAA,GAAAH,QAAA,CACArzD,EAAAjL,IAAA,OAAAo+D,CAAA,OAAA9nC,CAAA,GAAAuoC,IACA,MAAAvoC,CAAA,CAAAuoC,CACA,CAEA,OADA,MAAAvoC,CAAA,CAAAlJ,EAAA+F,KAAA,GACAloB,CACA,CAEAwzD,MAAA,CACA,SAAAnoC,CAAA,QAAA6nC,CAAA,CAAAlkE,MAAA,CACA,6BAEA,aAAAkkE,CAAA,OAAA7nC,CAAA,EAGAwoC,YAAAN,CAAA,EACA,IAAApxC,EAAA,KAAA2xC,QAAA,YACA,aAAA3xC,GAAAoxC,EAAAhX,GAAA,CAAAp6B,GAAAA,EAAA,IACA,CAEA2xC,SAAAlpD,CAAA,EACA,YAAA5b,MAAA,CACA,YAEA,IAAAmzB,EAAA,KAAAqxC,IAAA,GACA,SAAA5oD,IAAA,GAAAA,EAAAuX,EAAArd,IAAA,KACA,CAEA8N,KAAA,CACA,IAAA5S,EAAA,KAAAwzD,IAAA,GAEA,OADA,MAAAnoC,CAAA,GACArrB,CACA,CACA/F,UAAA,CACA,IAAAi5D,EAAA,GACA,QAAAhhE,EAAA,MAAAm5B,CAAA,CAAmCn5B,EAAA,MAAAghE,CAAA,CAAAlkE,MAAA,CAAyBkD,IAAA,CAC5D,IAAA6hE,EAAA,MAAAb,CAAA,CAAAhhE,EAAA,CACAghE,EAAAn+D,IAAA,IAA2Bg/D,EAAAnpD,IAAA,CAAW,GAAGmpD,EAAAjvD,IAAA,CAAW,EACpD,CACA,sBAA+BouD,EAAA7V,IAAA,MAAiB,GAEhD,CACA,SAAA2W,EAAAlvD,CAAA,EACA,IAAAouD,EAAA,GACA9G,EAAA,IACA,IAAA2H,EAAA,EAAAjvD,EAAA9V,MAAA,CAAAmR,KAAAC,SAAA,CAAA0E,CAAA,CAAAumB,EAAA,QACA,8BAAyC0oC,EAAA,IAAO,EAAK1oC,EAAO,IAAIsd,EAAQ,EACxE,EACAsrB,EAAA,GACAC,EAAA,GACA7oC,EAAA,EACA,KAAAA,EAAAvmB,EAAA9V,MAAA,GAEA,IAAAmlE,EAAArvD,EAAA4rD,SAAA,CAAArlC,GACAnD,EAAAisC,EAAAjsC,KAAA,CAAA0qC,GACA1qC,IACAmD,GAAAnD,CAAA,IAAAl5B,MAAA,CACAmlE,EAAArvD,EAAA4rD,SAAA,CAAArlC,IAEA,IAAA0oC,EAAA,CAAwBt0C,MAAAw0C,EAAAjlE,MAAA,CAAAokE,SAAA,GAAAC,SAAA,GAAAnrC,MAAA,GAAAtd,KAAA,GAAA9F,KAAA,GAAAumB,OAAAA,EAAAn7B,MAAA,IACxBgjE,EAAAn+D,IAAA,CAAAg/D,GACA,IAAAnpD,EAAA+nD,CAAA,CAAAwB,CAAA,SACA,GAAAvpD,EAAA,CAIA,GAHAmpD,EAAAnpD,IAAA,CAAAA,EACAmpD,EAAAjvD,IAAA,CAAAqvD,CAAA,IACA9oC,IACAzgB,eAAAA,EACAqpD,EAAAl/D,IAAA,CAAAm+D,EAAAlkE,MAAA,IACAklE,EAAAn/D,IAAA,CAAAm+D,EAAAlkE,MAAA,SAEA,GAAA4b,eAAAA,EACA,IAAAqpD,EAAAjlE,MAAA,EACAo9D,EAAA,4BAEA2H,EAAA7rC,KAAA,CAAA+rC,EAAArhD,GAAA,GACA,EAAAmhD,EAAA7rC,KAAA,EAAAA,KAAA,CAAAgrC,EAAAlkE,MAAA,GACA+kE,EAAAt0C,KAAA,GACAs0C,EAAAX,QAAA,CAAAc,EAAAthD,GAAA,GACA,EAAAmhD,EAAAX,QAAA,EAAAC,QAAA,CAAAH,EAAAlkE,MAAA,QAEA,GAAA4b,UAAAA,EACAmpD,EAAAX,QAAA,CAAAc,EAAAthD,GAAA,GACA,EAAAmhD,EAAAX,QAAA,EAAAC,QAAA,CAAAH,EAAAlkE,MAAA,GACAklE,EAAAn/D,IAAA,CAAAm+D,EAAAlkE,MAAA,SAEA,GAAA4b,iBAAAA,EACAmpD,EAAAnpD,IAAA,gBAEA,GAAAA,kBAAAA,EAAA,CAEA,IAAAxU,EAAA88D,EAAAtgD,GAAA,GAAA9N,IAAA,CACA,GAAAouD,EAAAlkE,MAAA,IAAAkkE,WAAAA,CAAA,CAAAA,EAAAlkE,MAAA,IAAA4b,IAAA,EACA,IAAA1a,EAAAgjE,EAAAtgD,GAAA,GAAA9N,IAAA,CACA1O,EAAAlG,EAAAkG,EACA,EAAA88D,EAAAlkE,MAAA,IAAAkB,KAAA,IAAAs3D,EAAAqF,SAAA,EAAA38D,EACA,CACA,GAAAgjE,IAAAA,EAAAlkE,MAAA,EAAAkkE,YAAAA,CAAA,CAAAA,EAAAlkE,MAAA,IAAA4b,IAAA,CACA,sCAEA,CAAAsoD,CAAA,CAAAA,EAAAlkE,MAAA,IAAA8V,IAAA,EAAA1O,CACA,CACA,QACA,CAEA,GADA8xB,EAAAisC,EAAAjsC,KAAA,CAAA4qC,GACA,CAGA,GAFAiB,EAAAjvD,IAAA,CAAAojB,CAAA,IACAmD,GAAA0oC,EAAAjvD,IAAA,CAAA9V,MAAA,CACAyjE,EAAAlW,GAAA,CAAAwX,EAAAjvD,IAAA,GACAivD,EAAAnpD,IAAA,WACA,QACA,CACA,GAAAmpD,EAAAjvD,IAAA,CAAAojB,KAAA,CAAA8qC,GAAA,CACAe,EAAAnpD,IAAA,QACA,QACA,CACAmpD,EAAAnpD,IAAA,MACA,QACA,CAEA,GADAsd,EAAAisC,EAAAjsC,KAAA,CAAA2qC,GACA,CACAkB,EAAAjvD,IAAA,CAAAojB,CAAA,IACA6rC,EAAAnpD,IAAA,UACAygB,GAAA0oC,EAAAjvD,IAAA,CAAA9V,MAAA,CACA,QACA,CACA,gCAA4CmR,KAAAC,SAAA,CAAA+zD,CAAA,kBAAwB,EAAc9oC,EAAO,EACzF,CACA,WAAA4nC,EAAAC,EAAA5oD,GAAA,IAAAva,OAAA4gC,MAAA,CAAA37B,IACA,CAEA,SAAAo/D,EAAA78D,CAAA,CAAAg8D,CAAA,EACA,IAAAc,EAAA,GACA,QAAA/zD,KAAAizD,EAAA3R,IAAA,GACArqD,EAAAglD,GAAA,CAAAj8C,IACA+zD,EAAAt/D,IAAA,CAAAuL,GAGA,GAAA+zD,EAAArlE,MAAA,GACA,kCAA8CqlE,EAAAhX,IAAA,OAAoB,EAElE,CAGA,SAAAiX,EAAA1pD,CAAA,CAAAsoD,CAAA,EACA,GAAAA,EAAAW,WAAA,CAAAvB,GAAA,CACA,IAAAiC,EAAArB,EAAAtgD,GAAA,GAAA9N,IAAA,CACA,GAAAyvD,IAAA3pD,EACA,wBAAwCA,EAAK,QAAQ2pD,EAAQ,EAE7D,CACA,OAAArB,EAAAO,OAAA,MACA,CAEA,SAAAe,EAAAtB,CAAA,CAAAK,CAAA,EACA,IAAAkB,EAAA,IAAAzC,IACA,QACA,IAAAuC,EAAArB,EAAAY,QAAA,YACA,GAAAS,MAAAA,GAAAhB,GAAA,CAAAA,EAAAhX,GAAA,CAAAgY,GACA,MAGA,GADArB,EAAAtgD,GAAA,GACA6hD,EAAAlY,GAAA,CAAAgY,GACA,mCAAmDp0D,KAAAC,SAAA,CAAAm0D,GAAwB,GAE3EE,EAAAhkE,GAAA,CAAA8jE,EACA,CACA,OAAAxkE,OAAA4gC,MAAA,CAAA8jC,EACA,CAEA,SAAAC,EAAAxB,CAAA,EACA,IAAAyB,EAAAH,EAAAtB,EAAAd,SAKA,CAHAgC,EAAAO,EAAA5C,EAAA,8BAAAxgE,KAAA,QACA6iE,EAAAO,EAAA5C,EAAA,+BAAAxgE,KAAA,QAEAojE,EAAApY,GAAA,UACA,OAEAoY,EAAApY,GAAA,SACA,OAEAoY,EAAApY,GAAA,YACA,UAEAoY,EAAApY,GAAA,eACA,aAGAoY,EAAApY,GAAA,aACA,OAEA,YACA,CAEA,SAAAqY,EAAA1B,CAAA,CAAA2B,CAAA,EACA,OAAA3B,EAAAS,SAAA,GAAArpD,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAA/E,EAAA6/D,GACA,CAEA,SAAAC,EAAA5B,CAAA,EACA,GAAAA,EAAAY,QAAA,QAEA,GADAZ,EAAAtgD,GAAA,GACAsgD,EAAAY,QAAA,WACA,SAAAtM,EAAAwJ,SAAA,EAAAkC,EAAAtgD,GAAA,GAAA9N,IAAA,CAEA,2BACA,CACA,WACA,CACA,SAAAiwD,EAAA7B,CAAA,EACA,GAAAA,EAAAlkE,MAAA,CACA,2CAAuDkkE,EAAA7nC,MAAA,CAAc,IAAI6nC,EAAAj5D,QAAA,GAAkB,EAE3F,CACA,IAAA+6D,EAAA,IAAAxM,OAAA,sBACA,SAAAyM,EAAArqD,CAAA,EACA,IAAAsd,EAAAtd,EAAAsd,KAAA,CAAA8qC,GAEA,GADA,GAAAxL,EAAAiC,cAAA,EAAAvhC,EAAA,sBAAAtd,GACAA,SAAAA,EACA,gBAEA,GAAAA,QAAAA,EACA,eAEA,GAAAsd,CAAA,KAEA,IAAAl5B,EAAA8S,SAAAomB,CAAA,KACA,GAAAs/B,EAAAiC,cAAA,EAAAz6D,IAAAA,GAAAA,GAAA,iCAAA4b,EACA,MACA,GAAAsd,CAAA,KAEA,IAAApI,EAAAhe,SAAAomB,CAAA,KACA,GAAAs/B,EAAAiC,cAAA,EAAA3pC,IAAAA,GAAAA,GAAA,2CAAAlV,EACA,CACA,OAAAA,CACA,CAEA,IAAAqhD,EAAA,GACAiJ,EAAAta,OAAAua,GAAA,qBACAC,EAAA,qBACAC,EAAA,iBACAC,EAAA,iBACAC,EAAA,uBACAC,EAAA,oBACAC,EAAA,oBACAC,EAAA,iBAIA,OAAA3L,EAIAl7D,IAAA,CAKA+b,IAAA,CAIAu+C,QAAA,CAMAwM,OAAA,CAMAzM,UAAA,CAMAH,WAAA,CAMAD,aAAA,aAIAwD,CAAA,CAAAz9D,CAAA,CAAA+b,CAAA,CAAAu+C,CAAA,CAAAwM,CAAA,CAAAzM,CAAA,CAAAH,CAAA,CAAAD,CAAA,EAMA,GALA,GAAAtB,EAAAoO,aAAA,EAAAtJ,EAAAL,EAAA,aACAl8D,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAklE,CAAA,GAChDlM,GACAA,CAAAA,EAAAn5D,OAAA4gC,MAAA,CAAAu4B,EAAAnpD,KAAA,KAEAopD,UAAAA,EACA,IAAAJ,MAAAA,GAAAD,MAAAA,EACA,eACA,MAEA,GAAAC,MAAAA,GAAAD,MAAAA,EACA,gBAEA,GAAAK,UAAAA,EACA,IAAAD,MAAAA,EACA,eACA,MAEA,GAAAA,MAAAA,EACA,gBAEA,GAAA1B,EAAAlB,gBAAA,QACAz3D,KAAAA,EAAA+b,KAAAA,EAAAu+C,SAAAA,EAAAwM,QAAAA,EAAAzM,WAAAA,EAAAH,YAAAA,EAAAD,cAAAA,CACA,EACA,CAYA+M,OAAAA,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,WAEAA,SAAAA,EAAA,CACA,IAAAhnE,EAAA,KAAAA,IAAA,KACA,QAAA+U,OAAA,IACA,IAAA5D,EAAAG,KAAAF,KAAA,MAAA6oD,aAAA,CAAA+M,MAAA,UAGA,OAFA71D,EAAAnR,IAAA,CAAAA,EACAmR,EAAA4K,IAAA,MAAmC,KAAAm+C,WAAA,MAAAjlD,OAAA,KAAAilD,WAAA,EAAuD,GAC1F5oD,KAAAC,SAAA,CAAAJ,EACA,CACA,IAAAA,EAAA,CACA4K,KAAA,eAAAu+C,QAAA,cAAAv+C,IAAA,CACA/b,KAAAA,CACA,EAOA,MANA,uBAAA8mE,OAAA,EACA31D,CAAAA,EAAA21D,OAAA,MAAAA,OAAA,EAEA,KAAA3M,OAAA,IACAhpD,CAAAA,EAAAkpD,UAAA,MAAAA,UAAA,CAAA5+C,GAAA,IAAAnK,KAAAF,KAAA,CAAA6a,EAAA+6C,MAAA,CAAAA,IAAA,EAEA11D,KAAAC,SAAA,CAAAJ,EACA,CACA,IAAAA,EAAA,GAsBA,OApBA,KAAA4D,OAAA,GAEA5D,GADA,KAAA8oD,aAAA,CAAA+M,MAAA,CAAAA,GACA,IAA0B,KAAA9M,WAAA,MAAAjlD,OAAA,KAAAilD,WAAA,EAAuD,GAGjF,KAAAC,OAAA,GACAhpD,GAAA,SAAAkpD,UAAA,CAAA5+C,GAAA,IAAAyoB,EAAA8iC,MAAA,CAAAA,IAAAxY,IAAA,UAAAwY,EAAA,cAGA71D,GAAA,KAAA4K,IAAA,CAGA,YAAAirD,IACA,UAAAF,OAAA,EACA31D,CAAAA,GAAA,YAEA,SAAA61D,GAAA,KAAAhnE,IAAA,EACAmR,CAAAA,GAAA,SAAAnR,IAAA,GAGAmR,CACA,CAOA4D,SAAA,CACA,qBAAAulD,QAAA,CAQAH,SAAA,CACA,qBAAAG,QAAA,CAQA2M,aAAA,CACA,kBAAAH,OAAA,CAMAtoC,KAAAn9B,CAAA,CAAA08C,CAAA,EACA,QAAAhpC,OAAA,IACA,IAAA9J,MAAA8J,OAAA,CAAA1T,GACA,mCAEA,aAAA64D,WAAA,EAAA74D,EAAAlB,MAAA,QAAA+5D,WAAA,CACA,qCAEA,IAAAgN,EAAA,KACA,OAAA7lE,EAAAoa,GAAA,IAAAyrD,EAAAjN,aAAA,CAAAz7B,IAAA,CAAAmL,EAAAoU,GACA,CACA,QAAAoc,OAAA,IACA,IAAAlvD,MAAA8J,OAAA,CAAA1T,GACA,mCAEA,GAAAA,EAAAlB,MAAA,QAAAk6D,UAAA,CAAAl6D,MAAA,CACA,qCAEA,IAAA+mE,EAAA,KACA,OAAA7lE,EAAAoa,GAAA,EAAAkuB,EAAAtmC,IAAA6jE,EAAA7M,UAAA,CAAAh3D,EAAA,CAAAm7B,IAAA,CAAAmL,EAAAoU,GACA,CACA,OAAAA,EAAA,KAAAhiC,IAAA,CAAA1a,EACA,CACA,CAAA8lE,CAAA,CAAAC,CAAA,CAAA/lE,CAAA,CAAA08C,CAAA,CAAAspB,CAAA,EACA,QAAAtyD,OAAA,IACA,IAAA9J,MAAA8J,OAAA,CAAA1T,GACA,mCAEA,aAAA64D,WAAA,EAAA74D,EAAAlB,MAAA,QAAA+5D,WAAA,CACA,qCAEA,IAAAoN,EAAA,KAAArN,aAAA,CACA9oD,EAAA9P,EAAA6P,KAAA,GACAC,EAAAmE,OAAA,EAAAjU,EAAAqa,KACA4rD,EAAA,CAAAH,CAAA,CAAAC,EAAA/lE,EAAA08C,EAAA,IACA5sC,CAAA,CAAAuK,EAAA,CAAAra,CACA,EACA,GACAgmE,EAAAl2D,GACA,MACA,CACA,QAAAgpD,OAAA,QAGAhpD,EAFA,IAAAkpD,EAAA,KAAAA,UAAA,CAGA,GAAApvD,MAAA8J,OAAA,CAAA1T,GACA8P,EAAA9P,EAAA6P,KAAA,OAEA,CACA,GAAA7P,MAAAA,GAAA,iBAAAA,EACA,mCAEA8P,EAAAkpD,EAAA5+C,GAAA,KACA,IAAAwyC,EAAAjuD,IAAA,CACA,+DAEA,IAAAiuD,CAAAA,EAAAjuD,IAAA,IAAAqB,CAAA,EACA,2CAAuE4sD,EAAAjuD,IAAA,CAAW,GAElF,OAAAqB,CAAA,CAAA4sD,EAAAjuD,IAAA,GAEA,CACA,GAAAmR,EAAAhR,MAAA,QAAAk6D,UAAA,CAAAl6D,MAAA,CACA,qCAEAgR,EAAAmE,OAAA,EAAAjU,EAAAqa,KACA2+C,CAAA,CAAA3+C,EAAA,EAAAyrD,CAAA,CAAAC,EAAA/lE,EAAA08C,EAAA,IACA5sC,CAAA,CAAAuK,EAAA,CAAAra,CACA,EACA,GACAgmE,EAAAl2D,GACA,MACA,CACA,IAAAA,EAAA4sC,EAAA,KAAAhiC,IAAA,CAAA1a,EACA8P,CAAAA,EAAAo6C,IAAA,CACA6b,EAAAlhE,IAAA,kBAA+CmhE,EAAA,MAAAl2D,EAAA,KAG/Ck2D,EAAAl2D,EAEA,CAQA,MAAAg2D,UAAA9lE,CAAA,CAAA08C,CAAA,EACA,IAAAqpB,EAAA,GACAj2D,EAAA,CAAA9P,EAAA,CAOA,OANA,MAAA8lE,CAAA,CAAAC,EAAA/lE,EAAA08C,EAAA,IACA5sC,CAAA,IAAA9P,CACA,GACA+lE,EAAAjnE,MAAA,EACA,MAAA2qD,QAAA6F,GAAA,CAAAyW,GAEAj2D,CAAA,IAQA,OAAAjG,KAAAyU,CAAA,CAAAqmD,CAAA,EACA,GAAA9K,EAAAqM,WAAA,CAAA5nD,GACA,OAAAA,EAEA,oBAAAA,EACA,IACA,OAAAu7C,EAAAhwD,IAAA,CAAAi6D,EAAAxlD,GAAAqmD,EACA,CACA,MAAAh3D,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,gCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACA,IAAAroD,EAAA,GAAAu+C,EAAA,GACAkN,EAAA,IACA7B,CAAAA,EAAAhmD,EAAAujD,EAAA,YAAAxV,GAAA,WAAA/tC,EAAAslD,QAAA,gBAEA3K,EAAA,QACAkN,EAAA7nD,EAAAmlD,SAAA,GAAArpD,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAA/E,IACA4V,EAAA,SAAgCyrD,EAAA/rD,GAAA,IAAAwQ,EAAA+6C,MAAA,IAAAxY,IAAA,MAAuC,IAKvE8L,EADAv+C,EAAAqqD,EAAAzmD,EAAAilD,OAAA,UAIA,IAAA3K,EAAA,KACAC,EAAA,KACA,KAAAv6C,EAAAxf,MAAA,EAAAwf,EAAAslD,QAAA,cACA,IAAAwC,EAAA9nD,EAAAoE,GAAA,GACAk2C,EAAA,IAAAiB,EAAAkC,EAAA,GAAArhD,EAAAu+C,EAAA,KAAAkN,EAAAtN,EAAAD,GACAC,EAAAuN,EAAApmE,KAAA,CACA0a,GAAA0rD,EAAAxxD,IAAA,CACAqkD,EAAA,QACAkN,EAAA,IACA,CACA,IAAAV,EAAA,KAEA,GAAAlB,EADAjmD,EAAAgkD,GACAjW,GAAA,aACA,IAAAsY,EACA,gBAEAc,EAAA,EACA,CACA,IAAA9mE,EAAA2f,EAAAslD,QAAA,OAAAtlD,EAAAoE,GAAA,GAAA9N,IAAA,IACA,GAAA0J,EAAAxf,MAAA,CACA,+BAEA,WAAA+6D,EAAAkC,EAAAp9D,EAAA+b,EAAAu+C,EAAAwM,EAAAU,EAAAtN,EAAAD,EACA,CACA,IAAAj6D,EAAA2f,EAAA3f,IAAA,CACA,GAAA24D,EAAAiC,cAAA,GAAA56D,GAAA,iBAAAA,GAAAA,EAAAq5B,KAAA,CAAA6qC,GAAA,0BAAAlkE,GACA,IAAA8mE,EAAAnnD,EAAAmnD,OAAA,OACAA,IACA,GAAAnO,EAAAiC,cAAA,EAAAoL,EAAA,4CAAArmD,EAAAmnD,OAAA,EACAA,EAAA,EAAAA,GAEA,IAAA/qD,EAAA4D,EAAA5D,IAAA,CACA2rD,EAAA3rD,EAAAsd,KAAA,CAAA8sC,GACA,GAAAuB,EAAA,CACA,IAAAxN,EAAAjnD,SAAAy0D,CAAA,WACAzN,EAAAiB,EAAAhwD,IAAA,EACA6Q,KAAA2rD,CAAA,IACArN,WAAA16C,EAAA06C,UAAA,GAEA,WAAAa,EAAAkC,EAAAp9D,GAAA,GAAA+b,EAAA,QAAA+qD,EAAA,KAAA5M,EAAAD,EACA,CACA,GAAAl+C,UAAAA,GAAAA,EAAA4rD,UAAA,YAAA5rD,EAAA4rD,UAAA,OACA,IAAAH,EAAA,MAAA7nD,EAAA06C,UAAA,CAAA16C,EAAA06C,UAAA,CAAA5+C,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAA+gB,IAAA,KAGA,OAFA,IAAAivC,EAAAkC,EAAAp9D,GAAA,GAAA+b,EAAA,QAAA+qD,EAAAU,EAAA,UAGA,CAEA,WAAAtM,EAAAkC,EAAAp9D,GAAA,GADA+b,EAAAqqD,EAAAzmD,EAAA5D,IAAA,EACAA,EAAA+qD,EAAA,eACA,CAIA,OAAAS,YAAAlmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAE,CACA,CACA,CACAnlE,EAAA85D,SAAiB,CAAAA,CAIjB,OAAA+H,EAIAlnD,IAAA,CAIA6rD,MAAA,aAIAnK,CAAA,CAAA1hD,CAAA,CAAA6rD,CAAA,EACA,GAAAjP,EAAAoO,aAAA,EAAAtJ,EAAAL,EAAA,YACAwK,EAAA1mE,OAAA4gC,MAAA,CAAA8lC,EAAA12D,KAAA,IACA,GAAAynD,EAAAlB,gBAAA,QAAiD17C,KAAAA,EAAA6rD,OAAAA,CAAA,EACjD,CAKA,OAAA18D,KAAAyU,CAAA,EACA,oBAAAA,EAAA,CAEA,IACAsjD,EAAA/3D,IAAA,CAAAoG,KAAAF,KAAA,CAAAuO,GACA,CACA,MAAAgnB,EAAA,EAEA,OAAAs8B,EAAA/3D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,GAAAA,aAAAykD,EAGA,OADAzkD,EAAAqlD,WAAA,CAAAvB,IAEA,yBAAAZ,EAAA33D,IAAA,CAAAyU,EACA,oBAAAojD,EAAA73D,IAAA,CAAAyU,EACA,oBAAAmjD,EAAA53D,IAAA,CAAAyU,EACA,gBACA,cACA,OAAAijD,EAAA13D,IAAA,CAAAyU,EACA,uBAAAgjD,EAAAz3D,IAAA,CAAAyU,EACA,qBAAA+iD,EAAAx3D,IAAA,CAAAyU,EACA,MAEA,oBAAAA,EAAA,CAEA,OAAAA,EAAA5D,IAAA,EACA,yBAAA8mD,EAAA33D,IAAA,CAAAyU,EACA,oBAAAojD,EAAA73D,IAAA,CAAAyU,EACA,oBAAAmjD,EAAA53D,IAAA,CAAAyU,EACA,gBACA,cACA,OAAAijD,EAAA13D,IAAA,CAAAyU,EACA,uBAAAgjD,EAAAz3D,IAAA,CAAAyU,EACA,qBAAA+iD,EAAAx3D,IAAA,CAAAyU,EACA,CACA,GAAAg5C,EAAA0F,MAAA,0BAA+D1+C,EAAA5D,IAAA,CAAS,2BACxEuiD,UAAA,eACA,EACA,CACA,GAAA3F,EAAAiC,cAAA,yCAAAj7C,EACA,CAIA,OAAAkoD,cAAAxmE,CAAA,EACA,OAAAwhE,EAAAiF,UAAA,CAAAzmE,EACA,CAIA,OAAAqgE,QAAArgE,CAAA,EACA,OAAA0hE,EAAA+E,UAAA,CAAAzmE,EACA,CAIA,OAAA0mE,QAAA1mE,CAAA,EACA,OAAAyhE,EAAAgF,UAAA,CAAAzmE,EACA,CAIA,OAAA2mE,WAAA3mE,CAAA,EACA,OAAAshE,EAAAmF,UAAA,CAAAzmE,EACA,CAIA,OAAA4mE,SAAA5mE,CAAA,EACA,OAAAqhE,EAAAoF,UAAA,CAAAzmE,EACA,CACA,CACAD,EAAA6hE,QAAgB,CAAAA,CAKhB,OAAAD,UAAAC,EAIAjjE,IAAA,aAIAy9D,CAAA,CAAA1hD,CAAA,CAAA/b,CAAA,CAAA4nE,CAAA,EACA,MAAAnK,EAAA1hD,EAAA6rD,GACA,GAAAjP,EAAAiC,cAAA,mBAAA56D,GAAAA,EAAAq5B,KAAA,CAAA6qC,GAAA,4BAAAlkE,GACA4nE,EAAA1mE,OAAA4gC,MAAA,CAAA8lC,EAAA12D,KAAA,IACA,GAAAynD,EAAAlB,gBAAA,QAAiDz3D,KAAAA,CAAA,EACjD,CACA,CAEA,SAAAkoE,EAAAlB,CAAA,CAAA9X,CAAA,EACA,UAAAA,EAAAzzC,GAAA,IAAAhJ,EAAAu0D,MAAA,CAAAA,IAAAxY,IAAA,UAAAwY,EAAA,aACA,CAHA5lE,EAAA4hE,aAAqB,CAAAA,CAOrB,OAAAD,UAAAC,EAIAjjE,YAAA09D,CAAA,CAAAz9D,CAAA,CAAA4nE,CAAA,EACA,MAAAnK,EAAA,QAAAz9D,EAAA4nE,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAmlE,CAAA,EAChD,CAIA,IAAA2B,UAAA,CACA,SAAA5O,EAAA9pD,EAAA,OAAAu3D,MAAA,aAAAnF,SAAA,MACA,CAIAmF,OAAAA,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,WAEAA,SAAAA,EACA,OAAA11D,KAAAC,SAAA,EACAwK,KAAA,QACA/b,KAAA,KAAAA,IAAA,CACA4nE,OAAA,KAAAA,MAAA,CAAAnsD,GAAA,IAAAnK,KAAAF,KAAA,CAAAwjB,EAAAoyC,MAAA,CAAAA,IACA,GAEA,IAAA71D,EAAA,GAKA,MAJA,YAAA61D,GACA71D,EAAAjL,IAAA,UAEAiL,EAAAjL,IAAA,MAAAlG,IAAA,CAAAkoE,EAAAlB,EAAA,KAAAY,MAAA,GACAz2D,EAAAq9C,IAAA,KACA,CAIA,OAAAtjD,KAAAyU,CAAA,EACA,GAAAojD,EAAA+E,UAAA,CAAAnoD,GACA,OAAAA,EAEA,oBAAAA,EACA,OAAAojD,EAAA73D,IAAA,CAAAi6D,EAAAxlD,IAEA,GAAAA,aAAAykD,EAAA,CACA,IAAApkE,EAAAylE,EAAA,QAAA9lD,GACAioD,EAAA7B,EAAApmD,GAEA,OADAumD,EAAAvmD,GACA,IAAAojD,EAAA3F,EAAAp9D,EAAA4nE,EACA,CACA,WAAA7E,EAAA3F,EAAAz9C,EAAA3f,IAAA,CAAA2f,EAAAioD,MAAA,CAAAjoD,EAAAioD,MAAA,CAAAnsD,GAAA,CAAAy/C,EAAAhwD,IAAA,KACA,CAKA,OAAA48D,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAG,CACA,CACA,CACAplE,EAAA2hE,aAAqB,CAAAA,CAIrB,OAAAD,UAAAE,EAIAoF,SAAA,aAIA3K,CAAA,CAAAz9D,CAAA,CAAA4nE,CAAA,CAAAQ,CAAA,EACA,MAAA3K,EAAA,QAAAz9D,EAAA4nE,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAolE,CAAA,GAChD,GAAA9N,EAAAlB,gBAAA,QAAiD2Q,UAAAA,CAAA,EACjD,CAIA,IAAAC,WAAA,CACA,SAAA9O,EAAA9pD,EAAA,OAAAu3D,MAAA,YACA,CAIAA,OAAAA,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,WAEAA,SAAAA,EACA,OAAA11D,KAAAC,SAAA,EACAwK,KAAA,QACAqsD,UAAA,KAAAA,SAAA,CACApoE,KAAA,KAAAA,IAAA,CACA4nE,OAAA,KAAAA,MAAA,CAAAnsD,GAAA,IAAAnK,KAAAF,KAAA,CAAA/N,EAAA2jE,MAAA,CAAAA,IACA,GAEA,IAAA71D,EAAA,GAQA,MAPA,YAAA61D,GACA71D,EAAAjL,IAAA,UAEAiL,EAAAjL,IAAA,MAAAlG,IAAA,CAAAkoE,EAAAlB,EAAA,KAAAY,MAAA,GACA,YAAAZ,GAAA,KAAAoB,SAAA,EACAj3D,EAAAjL,IAAA,cAEAiL,EAAAq9C,IAAA,KACA,CAIA,OAAA8Z,aAAAtoE,CAAA,CAAAkvD,CAAA,EAGA,OAAA+E,IADA6O,EAAA1F,EAAAp9D,EADAkvD,EAAA,CAAAA,GAAA,IAAAzzC,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAAuH,IACA,IACA41D,SAAA,CAKA,OAAAn9D,KAAAyU,CAAA,EACA,GAAAmjD,EAAAgF,UAAA,CAAAnoD,GACA,OAAAA,EAEA,oBAAAA,EACA,IACA,OAAAmjD,EAAA53D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,MAAA3Q,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,oCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACA,IAAApkE,EAAAylE,EAAA,QAAA9lD,GACAioD,EAAA7B,EAAApmD,EAAA,IACAyoD,EAAA,EAAAzC,EAAAhmD,EAAAujD,EAAA,gBAAAxV,GAAA,cAEA,OADAwY,EAAAvmD,GACA,IAAAmjD,EAAA1F,EAAAp9D,EAAA4nE,EAAAQ,EACA,CACA,WAAAtF,EAAA1F,EAAAz9C,EAAA3f,IAAA,CAAA2f,EAAAioD,MAAA,CAAAjoD,EAAAioD,MAAA,CAAAnsD,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAAuH,EAAA,UAAAkN,EAAAyoD,SAAA,CACA,CAKA,OAAAN,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAI,CACA,CACA,CACArlE,EAAA0hE,aAAqB,CAAAA,CAIrB,OAAAD,UAAAI,EAIAsF,OAAA,CAIAC,GAAA,aAIA/K,CAAA,CAAA1hD,CAAA,CAAA6rD,CAAA,CAAAW,CAAA,CAAAC,CAAA,EACA,MAAA/K,EAAA1hD,EAAA6rD,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAqlE,CAAA,GAChD,GAAA/N,EAAAlB,gBAAA,QAAiD8Q,QAAAA,EAAAC,IAAAA,CAAA,EACjD,CAIAxB,OAAAA,CAAA,EAEA,GADA,GAAArO,EAAA0F,MAAA,EAAA2I,MAAAA,GAAAA,YAAAA,EAAA,mEAA6I1I,UAAA,oBAC7I0I,SAAAA,EACA,OAAA11D,KAAAC,SAAA,EACAwK,KAAA,cACA0sD,gBAAA,KAAAF,OAAA,uBACAA,QAAA,KAAAA,OAAA,CACAC,IAAA,WAAAA,GAAA,MAAAA,GAAA,CAAApkE,KAAAA,EACAwjE,OAAA,KAAAA,MAAA,CAAAnsD,GAAA,IAAAnK,KAAAF,KAAA,CAAA/N,EAAA2jE,MAAA,CAAAA,IACA,GAEA,IAAA71D,EAAA,eAAsC+2D,EAAAlB,EAAA,KAAAY,MAAA,EAAgC,GAOtE,OANA,KAAAW,OAAA,EACAp3D,EAAAjL,IAAA,YAEA,WAAAsiE,GAAA,EACAr3D,EAAAjL,IAAA,KAA4B,KAAAsiE,GAAA,CAAAp9D,QAAA,GAAoB,GAEhD+F,EAAAq9C,IAAA,KACA,CAIA,OAAAtjD,KAAAyU,CAAA,EACA,GAAAkjD,EAAAiF,UAAA,CAAAnoD,GACA,OAAAA,EAEA,oBAAAA,EACA,IACA,OAAAkjD,EAAA33D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,MAAA3Q,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,yCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACAuB,EAAAhmD,EAAAujD,EAAA,kBACA,IAAA0E,EAAA7B,EAAApmD,GACA4oD,EAAA,EAAA5C,EAAAhmD,EAAAyjD,GAAA1V,GAAA,YACA8a,EAAAvC,EAAAtmD,GAEA,OADAumD,EAAAvmD,GACA,IAAAkjD,EAAAzF,EAAA,cAAAwK,EAAAW,EAAAC,EACA,CACA,WAAA3F,EAAAzF,EAAA,cAAAz9C,EAAAioD,MAAA,CAAAjoD,EAAAioD,MAAA,CAAAnsD,GAAA,CAAAy/C,EAAAhwD,IAAA,OAAAyU,EAAA4oD,OAAA,OAAA5oD,EAAA6oD,GAAA,CAAA7oD,EAAA6oD,GAAA,MACA,CAKA,OAAAV,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAK,CACA,CACA,CACAtlE,EAAAyhE,mBAA2B,CAAAA,CAI3B,OAAAD,UAAAK,EAIAsF,OAAA,aACA9K,CAAA,CAAAmK,CAAA,CAAAW,CAAA,EACA,MAAA9K,EAAA,WAAAmK,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAslE,CAAA,GAChD,GAAAhO,EAAAlB,gBAAA,QAAiD8Q,QAAAA,CAAA,EACjD,CAIAvB,OAAAA,CAAA,EACA,IAAAjrD,EAAA,SAAA6rD,MAAA,CAAAznE,MAAA,4BACA,SAAA6mE,EAEA11D,KAAAC,SAAA,EAAoCwK,KAAAA,EAAA0sD,gBADpC,KAAAF,OAAA,uBACoC,GAEpC,GAAkBxsD,EAAK,IAAI,KAAAwsD,OAAA,eAA+B,EAK1D,OAAAr9D,KAAAyU,CAAA,EACA,GAAAijD,EAAAkF,UAAA,CAAAnoD,GACA,OAAAA,EAEA,oBAAAA,EACA,IACA,OAAAijD,EAAA13D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,MAAA3Q,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,uCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACA,IAAAsE,EAAA/oD,EAAAvU,QAAA,GACAu9D,EAAAhpD,EAAAqlD,WAAA,CAAA9B,EAAA,yBAIA,GAHA,GAAAvK,EAAAiC,cAAA,EAAA+N,EAAA,yCAAAD,GAGA3sD,YAFA4D,EAAA8kD,UAAA,CAAAvB,EAAA,yBAEA,CACA,IAAA0E,EAAA7B,EAAApmD,GAIA,MAHA,GAAAg5C,EAAAiC,cAAA,EAAAgN,IAAAA,EAAAznE,MAAA,8CAAAynE,GACAjC,EAAAhmD,EAAAujD,EAAA,cACAgD,EAAAvmD,GACA,IAAAijD,EAAAxF,EAAA,MACA,CAGA,IAAAwK,EAAA7B,EAAApmD,EACAioD,CAAAA,EAAAznE,MAAA,CACA,GAAAw4D,EAAAiC,cAAA,EAAAgN,IAAAA,EAAAznE,MAAA,EAAAynE,UAAAA,CAAA,IAAA7rD,IAAA,wCAAA6rD,EAAAnsD,GAAA,IAAApY,EAAA2jE,MAAA,aAAAxY,IAAA,QAGAoZ,EAAA,CAAA1M,EAAAhwD,IAAA,WAEA,IAAA09D,EAAA/C,EAAAlmD,GAEA,GADA,GAAAg5C,EAAAiC,cAAA,EAAAgO,eAAAA,GAAAA,YAAAA,EAAA,qDAAAA,GACAjD,EAAAhmD,EAAAujD,EAAA,cAAAxV,GAAA,aACA,IAAAmb,EAAA9C,EAAApmD,GACA,GAAAg5C,EAAAiC,cAAA,EAAAiO,IAAAA,EAAA1oE,MAAA,EAAA0oE,UAAAA,CAAA,IAAA9sD,IAAA,0CAAA8sD,EAAAptD,GAAA,IAAApY,EAAA2jE,MAAA,aAAAxY,IAAA,OACA,CAEA,OADA0X,EAAAvmD,GACA,IAAAijD,EAAAxF,EAAAwK,EAAAgB,YAAAA,EACA,OACA,YAAAjpD,EAAA5D,IAAA,CACA,IAAA6mD,EAAAxF,EAAA,OAEAz9C,aAAAA,EAAA5D,IAAA,CAGA,IAAA6mD,EAAAxF,EAFA,CAAAlC,EAAAhwD,IAAA,WACAyU,YAAAA,EAAA8oD,eAAA,MAGA,GAAA9P,EAAAiC,cAAA,0CAAAj7C,EACA,CAKA,OAAAmoD,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAM,CACA,CACA,CACAvlE,EAAAwhE,gBAAwB,CAAAA,CAIxB,OAAAD,UAAAK,EAIA8F,QAAA,CAIAD,OAAA,CAKAJ,eAAA,CAIAF,OAAA,CAIAC,GAAA,aAIA/K,CAAA,CAAAz9D,CAAA,CAAAyoE,CAAA,CAAAb,CAAA,CAAAiB,CAAA,CAAAL,CAAA,EACA,MAAA/K,EAAA,WAAAz9D,EAAA4nE,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAulE,CAAA,GAChDiC,EAAA3nE,OAAA4gC,MAAA,CAAA+mC,EAAA33D,KAAA,IAGA,GAAAynD,EAAAlB,gBAAA,QAAiDqR,SAFjDL,SAAAA,GAAAA,SAAAA,EAEiDD,IAAAA,EAAAK,QAAAA,EAAAN,QADjDE,YAAAA,EACiDA,gBAAAA,CAAA,EACjD,CAIA,IAAAN,UAAA,CACA,SAAA5O,EAAA9pD,EAAA,OAAAu3D,MAAA,aAAAnF,SAAA,MACA,CAIAmF,OAAAA,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,WAEAA,SAAAA,EACA,OAAA11D,KAAAC,SAAA,EACAwK,KAAA,WACA/b,KAAA,KAAAA,IAAA,CACA8oE,SAAA,KAAAA,QAAA,CACAL,gBAAA,oBAAAA,eAAA,MAAAA,eAAA,CAAArkE,KAAAA,EACAmkE,QAAA,KAAAA,OAAA,CACAC,IAAA,WAAAA,GAAA,MAAAA,GAAA,CAAApkE,KAAAA,EACAwjE,OAAA,KAAAA,MAAA,CAAAnsD,GAAA,IAAAnK,KAAAF,KAAA,CAAA/N,EAAA2jE,MAAA,CAAAA,KACA6B,QAAA,KAAAA,OAAA,CAAAptD,GAAA,IAAAnK,KAAAF,KAAA,CAAAU,EAAAk1D,MAAA,CAAAA,IACA,GAEA,IAAA71D,EAAA,GAiBA,MAhBA,YAAA61D,GACA71D,EAAAjL,IAAA,aAEAiL,EAAAjL,IAAA,MAAAlG,IAAA,CAAAkoE,EAAAlB,EAAA,KAAAY,MAAA,GACA,YAAAZ,IACA,oBAAAyB,eAAA,EACAt3D,EAAAjL,IAAA,MAAAuiE,eAAA,EAEA,KAAAI,OAAA,OAAAA,OAAA,CAAA1oE,MAAA,GACAgR,EAAAjL,IAAA,YACAiL,EAAAjL,IAAA,CAAAgiE,EAAAlB,EAAA,KAAA6B,OAAA,IAEA,WAAAL,GAAA,EACAr3D,EAAAjL,IAAA,KAAgC,KAAAsiE,GAAA,CAAAp9D,QAAA,GAAoB,IAGpD+F,EAAAq9C,IAAA,KACA,CAIA,OAAAua,YAAA/oE,CAAA,CAAAkvD,CAAA,EAGA,OAAA+E,IADA0O,EAAAvF,EAAAp9D,EAAA,OADAkvD,EAAA,CAAAA,GAAA,IAAAzzC,GAAA,IAAAy/C,EAAAhwD,IAAA,CAAAuH,IACA,SACA01D,QAAA,CAKA,OAAAj9D,KAAAyU,CAAA,EACA,GAAAgjD,EAAAmF,UAAA,CAAAnoD,GACA,OAAAA,EAEA,oBAAAA,EACA,IACA,OAAAgjD,EAAAz3D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,MAAA3Q,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,uCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACA,IAAApkE,EAAAylE,EAAA,WAAA9lD,GACAioD,EAAA7B,EAAApmD,GACAipD,EAAA/C,EAAAlmD,GACAkpD,EAAA,GACAlD,EAAAhmD,EAAAujD,EAAA,cAAAxV,GAAA,aACAmb,CAAAA,EAAA9C,EAAApmD,EAAA,EAEA,IAAA6oD,EAAAvC,EAAAtmD,GAEA,OADAumD,EAAAvmD,GACA,IAAAgjD,EAAAvF,EAAAp9D,EAAA4oE,EAAAhB,EAAAiB,EAAAL,EACA,CACA,IAAAC,EAAA9oD,EAAA8oD,eAAA,CAmBA,OAjBA,MAAAA,IACAA,EAAA,UACA,kBAAA9oD,EAAAmpD,QAAA,EACAL,EAAA,OACA9oD,EAAAmpD,QAAA,GACAL,EAAA,UACA,kBAAA9oD,EAAA4oD,OAAA,EAAA5oD,EAAA4oD,OAAA,EACAE,CAAAA,EAAA,gBAIA,kBAAA9oD,EAAA4oD,OAAA,EAAA5oD,EAAA4oD,OAAA,EACAE,CAAAA,EAAA,eAKA,IAAA9F,EAAAvF,EAAAz9C,EAAA3f,IAAA,CAAAyoE,EAAA9oD,EAAAioD,MAAA,CAAAjoD,EAAAioD,MAAA,CAAAnsD,GAAA,CAAAy/C,EAAAhwD,IAAA,KAAAyU,EAAAkpD,OAAA,CAAAlpD,EAAAkpD,OAAA,CAAAptD,GAAA,CAAAy/C,EAAAhwD,IAAA,WAAAyU,EAAA6oD,GAAA,CAAA7oD,EAAA6oD,GAAA,MACA,CAKA,OAAAV,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAO,CACA,CACA,CACAxlE,EAAAuhE,gBAAwB,CAAAA,CAIxB,OAAAD,UAAAM,EAIAjjE,YAAA09D,CAAA,CAAAz9D,CAAA,CAAA4nE,CAAA,EACA,MAAAnK,EAAA,SAAAz9D,EAAA4nE,GACA1mE,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAAwlE,CAAA,EAChD,CAIAG,QAAA,CACA,oBACA,CAIA,OAAA97D,KAAAyU,CAAA,EACA,oBAAAA,EACA,IACA,OAAA+iD,EAAAx3D,IAAA,CAAAi6D,EAAAxlD,GACA,CACA,MAAA3Q,EAAA,CACA,GAAA2pD,EAAAiC,cAAA,qCAAAj7C,EACA,MAEA,GAAAA,aAAAykD,EAAA,CACA,IAAApkE,EAAAylE,EAAA,SAAA9lD,GACAioD,EAAA7B,EAAApmD,GAEA,OADAumD,EAAAvmD,GACA,IAAA+iD,EAAAtF,EAAAp9D,EAAA4nE,EACA,CACA,WAAAlF,EAAAtF,EAAAz9C,EAAA3f,IAAA,CAAA2f,EAAAioD,MAAA,CAAAjoD,EAAAioD,MAAA,CAAAnsD,GAAA,CAAAy/C,EAAAhwD,IAAA,KACA,CAMA,OAAA48D,WAAAzmE,CAAA,EACA,OAAAA,GAAAA,CAAA,CAAAglE,EAAA,GAAAQ,CACA,CACA,CACAzlE,EAAAshE,cAAsB,CAAAA,sCCtyCtBxhE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq/D,KAAa,CAAGr/D,EAAA47D,MAAc,CAAG57D,EAAA4nE,sBAA8B,CAAG5nE,EAAA6nE,cAAsB,CAAG7nE,EAAA8nE,gBAAwB,CAAG9nE,EAAA+nE,SAAiB,CAAG/nE,EAAAgoE,OAAe,CAAGhoE,EAAA27D,iBAAyB,CAAG37D,EAAAshE,cAAsB,CAAGthE,EAAA85D,SAAiB,CAAG95D,EAAA4hE,aAAqB,CAAG5hE,EAAAuhE,gBAAwB,CAAGvhE,EAAA6hE,QAAgB,CAAG7hE,EAAAwhE,gBAAwB,CAAGxhE,EAAA0hE,aAAqB,CAAG1hE,EAAA2hE,aAAqB,CAAG3hE,EAAAyhE,mBAA2B,CAAGzhE,EAAAq7D,mBAA2B,CAAGr7D,EAAAo7D,mBAA2B,CAAGp7D,EAAAs3D,QAAgB,QAEhe,IAAA2Q,EAAqBnkE,EAAQ,OAC7BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA82D,EAAA3Q,QAAA,IAClF,IAAA4Q,EAAmBpkE,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+2D,EAAA9M,mBAAA,IAC7Ft7D,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+2D,EAAA7M,mBAAA,IAC7F,IAAAnD,EAAqBp0D,EAAQ,OAC7BhE,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAuJ,mBAAA,IAC7F3hE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAyJ,aAAA,IACvF7hE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAwJ,aAAA,IACvF5hE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAsJ,gBAAA,IAC1F1hE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAA2J,QAAA,IAClF/hE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAqJ,gBAAA,IAC1FzhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAA0J,aAAA,IACvF9hE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAA4B,SAAA,IACnFh6D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+mD,EAAAoJ,cAAA,IACxF,IAAA6G,EAAqBrkE,EAAQ,OAC7BhE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAxM,iBAAA,IAC3F77D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAH,OAAA,IACjFloE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAJ,SAAA,IACnFjoE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAL,gBAAA,IAC1FhoE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAN,cAAA,IACxF/nE,OAAAC,cAAA,CAAAC,EAAA,yBAAyD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAP,sBAAA,IAChG9nE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAg3D,EAAAvM,MAAA,IAChF,IAAAuD,EAAiBr7D,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,QAAwC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAguD,EAAAE,KAAA,wCC1B/Ev/D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+nE,SAAiB,CAAG/nE,EAAAgoE,OAAe,CAAGhoE,EAAA8nE,gBAAwB,CAAG9nE,EAAA4nE,sBAA8B,CAAG5nE,EAAA6nE,cAAsB,CAAG7nE,EAAA47D,MAAc,CAAG57D,EAAA27D,iBAAyB,QACrK,IAAApE,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BmkE,EAAuBnkE,EAAQ,OAC/B0zD,EAA4B1zD,EAAQ,OACpChE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqmD,EAAAmE,iBAAA,IAC3F77D,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqmD,EAAAoE,MAAA,IAChF,IAAA1D,EAAuBp0D,EAAQ,OAC/Bq7D,EAAmBr7D,EAAQ,MAK3B,OAAA+jE,EAIAhV,QAAA,CAIAj0D,IAAA,CAIAy5C,SAAA,CAIA+vB,KAAA,CAIAxjC,IAAA,aAIAiuB,CAAA,CAAAuV,CAAA,CAAAxjC,CAAA,EACA,IAAAhmC,EAAAi0D,EAAAj0D,IAAA,CAAAy5C,EAAAwa,EAAA+S,MAAA,GACA,GAAAxN,EAAA/B,gBAAA,QACAxD,SAAAA,EAAAj0D,KAAAA,EAAAy5C,UAAAA,EAAA+vB,MAAAA,EAAAxjC,KAAAA,CACA,EACA,CACA,CACA5kC,EAAA6nE,cAAsB,CAAAA,CAMtB,OAAAD,EAIA/U,QAAA,CAIAj0D,IAAA,CAIAgmC,IAAA,CAIAyT,SAAA,CAIA0uB,QAAA,CAIA9mE,KAAA,aAIA4yD,CAAA,CAAAkU,CAAA,CAAAniC,CAAA,CAAA3kC,CAAA,EACA,IAAArB,EAAAi0D,EAAAj0D,IAAA,CAAAy5C,EAAAwa,EAAA+S,MAAA,GACA,GAAAxN,EAAA/B,gBAAA,QACAxD,SAAAA,EAAAj0D,KAAAA,EAAAgmC,KAAAA,EAAAyT,UAAAA,EAAA0uB,SAAAA,EAAA9mE,MAAAA,CACA,EACA,CACA,CACAD,EAAA4nE,sBAA8B,CAAAA,CAK9B,OAAAE,EAIAjV,QAAA,CAIAj0D,IAAA,CAIAgmC,IAAA,CAIAyT,SAAA,CAIA0uB,QAAA,aAIAlU,CAAA,CAAAkU,CAAA,CAAAniC,CAAA,EACA,IAAAhmC,EAAAi0D,EAAAj0D,IAAA,CAAAy5C,EAAAwa,EAAA+S,MAAA,GACA,GAAAxN,EAAA/B,gBAAA,QACAxD,SAAAA,EAAAj0D,KAAAA,EAAAgmC,KAAAA,EAAAyT,UAAAA,EAAA0uB,SAAAA,CACA,EACA,CACA,CACA/mE,EAAA8nE,gBAAwB,CAAAA,CAOxB,OAAAE,EAIA/oE,IAAA,CAIAopE,UAAA,QAMAC,UAAAroE,CAAA,EACA,QAAAA,CAAAA,GAAAA,EAAAooE,UAAA,CACA,CAIA1pE,YAAAM,CAAA,EACA,GAAAm5D,EAAA/B,gBAAA,QAAiDp3D,KAAAA,EAAAopE,WAAA,IACjD,CACA,CACAroE,EAAAgoE,OAAe,CAAAA,EAEf,IAAA3P,EAAA,CACA,kBACA,kBACA,yBACA,gCACA,mBACA,iDACA,2DACA,gDACA,mBACA,2BACA,EACAkQ,EAAA,CACA,cACAlwB,UAAA,gBACAz5C,KAAA,QACA4nE,OAAA,WACA3L,OAAA,GACA,+BAAkD3qD,KAAAC,SAAA,CAAAuoC,GAAwB,GAG1E,cACAL,UAAA,iBACAz5C,KAAA,QACA4nE,OAAA,YACA3L,OAAA,IACA,IAAAA,EAAA,qBAIA,OAHAzkC,GAAA,GAAAA,GAAA,KAAAiiC,CAAA,CAAAjiC,EAAApsB,QAAA,KACA6wD,CAAAA,EAAAxC,CAAA,CAAAjiC,EAAApsB,QAAA,KAEA,8BAAiDosB,EAAApsB,QAAA,OAAmB,EAAG6wD,EAAO,GAE9E,CACA,CAWA,OAAAkN,EAIAS,SAAA,CAIAC,MAAA,CAIAC,QAAA,CAIAC,OAAA,EACAj7D,CAAA,EACAk7D,CAAA,EACAC,CAAA,EAEAjO,CAAA,aAIA4N,CAAA,EACA,IAAAM,EAAA,GAEAA,EADA,iBAAAN,EACAt4D,KAAAF,KAAA,CAAAw4D,GAGAA,EAEA,MAAAK,CAAA,KAAAx4B,IACA,MAAA3iC,CAAA,KAAA2iC,IACA,MAAAu4B,CAAA,KAAAv4B,IAEA,IAAA04B,EAAA,GACA,QAAAtqE,KAAAqqE,EACA,IACAC,EAAAjkE,IAAA,CAAAozD,EAAA2J,QAAA,CAAA/3D,IAAA,CAAArL,GACA,CACA,MAAAmP,EAAA,CACAD,QAAAI,GAAA,+BAA0DmC,KAAAC,SAAA,CAAA1R,GAAkB,GAAAmP,EAAA8qC,OAAA,CAC5E,CAEA,GAAA0f,EAAA/B,gBAAA,QACAmS,UAAA1oE,OAAA4gC,MAAA,CAAAqoC,EACA,GACA,IAAAL,EAAA,KACAC,EAAA,EACA,OAAA/N,CAAA,MAAAoO,WAAA,GAEA,KAAAR,SAAA,CAAAt0D,OAAA,EAAA2+C,EAAAv4C,SACA2uD,EACA,OAAApW,EAAAl4C,IAAA,EACA,kBACA,QAAA8tD,MAAA,EACA96D,QAAAI,GAAA,uCACA,MACA,CAEA,GAAAqqD,EAAA/B,gBAAA,QAA6DoS,OAAA5V,CAAA,GAC7D,MACA,gBACAA,IAAAA,EAAA2T,MAAA,CAAAznE,MAAA,CACA4pE,EAAA,IAGA,GAAAvQ,EAAAoB,cAAA,GAAAkP,GAAA7V,EAAAsU,OAAA,GAAAuB,EAAAvB,OAAA,+CAA0J7sD,EAAM,GAAAu4C,GAEhK8V,EAAAD,CADAA,EAAA7V,CAAA,EACAsU,OAAA,EAEA,MACA,gBAGA8B,EAAA,MAAAJ,CAAA,CACA,KACA,aAEAI,EAAA,MAAAL,CAAA,CACA,KACA,aACAK,EAAA,MAAAv7D,CAAA,CACA,KACA,SACA,MACA,CAEA,IAAA2qC,EAAAwa,EAAA+S,MAAA,GACAqD,EAAA3c,GAAA,CAAAjU,IAGA4wB,EAAA3hE,GAAA,CAAA+wC,EAAAwa,EACA,GAEA,KAAA4V,MAAA,EACA,GAAArQ,EAAA/B,gBAAA,QACAoS,OAAAvQ,EAAAuJ,mBAAA,CAAA33D,IAAA,iBACA,GAEA,GAAAsuD,EAAA/B,gBAAA,QAAiDqS,SAAAA,EAAAC,QAAAA,CAAA,EACjD,CAMA/C,OAAAsD,CAAA,EACA,IAAAtD,EAAAsD,EAAA,iBAEA,OADA,KAAAV,SAAA,CAAAnuD,GAAA,IAAA0nB,EAAA6jC,MAAA,CAAAA,GAEA,CAKAuD,YAAA,CAGA,OAAAj5D,KAAAC,SAAA,CAAA24D,IAFA,CAAAN,SAAA,CAAAnuD,GAAA,IAAA0nB,EAAA6jC,MAAA,UAEAvrD,GAAA,IAAAnK,KAAAF,KAAA,CAAAhL,IACA,CAKAgkE,aAAA,CACA,OAAAf,EAAA3Q,QAAA,CAAAkD,eAAA,EACA,CAEA,CAAA4O,CAAA,CAAA/4D,CAAA,CAAA4pD,CAAA,CAAAoP,CAAA,EAEA,MAAAjR,EAAAkR,WAAA,EAAAj5D,GAAA,CACA,IAAA02D,EAAA12D,EAAAsB,WAAA,GACA,QAAAkhD,KAAA,MAAAgW,CAAA,CAAA5O,MAAA,GACA,GAAA8M,IAAAlU,EAAAkU,QAAA,CACA,OAAAlU,EAGA,WACA,CAEA,GAAAxiD,KAAAA,EAAA6d,OAAA,OACA,IAAAq7C,EAAA,GACA,QAAA3qE,EAAAi0D,EAAA,SAAAgW,CAAA,CACAjqE,EAAA0C,KAAA,WAAA+O,GACAk5D,EAAAzkE,IAAA,CAAA+tD,GAGA,GAAAoH,EAAA,CACA,IAAAuP,EAAA,EAAAzqE,MAAA,GAAAk7D,CAAA,CAAAA,EAAAl7D,MAAA,SACA0qE,EAAAxP,EAAAl7D,MAAA,CACA2qE,EAAA,GACAvK,EAAAE,KAAA,CAAAsK,OAAA,CAAAH,IAAAA,cAAAA,EAAA7uD,IAAA,GACA+uD,EAAA,GACAD,KAIA,QAAAxnE,EAAAsnE,EAAAxqE,MAAA,GAAkDkD,GAAA,EAAQA,IAAA,CAC1D,IAAAukE,EAAA+C,CAAA,CAAAtnE,EAAA,CAAAukE,MAAA,CAAAznE,MAAA,CACAynE,IAAAiD,GAAA,GAAAjD,IAAAiD,EAAA,GACAF,EAAAK,MAAA,CAAA3nE,EAAA,EAEA,CAEA,QAAAA,EAAAsnE,EAAAxqE,MAAA,GAAkDkD,GAAA,EAAQA,IAAA,CAC1D,IAAAukE,EAAA+C,CAAA,CAAAtnE,EAAA,CAAAukE,MAAA,CACA,QAAAxhE,EAAA,EAAoCA,EAAAi1D,EAAAl7D,MAAA,CAAmBiG,IAEvD,GAAAm6D,EAAAE,KAAA,CAAAsK,OAAA,CAAA1P,CAAA,CAAAj1D,EAAA,GAIA,GAAAA,GAAAwhE,EAAAznE,MAAA,EACA,GAAAk7D,cAAAA,CAAA,CAAAj1D,EAAA,CAAA2V,IAAA,CACA,SAEA4uD,EAAAK,MAAA,CAAA3nE,EAAA,GACA,KACA,CAEA,GAAAg4D,CAAA,CAAAj1D,EAAA,CAAA2V,IAAA,GAAA6rD,CAAA,CAAAxhE,EAAA,CAAAk0D,QAAA,EACAqQ,EAAAK,MAAA,CAAA3nE,EAAA,GACA,KACA,EAEA,CACA,CAGA,GAAAsnE,IAAAA,EAAAxqE,MAAA,EAAAk7D,GAAAA,EAAAl7D,MAAA,GAAAwqE,CAAA,IAAA/C,MAAA,CAAAznE,MAAA,EACA,IAAA8qE,EAAA5P,CAAA,CAAAA,EAAAl7D,MAAA,IACA8qE,CAAAA,MAAAA,GAAAhgE,MAAA8J,OAAA,CAAAk2D,IAAA,iBAAAA,CAAA,GACAN,EAAAK,MAAA,KAEA,CACA,GAAAL,IAAAA,EAAAxqE,MAAA,CACA,YAEA,GAAAwqE,EAAAxqE,MAAA,IAAAsqE,EAAA,CACA,IAAAS,EAAAP,EAAAlvD,GAAA,IAAAnK,KAAAC,SAAA,CAAAQ,EAAAi1D,MAAA,KAAAxY,IAAA,OACA,GAAAgL,EAAAoB,cAAA,qDAAsGsQ,EAAS,SAAAz5D,EAC/G,CACA,OAAAk5D,CAAA,WAIA,IADA,EAAAV,CAAA,CAAA13D,GAAA,CAAA+mD,EAAAqJ,gBAAA,CAAAz3D,IAAA,CAAAuG,GAAAu1D,MAAA,KAIA,IACA,CAKAmE,gBAAA15D,CAAA,EACA,IAAAwiD,EAAA,MAAAuW,CAAA,CAAA/4D,EAAA,SAEA,MADA,GAAA+nD,EAAAoB,cAAA,EAAA3G,EAAA,6BAAAxiD,GACAwiD,EAAAj0D,IAAA,CASAorE,YAAA35D,CAAA,EACA,cAAA+4D,CAAA,CAAA/4D,EAAA,QACA,CAWA+4D,YAAA/4D,CAAA,CAAA4pD,CAAA,EACA,aAAAmP,CAAA,CAAA/4D,EAAA4pD,GAAA,QACA,CAIAgQ,gBAAAv7C,CAAA,EACA,IAAA5M,EAAAjY,MAAAC,IAAA,OAAA++D,CAAA,CAAAlX,IAAA,IACA7vC,EAAArE,IAAA,EAAAhf,EAAAF,IAAAE,EAAAyrE,aAAA,CAAA3rE,IACA,QAAA0D,EAAA,EAAwBA,EAAA6f,EAAA/iB,MAAA,CAAkBkD,IAAA,CAC1C,IAAArD,EAAAkjB,CAAA,CAAA7f,EAAA,CACAysB,EAAA,MAAAm6C,CAAA,CAAA13D,GAAA,CAAAvS,GAAAqD,EACA,CACA,CAEA,CAAAkoE,CAAA,CAAA95D,CAAA,CAAA4pD,CAAA,CAAAoP,CAAA,EAEA,MAAAjR,EAAAkR,WAAA,EAAAj5D,GAAA,CACA,IAAA+5D,EAAA/5D,EAAAsB,WAAA,GACA,QAAAkhD,KAAA,MAAA+V,CAAA,CAAA3O,MAAA,GACA,GAAAmQ,IAAAvX,EAAAoU,SAAA,CACA,OAAApU,EAGA,WACA,CAEA,GAAAxiD,KAAAA,EAAA6d,OAAA,OACA,IAAAq7C,EAAA,GACA,QAAA3qE,EAAAi0D,EAAA,SAAA+V,CAAA,CACAhqE,EAAA0C,KAAA,WAAA+O,GACAk5D,EAAAzkE,IAAA,CAAA+tD,GAGA,GAAAoH,EAAA,CAEA,QAAAh4D,EAAAsnE,EAAAxqE,MAAA,GAAkDkD,GAAA,EAAQA,IAC1DsnE,CAAA,CAAAtnE,EAAA,CAAAukE,MAAA,CAAAznE,MAAA,CAAAk7D,EAAAl7D,MAAA,EACAwqE,EAAAK,MAAA,CAAA3nE,EAAA,GAIA,QAAAA,EAAAsnE,EAAAxqE,MAAA,GAAkDkD,GAAA,EAAQA,IAAA,CAC1D,IAAAukE,EAAA+C,CAAA,CAAAtnE,EAAA,CAAAukE,MAAA,CACA,QAAAxhE,EAAA,EAAoCA,EAAAi1D,EAAAl7D,MAAA,CAAmBiG,IAEvD,GAAAm6D,EAAAE,KAAA,CAAAsK,OAAA,CAAA1P,CAAA,CAAAj1D,EAAA,GAIAi1D,CAAA,CAAAj1D,EAAA,CAAA2V,IAAA,GAAA6rD,CAAA,CAAAxhE,EAAA,CAAAk0D,QAAA,EACAqQ,EAAAK,MAAA,CAAA3nE,EAAA,GACA,KACA,CAEA,CACA,CACA,GAAAsnE,IAAAA,EAAAxqE,MAAA,CACA,YAEA,GAAAwqE,EAAAxqE,MAAA,IAAAsqE,EAAA,CACA,IAAAS,EAAAP,EAAAlvD,GAAA,IAAAnK,KAAAC,SAAA,CAAAQ,EAAAi1D,MAAA,KAAAxY,IAAA,OACA,GAAAgL,EAAAoB,cAAA,kDAAmGsQ,EAAS,SAAAz5D,EAC5G,CACA,OAAAk5D,CAAA,WAIA,IADA,EAAAX,CAAA,CAAAz3D,GAAA,CAAA+mD,EAAAwJ,aAAA,CAAA53D,IAAA,CAAAuG,GAAAu1D,MAAA,KAIA,IACA,CAKAyE,aAAAh6D,CAAA,EACA,IAAAwiD,EAAA,MAAAsX,CAAA,CAAA95D,EAAA,SAEA,MADA,GAAA+nD,EAAAoB,cAAA,EAAA3G,EAAA,0BAAAxiD,GACAwiD,EAAAj0D,IAAA,CASA0rE,SAAAj6D,CAAA,EACA,cAAA85D,CAAA,CAAA95D,EAAA,QACA,CAWA85D,SAAA95D,CAAA,CAAA4pD,CAAA,EACA,aAAAkQ,CAAA,CAAA95D,EAAA4pD,GAAA,QACA,CAIAsQ,aAAA77C,CAAA,EACA,IAAA5M,EAAAjY,MAAAC,IAAA,OAAA8+D,CAAA,CAAAjX,IAAA,IACA7vC,EAAArE,IAAA,EAAAhf,EAAAF,IAAAE,EAAAyrE,aAAA,CAAA3rE,IACA,QAAA0D,EAAA,EAAwBA,EAAA6f,EAAA/iB,MAAA,CAAkBkD,IAAA,CAC1C,IAAArD,EAAAkjB,CAAA,CAAA7f,EAAA,CACAysB,EAAA,MAAAk6C,CAAA,CAAAz3D,GAAA,CAAAvS,GAAAqD,EACA,CACA,CAWAuoE,SAAAn6D,CAAA,CAAA4pD,CAAA,EACA,MAAA7B,EAAAkR,WAAA,EAAAj5D,GAAA,CACA,IAAA02D,EAAA12D,EAAAsB,WAAA,GACA,GAAA42D,CAAA,CAAAxB,EAAA,CACA,OAAA7O,EAAAyJ,aAAA,CAAA73D,IAAA,CAAAy+D,CAAA,CAAAxB,EAAA,CAAA1uB,SAAA,EAEA,QAAAwa,KAAA,MAAAnlD,CAAA,CAAAusD,MAAA,GACA,GAAA8M,IAAAlU,EAAAkU,QAAA,CACA,OAAAlU,EAGA,WACA,CAEA,GAAAxiD,KAAAA,EAAA6d,OAAA,OACA,IAAAq7C,EAAA,GACA,QAAA3qE,EAAAi0D,EAAA,SAAAnlD,CAAA,CACA9O,EAAA0C,KAAA,WAAA+O,GACAk5D,EAAAzkE,IAAA,CAAA+tD,GAGA,GAAA0W,IAAAA,EAAAxqE,MAAA,OACA,UAAAsR,EACA6nD,EAAAyJ,aAAA,CAAA73D,IAAA,wBAEAuG,UAAAA,EACA6nD,EAAAyJ,aAAA,CAAA73D,IAAA,yBAEA,KAEA,GAAAy/D,EAAAxqE,MAAA,IACA,IAAA+qE,EAAAP,EAAAlvD,GAAA,IAAAnK,KAAAC,SAAA,CAAAQ,EAAAi1D,MAAA,KAAAxY,IAAA,OACA,GAAAgL,EAAAoB,cAAA,0CAA2FsQ,EAAS,UAAAz5D,EACpG,CACA,OAAAk5D,CAAA,UAIA,kBADAl5D,CAAAA,EAAA6nD,EAAAyJ,aAAA,CAAA73D,IAAA,CAAAuG,GAAAu1D,MAAA,IAEA1N,EAAAyJ,aAAA,CAAA73D,IAAA,wBAEAuG,mBAAAA,EACA6nD,EAAAyJ,aAAA,CAAA73D,IAAA,yBAGA,IADA,EAAA4D,CAAA,CAAAyD,GAAA,CAAAd,IAIA,IACA,CAIAo6D,aAAA/7C,CAAA,EACA,IAAA5M,EAAAjY,MAAAC,IAAA,OAAA4D,CAAA,CAAAikD,IAAA,IACA7vC,EAAArE,IAAA,EAAAhf,EAAAF,IAAAE,EAAAyrE,aAAA,CAAA3rE,IACA,QAAA0D,EAAA,EAAwBA,EAAA6f,EAAA/iB,MAAA,CAAkBkD,IAAA,CAC1C,IAAArD,EAAAkjB,CAAA,CAAA7f,EAAA,CACAysB,EAAA,MAAAhhB,CAAA,CAAAyD,GAAA,CAAAvS,GAAAqD,EACA,CACA,CA6BAyoE,cAAA5c,CAAA,CAAAhnD,CAAA,EACA,aAAA8zD,CAAA,CAAAtlD,MAAA,CAAAw4C,EAAAhnD,EACA,CACA6jE,cAAA7c,CAAA,CAAAmM,CAAA,EACA,aAAAW,CAAA,CAAA/uD,MAAA,CAAAiiD,EAAAmM,EACA,CAKA2Q,aAAA3Q,CAAA,EACA,YAAA0Q,aAAA,MAAAlC,MAAA,CAAAjC,MAAA,CAAAvM,GAAA,GACA,CAUA4Q,kBAAAhY,CAAA,CAAA/rD,CAAA,EACA,oBAAA+rD,EAAA,CACA,IAAA9wB,EAAA,KAAAyoC,QAAA,CAAA3X,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,2BAAA8wB,GACAA,EAAA9wB,CACA,CAEA,MADA,GAAAq2B,EAAAoB,cAAA,KAAApB,EAAA0S,SAAA,EAAAhkE,EAAA,OAAA+rD,EAAAkU,QAAA,wCAA2IlU,EAAAj0D,IAAA,CAAc,UAAAkI,GACzJ,KAAA4jE,aAAA,CAAA7X,EAAA2T,MAAA,IAAApO,EAAA0S,SAAA,EAAAhkE,EAAA,GACA,CASAikE,kBAAAlY,CAAA,CAAAoH,CAAA,EACA,oBAAApH,EAAA,CACA,IAAA9wB,EAAA,KAAAyoC,QAAA,CAAA3X,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,2BAAA8wB,GACAA,EAAA9wB,CACA,CACA,SAAAq2B,EAAApN,MAAA,GACA6H,EAAAkU,QAAA,CACA,KAAA4D,aAAA,CAAA9X,EAAA2T,MAAA,CAAAvM,GAAA,IACA,CACA,CASA+Q,mBAAAnY,CAAA,CAAA/rD,CAAA,EACA,oBAAA+rD,EAAA,CACA,IAAA9wB,EAAA,KAAAqnC,WAAA,CAAAvW,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,8BAAA8wB,GACAA,EAAA9wB,CACA,CAEA,MADA,GAAAq2B,EAAAoB,cAAA,KAAApB,EAAA0S,SAAA,EAAAhkE,EAAA,OAAA+rD,EAAAkU,QAAA,2CAA8IlU,EAAAj0D,IAAA,CAAc,UAAAkI,GAC5J,KAAA4jE,aAAA,CAAA7X,EAAA2T,MAAA,IAAApO,EAAA0S,SAAA,EAAAhkE,EAAA,GACA,CAMAmkE,mBAAApY,CAAA,CAAAoH,CAAA,EACA,oBAAApH,EAAA,CACA,IAAA9wB,EAAA,KAAAqnC,WAAA,CAAAvW,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,8BAAA8wB,GACAA,EAAA9wB,CACA,CACA,SAAAq2B,EAAApN,MAAA,GACA6H,EAAAkU,QAAA,CACA,KAAA4D,aAAA,CAAA9X,EAAA2T,MAAA,CAAAvM,GAAA,IACA,CACA,CAUAiR,qBAAArY,CAAA,CAAA/rD,CAAA,EACA,oBAAA+rD,EAAA,CACA,IAAA9wB,EAAA,KAAAqnC,WAAA,CAAAvW,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,8BAAA8wB,GACAA,EAAA9wB,CACA,CACA,IAAA2W,EAAA,iCACA75C,EAAA,GAAAu5D,EAAAkF,YAAA,EAAAx2D,GACA,KAAA/H,MAAA,OACA,IACA,aAAA67D,CAAA,CAAAtlD,MAAA,CAAAu9C,EAAA4U,OAAA,CAAA5oE,EACA,CACA,MAAA+O,EAAA,CACA8qC,EAAA,8BACA,CAGA,GAAA0f,EAAA6E,MAAA,KAAAvkB,EAAA,YACAz4C,MAAA,GAAAm4D,EAAA4C,OAAA,EAAAn8D,GACA2/D,KAAA,CAAoB2M,OAAAtY,EAAAj0D,IAAA,CAAAy5C,UAAAwa,EAAA+S,MAAA,GACpB,EACA,CACA1K,UAAAkQ,CAAA,CAAAzQ,CAAA,EACA,IAAA7zD,EAAA,GAAAsxD,EAAA2C,QAAA,EAAAqQ,EAAA,QACAx9D,EAAAq6D,EAAA3Q,QAAA,CAAAmD,uBAAA,QAAAE,EAAA7zD,GAGA,GAAA8G,EAAA8qC,OAAA,CAAA6tB,UAAA,CADA,6CACA,CACA,IAAAQ,EAAA,GAAA3O,EAAA4C,OAAA,EAAAl0D,EAAAgJ,KAAA,OACAu7D,EAAA,KAAAb,QAAA,CAAAzD,GACA,GAAAsE,EACA,IACA,IAAAzmC,EAAA,MAAAg2B,CAAA,CAAAtlD,MAAA,CAAA+1D,EAAA7E,MAAA,CAAA1/D,EAAAgJ,KAAA,IACAlC,CAAAA,EAAAktD,MAAA,EACAl8D,KAAAysE,EAAAzsE,IAAA,CAAAy5C,UAAAgzB,EAAAzF,MAAA,GAAAhhC,KAAAA,CACA,EACAh3B,EAAAitD,MAAA,CAAAjtD,EAAAktD,MAAA,CAAAziB,SAAA,CACAzqC,EAAA8qC,OAAA,wBAA2D9qC,EAAAitD,MAAA,CAAa,EAExE,MAAAt1B,EAAA,CACA33B,EAAA8qC,OAAA,qDACA,CAEA,CAEA,IAAA3mC,EAAA,KAAAu5D,gBAAA,CAAA3Q,GAQA,OAPA5oD,GACAnE,CAAAA,EAAAutD,UAAA,EACAgQ,OAAAp5D,EAAAnT,IAAA,CACAy5C,UAAAtmC,EAAAsmC,SAAA,CACAzT,KAAA7yB,EAAA6yB,IAAA,CACA,EAEAh3B,CACA,CASA29D,qBAAA1Y,CAAA,CAAAoH,CAAA,EACA,oBAAApH,EAAA,CACA,IAAA9wB,EAAA,KAAAqnC,WAAA,CAAAvW,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,8BAAA8wB,GACAA,EAAA9wB,CACA,CACA,SAAAq2B,EAAA4C,OAAA,QAAAJ,CAAA,CAAA/uD,MAAA,CAAAgnD,EAAA4U,OAAA,CAAAxN,GAAA,IACA,CAgCAuR,mBAAA3Y,CAAA,CAAAoH,CAAA,EACA,oBAAApH,EAAA,CACA,IAAA9wB,EAAA,KAAAooC,QAAA,CAAAtX,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,gCAAA8wB,GACAA,EAAA9wB,CACA,CACA,GAAAq2B,EAAA6E,MAAA,EAAAhD,EAAAl7D,MAAA,EAAA8zD,EAAA2T,MAAA,CAAAznE,MAAA,2BAAkG8zD,EAAA+S,MAAA,GAAkB,yBAA4BjmD,MAAAs6C,EAAAl7D,MAAA,CAAA0sE,cAAA5Y,EAAA2T,MAAA,CAAAznE,MAAA,GAChJ,IAAA2sE,EAAA,GACA7Y,EAAAmU,SAAA,EACA0E,EAAA5mE,IAAA,CAAA+tD,EAAAoU,SAAA,EAGA,IAAA0E,EAAA,CAAA9e,EAAA5sD,IACA,WAAA4sD,EAAAlyC,IAAA,CACA,GAAAw9C,EAAA9pD,EAAA,EAAApO,GAEA4sD,UAAAA,EAAAlyC,IAAA,CACA,GAAA48C,EAAAqU,SAAA,KAAAxT,EAAA4C,OAAA,EAAA/6D,KAEA4sD,SAAAA,EAAAlyC,IAAA,oBAAA1a,EACAA,EAAAA,EAAA,cAEA4sD,EAAAlyC,IAAA,CAAAsd,KAAA,WACAh4B,EAAA,GAAAm4D,EAAAmH,OAAA,EAAAt/D,GAEA4sD,EAAAlyC,IAAA,CAAAsd,KAAA,WACAh4B,EAAA,GAAAm4D,EAAAmD,YAAA,EAAAt7D,EAAA,IAEA,YAAA4sD,EAAAlyC,IAAA,EAEA,MAAAigD,CAAA,CAAA/uD,MAAA,cAAA5L,EAAA,EAEA,GAAAm4D,EAAAyT,YAAA,KAAAzT,EAAA4C,OAAA,EAAA/6D,GAAA,KAsBA,IApBAg6D,EAAA/lD,OAAA,EAAAjU,EAAAqa,KACA,IAAAuyC,EAAAgG,EAAA2T,MAAA,CAAAlsD,EAAA,CACA,IAAAuyC,EAAA6Y,OAAA,EACA,GAAAtN,EAAAoB,cAAA,EAAAv5D,MAAAA,EAAA,qDAAqG,YAAA4sD,EAAAjuD,IAAA,CAAAqB,GACrG,MACA,CACAA,MAAAA,EACAyrE,EAAA5mE,IAAA,OAEA+nD,UAAAA,EAAAqM,QAAA,EAAArM,UAAAA,EAAAqM,QAAA,CACA,GAAAd,EAAAoB,cAAA,iEAAA3M,EAAAjuD,IAAA,CAAAqB,GAEA4J,MAAA8J,OAAA,CAAA1T,GACAyrE,EAAA5mE,IAAA,CAAA7E,EAAAoa,GAAA,IAAAsxD,EAAA9e,EAAA5sD,KAGAyrE,EAAA5mE,IAAA,CAAA6mE,EAAA9e,EAAA5sD,GAEA,GAEAyrE,EAAA3sE,MAAA,EAAA2sE,OAAAA,CAAA,CAAAA,EAAA3sE,MAAA,KACA2sE,EAAA/oD,GAAA,GAEA,OAAA+oD,CACA,CACAI,eAAAjZ,CAAA,CAAAoH,CAAA,EACA,oBAAApH,EAAA,CACA,IAAA9wB,EAAA,KAAAooC,QAAA,CAAAtX,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,gCAAA8wB,GACAA,EAAA9wB,CACA,CACA,IAAA2pC,EAAA,GACAK,EAAA,GACAC,EAAA,GA2BA,OA1BAnZ,EAAAmU,SAAA,EACA0E,EAAA5mE,IAAA,CAAA+tD,EAAAoU,SAAA,EAEA,GAAA7O,EAAAoB,cAAA,EAAAS,EAAAl7D,MAAA,GAAA8zD,EAAA2T,MAAA,CAAAznE,MAAA,4CAAAk7D,GACApH,EAAA2T,MAAA,CAAAtyD,OAAA,EAAA24C,EAAAvyC,KACA,IAAAra,EAAAg6D,CAAA,CAAA3/C,EAAA,CACA,GAAAuyC,EAAA6Y,OAAA,EACA,GAAA7Y,WAAAA,EAAAlyC,IAAA,CACA+wD,EAAA5mE,IAAA,IAAAqzD,EAAA9pD,EAAA,EAAApO,SAEA,GAAA4sD,UAAAA,EAAAlyC,IAAA,CACA+wD,EAAA5mE,IAAA,IAAAyyD,EAAAqU,SAAA,EAAA3rE,SAEA,GAAA4sD,UAAAA,EAAAqM,QAAA,EAAArM,UAAAA,EAAAqM,QAAA,CAEA,oCAGAwS,EAAA5mE,IAAA,OAAA81D,CAAA,CAAA/uD,MAAA,EAAAghD,EAAAlyC,IAAA,GAAA1a,EAAA,QAIA8rE,EAAAjnE,IAAA,CAAA+nD,GACAmf,EAAAlnE,IAAA,CAAA7E,EAEA,GACA,CACA6G,KAAA,MAAA8zD,CAAA,CAAA/uD,MAAA,CAAAkgE,EAAAC,GACAN,OAAAA,CACA,CACA,CAEAO,eAAApZ,CAAA,CAAA/rD,CAAA,CAAA4kE,CAAA,EACA,oBAAA7Y,EAAA,CACA,IAAA9wB,EAAA,KAAAooC,QAAA,CAAAtX,GACA,GAAAuF,EAAAoB,cAAA,EAAAz3B,EAAA,gCAAA8wB,GACAA,EAAA9wB,CACA,CACA,GAAA2pC,MAAAA,GAAA,CAAA7Y,EAAAmU,SAAA,EACA,IAAAoD,EAAAvX,EAAAoU,SAAA,CACA,GAAA7O,EAAAoB,cAAA,KAAApB,EAAAkR,WAAA,EAAAoC,CAAA,SAAAA,CAAA,IAAA/5D,WAAA,KAAAy4D,EAAA,sCAAAsB,CAAA,KACAA,EAAAA,EAAA57D,KAAA,GACA,CACA,IAAA41D,EAAA,GACAwG,EAAA,GACAxO,EAAA,GACA7K,EAAA2T,MAAA,CAAAtyD,OAAA,EAAA24C,EAAAvyC,KACAuyC,EAAA6Y,OAAA,CACA7Y,WAAAA,EAAAlyC,IAAA,EAAAkyC,UAAAA,EAAAlyC,IAAA,EAAAkyC,UAAAA,EAAAqM,QAAA,EAAArM,UAAAA,EAAAqM,QAAA,EACAwM,EAAA5gE,IAAA,CAAAozD,EAAA4B,SAAA,CAAAhwD,IAAA,EAAiE6Q,KAAA,UAAA/b,KAAAiuD,EAAAjuD,IAAA,IACjE8+D,EAAA54D,IAAA,OAGA4gE,EAAA5gE,IAAA,CAAA+nD,GACA6Q,EAAA54D,IAAA,OAIAonE,EAAApnE,IAAA,CAAA+nD,GACA6Q,EAAA54D,IAAA,KAEA,GACA,IAAAqnE,EAAA,MAAAT,EAAA,MAAA9Q,CAAA,CAAAtlD,MAAA,CAAAowD,EAAA,GAAAtN,EAAApN,MAAA,EAAA0gB,IAAA,KACAU,EAAA,MAAAxR,CAAA,CAAAtlD,MAAA,CAAA42D,EAAAplE,EAAA,IAEAmzD,EAAA,GACAtI,EAAA,GACA0a,EAAA,EAAAC,EAAA,EA8BA,OA7BAzZ,EAAA2T,MAAA,CAAAtyD,OAAA,EAAA24C,EAAAvyC,KACA,IAAAra,EAAA,KACA,GAAA4sD,EAAA6Y,OAAA,EACA,GAAAyG,MAAAA,EACAlsE,EAAA,IAAA+nE,EAAA,WAEA,GAAAtK,CAAA,CAAApjD,EAAA,CACAra,EAAA,IAAA+nE,EAAAmE,CAAA,CAAAG,IAAA,OAGA,IACArsE,EAAAksE,CAAA,CAAAG,IAAA,CAEA,MAAA1+D,EAAA,CACA3N,EAAA2N,CACA,OAIA,IACA3N,EAAAmsE,CAAA,CAAAC,IAAA,CAEA,MAAAz+D,EAAA,CACA3N,EAAA2N,CACA,CAEAqsD,EAAAn1D,IAAA,CAAA7E,GACA0xD,EAAA7sD,IAAA,CAAA+nD,EAAAjuD,IAAA,OACA,GACA44D,EAAAoE,MAAA,CAAAwB,SAAA,CAAAnD,EAAAtI,EACA,CAOA2Z,iBAAA3Q,CAAA,EACA,IAAA7zD,EAAA,GAAAsxD,EAAA2C,QAAA,EAAAJ,EAAA7zD,IAAA,YACA7G,EAAA,GAAAm4D,EAAA2I,SAAA,QAAApG,EAAA16D,KAAA,CAAA06D,EAAA16D,KAAA,eACA4yD,EAAA,KAAAuW,WAAA,IAAAhR,EAAA4C,OAAA,EAAAl0D,EAAAgJ,KAAA,QACA,IAAA+iD,EACA,YAEA,IAAAjuB,EAAA,MAAAg2B,CAAA,CAAAtlD,MAAA,CAAAu9C,EAAA2T,MAAA,CAAA1/D,EAAAgJ,KAAA,KACA,WAAA83D,EAAA/U,EAAAA,EAAAkU,QAAA,CAAAniC,EAAA3kC,EACA,CACAssE,gBAAAzlE,CAAA,EACA,oBACA,CAOA0lE,SAAAz+D,CAAA,EACA,IAAA8kD,EAAA,KAAAsX,QAAA,CAAAp8D,EAAA29D,MAAA,WACA,CAAA7Y,GAAAA,EAAAmU,SAAA,CACA,KAKA,IAAAa,EAAAhV,EAAAA,EAAAoU,SAAA,MAAAgF,cAAA,CAAApZ,EAAA9kD,EAAAjH,IAAA,CAAAiH,EAAA29D,MAAA,EACA,CAOAe,WAAA3lE,CAAA,EACA,IAAA4lE,EAAA,GAAAtU,EAAA4C,OAAA,EAAAl0D,GACA+rD,EAAA,KAAA2X,QAAA,IAAApS,EAAA0S,SAAA,EAAA4B,EAAA,MACA,IAAA7Z,EACA,YAEA,IAAAjuB,EAAA,MAAAg2B,CAAA,CAAAtlD,MAAA,CAAAu9C,EAAA2T,MAAA,IAAApO,EAAA0S,SAAA,EAAA4B,EAAA,IACA,WAAA5E,EAAAjV,EAAAA,EAAAkU,QAAA,CAAAniC,EACA,CAOA,OAAA96B,KAAA7J,CAAA,SAEA,aAAA8nE,EACA9nE,MAIA8nE,EADA,iBAAA9nE,EACAiQ,KAAAF,KAAA,CAAA/P,GAGA,mBAAAA,EAAAkpE,UAAA,CACAlpE,EAAAkpE,UAAA,GAGA,mBAAAlpE,EAAA2lE,MAAA,CACA3lE,EAAA2lE,MAAA,SAGA3lE,EACA,CACA,CACAD,EAAA+nE,SAAiB,CAAAA,sCCrkCjBjoE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq/D,KAAa,QACb,IAAA9H,EAAmBzzD,EAAQ,OAC3B6oE,EAAA,GACA,SAAAxuE,EAAA8B,CAAA,CAAA2sE,CAAA,EACA,IAAA9L,EAAA,GAMA,OALA8L,EAAA,IACA9L,EAAA,GACA8L,GAAA,IAGA,IAAAvN,EAAAsN,EAAA,GAAgC7L,EAAA,OAAkB,KAAK8L,EAAM,EAAA3sE,EAAA,CAAY6gE,OAAAA,EAAA8L,MAAAA,CAAA,EACzE,CACA,SAAAruE,EAAA0B,CAAA,CAAA4vB,CAAA,EAEA,WAAAwvC,EAAAsN,EAAA,QAAqC,MAAmB,EAAA1sE,EAAA,CAAY4vB,KAAAA,CAAA,EACpE,CACA,IAAAg9C,EAAAliB,OAAAua,GAAA,iBAIA,OAAA7F,EAIA1kD,IAAA,CAIA1a,KAAA,EACA8kC,CAAA,CAIA8nC,YAAA,aAIAC,CAAA,CAAAnyD,CAAA,CAAA1a,CAAA,CAAA8kC,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,MAEA,GAAAwyB,EAAAoO,aAAA,EAAAgH,EAAAG,EAAA,SACA,GAAAvV,EAAAlB,gBAAA,QAAiDwW,aAAAA,EAAAlyD,KAAAA,EAAA1a,MAAAA,CAAA,GACjD,MAAA8kC,CAAA,CAAAA,EAEA,KAAA6gC,MAAA,EACA,CAIAA,QAAA,CACA,kBAAAjrD,IAAA,EAGA,sBAAAA,IAAA,CAFA,sBAKA,eAAAA,IAAA,CACA,SAA4B,KAAA1a,KAAA,CAAAoa,GAAA,IAAAkuB,EAAAq9B,MAAA,IAAAxY,IAAA,MAA4C,GAExE,KAAAzyC,IAAA,CAKAq/C,cAAA,CACA,QACA,CAIA+S,UAAA,CACA,QACA,CAIAC,UAAA,CACA,QACA,CAIAC,UAAA,CACA,aAAAtyD,IAAA,CAAAsd,KAAA,iBACA,CAIAi1C,QAAA,CACA,YAAAvyD,IAAA,CAAA4rD,UAAA,SACA,CAIA4G,UAAA,CACA,sBAAAxyD,IAAA,CAKA,IAAAyyD,WAAA,CACA,kBAAAzyD,IAAA,CACA,MAAA0yD,UAAA,eAEA,aAAAtoC,CAAA,CAWA,IAAA+zB,aAAA,CACA,kBAAAn+C,IAAA,CACA,MAAA0yD,UAAA,sBAEA,WAAAtoC,CAAA,CACA,GAEA,WAAAA,CAAA,CACA,KAAA9kC,KAAA,CAAAlB,MAAA,CAEA,IACA,CAIA,OAAA+K,KAAA6Q,CAAA,CAAA1a,CAAA,EACA,WAAAo/D,EAAAsN,EAAAhyD,EAAA1a,EACA,CAIA,OAAAsqB,MAAAge,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,GAItB,OAAA+kC,OAAA/kC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAglC,OAAAhlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAilC,OAAAjlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAklC,OAAAllC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAmlC,OAAAnlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAolC,OAAAplC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAqlC,OAAArlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAslC,OAAAtlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAulC,OAAAvlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAwlC,OAAAxlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAAylC,OAAAzlC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,IAIvB,OAAA0lC,QAAA1lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA2lC,QAAA3lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA4lC,QAAA5lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA6lC,QAAA7lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA8lC,QAAA9lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA+lC,QAAA/lC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAgmC,QAAAhmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAimC,QAAAjmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAkmC,QAAAlmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAmmC,QAAAnmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAomC,QAAApmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAqmC,QAAArmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAsmC,QAAAtmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAumC,QAAAvmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAwmC,QAAAxmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAAymC,QAAAzmC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA0mC,QAAA1mC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA2mC,QAAA3mC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA4mC,QAAA5mC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA6mC,QAAA7mC,CAAA,EAAwB,OAAApqC,EAAAoqC,EAAA,KAIxB,OAAA8mC,KAAA9mC,CAAA,EAAqB,OAAApqC,EAAAoqC,EAAA,KAIrB,OAAA+mC,KAAA/mC,CAAA,EAAqB,OAAApqC,EAAAoqC,EAAA,IAIrB,OAAAgnC,MAAAhnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAinC,MAAAjnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAknC,MAAAlnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAmnC,MAAAnnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAonC,MAAApnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAqnC,MAAArnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAsnC,MAAAtnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAunC,MAAAvnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAwnC,MAAAxnC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAAynC,MAAAznC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAA0nC,MAAA1nC,CAAA,EAAsB,OAAApqC,EAAAoqC,EAAA,KAItB,OAAA2nC,OAAA3nC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA4nC,OAAA5nC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA6nC,OAAA7nC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA8nC,OAAA9nC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA+nC,OAAA/nC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAgoC,OAAAhoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAioC,OAAAjoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAkoC,OAAAloC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAmoC,OAAAnoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAooC,OAAApoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAqoC,OAAAroC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAsoC,OAAAtoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAuoC,OAAAvoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAwoC,OAAAxoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAAyoC,OAAAzoC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA0oC,OAAA1oC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA2oC,OAAA3oC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA4oC,OAAA5oC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA6oC,OAAA7oC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA8oC,OAAA9oC,CAAA,EAAuB,OAAApqC,EAAAoqC,EAAA,MAIvB,OAAA+oC,IAAA/oC,CAAA,EAAoB,OAAApqC,EAAAoqC,EAAA,MAIpB,OAAAgpC,OAAAhpC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAA3c,OAAA2c,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAzc,OAAAyc,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAvc,OAAAuc,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAipC,OAAAjpC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAkpC,OAAAlpC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAmpC,OAAAnpC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAopC,OAAAppC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAqpC,OAAArpC,CAAA,EAAuB,OAAAhqC,EAAAgqC,EAAA,GAIvB,OAAAspC,QAAAtpC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAupC,QAAAvpC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAwpC,QAAAxpC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAypC,QAAAzpC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA0pC,QAAA1pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA2pC,QAAA3pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA4pC,QAAA5pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA6pC,QAAA7pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA8pC,QAAA9pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA+pC,QAAA/pC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAgqC,QAAAhqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAiqC,QAAAjqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAkqC,QAAAlqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAmqC,QAAAnqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAoqC,QAAApqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAqqC,QAAArqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAsqC,QAAAtqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAuqC,QAAAvqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAwqC,QAAAxqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAyqC,QAAAzqC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA0qC,QAAA1qC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA2qC,QAAA3qC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAA4qC,QAAA5qC,CAAA,EAAwB,OAAAhqC,EAAAgqC,EAAA,IAIxB,OAAAr5B,QAAAq5B,CAAA,EAAwB,WAAA82B,EAAAsN,EAAA,UAAApkC,EAAA,CAIxB,OAAAjqC,KAAAiqC,CAAA,EAAqB,WAAA82B,EAAAsN,EAAA,SAAApkC,EAAA,CAIrB,OAAA1pC,MAAA0pC,CAAA,EAAsB,WAAA82B,EAAAsN,EAAA,QAAApkC,EAAA,CAItB,OAAAjrB,OAAAirB,CAAA,EAAuB,WAAA82B,EAAAsN,EAAA,SAAApkC,EAAA,CAIvB,OAAAz9B,MAAAy9B,CAAA,CAAAm1B,CAAA,EACA,kCAEA,CAIA,OAAA0V,MAAA7qC,CAAA,CAAA3pC,CAAA,EACA,kCAEA,CAIA,OAAAy0E,UAAA9qC,CAAA,EACA,WAAA82B,EAAAsN,EAAA,YAAA7sE,OAAAwM,MAAA,IAA8Di8B,GAC9D,CAIA,OAAAohC,QAAA1pE,CAAA,EACA,OAAAA,GACA,iBAAAA,GACA,iBAAAA,GACAA,EAAA4sE,YAAA,GAAAA,CACA,CAQA,OAAAvN,YAAAr/D,CAAA,CAAA0a,CAAA,EACA,GAAA0kD,EAAAsK,OAAA,CAAA1pE,GAAA,CACA,GAAAA,EAAA0a,IAAA,GAAAA,EACA,sCAA0DA,EAAK,QAAQ1a,EAAA0a,IAAA,CAAW,GAElF,OAAA1a,EAAAA,KAAA,CAEA,OAAAA,CACA,CACA,CACAD,EAAAq/D,KAAa,CAAAA,sCC3lBbv/D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAszE,cAAsB,CAAGtzE,EAAA8vD,UAAkB,QAC3C,IAAAyH,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B68D,EAAAl/D,OAAA,GACA8xE,EAAA9xE,OAAA,IACA,SAAA+xE,EAAAtkE,CAAA,EAKA,IAAAT,EAAAS,CADAA,EAAAA,EAAAyC,WAAA,IACA8uD,SAAA,IAAAn/D,KAAA,KACAmyE,EAAA,IAAA/0E,WAAA,IACA,QAAAuD,EAAA,EAAoBA,EAAA,GAAQA,IAC5BwxE,CAAA,CAAAxxE,EAAA,CAAAwM,CAAA,CAAAxM,EAAA,CAAAiJ,UAAA,IAEA,IAAAwoE,EAAA,GAAAvb,EAAA4C,QAAA,KAAAxD,EAAAqU,SAAA,EAAA6H,IACA,QAAAxxE,EAAA,EAAoBA,EAAA,GAAQA,GAAA,EAC5ByxE,CAAA,CAAAzxE,GAAA,UACAwM,CAAAA,CAAA,CAAAxM,EAAA,CAAAwM,CAAA,CAAAxM,EAAA,CAAA6P,WAAA,IAEA4hE,CAAAA,GAAAA,CAAA,CAAAzxE,GAAA,QACAwM,CAAAA,CAAA,CAAAxM,EAAA,GAAAwM,CAAA,CAAAxM,EAAA,GAAA6P,WAAA,IAGA,WAAArD,EAAA2+C,IAAA,IACA,CAGA,IAAAumB,EAAA,GACA,QAAA1xE,EAAA,EAAgBA,EAAA,GAAQA,IACxB0xE,CAAA,CAAA9/D,OAAA5R,GAAA,CAAA4R,OAAA5R,GAEA,QAAAA,EAAA,EAAgBA,EAAA,GAAQA,IACxB0xE,CAAA,CAAA9/D,OAAAC,YAAA,IAAA7R,GAAA,CAAA4R,OAAA,GAAA5R,GAKA,SAAA2xE,EAAA1kE,CAAA,EAGA,IAAAukE,EAAAvkE,CADAA,EAAAA,CADAA,EAAAA,EAAA4C,WAAA,IACA2uD,SAAA,IAAAvxD,EAAAuxD,SAAA,YACAn/D,KAAA,KAAA+Y,GAAA,IAAkDs5D,CAAA,CAAA9oD,EAAA,EAAuBuiC,IAAA,KAEzE,KAAAqmB,EAAA10E,MAAA,EANA,IAMA,CACA,IAAA+2D,EAAA2d,EAAAhT,SAAA,GAPA,IAQAgT,EAAA5hE,SAAAikD,EAAA,OAAA2d,EAAAhT,SAAA,CAAA3K,EAAA/2D,MAAA,CACA,CACA,IAAA80E,EAAAhgE,OAAA,GAAAhC,SAAA4hE,EAAA,QACA,KAAAI,EAAA90E,MAAA,IACA80E,EAAA,IAAAA,EAEA,OAAAA,CACA,CAEA,IAAAC,EAAA,WAEA,IAAA/jE,EAAA,GACA,QAAA9N,EAAA,EAAoBA,EAAA,GAAQA,IAE5B8N,CAAA,CADA,uCAAA9N,EAAA,CACA,CAAAR,OAAAQ,GAEA,OAAA8N,CACA,IA4CA,SAAA+/C,EAAA5gD,CAAA,EAEA,GADA,GAAAipD,EAAAqB,cAAA,mBAAAtqD,EAAA,4BAAAA,GACAA,EAAA+oB,KAAA,2BAA4C,CAE5C/oB,EAAAq3D,UAAA,QACAr3D,CAAAA,EAAA,KAAAA,CAAA,EAEA,IAAAa,EAAAyjE,EAAAtkE,GAGA,MADA,GAAAipD,EAAAqB,cAAA,GAAAtqD,EAAA+oB,KAAA,mCAAAloB,IAAAb,EAAA,iCAAAA,GACAa,CACA,CAEA,GAAAb,EAAA+oB,KAAA,mCAAoD,CAEpD,GAAAkgC,EAAAqB,cAAA,EAAAtqD,EAAAuxD,SAAA,QAAAmT,EAAA1kE,GAAA,8BAAAA,GACA,IAAAa,EAAAgkE,CA3DA,SAAA9zE,CAAA,EACAA,EAAAA,EAAA0R,WAAA,GACA,IAAA5B,EAAA4wD,EACA,QAAA1+D,EAAA,EAAoBA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IACtC8N,EAAAA,EAAAwjE,EAAAO,CAAA,CAAA7zE,CAAA,CAAAgC,EAAA,EAEA,OAAA8N,CACA,GAoDAb,EAAAuxD,SAAA,KAAAz2D,QAAA,KACA,KAAA+F,EAAAhR,MAAA,KACAgR,EAAA,IAAAA,EAEA,OAAAyjE,EAAA,KAAAzjE,EACA,CACA,GAAAooD,EAAAqB,cAAA,iCAAAtqD,EACA,CACAlP,EAAA8vD,UAAkB,CAAAA,EA2BlB9vD,EAAAszE,cAAsB,CARtB,SAAApkE,CAAA,EAEA,IAAA8kE,EAAAvyE,OAAAquD,EAAA5gD,IAAAlF,QAAA,KAAA8H,WAAA,GACA,KAAAkiE,EAAAj1E,MAAA,KACAi1E,EAAA,IAAAA,EAEA,WAAAJ,EAAA,OAAAI,GAAAA,CACA,sCC7JAl0E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAi0E,cAAsB,CAAGj0E,EAAAk0E,SAAiB,CAAGl0E,EAAAm0E,aAAqB,QAClE,IAAA5c,EAAmBzzD,EAAQ,OAC3B2zD,EAAqB3zD,EAAQ,OAe7B,SAAAqwE,EAAAl0E,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAA6vD,UAAA,CAqCA,eAAAskB,EAAAxrB,CAAA,CAAAyrB,CAAA,EACA,IAAAtkE,EAAA,MAAAskE,EAKA,MAJAtkE,CAAAA,MAAAA,GAAAA,+CAAAA,CAAA,IACA,GAAAwnD,EAAA0F,MAAA,mBAAArU,EAAA,yCAAyG3oD,MAAA2oD,CAAA,GACzG,GAAA2O,EAAAiC,cAAA,qEAA0E,SAAA5Q,IAE1E,GAAA6O,EAAA3H,UAAA,EAAA//C,EACA,CA1CA/P,EAAAm0E,aAAqB,CAAAA,EAkCrBn0E,EAAAk0E,SAAiB,CARjB,SAAAj0E,CAAA,EACA,IAEA,MADA,GAAAw3D,EAAA3H,UAAA,EAAA7vD,GACA,EACA,CACA,MAAA2N,EAAA,EACA,QACA,EA+DA5N,EAAAi0E,cAAsB,CAhBtB,SAAArrB,CAAA,CAAA0rB,CAAA,QACA,iBAAA1rB,EACA,EAAA3wB,KAAA,sBACA,GAAAw/B,EAAA3H,UAAA,EAAAlH,IAEA,GAAA2O,EAAA0F,MAAA,EAAAqX,MAAAA,EAAA,8DAAkHpX,UAAA,gBAClHkX,EAAAxrB,EAAA0rB,EAAAC,WAAA,CAAA3rB,KAEAurB,EAAAvrB,GACAwrB,EAAAxrB,EAAAA,EAAAkH,UAAA,IAEAlH,GAAA,mBAAAA,EAAAuB,IAAA,CACAiqB,EAAAxrB,EAAAA,OAEA,GAAA2O,EAAAiC,cAAA,8CAAA5Q,EACA,sCCpHA9oD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAw0E,iBAAyB,CAAGx0E,EAAAy0E,gBAAwB,QACpD,IAAAld,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B2zD,EAAqB3zD,EAAQ,MAmC7B9D,CAAAA,EAAAy0E,gBAAwB,CAfxB,SAAA9Z,CAAA,EACA,IAAA7wD,EAAA,GAAA2tD,EAAA3H,UAAA,EAAA6K,EAAA7wD,IAAA,EAEA4qE,EAAAllE,CADA,EAAA2oD,EAAA4I,SAAA,EAAApG,EAAAnrD,KAAA,aACAxF,QAAA,KAUA,OARA0qE,EADAA,MAAAA,EACA,KAEAA,EAAA31E,MAAA,GACA,MAAA21E,EAGA,KAAAA,EAEA,GAAAjd,EAAA3H,UAAA,KAAAqI,EAAA2S,SAAA,KAAAvT,EAAAqU,SAAA,KAAAzT,EAAAwc,SAAA,GAAA7qE,EAAA4qE,EAAA,OACA,EAiCA10E,EAAAw0E,iBAAyB,CARzB,SAAAI,CAAA,CAAA92B,CAAA,CAAA+2B,CAAA,EACA,IAAA/qE,EAAA,GAAA2tD,EAAA3H,UAAA,EAAA8kB,GACA12B,EAAA,GAAAia,EAAA4C,QAAA,EAAAjd,EAAA,QACAg3B,EAAA,GAAA3c,EAAA4C,QAAA,EAAA8Z,EAAA,gBAGA,MAFA,GAAA1c,EAAAqB,cAAA,EAAAtb,KAAAA,EAAAn/C,MAAA,gCAAA++C,GACA,GAAAqa,EAAAqB,cAAA,EAAAsb,KAAAA,EAAA/1E,MAAA,gDAAA81E,GACA,GAAApd,EAAA3H,UAAA,KAAAqI,EAAA2S,SAAA,KAAAvT,EAAAqU,SAAA,KAAAzT,EAAAnN,MAAA,UAAAlhD,EAAAo0C,EAAA42B,EAAA,OACA,sCCxDAh1E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAi0E,cAAsB,CAAGj0E,EAAAk0E,SAAiB,CAAGl0E,EAAAm0E,aAAqB,CAAGn0E,EAAAw0E,iBAAyB,CAAGx0E,EAAAy0E,gBAAwB,CAAGz0E,EAAAszE,cAAsB,CAAGtzE,EAAA8vD,UAAkB,QAEvK,IAAA2H,EAAmB3zD,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmD,EAAA3H,UAAA,IACpFhwD,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmD,EAAA6b,cAAA,IACxF,IAAAyB,EAA4BjxE,EAAQ,OACpChE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4jE,EAAAN,gBAAA,IAC1F30E,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4jE,EAAAP,iBAAA,IAC3F,IAAAQ,EAAkBlxE,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6jE,EAAAb,aAAA,IACvFr0E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6jE,EAAAd,SAAA,IACnFp0E,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6jE,EAAAf,cAAA,sCC1BxFn0E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAi1E,WAAmB,QAMnBj1E,EAAAi1E,WAAmB,gFCPnBn1E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAk1E,QAAgB,QAMhBl1E,EAAAk1E,QAAgB,0GCFhBp1E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAm1E,aAAqB,CAAGn1E,EAAAo1E,WAAmB,CAAGp1E,EAAAq1E,SAAiB,CAAGr1E,EAAAs1E,SAAiB,CAAGt1E,EAAAu1E,UAAkB,CAAGv1E,EAAAw1E,WAAmB,CAAGx1E,EAAA0jD,CAAS,CAAG1jD,EAAAk1E,QAAgB,CAAGl1E,EAAAi1E,WAAmB,QACnL,IAAAQ,EAAqB3xE,EAAQ,OAC7BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAskE,EAAAR,WAAA,IACrF,IAAAS,EAAkB5xE,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAukE,EAAAR,QAAA,IAClF,IAAAS,EAAmB7xE,EAAQ,MAC3BhE,OAAAC,cAAA,CAAAC,EAAA,IAAoC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwkE,EAAAjyB,CAAA,IAC3E5jD,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwkE,EAAAH,WAAA,IACrF11E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwkE,EAAAJ,UAAA,IACpFz1E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwkE,EAAAL,SAAA,IACnFx1E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwkE,EAAAN,SAAA,IACnF,IAAAO,EAAmB9xE,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAykE,EAAAR,WAAA,IACrFt1E,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAykE,EAAAT,aAAA,qCCnBvFr1E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq1E,SAAiB,CAAGr1E,EAAAs1E,SAAiB,CAAGt1E,EAAAu1E,UAAkB,CAAGv1E,EAAAw1E,WAAmB,CAAGx1E,EAAA0jD,CAAS,QAM5F1jD,EAAA0jD,CAAS,CAAAjiD,OAAA,sEAMTzB,EAAAw1E,WAAmB,CAAA/zE,OAAA,uBAMnBzB,EAAAu1E,UAAkB,CAAA9zE,OAAA,sEAMlBzB,EAAAs1E,SAAiB,CAAA7zE,OAAA,sEAAAA,OAAA,IAMjBzB,EAAAq1E,SAAiB,CAAA5zE,OAAA,wGC9BjB3B,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAm1E,aAAqB,CAAGn1E,EAAAo1E,WAAmB,QAM3Cp1E,EAAAo1E,WAAmB,KAMnBp1E,EAAAm1E,aAAqB,sECdrBr1E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAixD,QAAgB,CAAGjxD,EAAA61E,YAAoB,CAAG71E,EAAA81E,WAAmB,CAAG91E,EAAA+1E,aAAqB,QACrF,IAAAxe,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAG3BkyE,EAAsBlyE,EAAQ,OAC9Bs0D,EAAmBt0D,EAAQ,OAC3BmyE,EAAsBnyE,EAAQ,OAC9B68D,EAAAl/D,OAAA,GACA,SAAAy0E,EAAAj2E,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAAoM,IAAA,CAEA,SAAA8pE,EAAAl2E,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAAm2E,WAAA,CAEA,SAAAC,EAAAp2E,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAAs0E,WAAA,CAEA,SAAA+B,EAAAr2E,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAAs2E,eAAA,CAEA,SAAAC,EAAAv2E,CAAA,EACA,GAAAA,MAAAA,EAAA,CACA,GAAAo2E,EAAAp2E,GACA,OAAAA,EAEA,GAAAA,EAAAytD,QAAA,CACA,OAAAztD,EAAAytD,QAAA,CAIA,CACA,MAAA+oB,EACA,CAAAh8C,CAAA,CACAo4B,QAAA,aACA6jB,CAAA,CAAA7jB,CAAA,CAAAjuB,CAAA,EAEA,GADA,GAAAwzB,EAAA/B,gBAAA,QAAiDxD,SAAAA,CAAA,GACjDA,EAAA2T,MAAA,CAAAznE,MAAA,CAAA6lC,EAAA7lC,MAAA,CACA,kCAGA,IAAA43E,EAAAC,EAAAF,EAAAC,MAAA,gBACArC,EAAA+B,EAAAM,GAAAA,EAAA,IACA,OAAAl8C,CAAA,kBACA,IAAAo8C,EAAA,MAAAntB,QAAA6F,GAAA,CAAAsD,EAAA2T,MAAA,CAAAnsD,GAAA,EAAAwyC,EAAAvyC,IAEA,MADAsqB,CAAA,CAAAtqB,EAAA,CAEA,KAEAuyC,EAAAkZ,SAAA,CAAAnhC,CAAA,CAAAtqB,EAAA,EAAAK,EAAA1a,IACA,YAAA0a,EACA,MAAAhH,OAAA,CAAA1T,GACAypD,QAAA6F,GAAA,CAAAtvD,EAAAoa,GAAA,OAAA89C,EAAA8b,cAAA,EAAA1rC,EAAA+rC,KAEA,GAAAnc,EAAA8b,cAAA,EAAAh0E,EAAAq0E,GAEAr0E,KAGA,OAAAy2E,EAAAI,SAAA,CAAAtL,kBAAA,CAAA3Y,EAAAgkB,EACA,GACA,CACAE,gBAAA,CACA,aAAAt8C,CAAA,CAEA,CAOA,SAAAm8C,EAAA32E,CAAA,CAAA+2E,CAAA,SACA,MAAA/2E,EACA,KAEA,mBAAAA,CAAA,CAAA+2E,EAAA,CACA/2E,EAEAA,EAAAytD,QAAA,qBAAAztD,EAAAytD,QAAA,CAAAspB,EAAA,CACA/2E,EAAAytD,QAAA,CAEA,IACA,CACA,SAAAupB,EAAAh3E,CAAA,SACA,MAAAA,EACA,KAEAA,EAAAytD,QAAA,MACA,CAIA,eAAAqoB,EAAAmB,CAAA,CAAA5T,CAAA,EAEA,IAAA6T,EAAA5f,EAAA8H,KAAA,CAAAC,WAAA,CAAA4X,EAAA,aACA,GAAA9e,EAAAoB,cAAA,mBAAA2d,EAAA,0CAAAD,GAEA,IAAA7D,EAAA,GAAA2C,EAAAoB,WAAA,EAAAD,GAOA,MANA,GAAA/e,EAAAoB,cAAA,EAAA6Z,MAAAA,EAAAvrE,EAAA,GAAAw7D,GAAA,IAAAp1C,OAAA,8CAAAmlD,EAAAvrE,EAAA,EACA,GAAAswD,EAAAoB,cAAA,EAAA6Z,MAAAA,EAAAvsE,IAAA,GAAAw8D,GAAA,IAAAp1C,OAAA,oDAAAmlD,EAAAvsE,IAAA,EAEAusE,EAAAvpE,IAAA,EACAupE,CAAAA,EAAAvpE,IAAA,CAAAupE,EAAAvpE,IAAA,EAEAupE,CACA,CAKA,eAAAyC,EAAAuB,CAAA,CAAA7Q,CAAA,CAAA5hC,CAAA,EAEA,IAAA+xC,EAAAC,EAAAS,EAAA,eACA/C,EAAA+B,EAAAM,GAAAA,EAAA,KACA,aAAAjtB,QAAA6F,GAAA,CAAAiX,EAAAnsD,GAAA,EAAAwyC,EAAAvyC,IACAuyC,EAAAkZ,SAAA,CAAAnhC,CAAA,CAAAtqB,EAAA,EAAAK,EAAA1a,IAEA,CADAA,EAAAs3D,EAAA8H,KAAA,CAAAC,WAAA,CAAAr/D,EAAA0a,GACAA,YAAAA,GACA,GAAAw9C,EAAA8b,cAAA,EAAAh0E,EAAAq0E,GAEAr0E,IAGA,CAjBAD,EAAA+1E,aAAqB,CAAAA,EAkBrB/1E,EAAA81E,WAAmB,CAAAA,EAkMnB,IAAA7Q,EAAAta,OAAAua,GAAA,6BACAoS,EAAA,IAAA7iB,QAIA,SAAA8iB,EAAAb,CAAA,EACA,OAAAY,EAAAnmE,GAAA,CAAAulE,CAAA,CAAAzR,EAAA,CACA,CAKA,eAAAuS,EAAAd,CAAA,CAAAe,CAAA,MACA/L,EACA,IAAA7Y,EAAA,KAGA,GAAAhpD,MAAA8J,OAAA,CAAA8jE,GAAA,CACA,IAAAC,EAAA,SAAA94E,CAAA,EACA,MAAAw5D,EAAAkR,WAAA,EAAA1qE,EAAA,IACA,OAAAA,EAEA,IAAAi0D,EAAA6jB,EAAAI,SAAA,CAAA3M,QAAA,CAAAvrE,GAEA,MADA,GAAAw5D,EAAAoB,cAAA,EAAA3G,EAAA,0BAAAj0D,GACAi0D,EAAAoU,SAAA,EAGAyE,EAAA+L,EAAAp9D,GAAA,IACA,MAAAkrB,EACA,KAEA17B,MAAA8J,OAAA,CAAA4xB,GACAA,EAAAlrB,GAAA,CAAAq9D,GAEAA,EAAAnyC,GAEA,KACAkyC,MAAAA,EACA/L,EAAA,OAEA,iBAAA+L,EACA,GAAArf,EAAAkR,WAAA,EAAAmO,EAAA,IAEA/L,EAAA,CAAA+L,EAAA,EAIA5kB,EAAA6jB,EAAAI,SAAA,CAAA3M,QAAA,CAAAsN,GACA,GAAArf,EAAAoB,cAAA,EAAA3G,EAAA,2BAAA4kB,GACA/L,EAAA,CAAA7Y,EAAAoU,SAAA,GAxCAhnE,GAAA,iBA2CAw3E,GA3CA,mBA2CAA,GA1CA,mBAAAx3E,EAAA82E,cAAA,EAAA92E,EAAA4yD,QAAA,CA4CA6Y,EAAA,MAAA+L,EAAAV,cAAA,GAEA,aAAAU,EAGA/L,EAAA,CAAA7Y,CADAA,EAAA4kB,EAAA5kB,QAAA,EACAoU,SAAA,EAGA,GAAA7O,EAAAoB,cAAA,kCAAAie,GA0BA,OAAa5kB,SAAAA,EAAA7X,IATb0wB,CAdAA,EAAAA,EAAArxD,GAAA,KACA,GAAAtV,MAAAA,EACA,YAEA,GAAA8E,MAAA8J,OAAA,CAAA5O,GAAA,CACA,IAAAkrB,EAAApmB,MAAAC,IAAA,KAAAi4D,IAAAh9D,EAAAsV,GAAA,IAAAtV,EAAA4M,WAAA,KAAAsoD,MAAA,WACA,IAAAhqC,EAAAlxB,MAAA,CACAkxB,CAAA,KAEAA,EAAAxS,IAAA,GACAwS,EACA,CACA,OAAAlrB,EAAA4M,WAAA,EACA,EAAK,EACL0I,GAAA,IACA,MAAAtV,EACA,OAEA8E,MAAA8J,OAAA,CAAA5O,GACAA,EAAAqoD,IAAA,MAEAroD,GACKqoD,IAAA,MACQse,OAAAA,CAAA,CACb,CACA,eAAAiM,EAAAjB,CAAA,CAAAe,CAAA,EACA,IAAYG,KAAAA,CAAA,EAAOL,EAAAb,GACnB,OAAAkB,EAAAzmE,GAAA,QAAAqmE,EAAAd,EAAAe,EAAA,EAAAz8B,GAAA,OACA,CACA,eAAA68B,EAAAnB,CAAA,CAAAxZ,CAAA,CAAAua,CAAA,EAEA,IAAA/pB,EAAAupB,EAAAP,EAAAC,MAAA,EACA,GAAAve,EAAA6E,MAAA,EAAAvP,EAAA,wEAAgHwP,UAAAA,CAAA,GAChH,IAAYrK,SAAAA,CAAA,CAAA7X,IAAAA,CAAA,CAAA0wB,OAAAA,CAAA,EAAwB,MAAA8L,EAAAd,EAAAe,GACpC,CAAYxpB,KAAAA,CAAA,CAAA2pB,KAAAA,CAAA,EAAaL,EAAAb,GACzBltC,EAAAouC,EAAAzmE,GAAA,CAAA6pC,GACA,IAAAxR,EAAA,CAEA,IAAA/O,EAAA,CAAyBvrB,QADzB++C,GAAAyoB,EACyBhL,OAAAA,CAAA,EACzBoM,EAAA,IACA,IAAAC,EAAAllB,EACA,GAAAklB,MAAAA,EACA,IACAA,EAAArB,EAAAI,SAAA,CAAA3M,QAAA,CAAAp8D,EAAA29D,MAAA,IACA,CACA,MAAA99D,EAAA,EAGA,GAAAmqE,EAAA,CACA,IAAAC,EAAAD,EACAnzC,EAAAiuB,EAAA6jB,EAAAI,SAAA,CAAA7K,cAAA,CAAApZ,EAAA9kD,EAAAjH,IAAA,CAAAiH,EAAA29D,MAAA,KACAuM,EAAAvB,EAAAe,EAAA7yC,EAAA,GACA,IAAAqxC,EAAAiC,oBAAA,CAAAxB,EAAAoB,EAAAL,EAAAO,EAAAjqE,GAEA,MAEAkqE,EAAAvB,EAAAe,EAAA,MACA,IAAAxB,EAAAkC,2BAAA,CAAAzB,EAAAoB,EAAAL,EAAA1pE,GAGA,EACAqqE,EAAA,GAgBA5uC,EAAA,CAAgBwR,IAAAA,EAAAq9B,UAAA,GAAAllD,MAfhB,KACAilD,EAAAr5E,MAAA,EAGAq5E,EAAAtzE,IAAA,CAAA4oD,EAAA4qB,EAAA,CAAA79C,EAAAq9C,GACA,EAUgBS,KAThB,UACA,GAAAH,GAAAA,EAAAr5E,MAAA,CACA,OAEA,IAAAy5E,EAAAJ,EACAA,EAAA,GACA,MAAA1uB,QAAA6F,GAAA,CAAAipB,GACA9qB,EAAA+qB,GAAA,CAAAh+C,EAAAq9C,EACA,CACgB,EAChBF,EAAAtwE,GAAA,CAAA0zC,EAAAxR,EACA,CACA,OAAAA,CACA,CAIA,IAAAkvC,EAAAhvB,QAAAC,OAAA,GACA,eAAAgvB,EAAAjC,CAAA,CAAAe,CAAA,CAAA7yC,CAAA,CAAAg0C,CAAA,EACA,MAAAF,EACA,IAAAlvC,EAAA,MAAAmuC,EAAAjB,EAAAe,GACA,IAAAjuC,EACA,SAEA,IAAA7pB,EAAA6pB,EAAA6uC,SAAA,CAAAt5E,MAAA,CAgBA,OAfAyqC,EAAA6uC,SAAA,CAAA7uC,EAAA6uC,SAAA,CAAA59C,MAAA,GAA4Cq9C,SAAAA,CAAA,CAAAe,KAAAA,CAAA,CAAgB,IAC5D,IAAAC,EAAAjvE,MAAAC,IAAA,CAAA86B,GACAg0C,GACAE,EAAAh0E,IAAA,CAAA8zE,EAAAC,EAAA,KAAAf,IAEA,IACAA,EAAAzrE,IAAA,CAAAqqE,KAAAoC,EACA,CACA,MAAAlrE,EAAA,EACA,OAAAirE,CACA,GACA,IAAArvC,EAAA6uC,SAAA,CAAAt5E,MAAA,GACAyqC,EAAA+uC,IAAA,GACAhB,EAAAb,GAAAkB,IAAA,CAAA1mC,MAAA,CAAA1H,EAAAwR,GAAA,GAEAr7B,EAAA,CACA,CACA,eAAAs4D,EAAAvB,CAAA,CAAAe,CAAA,CAAA7yC,CAAA,CAAAg0C,CAAA,EACA,IACA,MAAAF,CACA,CACA,MAAA9qE,EAAA,EACA,IAAAmrE,EAAAJ,EAAAjC,EAAAe,EAAA7yC,EAAAg0C,GAEA,OADAF,EAAAK,EACA,MAAAA,CACA,CACA,IAAAhd,EAAA,eACA8Z,EAQAjtB,MAAA,CAIAkuB,SAAA,CAQAH,MAAA,CAIAqC,OAAA,EAIA/T,EAAA,CAIAyD,QAAA,aAMA9f,CAAA,CAAAkgB,CAAA,CAAA6N,CAAA,CAAAsC,CAAA,MA7NAhf,MAqOAif,EAPA,GAAA9gB,EAAAoB,cAAA,mBAAA5Q,GAAA,GAAAuP,EAAAgc,aAAA,EAAAvrB,GAAA,6CAAAA,GACA,MAAA+tB,GACAA,CAAAA,EAAA,MAEA,IAAAwC,EAAA5hB,EAAAwQ,SAAA,CAAAj+D,IAAA,CAAAg/D,GACA,GAAA1Q,EAAA/B,gBAAA,QAAiDzN,OAAAA,EAAA+tB,OAAAA,EAAAG,UAAAqC,CAAA,GACjDr5E,OAAAC,cAAA,MAAAklE,EAAA,CAAgDhlE,MAAA,KAEhD,IAAAguD,EAAA,KACAmrB,EAAA,KACA,GAAAH,EAAA,CACA,IAAAvrB,EAAAupB,EAAAN,GAGAyC,EAAA,IAAAnD,EAAAoD,2BAAA,MAAAvC,SAAA,CAAAppB,EAAAurB,EACA,CACA,IAAArB,EAAA,IAAAvnC,IAEA,oBAAAuY,GACA,MAAAwP,EAAAkR,WAAA,EAAA1gB,GACAqF,EAAArF,EACAswB,EAAAxvB,QAAAC,OAAA,CAAAf,OAEA,CACA,IAAA0rB,EAAAsC,EAAAD,EAAA,eACA,IAAAN,EAAA/B,GACA,QAAAlc,EAAA8C,SAAA,8EACAgC,UAAA,aACA,GAEAgc,EAAA5E,EAAAC,WAAA,CAAA3rB,GAAAuB,IAAA,KACA,GAAA8D,MAAAA,EACA,QAAAmK,EAAA8C,SAAA,6FACAj7D,MAAA2oD,CACA,GAGA,OADA2uB,EAAA,MAAAtpB,IAAA,CAAAA,EACAA,CACA,EACA,OAGAirB,EAAAtwB,EAAAkH,UAAA,GAAA3F,IAAA,KACA,GAAA8D,MAAAA,EACA,oBAGA,OADAspB,EAAA,MAAAtpB,IAAA,CAAAA,EACAA,CACA,GA9QAgM,EAiRA,CAA4Bif,YAAAA,EAAAjrB,KAAAA,EAAAmrB,SAAAA,EAAAxB,KAAAA,CAAA,EAhR5BN,EAAAhwE,GAAA,CAAAovE,IAgRA,CAhRAzR,EAAA,CAAAhL,GAkRA,IAAA+e,EAAA,IAAAtc,MAAA,GAAoC,CACpCvrD,IAAA,CAAAy3C,EAAA+T,EAAAvQ,KAEA,oBAAAuQ,GAAAZ,EAAA7tC,OAAA,CAAAyuC,IAAA,EACA,OAAA9T,QAAA13C,GAAA,CAAAy3C,EAAA+T,EAAAvQ,GAEA,IACA,YAAA+d,QAAA,CAAAxN,EACA,CACA,MAAA/uD,EAAA,CACA,OAAAwqD,EAAAkI,OAAA,EAAA1yD,EAAA,qBAAAA,QAAAA,EAAAiyD,QAAA,CACA,MAAAjyD,CAEA,CAEA,EACA0+C,IAAA,CAAA1D,EAAA+T,IAEA,EAAAzuC,OAAA,CAAAyuC,IAAA,EACA9T,QAAAyD,GAAA,CAAA1D,EAAA+T,GAEA9T,QAAAyD,GAAA,CAAA1D,EAAA+T,IAAA,KAAAma,SAAA,CAAAxM,QAAA,CAAAz2D,OAAA8oD,GAEA,GAMA,MALA,GAAAvE,EAAA/B,gBAAA,QAAiD2iB,QAAAA,CAAA,GACjD,GAAA5gB,EAAA/B,gBAAA,QACAqS,SAAA,EAAAC,OAAA,EAAAwQ,EAAAzQ,QAAA,CAAA4Q,SAhfA5C,CAAA,EACA,IAAA6C,EAAA,eAAAlG,CAAA,EAEA,IAAA1Y,EAAA,MAAAob,EAAA1C,EAAA,SACA1Y,CAAAA,EAAA7yD,EAAA,OAAA4uE,EAAA5mB,UAAA,GACA6K,EAAA7wD,IAAA,EACA6wD,CAAAA,EAAA7wD,IAAA,UAAAquD,EAAA8b,cAAA,EAAAtZ,EAAA7wD,IAAA,CAAA0sE,EAAAE,EAAAC,MAAA,IAEA,IAAAwC,EAAAzC,EAAAI,SAAA,CACA0C,EAAA,GAAAphB,EAAA2I,SAAA,EAAApG,EAAA16D,KAAA,EAAA0gE,EAAA,qBAAAA,EACA8Y,EAAA,OAAA9e,CAAAA,EAAA7zD,IAAA,SACAqyE,EAAAzQ,QAAA,EAAAyQ,EAAAzQ,QAAA,CAAAvB,OAAA,GAAAgS,EAAAxQ,OAAA,EAAA8Q,GAAAD,GACA,GAAAphB,EAAAoB,cAAA,qFAAA6Z,GAEA,GAAAjb,EAAAoB,cAAA,EAAA2f,EAAAzQ,QAAA,EAAA+Q,EAAA,6DAAA9e,EAAA7zD,IAAA,EAEA,IAAAqgE,EAAAgS,EAAAxQ,OAAA,EAAAwQ,EAAAzQ,QAAA,EAAAyQ,EAAAzQ,QAAA,CAAAvB,OAAA,CAIA,MAHA,GAAA/O,EAAAoB,cAAA,EAAA2N,GAAAqS,EAAA,8DAAA7e,EAAA16D,KAAA,EAEA,GAAAm4D,EAAAoB,cAAA,EAAA2f,EAAAzQ,QAAA,EAAA+Q,EAAA,6DAAA9e,EAAA7zD,IAAA,EACA6zD,CACA,EACA+e,EAAA,eAAArG,CAAA,EACA,IAAAsD,EAAAC,EAAAF,EAAAC,MAAA,SACA,GAAAve,EAAA6E,MAAA,EAAAiZ,EAAAS,GAAA,oEAAuHzZ,UAAA,SACvH,IAAAvC,EAAA,MAAA4e,EAAAlG,GACA,IACA,aAAAsD,EAAAtqE,IAAA,CAAAsuD,EACA,CACA,MAAA/sD,EAAA,CACA,MAAAwqD,EAAAuhB,eAAA,EAAA/rE,IAAAA,EAAA9G,IAAA,CACA,MAAA4vE,EAAAI,SAAA,CAAA5b,SAAA,CAAAttD,EAAA9G,IAAA,CAAA6zD,EAEA,OAAA/sD,CACA,CACA,EACAgsE,EAAA,eAAAvG,CAAA,EACA,IAAAsD,EAAAD,EAAAC,MAAA,CACA,GAAAve,EAAA6E,MAAA,EAAAqZ,EAAAK,GAAA,iFAAoIzZ,UAAA,oBACpI,IAAAvC,EAAA,MAAAgc,EAAAJ,eAAA,OAAAgD,EAAAlG,IACA3lB,EAAAupB,EAAAP,EAAAC,MAAA,EAGA,WAAAV,EAAAoD,2BAAA,CAAA3C,EAAAI,SAAA,CAAAppB,EAAAiN,EACA,EACAyb,EAAA,eAAA/C,CAAA,EACA,IAAAsD,EAAAC,EAAAF,EAAAC,MAAA,gBAEA,MADA,GAAAve,EAAA6E,MAAA,EAAAkZ,EAAAQ,GAAA,2EAAkIzZ,UAAA,gBAClI,MAAAyZ,EAAAP,WAAA,OAAAmD,EAAAlG,GACA,EACAlI,EAAA,MAAAkI,GACA,MAAAuG,EAAAvG,GAQA,MANA,GAAAjb,EAAA/B,gBAAA,EAAA8U,EAAA,CACA0O,UAAAnD,EACAN,YAAAA,EACAmD,oBAAAA,EACAK,KAAAA,EAAAF,WAAAA,CACA,GACAvO,CACA,EAobA,UACA,GAEA,IAAAzO,MAAA,MACAvrD,IAAA,CAAAy3C,EAAA+T,EAAAvQ,KACA,oBAAAuQ,GAAAA,KAAA/T,GAAAmT,EAAA7tC,OAAA,CAAAyuC,IAAA,EACA,OAAA9T,QAAA13C,GAAA,CAAAy3C,EAAA+T,EAAAvQ,GAGA,IACA,OAAAxD,EAAAwgB,WAAA,CAAAzM,EACA,CACA,MAAA/uD,EAAA,CACA,OAAAwqD,EAAAkI,OAAA,EAAA1yD,EAAA,qBAAAA,QAAAA,EAAAiyD,QAAA,CACA,MAAAjyD,CAEA,CAEA,EACA0+C,IAAA,CAAA1D,EAAA+T,IACA,iBAAAA,GAAAA,KAAA/T,GAAAmT,EAAA7tC,OAAA,CAAAyuC,IAAA,EACA9T,QAAAyD,GAAA,CAAA1D,EAAA+T,GAEA/T,EAAAkuB,SAAA,CAAA9M,WAAA,CAAArN,EAEA,EACA,CAKAmd,QAAAnD,CAAA,EACA,WAAAd,EAAA,KAAAjtB,MAAA,MAAAkuB,SAAA,CAAAH,EACA,CAKAoD,OAAAnxB,CAAA,EACA,WAAAitB,EAAAjtB,EAAA,KAAAkuB,SAAA,MAAAH,MAAA,CACA,CAIA,MAAA7mB,YAAA,CAAyB,aAAAynB,EAAA,MAAA2B,WAAA,CAIzB,MAAAc,iBAAA,CACA,IAAAtsB,EAAAupB,EAAA,KAAAN,MAAA,EACA,GAAAve,EAAA6E,MAAA,EAAAvP,EAAA,6DAAyGwP,UAAA,oBACzG,IAAA9mC,EAAA,MAAAs3B,EAAAusB,OAAA,YAAAnqB,UAAA,UACA,OAAA15B,EACA,KAEAA,CACA,CAKA,MAAA8jD,mBAAA,CAEA,IAAAd,EAAA,KAAAe,qBAAA,GACA,GAAAf,EAEA,OADA,MAAAA,EAAAgB,IAAA,GACA,KAIA,GAAAhkD,MADA,WAAA4jD,eAAA,GAEA,YAGA,IAAAtsB,EAAAupB,EAAA,KAAAN,MAAA,EAEA,MADA,GAAAve,EAAA6E,MAAA,EAAAvP,MAAAA,EAAA,sEAA0HwP,UAAA,sBAC1H,IAAAxT,QAAA,CAAAC,EAAAC,KACA,IAAAywB,EAAA,UACA,IACA,IAAAjkD,EAAA,WAAA4jD,eAAA,GACA,GAAA5jD,MAAAA,EACA,OAAAuzB,EAAA,MAEA+D,EAAAmrB,IAAA,SAAAwB,EACA,CACA,MAAAzsE,EAAA,CACAg8C,EAAAh8C,EACA,CACA,EACAysE,GACA,EACA,CAOAF,uBAAA,CACA,OAAA5C,EAAA,MAAA6B,QAAA,CAOAhQ,YAAA/4D,CAAA,EAKA,MAJA,iBAAAA,GACAA,CAAAA,EAAAA,EAAAu1D,MAAA,IAEA0U,SAjiBA5D,CAAA,CAAArmE,CAAA,EACA,IAAAkqE,EAAA,YAAA31C,CAAA,EACA,IAAAiuB,EAAA6jB,EAAAI,SAAA,CAAA1N,WAAA,CAAA/4D,EAAAu0B,GAKA,MAJA,GAAAwzB,EAAA6E,MAAA,EAAApK,EAAA,gDACAqK,UAAA,WACAsB,KAAA,CAAoBnuD,IAAAA,EAAAu0B,KAAAA,CAAA,CACpB,GACAiuB,CACA,EACA0mB,EAAA,kBAAA30C,CAAA,EACA,IAAAiuB,EAAA0nB,KAAA31C,GAEAyuC,EAAA,GAOA,GANAxgB,EAAA2T,MAAA,CAAAznE,MAAA,KAAA6lC,EAAA7lC,MAAA,EAEAs0E,CADAA,EAAA,MAAA0C,EAAAnxC,EAAAjiB,GAAA,KACA7Y,IAAA,EACAupE,CAAAA,EAAAvpE,IAAA,UAAAquD,EAAA8b,cAAA,EAAAZ,EAAAvpE,IAAA,CAAA0sE,EAAAE,EAAAC,MAAA,IAGA9jB,EAAA2T,MAAA,CAAAznE,MAAA,GAAA6lC,EAAA7lC,MAAA,CACA,0FAEA,IAAA83E,EAAA,MAAAf,EAAAY,EAAAC,MAAA,CAAA9jB,EAAA2T,MAAA,CAAA5hC,GACA,OAAA9kC,OAAAwM,MAAA,IAA+B+mE,EAAA,SAAAjb,EAAAoiB,iBAAA,GAC/B1yE,GAAA4uE,EAAA5mB,UAAA,GACAhpD,KAAA4vE,EAAAI,SAAA,CAAA7L,kBAAA,CAAApY,EAAAgkB,EACA,GACA,EACA6C,EAAA,kBAAA90C,CAAA,EACA,IAAA70B,EAAA,MAAA0qE,KAAA71C,UACA,IAAA70B,EAAAhR,MAAA,CACAgR,CAAA,IAEAA,CACA,EACA6pE,EAAA,kBAAAh1C,CAAA,EACA,IAAA+xC,EAAAD,EAAAC,MAAA,CACA,GAAAve,EAAA6E,MAAA,EAAAqZ,EAAAK,GAAA,iFAAoIzZ,UAAA,oBACpI,IAAAvC,EAAA,MAAAgc,EAAAJ,eAAA,OAAAgD,KAAA30C,IACA8oB,EAAAupB,EAAAP,EAAAC,MAAA,EAGA,WAAAV,EAAAoD,2BAAA,CAAA3C,EAAAI,SAAA,CAAAppB,EAAAiN,EACA,EACAyb,EAAA,kBAAAxxC,CAAA,EACA,IAAA+xC,EAAAC,EAAAF,EAAAC,MAAA,gBAEA,MADA,GAAAve,EAAA6E,MAAA,EAAAkZ,EAAAQ,GAAA,2EAAkIzZ,UAAA,gBAClI,MAAAyZ,EAAAP,WAAA,OAAAmD,KAAA30C,GACA,EACA61C,EAAA,kBAAA71C,CAAA,EACA,IAAA+xC,EAAAC,EAAAF,EAAAC,MAAA,SACA,GAAAve,EAAA6E,MAAA,EAAAiZ,EAAAS,GAAA,oEAAuHzZ,UAAA,SACvH,IAAAvC,EAAA,MAAA4e,KAAA30C,GACA70B,EAAA,KACA,IACAA,EAAA,MAAA4mE,EAAAtqE,IAAA,CAAAsuD,EACA,CACA,MAAA/sD,EAAA,CACA,MAAAwqD,EAAAuhB,eAAA,EAAA/rE,IAAAA,EAAA9G,IAAA,CACA,MAAA4vE,EAAAI,SAAA,CAAA5b,SAAA,CAAAttD,EAAA9G,IAAA,CAAA6zD,EAEA,OAAA/sD,CACA,CACA,IAAAilD,EAAA0nB,KAAA31C,GACA,OAAA8xC,EAAAI,SAAA,CAAA5L,oBAAA,CAAArY,EAAA9iD,EACA,EACAo7D,EAAA,SAAAvmC,IAEA,KADAA,GACA8iC,QAAA,CACA,MAAAgS,KAAA90C,GAEA,MAAAg1C,KAAAh1C,GAuBA,MArBA,GAAAwzB,EAAA/B,gBAAA,EAAA8U,EAAA,CACAvsE,KAAA83E,EAAAI,SAAA,CAAA/M,eAAA,CAAA15D,GACAwpE,UAAAnD,EAAAr5B,KAAAhtC,EACAkqE,YAAAA,EACAnE,YAAAA,EACAmD,oBAAAA,EACAK,KAAAA,EAAAF,WAAAA,EAAAe,iBAAAA,CACA,GAEA36E,OAAAC,cAAA,CAAAorE,EAAA,YACAl6D,aAAA,GACAC,WAAA,GACAC,IAAA,KACA,IAAA0hD,EAAA6jB,EAAAI,SAAA,CAAA1N,WAAA,CAAA/4D,GAKA,MAJA,GAAA+nD,EAAA6E,MAAA,EAAApK,EAAA,gDACAqK,UAAA,WACAsB,KAAA,CAAwBnuD,IAAAA,CAAA,CACxB,GACAwiD,CACA,CACA,GACAsY,CACA,EAkcA,KAAA96D,EAEA,CAMA85D,SAAA95D,CAAA,EAIA,MAHA,iBAAAA,GACAA,CAAAA,EAAAA,EAAAu1D,MAAA,IAEA8U,SA7cAhE,CAAA,CAAArmE,CAAA,EACA,IAAAkqE,EAAA,YAAA31C,CAAA,EACA,IAAAiuB,EAAA6jB,EAAAI,SAAA,CAAA3M,QAAA,CAAA95D,EAAAu0B,GAKA,MAJA,GAAAwzB,EAAA6E,MAAA,EAAApK,EAAA,gDACAqK,UAAA,WACAsB,KAAA,CAAoBnuD,IAAAA,EAAAu0B,KAAAA,CAAA,CACpB,GACAiuB,CACA,EACAsY,EAAA,YAAAvmC,CAAA,EACA,WAAA6xC,EAAAC,EAAA6D,KAAA31C,GAAAA,EACA,EAmBA,MAlBA,GAAAwzB,EAAA/B,gBAAA,EAAA8U,EAAA,CACAvsE,KAAA83E,EAAAI,SAAA,CAAAzM,YAAA,CAAAh6D,GACAwpE,UAAAnD,EAAAr5B,KAAAhtC,EACAkqE,YAAAA,CACA,GAEAz6E,OAAAC,cAAA,CAAAorE,EAAA,YACAl6D,aAAA,GACAC,WAAA,GACAC,IAAA,KACA,IAAA0hD,EAAA6jB,EAAAI,SAAA,CAAA3M,QAAA,CAAA95D,GAKA,MAJA,GAAA+nD,EAAA6E,MAAA,EAAApK,EAAA,gDACAqK,UAAA,WACAsB,KAAA,CAAwBnuD,IAAAA,CAAA,CACxB,GACAwiD,CACA,CACA,GACAsY,CACA,EA8aA,KAAA96D,EACA,CAIA,MAAAsqE,iBAAA17E,CAAA,EACA,oBACA,CAqBA,MAAA27E,YAAAnD,CAAA,CAAAoD,CAAA,CAAAC,CAAA,EACA,MAAAD,GACAA,CAAAA,EAAA,GAEA,MAAAC,GACAA,CAAAA,EAAA,UAEA,IAAgB7sB,KAAAA,CAAA,CAAAirB,YAAAA,CAAA,EAAoB3B,EAAA,MACpCroE,EAAA++C,GAAA,MAAAirB,EACA,CAAgBrmB,SAAAA,CAAA,CAAA6Y,OAAAA,CAAA,EAAmB,MAAA8L,EAAA,KAAAC,GACnCh9C,EAAA,CAAyBvrB,QAAAA,EAAAw8D,OAAAA,EAAAmP,UAAAA,EAAAC,QAAAA,CAAA,EACzBptB,EAAAupB,EAAA,KAAAN,MAAA,EAEA,MADA,GAAAve,EAAA6E,MAAA,EAAAvP,EAAA,oEAAgHwP,UAAA,gBAChH,OAAAxP,EAAAqtB,OAAA,CAAAtgD,EAAA,EAAApgB,GAAA,KACA,IAAA09D,EAAAllB,EACA,GAAAklB,MAAAA,EACA,IACAA,EAAA,KAAAjB,SAAA,CAAA3M,QAAA,CAAAp8D,EAAA29D,MAAA,IACA,CACA,MAAA99D,EAAA,EAEA,GAAAmqE,EACA,IACA,WAAA9B,EAAA+E,QAAA,CAAAjtE,EAAA,KAAA+oE,SAAA,CAAAiB,EACA,CACA,MAAAnqE,EAAA,CACA,WAAAqoE,EAAAgF,iBAAA,CAAAltE,EAAAH,EACA,CAEA,WAAAooE,EAAAkF,GAAA,CAAAntE,EAAA2/C,EACA,EACA,CAIA,MAAA4qB,GAAAb,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,MAAAquC,EAAA,UAAAJ,GAGA,OAFAjuC,EAAA6uC,SAAA,CAAAvzE,IAAA,EAA6BgzE,SAAAA,EAAAe,KAAA,KAC7BrvC,EAAArW,KAAA,GACA,KAMA,MAAA0lD,KAAApB,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,MAAAquC,EAAA,YAAAJ,GAGA,OAFAjuC,EAAA6uC,SAAA,CAAAvzE,IAAA,EAA6BgzE,SAAAA,EAAAe,KAAA,KAC7BrvC,EAAArW,KAAA,GACA,KAOA,MAAA8kD,KAAAR,CAAA,IAAA7yC,CAAA,EACA,aAAAqzC,EAAA,KAAAR,EAAA7yC,EAAA,KACA,CAKA,MAAAu2C,cAAA1D,CAAA,EACA,GAAAA,EAAA,CACA,IAAAjuC,EAAA,MAAAmuC,EAAA,KAAAF,UACA,EAGAjuC,EAAA6uC,SAAA,CAAAt5E,MAAA,CAFA,CAGA,CACA,IAAgB64E,KAAAA,CAAA,EAAOL,EAAA,MACvBz/C,EAAA,EACA,QAAqBugD,UAAAA,CAAA,IAAYT,EAAA3d,MAAA,GACjCniC,GAAAugD,EAAAt5E,MAAA,CAEA,OAAA+4B,CACA,CAKA,MAAAugD,UAAAZ,CAAA,EACA,GAAAA,EAAA,CACA,IAAAjuC,EAAA,MAAAmuC,EAAA,KAAAF,UACA,EAGAjuC,EAAA6uC,SAAA,CAAAh+D,GAAA,GAAwCy9D,SAAAA,CAAA,CAAU,GAAAA,GAFlD,GAIA,IAAgBF,KAAAA,CAAA,EAAOL,EAAA,MACvBxnE,EAAA,GACA,QAAqBsoE,UAAAA,CAAA,IAAYT,EAAA3d,MAAA,GACjClqD,EAAAA,EAAAi7C,MAAA,CAAAqtB,EAAAh+D,GAAA,GAAoDy9D,SAAAA,CAAA,CAAU,GAAAA,IAE9D,OAAA/nE,CACA,CAKA,MAAA0oE,IAAAhB,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,MAAAmuC,EAAA,KAAAF,GACA,IAAAjuC,EACA,YAEA,GAAAsuC,EAAA,CACA,IAAAx9D,EAAAkvB,EAAA6uC,SAAA,CAAAh+D,GAAA,GAA+Cy9D,SAAAA,CAAA,CAAU,GAAAA,GAAA5pD,OAAA,CAAA4pD,GACzDx9D,GAAA,GACAkvB,EAAA6uC,SAAA,CAAAzO,MAAA,CAAAtvD,EAAA,EAEA,CAKA,MAJAw9D,CAAAA,MAAAA,GAAAtuC,IAAAA,EAAA6uC,SAAA,CAAAt5E,MAAA,IACAyqC,EAAA+uC,IAAA,GACAhB,EAAA,MAAAK,IAAA,CAAA1mC,MAAA,CAAA1H,EAAAwR,GAAA,GAEA,KAMA,MAAAogC,mBAAA3D,CAAA,EACA,GAAAA,EAAA,CACA,IAAAjuC,EAAA,MAAAmuC,EAAA,KAAAF,GACA,IAAAjuC,EACA,YAEAA,EAAA+uC,IAAA,GACAhB,EAAA,MAAAK,IAAA,CAAA1mC,MAAA,CAAA1H,EAAAwR,GAAA,CACA,KACA,CACA,IAAoB48B,KAAAA,CAAA,EAAOL,EAAA,MAC3B,QAAyBv8B,IAAAA,CAAA,CAAAu9B,KAAAA,CAAA,IAAYX,EAAA3d,MAAA,GACrCse,IACAX,EAAA1mC,MAAA,CAAA8J,EAEA,CACA,YAKA,MAAAqgC,YAAA5D,CAAA,CAAAK,CAAA,EACA,kBAAAQ,EAAA,CAAAb,EAAAK,EACA,CAIA,MAAAwD,eAAA7D,CAAA,CAAAK,CAAA,EACA,kBAAAW,GAAA,CAAAhB,EAAAK,EACA,CAIA,OAAAyD,WAAAzS,CAAA,EACA,MAAA0S,UAAA3F,EACAl3E,YAAAuQ,CAAA,CAAAynE,EAAA,MACA,MAAAznE,EAAA45D,EAAA6N,EACA,CACA,CACA,OAAA6E,CACA,CAKA,OAAA1xE,KAAA8+C,CAAA,CAAAkgB,CAAA,CAAA6N,CAAA,EAKA,OAJA,MAAAA,GACAA,CAAAA,EAAA,MAEA,SAAA/tB,EAAAkgB,EAAA6N,EAEA,CACA,CAEA,SAAA8E,IACA,OAAA5F,CACA,CAHA71E,EAAA61E,YAAoB,CAAAA,CAOpB,OAAA5kB,UAAAwqB,IACA,CACAz7E,EAAAixD,QAAgB,CAAAA,sCC77BhBnxD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA07E,eAAuB,QACvB,IAAAnkB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3B63E,EAAsB73E,EAAQ,MAM9B,OAAA43E,EAIA5E,SAAA,CAIA8E,QAAA,CAIAjF,MAAA,aAQA7N,CAAA,CAAA8S,CAAA,CAAAjF,CAAA,EACA,IAAAwC,EAAA5hB,EAAAwQ,SAAA,CAAAj+D,IAAA,CAAAg/D,GAEA8S,aAAAl9E,aAIA,iBAAAk9E,GACAA,CAAAA,EAAAA,EAAAtuC,MAAA,EAEAsuC,EAAArV,UAAA,QACAqV,CAAAA,EAAA,KAAAA,CAAA,GAPAA,EAAA,GAAAxjB,EAAA4C,OAAA,KAAA5C,EAAA2C,QAAA,EAAA6gB,IAWA,GAAAxjB,EAAA/B,gBAAA,QACAulB,SAAAA,EAAA9E,UAAAqC,EAAAxC,OAAAA,GAAA,IACA,EACA,CACAoD,OAAAnxB,CAAA,EACA,WAAA+yB,EAAA9F,YAAA,CAAAjtB,EAAA,KAAAkuB,SAAA,MAAAH,MAAA,CACA,CAKA,MAAAkF,qBAAA,GAAAj3C,CAAA,EACA,IAAAyuC,EAAA,GACAxgB,EAAA,KAAAikB,SAAA,CAAArO,MAAA,CAIA,GAHA5V,EAAA2T,MAAA,CAAAznE,MAAA,KAAA6lC,EAAA7lC,MAAA,EACAs0E,CAAAA,EAAA,SAAAsI,EAAA5F,aAAA,EAAAnxC,EAAAjiB,GAAA,KAEAkwC,EAAA2T,MAAA,CAAAznE,MAAA,GAAA6lC,EAAA7lC,MAAA,CACA,4DAEA,IAAA83E,EAAA,SAAA8E,EAAA7F,WAAA,OAAAa,MAAA,CAAA9jB,EAAA2T,MAAA,CAAA5hC,GAEA,OAAA9kC,OAAAwM,MAAA,IAA+B+mE,EAAA,CAAevsE,KAD9C,GAAAsxD,EAAApN,MAAA,QAAA4wB,QAAA,MAAA9E,SAAA,CAAAlM,YAAA,CAAAiM,GAAA,CAC8C,EAC9C,CASA,MAAApO,OAAA,GAAA7jC,CAAA,EACA,IAAA+1B,EAAA,WAAAkhB,oBAAA,IAAAj3C,GACA,GAAAwzB,EAAA6E,MAAA,OAAA0Z,MAAA,0BAAAA,MAAA,CAAAJ,eAAA,iFACArZ,UAAA,iBACA,GACA,IAAA4e,EAAA,WAAAnF,MAAA,CAAAJ,eAAA,CAAA5b,GACAzrD,EAAA,GAAAipD,EAAAsc,gBAAA,EAAAqH,GACA,WAAAH,EAAA9F,YAAA,CAAA3mE,EAAA,KAAA4nE,SAAA,MAAAH,MAAA,CAAAmF,EACA,CAKAhC,QAAAnD,CAAA,EACA,WAAA+E,EAAA,KAAA5E,SAAA,MAAA8E,QAAA,CAAAjF,EACA,CAIA,OAAAoF,aAAAp8E,CAAA,CAAAg3E,CAAA,EACA,GAAAve,EAAAoB,cAAA,EAAA75D,MAAAA,EAAA,+BAAAA,GACA,iBAAAA,GACAA,CAAAA,EAAAuQ,KAAAF,KAAA,CAAArQ,EAAA,EAEA,IAAAmpE,EAAAnpE,EAAAmpE,GAAA,CACA8S,EAAA,GAOA,OANAj8E,EAAAi8E,QAAA,CACAA,EAAAj8E,EAAAi8E,QAAA,CAEAj8E,EAAAq8E,GAAA,EAAAr8E,EAAAq8E,GAAA,CAAAJ,QAAA,EACAA,CAAAA,EAAAj8E,EAAAq8E,GAAA,CAAAJ,QAAA,EAEA,SAAA9S,EAAA8S,EAAAjF,EACA,CACA,CACA32E,EAAA07E,eAAuB,CAAAA,sCCjHvB57E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAi7E,iBAAyB,CAAGj7E,EAAAg7E,QAAgB,CAAGh7E,EAAAq5E,2BAAmC,CAAGr5E,EAAAi8E,0BAAkC,CAAGj8E,EAAAm4E,2BAAmC,CAAGn4E,EAAAk4E,oBAA4B,CAAGl4E,EAAA07E,eAAuB,CAAG17E,EAAAixD,QAAgB,CAAGjxD,EAAA61E,YAAoB,QAShQ,IAAA8F,EAAoB73E,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwqE,EAAA9F,YAAA,IACtF/1E,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwqE,EAAA1qB,QAAA,IAClF,IAAAirB,EAAmBp4E,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+qE,EAAAR,eAAA,IACzF,IAAAzF,EAAoBnyE,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAAiC,oBAAA,IAC9Fp4E,OAAAC,cAAA,CAAAC,EAAA,8BAA8D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAAkC,2BAAA,IACrGr4E,OAAAC,cAAA,CAAAC,EAAA,6BAA6D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAAgG,0BAAA,IACpGn8E,OAAAC,cAAA,CAAAC,EAAA,8BAA8D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAAoD,2BAAA,IACrGv5E,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAA+E,QAAA,IAClFl7E,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8kE,EAAAgF,iBAAA,wCCrB3Fn7E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAk4E,oBAA4B,CAAGl4E,EAAAm4E,2BAAmC,CAAGn4E,EAAAq5E,2BAAmC,CAAGr5E,EAAAi8E,0BAAkC,CAAGj8E,EAAAi7E,iBAAyB,CAAGj7E,EAAAg7E,QAAgB,QAG5L,IAAAhF,EAAsBlyE,EAAQ,OAC9ByzD,EAAmBzzD,EAAQ,MAI3B,OAAAk3E,UAAAhF,EAAAkF,GAAA,CAIApE,SAAA,CAIAjkB,QAAA,CAIAjuB,IAAA,aAIA72B,CAAA,CAAAorE,CAAA,CAAAtmB,CAAA,EACA,MAAA9kD,EAAAA,EAAA2/C,QAAA,EACA,IAAA9oB,EAAAu0C,EAAAlN,cAAA,CAAApZ,EAAA9kD,EAAAjH,IAAA,CAAAiH,EAAA29D,MAAA,EACA,GAAAnU,EAAAlB,gBAAA,QAAiDzxB,KAAAA,EAAAiuB,SAAAA,EAAAikB,UAAAqC,CAAA,EACjD,CAIA,IAAAgD,WAAA,CAAsB,YAAAtpB,QAAA,CAAAj0D,IAAA,CAItB,IAAAw9E,gBAAA,CAA2B,YAAAvpB,QAAA,CAAA+S,MAAA,GAC3B,CACA5lE,EAAAg7E,QAAgB,CAAAA,CAIhB,OAAAC,UAAAjF,EAAAkF,GAAA,CAIAttE,KAAA,aAIAG,CAAA,CAAAH,CAAA,EACA,MAAAG,EAAAA,EAAA2/C,QAAA,EACA,GAAA6J,EAAAlB,gBAAA,QAAiDzoD,MAAAA,CAAA,EACjD,CACA,CACA5N,EAAAi7E,iBAAyB,CAAAA,CAKzB,OAAAgB,UAAAjG,EAAAqG,kBAAA,CACA,CAAAlD,CAAA,aAIAA,CAAA,CAAAzrB,CAAA,CAAAiN,CAAA,EACA,MAAAA,EAAAjN,GACA,MAAAyrB,CAAA,CAAAA,CACA,CAKA,IAAAmD,MAAA,CACA,aAAAA,KAAAjiE,GAAA,KACA,IAAAw4C,EAAA9kD,EAAA29D,MAAA,CAAA3sE,MAAA,OAAAo6E,CAAA,CAAAhP,QAAA,CAAAp8D,EAAA29D,MAAA,UACA,GAAA7Y,EACA,IACA,WAAAmoB,EAAAjtE,EAAA,MAAAorE,CAAA,CAAAtmB,EACA,CACA,MAAAjlD,EAAA,CACA,WAAAqtE,EAAAltE,EAAAH,EACA,CAEA,OAAAG,CACA,EACA,CACA,CACA/N,EAAAi8E,0BAAkC,CAAAA,CAKlC,OAAA5C,UAAArD,EAAAuG,mBAAA,CACA,CAAApD,CAAA,aAIAA,CAAA,CAAAzrB,CAAA,CAAAiN,CAAA,EACA,MAAAA,EAAAjN,GACA,MAAAyrB,CAAA,CAAAA,CACA,CAUA,MAAAiB,KAAAoC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAA,YAAAtC,KAAAoC,EAAAC,UACA,MAAAC,EACA,KAEA,IAAAT,EAAA,MAAA9C,CAAA,MAAAzrB,QAAA,CAAAgvB,EACA,CACA,CACA18E,EAAAq5E,2BAAmC,CAAAA,CAKnC,OAAAlB,UAAA5gB,EAAAolB,YAAA,CAIA5uE,GAAA,aAIA2oE,CAAA,CAAAoB,CAAA,CAAAr9C,CAAA,CAAA1sB,CAAA,EACA,MAAA2oE,EAAAoB,EAAAr9C,GACA,GAAA88B,EAAAlB,gBAAA,QAAiDtoD,IAAAA,CAAA,EACjD,CAIA,MAAA6uE,UAAA,CACA,kBAAA7uE,GAAA,CAAA6uE,QAAA,EACA,CAIA,MAAAC,gBAAA,CACA,kBAAA9uE,GAAA,CAAA8uE,cAAA,EACA,CAIA,MAAAC,uBAAA,CACA,kBAAA/uE,GAAA,CAAA+uE,qBAAA,EACA,CACA,CACA98E,EAAAm4E,2BAAmC,CAAAA,CAKnC,OAAAD,UAAAC,EAIAx5E,YAAA+3E,CAAA,CAAAoB,CAAA,CAAAr9C,CAAA,CAAAo4B,CAAA,CAAAkqB,CAAA,EACA,MAAArG,EAAAoB,EAAAr9C,EAAA,IAAAugD,EAAA+B,EAAArG,EAAAI,SAAA,CAAAjkB,IACA,IAAAjuB,EAAA8xC,EAAAI,SAAA,CAAA7K,cAAA,CAAApZ,EAAA,KAAA9kD,GAAA,CAAAjH,IAAA,MAAAiH,GAAA,CAAA29D,MAAA,EACA,GAAAnU,EAAAlB,gBAAA,QAAiDzxB,KAAAA,EAAAiuB,SAAAA,CAAA,EACjD,CAIA,IAAAspB,WAAA,CACA,YAAAtpB,QAAA,CAAAj0D,IAAA,CAKA,IAAAw9E,gBAAA,CACA,YAAAvpB,QAAA,CAAA+S,MAAA,EACA,CACA,CACA5lE,EAAAk4E,oBAA4B,CAAAA,sCCtL5Bp4E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqI,WAAmB,CAAGrI,EAAAg9E,UAAkB,CAAGh9E,EAAAi9E,UAAkB,CAAGj9E,EAAAk9E,UAAkB,QAClF,IAAA/8C,EAAer8B,EAAQ,OACvBq5E,EAAiBr5E,EAAQ,OACzBq1C,EAAiBr1C,EAAQ,OACzBs5E,EAAiBt5E,EAAQ,OACzByzD,EAAmBzzD,EAAQ,OAc3Bu5E,EAAAC,WAZA,uBAAAC,KACA,OAAAA,KAEA,uBAAA17C,OACA,OAAAA,OAEA,QAAqB,IAAN/9B,EAAAslC,CAAM,CACrB,OAAetlC,EAAAslC,CAAM,OAErB,uCACA,IAGAtmC,EAAAu6E,EAAAv6E,MAAA,EAAAu6E,EAAAG,QAAA,CAQAx9E,EAAAk9E,UAAkB,CAPlB,SAAAO,CAAA,EACA,OAAAA,GACA,oBAAAtkC,EAAAyB,MAAA,CAAAz7C,MAAA,EACA,qBAAAi+E,EAAA13B,MAAA,CAAAvmD,MAAA,EACA,CACA,GAAAo4D,EAAAiC,cAAA,kDAAAikB,EACA,EAOAz9E,EAAAi9E,UAAkB,CALlB,SAAAS,CAAA,CAAArtE,CAAA,EACA,IAAAotE,EAAA,CAAoB7iC,OAAAzB,EAAAyB,MAAA,CAAA8K,OAAA03B,EAAA13B,MAAA,CAAkD,CAAAg4B,EAAA,CAEtE,MADA,GAAAnmB,EAAAiC,cAAA,EAAAikB,MAAAA,EAAA,qCAAAC,GACAv9C,EAAAE,IAAA,CAAAlhC,MAAA,CAAAs+E,EAAAptE,EACA,EAOArQ,EAAAg9E,UAAkB,CALlB,SAAA/+B,CAAA,CAAAC,CAAA,CAAAy/B,CAAA,CAAAC,CAAA,CAAAF,CAAA,EACA,IAAAD,EAAA,CAAoB7iC,OAAAzB,EAAAyB,MAAA,CAAA8K,OAAA03B,EAAA13B,MAAA,CAAkD,CAAAg4B,EAAA,CAEtE,MADA,GAAAnmB,EAAAiC,cAAA,EAAAikB,MAAAA,EAAA,uCAAAC,GACA,GAAAP,EAAAz/B,MAAA,EAAA+/B,EAAAx/B,EAAAC,EAAA,CAAwDrzB,EAAA8yD,EAAAv1E,MAAAw1E,CAAA,EACxD,EAWA59E,EAAAqI,WAAmB,CATnB,SAAAtJ,CAAA,EACA,GAAAw4D,EAAA0F,MAAA,EAAAn6D,MAAAA,EAAA,2EACAo6D,UAAA,aACA,GACA,GAAA3F,EAAAiC,cAAA,EAAAp7D,OAAAg4D,SAAA,CAAAr3D,IAAAA,EAAA,GAAAA,GAAA,+BAAAA,GACA,IAAAgR,EAAA,IAAArR,WAAAK,GAEA,OADA+D,EAAA8J,eAAA,CAAAmD,GACAA,CACA,sCCnDAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA69E,WAAmB,QASnB,IAAAC,EAAoBh6E,EAAQ,OAC5ByzD,EAAmBzzD,EAAQ,OAC3Bi6E,EAAA,GACAC,EAAA,SAAAC,CAAA,CAAA5tE,CAAA,CAAAvJ,CAAA,EACA,SAAAg3E,EAAAb,UAAA,EAAAgB,EAAA5tE,GAAAxJ,MAAA,CAAAC,GAAAc,MAAA,EACA,EACAs2E,EAAAF,EAkBA,SAAAH,EAAAI,CAAA,CAAA5gC,CAAA,CAAA+tB,CAAA,EACA,IAAA/6D,EAAA,GAAAknD,EAAAwD,QAAA,EAAA1d,EAAA,OACAv2C,EAAA,GAAAywD,EAAAwD,QAAA,EAAAqQ,EAAA,QACA,SAAA7T,EAAAyD,OAAA,EAAAkjB,EAAAD,EAAA5tE,EAAAvJ,GACA,CACA9G,EAAA69E,WAAmB,CAAAA,EACnBA,EAAA9zE,CAAA,CAAAi0E,EACAH,EAAAM,IAAA,YAAiCJ,EAAA,IACjCF,EAAAO,QAAA,UAAAzqD,CAAA,EACA,GAAAoqD,EACA,qCAEAG,EAAAvqD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAm9C,uCC1CA/9E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAm+E,IAAY,CAAGn+E,EAAA01C,SAAiB,CAAG11C,EAAAq+E,UAAkB,CAAGr+E,EAAAs+E,UAAkB,CAAGt+E,EAAAkhD,MAAc,CAAGlhD,EAAA09C,MAAc,CAAG19C,EAAA0lD,MAAc,CAAG1lD,EAAA46C,MAAc,CAAG56C,EAAA4+C,SAAiB,CAAG5+C,EAAA4rE,SAAiB,CAAG5rE,EAAAqI,WAAmB,CAAGrI,EAAA69E,WAAmB,QAGlO,IAAAlgC,EAAkB75C,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwsC,EAAAkgC,WAAA,IACrF,IAAAU,EAAoBz6E,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAotE,EAAA3S,SAAA,IACnF,IAAA4S,EAAuB16E,EAAQ,OAC/BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqtE,EAAA5/B,SAAA,IACnF,IAAAwC,EAAoBt9C,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAiwC,EAAA1D,MAAA,IAChF,IAAA+gC,EAAoB36E,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAstE,EAAAp2E,WAAA,IACrF,IAAAq2E,EAAoB56E,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAutE,EAAAx9B,MAAA,IAChFphD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAutE,EAAAJ,UAAA,IACpF,IAAAK,EAAkB76E,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwtE,EAAA/jC,MAAA,IAChF96C,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwtE,EAAAj5B,MAAA,IAChF,IAAAk5B,EAAuB96E,EAAQ,OAC/BhE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAytE,EAAAP,UAAA,IACpF,IAAAQ,EAAqB/6E,EAAQ,MAC7BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0tE,EAAAnpC,SAAA,IAiBnF11C,EAAAm+E,IAAY,CAZZ,WACAxgC,EAAAkgC,WAAA,CAAAM,IAAA,GACAI,EAAA3S,SAAA,CAAAuS,IAAA,GACA/8B,EAAA1D,MAAA,CAAAygC,IAAA,GACAM,EAAAp2E,WAAA,CAAA81E,IAAA,GACAK,EAAA5/B,SAAA,CAAAu/B,IAAA,GACAO,EAAAx9B,MAAA,CAAAi9B,IAAA,GACAO,EAAAJ,UAAA,CAAAH,IAAA,GACAQ,EAAA/jC,MAAA,CAAAujC,IAAA,GACAQ,EAAAj5B,MAAA,CAAAy4B,IAAA,GACAM,EAAAp2E,WAAA,CAAA81E,IAAA,EACA,sCCxCAr+E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4rE,SAAiB,QACjB,IAAAn6D,EAAe3N,EAAQ,OACvByzD,EAAmBzzD,EAAQ,OAC3Bi6E,EAAA,GACAe,EAAA,SAAAh4E,CAAA,EACA,SAAA2K,EAAApO,UAAA,EAAAyD,EACA,EACAi4E,EAAAD,EAuBA,SAAAlT,EAAAR,CAAA,EACA,IAAAtkE,EAAA,GAAAywD,EAAAwD,QAAA,EAAAqQ,EAAA,QACA,SAAA7T,EAAAyD,OAAA,EAAA+jB,EAAAj4E,GACA,CACA9G,EAAA4rE,SAAiB,CAAAA,EACjBA,EAAA7hE,CAAA,CAAA+0E,EACAlT,EAAAuS,IAAA,YAA+BJ,EAAA,IAC/BnS,EAAAwS,QAAA,UAAAzqD,CAAA,EACA,GAAAoqD,EACA,uCAEAgB,EAAAprD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAkrC,uCC1CA9rE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA09C,MAAc,QACd,IAAAogC,EAAoBh6E,EAAQ,OAC5ByzD,EAAmBzzD,EAAQ,OAC3Bi6E,EAAA,GACAiB,EAAA,SAAA/gC,CAAA,CAAAC,CAAA,CAAAy/B,CAAA,CAAAC,CAAA,CAAAH,CAAA,EACA,SAAAK,EAAAd,UAAA,EAAA/+B,EAAAC,EAAAy/B,EAAAC,EAAAH,EACA,EACAwB,EAAAD,EAqBA,SAAAthC,EAAAG,CAAA,CAAAC,CAAA,CAAA6/B,CAAA,CAAAC,CAAA,CAAAH,CAAA,EACA,IAAAx/B,EAAA,GAAAsZ,EAAAwD,QAAA,EAAAld,EAAA,YACAK,EAAA,GAAAqZ,EAAAwD,QAAA,EAAAjd,EAAA,QACA,SAAAyZ,EAAAyD,OAAA,EAAAikB,EAAAhhC,EAAAC,EAAAy/B,EAAAC,EAAAH,GACA,CACAz9E,EAAA09C,MAAc,CAAAA,EACdA,EAAA3zC,CAAA,CAAAi1E,EACAthC,EAAAygC,IAAA,YAA4BJ,EAAA,IAC5BrgC,EAAA0gC,QAAA,UAAAzqD,CAAA,EACA,GAAAoqD,EACA,gCAEAkB,EAAAtrD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAgd,uCClDA59C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqI,WAAmB,QASnB,IAAAy1E,EAAoBh6E,EAAQ,OAC5Bi6E,EAAA,GACAmB,EAAA,SAAAngF,CAAA,EACA,WAAAL,WAAA,GAAAo/E,EAAAz1E,WAAA,EAAAtJ,GACA,EACAogF,EAAAD,EAQA,SAAA72E,EAAAtJ,CAAA,EACA,OAAAogF,EAAApgF,EACA,CACAiB,EAAAqI,WAAmB,CAAAA,EACnBA,EAAA0B,CAAA,CAAAm1E,EACA72E,EAAA81E,IAAA,YAAiCJ,EAAA,IACjC11E,EAAA+1E,QAAA,UAAAzqD,CAAA,EACA,GAAAoqD,EACA,qCAEAoB,EAAAxrD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAr4B,uCCnCAvI,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4+C,SAAiB,QACjB,IAAAwgC,EAAoBt7E,EAAQ,OAC5ByzD,EAAmBzzD,EAAQ,OAC3Bi6E,EAAA,GACAsB,EAAA,SAAAv4E,CAAA,EACA,SAAAs4E,EAAAxgC,SAAA,EAAA93C,EACA,EACAw4E,EAAAD,EAkBA,SAAAzgC,EAAAwsB,CAAA,EACA,IAAAtkE,EAAA,GAAAywD,EAAAwD,QAAA,EAAAqQ,EAAA,QACA,SAAA7T,EAAAyD,OAAA,EAAAskB,EAAAx4E,GACA,CACA9G,EAAA4+C,SAAiB,CAAAA,EACjBA,EAAA70C,CAAA,CAAAs1E,EACAzgC,EAAAu/B,IAAA,YAA+BJ,EAAA,IAC/Bn/B,EAAAw/B,QAAA,UAAAzqD,CAAA,EACA,GAAAoqD,EACA,uCAEAuB,EAAA3rD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAke,uCCvCA9+C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAs+E,UAAkB,CAAGt+E,EAAAkhD,MAAc,QACnC,IAAAq+B,EAAiBz7E,EAAQ,OACzByzD,EAAmBzzD,EAAQ,OAC3B07E,EAAA,GAAAC,EAAA,GACAC,EAAA,eAAAC,CAAA,CAAAzhC,CAAA,CAAAwF,CAAA,CAAAjb,CAAA,CAAAp3B,CAAA,CAAAjJ,CAAA,CAAAw7C,CAAA,EACA,gBAAA27B,EAAAt+B,WAAA,EAAA0+B,EAAAzhC,EAAA,CAA2DwF,EAAAA,EAAAjb,EAAAA,EAAAp3B,EAAAA,EAAAjJ,MAAAA,EAAAw7C,WAAAA,CAAA,EAC3D,EACAg8B,EAAA,SAAAD,CAAA,CAAAzhC,CAAA,CAAAwF,CAAA,CAAAjb,CAAA,CAAAp3B,CAAA,CAAAjJ,CAAA,EACA,SAAAm3E,EAAAr+B,MAAA,EAAAy+B,EAAAzhC,EAAA,CAAgDwF,EAAAA,EAAAjb,EAAAA,EAAAp3B,EAAAA,EAAAjJ,MAAAA,CAAA,EAChD,EACAy3E,EAAAH,EACAI,EAAAF,EAsCA,eAAA1+B,EAAA6+B,CAAA,CAAAjiC,CAAA,CAAA4F,CAAA,CAAAjb,CAAA,CAAAp3B,CAAA,CAAAjJ,CAAA,CAAA43E,CAAA,EACA,IAAAL,EAAA,GAAApoB,EAAAwD,QAAA,EAAAglB,EAAA,UACA7hC,EAAA,GAAAqZ,EAAAwD,QAAA,EAAAjd,EAAA,QACA,SAAAyZ,EAAAyD,OAAA,QAAA6kB,EAAAF,EAAAzhC,EAAAwF,EAAAjb,EAAAp3B,EAAAjJ,EAAA43E,GACA,CAiCA,SAAA1B,EAAAyB,CAAA,CAAAjiC,CAAA,CAAA4F,CAAA,CAAAjb,CAAA,CAAAp3B,CAAA,CAAAjJ,CAAA,EACA,IAAAu3E,EAAA,GAAApoB,EAAAwD,QAAA,EAAAglB,EAAA,UACA7hC,EAAA,GAAAqZ,EAAAwD,QAAA,EAAAjd,EAAA,QACA,SAAAyZ,EAAAyD,OAAA,EAAA8kB,EAAAH,EAAAzhC,EAAAwF,EAAAjb,EAAAp3B,EAAAjJ,GACA,CApCApI,EAAAkhD,MAAc,CAAAA,EACdA,EAAAn3C,CAAA,CAAA21E,EACAx+B,EAAAi9B,IAAA,YAA4BsB,EAAA,IAC5Bv+B,EAAAk9B,QAAA,UAAAzqD,CAAA,EACA,GAAA8rD,EACA,gCAEAI,EAAAlsD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAwgB,GA4BAlhD,EAAAs+E,UAAkB,CAAAA,EAClBA,EAAAv0E,CAAA,CAAA61E,EACAtB,EAAAH,IAAA,YAAgCqB,EAAA,IAChClB,EAAAF,QAAA,UAAAzqD,CAAA,EACA,GAAA6rD,EACA,oCAEAM,EAAAnsD,CACA,EACA7zB,OAAA4gC,MAAA,CAAA49C,uCCrGAx+E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0lD,MAAc,CAAG1lD,EAAA46C,MAAc,QAC/B,IAAAkjC,EAAoBh6E,EAAQ,OAC5ByzD,EAAmBzzD,EAAQ,OAC3Bm8E,EAAA,SAAAn5E,CAAA,EACA,SAAAg3E,EAAAZ,UAAA,YAAAr2E,MAAA,CAAAC,GAAAc,MAAA,EACA,EACAs4E,EAAA,SAAAp5E,CAAA,EACA,SAAAg3E,EAAAZ,UAAA,YAAAr2E,MAAA,CAAAC,GAAAc,MAAA,EACA,EACAu4E,EAAAF,EACAG,EAAAF,EACAG,EAAA,GAAAC,EAAA,GAkBA,SAAA1lC,EAAAwwB,CAAA,EACA,IAAAtkE,EAAA,GAAAywD,EAAAwD,QAAA,EAAAqQ,EAAA,QACA,SAAA7T,EAAAyD,OAAA,EAAAmlB,EAAAr5E,GACA,CA2BA,SAAA4+C,EAAA0lB,CAAA,EACA,IAAAtkE,EAAA,GAAAywD,EAAAwD,QAAA,EAAAqQ,EAAA,QACA,SAAA7T,EAAAyD,OAAA,EAAAolB,EAAAt5E,GACA,CA7BA9G,EAAA46C,MAAc,CAAAA,EACdA,EAAA7wC,CAAA,CAAAk2E,EACArlC,EAAAujC,IAAA,YAA4BkC,EAAA,IAC5BzlC,EAAAwjC,QAAA,UAAAzqD,CAAA,EACA,GAAA0sD,EACA,gCAEAF,EAAAxsD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAka,GAqBA56C,EAAA0lD,MAAc,CAAAA,EACdA,EAAA37C,CAAA,CAAAm2E,EACAx6B,EAAAy4B,IAAA,YAA4BmC,EAAA,IAC5B56B,EAAA04B,QAAA,UAAAzqD,CAAA,EACA,GAAA2sD,EACA,gCAEAF,EAAAzsD,CACA,EACA7zB,OAAA4gC,MAAA,CAAAka,sCCzEA96C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA01C,SAAiB,QACjB,IAAA6hB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAE3B68D,EAAAl/D,OAAA,GACAm/D,EAAAn/D,OAAA,GACA8+E,EAAA9+E,OAAA,GACA++E,EAAA/+E,OAAA,IACAg/E,EAAAh/E,OAAA,IACAi/E,EAAAj/E,OAAA,IACAu6D,EAAA,GACA,SAAA2kB,EAAA1gF,CAAA,EACA,SAAAk4D,EAAA0T,YAAA,KAAA1T,EAAAkF,SAAA,EAAAp9D,GAAA,GACA,CAOA,MAAAy1C,EACA,CAAAjN,CAAA,EACAtmC,CAAA,EACAomC,CAAA,EACAq4C,CAAA,KAOAn4C,GAAA,CAAc,aAAAA,CAAA,CACd,IAAAA,EAAAxoC,CAAA,EACA,GAAAk4D,EAAAqB,cAAA,UAAArB,EAAAyF,UAAA,EAAA39D,GAAA,oBAAAA,GACA,MAAAwoC,CAAA,IAAA0vB,EAAA6C,OAAA,EAAA/6D,EACA,CAIA,IAAAkC,GAAA,CAAc,aAAAA,CAAA,CACd,IAAAA,EAAAi9D,CAAA,EACA,GAAAjH,EAAAqB,cAAA,UAAArB,EAAAyF,UAAA,EAAAwB,GAAA,oBAAAA,GACA,IAAAn/D,EAAA,GAAAk4D,EAAA6C,OAAA,EAAAoE,GACA,GAAAjH,EAAAqB,cAAA,EAAA3nD,EAAAA,SAAA5R,EAAAwgE,SAAA,iCAAAxgE,GACA,MAAAkC,CAAA,CAAAlC,CACA,CAWA,IAAAsoC,GAAA,CAAc,aAAAA,CAAA,CACd,IAAAA,EAAAtoC,CAAA,EACA,IAAAsoC,EAAA,GAAA4vB,EAAAyE,SAAA,EAAA38D,EAAA,SACA,GAAAk4D,EAAAqB,cAAA,EAAAjxB,KAAAA,GAAAA,KAAAA,EAAA,gBAAAtoC,GACA,MAAAsoC,CAAA,CAAAA,CACA,CAKA,IAAAq4C,UAAA,CAAqB,aAAAA,CAAA,CAKrB,IAAAC,eAAA,CACA,IAAAt4C,EAAA,KAAAq4C,QAAA,QACA,MAAAr4C,EACA,KAEAmN,EAAAorC,UAAA,CAAAv4C,EACA,CAMA,IAAAw4C,SAAA,CACA,iBAAAx4C,CAAA,IACA,CAKA,IAAAy4C,aAAA,CAEA,IAAAA,EAAA,GAAA7oB,EAAA4C,QAAA,OAAA54D,CAAA,EAIA,OAHA,KAAA4+E,OAAA,EACAC,CAAAA,CAAA,UAEA,GAAA7oB,EAAA6C,OAAA,EAAAgmB,EACA,CAIA,IAAAC,mBAAA,CACA,SAAA9oB,EAAAnN,MAAA,QAAAviB,CAAA,MAAAu4C,WAAA,EACA,CAIA,IAAAE,YAAA,CACA,SAAA/oB,EAAAnN,MAAA,QAAAviB,CAAA,MAAAtmC,CAAA,MAAA4+E,OAAA,gBACA,CAIApiF,YAAA09D,CAAA,CAAA5zB,CAAA,CAAAtmC,CAAA,CAAAomC,CAAA,EACA,GAAA4vB,EAAAwN,aAAA,EAAAtJ,EAAAL,EAAA,aACA,MAAAvzB,CAAA,CAAAA,EACA,MAAAtmC,CAAA,CAAAA,EACA,MAAAomC,CAAA,CAAAA,EACA,MAAAq4C,CAAA,KACA,CACA,CAAAj2B,OAAAua,GAAA,kCACA,uBAA4B,EAAM,KAAAz8B,CAAA,CAAO,SAAS,KAAAtmC,CAAA,CAAO,cAAc,KAAA4+E,OAAA,CAAa,cAAc,KAAAH,QAAA,GAAgB,EAKlH10E,OAAA,CACA,IAAAA,EAAA,IAAAwpC,EAAAsmB,EAAA,KAAAvzB,CAAA,MAAAtmC,CAAA,MAAAomC,CAAA,EAIA,OAHA,KAAAq4C,QAAA,EACA10E,CAAAA,EAAA,CAAA00E,CAAA,MAAAA,QAAA,EAEA10E,CACA,CAIAi1E,QAAA,CACA,IAAAP,EAAA,KAAAA,QAAA,CACA,OACAQ,MAAA,YACAR,SAAA,MAAAA,EAAAA,EAAA52E,QAAA,QACAy+B,EAAA,KAAAA,CAAA,CAAAtmC,EAAA,KAAAA,CAAA,CAAAomC,EAAA,KAAAA,CAAA,CAEA,CAWA,OAAAu4C,WAAAv4C,CAAA,EACA,IAAA84C,EAAA,GAAAlpB,EAAA4I,SAAA,EAAAx4B,EAAA,YAEA,GAAAi4C,GAAAa,GAAAZ,EACA9f,GAGA,GAAAxI,EAAAqB,cAAA,EAAA6nB,GAAAX,EAAA,wBAAAn4C,GACA,CAAA84C,EAAAX,CAAA,EAAAH,EACA,CAeA,OAAAe,YAAAhyE,CAAA,CAAAi5B,CAAA,EACA,SAAA4vB,EAAA4I,SAAA,EAAAzxD,GAAAixE,EAAA9+E,OAAA,GAAA8mC,EAAA,GACA,CAsBA,OAAAg5C,eAAAh5C,CAAA,EACA,IAAA84C,EAAA,GAAAlpB,EAAA4I,SAAA,EAAAx4B,UACA,IAAAo4B,GAAA0gB,IAAAb,EACA,GAEAa,IAAAzgB,GAAAygB,IAAAZ,EACA,IAEA,GAAAtoB,EAAAqB,cAAA,EAAA6nB,GAAAX,EAAA,gBAAAn4C,GAEA,EAAAq4B,EAAA,MACA,CASA,OAAA92D,KAAA+kC,CAAA,EACA,SAAA2yC,EAAAC,CAAA,CAAA/oC,CAAA,EACA,GAAAyf,EAAAqB,cAAA,EAAAioB,EAAA/oC,EAAA,YAAA7J,EACA,CAEA,GAAAA,MAAAA,EACA,WAAA6G,EAAAsmB,EAAAzE,EAAA2d,QAAA,CAAA3d,EAAA2d,QAAA,KAEA,oBAAArmC,EAAA,CACA,IAAAhwC,EAAA,GAAAs5D,EAAA4C,QAAA,EAAAlsB,EAAA,aACA,GAAAhwC,KAAAA,EAAAE,MAAA,EACA,IAAA0pC,EAAA,GAAA0vB,EAAA6C,OAAA,EAAAn8D,EAAAiR,KAAA,QACA3N,EAAAtD,EAAAiR,KAAA,QACAy4B,EAAA,IAAApmC,CAAA,UAEA,OADAA,CAAA,SACA,IAAAuzC,EAAAsmB,EAAAvzB,EAAA,GAAA0vB,EAAA6C,OAAA,EAAA74D,GAAAomC,EACA,CACA,GAAA1pC,KAAAA,EAAAE,MAAA,EACA,IAAA0pC,EAAA,GAAA0vB,EAAA6C,OAAA,EAAAn8D,EAAAiR,KAAA,QACA3N,EAAAtD,EAAAiR,KAAA,QACA0xE,EAAA,CAAAr/E,IAAAA,CAAA,2BACA,IAAAomC,EAAAmN,EAAA6rC,cAAA,CAAA1iF,CAAA,MACA,WAAA62C,EAAAsmB,EAAAvzB,EAAA,GAAA0vB,EAAA6C,OAAA,EAAA74D,GAAAomC,EACA,CACAi5C,EAAA,kCACA,CACA,GAAA3yC,aAAA6G,EACA,OAAA7G,EAAA3iC,KAAA,GAGA,IAAAw1E,EAAA7yC,EAAApG,CAAA,CACA+4C,EAAAE,MAAAA,EAAA,aACA,IAAAj5C,EAAAk4C,EAAAe,GAEAv/E,EAAA,SAAAA,CAAA,CAAA6+E,CAAA,EACA,GAAA7+E,MAAAA,EACA,OAAAw+E,EAAAx+E,GAEA,GAAA6+E,MAAAA,EAAA,CACAQ,EAAA,GAAArpB,EAAAmR,WAAA,EAAA0X,EAAA,2BACA,IAAAniF,EAAA,GAAAs5D,EAAA4C,QAAA,EAAAimB,GAEA,OADAniF,CAAA,SACA,GAAAs5D,EAAA6C,OAAA,EAAAn8D,EACA,CACA2iF,EAAA,eACA,EAAS3yC,EAAA1sC,CAAA,CAAA0sC,EAAAmyC,WAAA,EACTQ,EAAA,QAAArpB,EAAA4C,QAAA,EAAA54D,EAAA,2BAEA,IAAgBy+E,SAAAA,CAAA,CAAAr4C,EAAAA,CAAA,EAAc,SAAAo5C,CAAA,CAAAX,CAAA,CAAAD,CAAA,EAC9B,GAAAY,MAAAA,EAAA,CACA,IAAAp5C,EAAA,GAAA4vB,EAAA4I,SAAA,EAAA4gB,GACA,OACAf,SAAA,GAAAF,EAAAn4C,EAAAvlC,KAAAA,EACAulC,EAAAmN,EAAA6rC,cAAA,CAAAh5C,EACA,CACA,CACA,GAAAy4C,MAAAA,EAEA,OADAQ,EAAA,GAAArpB,EAAAmR,WAAA,EAAA0X,EAAA,2BACA,CAAyBz4C,EAAA,OAAA4vB,EAAA4C,QAAA,EAAAimB,EAAA,WAEzB,GAAAD,MAAAA,EAAA,CACA,UAAA5oB,EAAAyE,SAAA,EAAAmkB,EAAA,gBACA,cAAqCx4C,EAAA,GACrC,eAAqCA,EAAA,GACrC,CACAi5C,EAAA,qBACA,CACAA,EAAA,eACA,EAAS3yC,EAAAtG,CAAA,CAAAsG,EAAAmyC,WAAA,CAAAnyC,EAAAkyC,OAAA,EACThxE,EAAA,IAAA2lC,EAAAsmB,EAAAvzB,EAAAtmC,EAAAomC,GAOA,OANAq4C,GACA7wE,CAAAA,EAAA,CAAA6wE,CAAA,CAAAA,CAAA,EAGAY,EAAA3yC,MAAAA,EAAAkyC,OAAA,KAAA5oB,EAAAyE,SAAA,EAAA/tB,EAAAkyC,OAAA,kBAAAhxE,EAAAgxE,OAAA,qBACAS,EAAA3yC,MAAAA,EAAAmyC,WAAA,EAAAnyC,EAAAmyC,WAAA,GAAAjxE,EAAAixE,WAAA,yBACAjxE,CACA,CACA,CACA/P,EAAA01C,SAAiB,CAAAA,sCCzSjB51C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq+E,UAAkB,QAClB,IAAAuD,EAAoB99E,EAAQ,OAC5ByzD,EAAmBzzD,EAAQ,OAC3B+6E,EAAuB/6E,EAAQ,KAK/B,OAAAu6E,EACA,CAAAttC,CAAA,aAIAA,CAAA,EACA,GAAAwmB,EAAAiC,cAAA,UAAAjC,EAAAqG,UAAA,EAAA7sB,GAAA,iDACA,MAAAA,CAAA,IAAAwmB,EAAAyD,OAAA,EAAAjqB,EACA,CAIA,IAAAA,YAAA,CAAuB,aAAAA,CAAA,CAOvB,IAAAuH,WAAA,CAAsB,OAAA+lC,EAAAwD,gBAAA,OAAA9wC,CAAA,EAQtB,IAAA+wC,qBAAA,CAAgC,OAAAzD,EAAAwD,gBAAA,OAAA9wC,CAAA,KAIhCsG,KAAAzvC,CAAA,EACA,GAAA2vD,EAAAiC,cAAA,UAAAjC,EAAAqG,UAAA,EAAAh2D,GAAA,iCAAAA,GACA,IAAAinC,EAAA+yC,EAAA1oC,SAAA,CAAA7B,IAAA,IAAAkgB,EAAA+F,YAAA,EAAA11D,GAAA,GAAA2vD,EAAA+F,YAAA,QAAAvsB,CAAA,GACAkE,KAAA,EACA,GACA,OAAA4pC,EAAAnpC,SAAA,CAAA5rC,IAAA,EACA2+B,EAAA,GAAA8uB,EAAAgI,OAAA,EAAA1wB,EAAApG,CAAA,KACAtmC,EAAA,GAAAo1D,EAAAgI,OAAA,EAAA1wB,EAAA1sC,CAAA,KACAomC,EAAAsG,EAAA8G,QAAA,MACA,EACA,CAuBAosC,oBAAAxxC,CAAA,EACA,IAAAyxC,EAAA3D,EAAAwD,gBAAA,CAAAtxC,GACA,SAAAgnB,EAAAyD,OAAA,EAAA4mB,EAAA1oC,SAAA,CAAAhC,eAAA,IAAAqgB,EAAA+F,YAAA,QAAAvsB,CAAA,KAAAwmB,EAAAwD,QAAA,EAAAinB,GAAA,IACA,CA0BA,OAAAH,iBAAAxxE,CAAA,CAAA4xE,CAAA,EACA,IAAApjF,EAAA,GAAA04D,EAAAwD,QAAA,EAAA1qD,EAAA,OAEA,GAAAxR,KAAAA,EAAAE,MAAA,EACA,IAAAijF,EAAAJ,EAAA1oC,SAAA,CAAAjC,YAAA,CAAAp4C,EAAA,EAAAojF,GACA,SAAA1qB,EAAAyD,OAAA,EAAAgnB,EACA,CAEA,GAAAnjF,KAAAA,EAAAE,MAAA,EACA,IAAAg9C,EAAA,IAAAr9C,WAAA,GACAq9C,CAAAA,CAAA,MACAA,EAAAz0C,GAAA,CAAAzI,EAAA,GACAA,EAAAk9C,CACA,CACA,IAAApM,EAAAiyC,EAAA1oC,SAAA,CAAApF,eAAA,CAAAjD,OAAA,CAAAhyC,GACA,SAAA04D,EAAAyD,OAAA,EAAArrB,EAAA+D,UAAA,CAAAuuC,GACA,CAmBA,OAAAlsC,iBAAAnuC,CAAA,CAAAywC,CAAA,EACA,GAAAkf,EAAAiC,cAAA,UAAAjC,EAAAqG,UAAA,EAAAh2D,GAAA,iCAAAA,GACA,IAAAinC,EAAAgwC,EAAAnpC,SAAA,CAAA5rC,IAAA,CAAAuuC,GACA6pC,EAAAN,EAAA1oC,SAAA,CAAAxD,SAAA,CAAAE,WAAA,IAAA2hB,EAAA+F,YAAA,KAAA/F,EAAAvM,MAAA,GAAAnc,EAAApG,CAAA,CAAAoG,EAAA1sC,CAAA,KAEA6/E,EAAAE,CADAA,EAAAA,EAAApsC,cAAA,CAAAjH,EAAAkyC,OAAA,GACAhrC,gBAAA,IAAAwhB,EAAA+F,YAAA,EAAA11D,IAEA,MADA,GAAA2vD,EAAAiC,cAAA,EAAAwoB,MAAAA,EAAA,2CAAA3pC,GACA,KAAA2pC,EAAApuC,KAAA,IACA,CAWA,OAAAuuC,UAAAC,CAAA,CAAAC,CAAA,CAAAJ,CAAA,EACA,IAAAK,EAAAV,EAAA1oC,SAAA,CAAApF,eAAA,CAAAjD,OAAA,CAAAwtC,EAAAwD,gBAAA,CAAAO,GAAA3hB,SAAA,KACA8hB,EAAAX,EAAA1oC,SAAA,CAAApF,eAAA,CAAAjD,OAAA,CAAAwtC,EAAAwD,gBAAA,CAAAQ,GAAA5hB,SAAA,KACA,WAAA6hB,EAAA9hF,GAAA,CAAA+hF,GAAA3uC,KAAA,GAAAquC,EACA,CACA,CACAjiF,EAAAq+E,UAAkB,CAAAA,sCCrKlBv+E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4+C,SAAiB,CAAG5+C,EAAA4rE,SAAiB,CAAG5rE,EAAAqI,WAAmB,CAAGrI,EAAA69E,WAAmB,CAAG79E,EAAAi7E,iBAAyB,CAAGj7E,EAAAg7E,QAAgB,CAAGh7E,EAAAm4E,2BAAmC,CAAGn4E,EAAAq5E,2BAAmC,CAAGr5E,EAAAi8E,0BAAkC,CAAGj8E,EAAAk4E,oBAA4B,CAAGl4E,EAAA07E,eAAuB,CAAG17E,EAAAixD,QAAgB,CAAGjxD,EAAA61E,YAAoB,CAAG71E,EAAAm1E,aAAqB,CAAGn1E,EAAAo1E,WAAmB,CAAGp1E,EAAAk1E,QAAgB,CAAGl1E,EAAA0jD,CAAS,CAAG1jD,EAAAq1E,SAAiB,CAAGr1E,EAAAs1E,SAAiB,CAAGt1E,EAAAu1E,UAAkB,CAAGv1E,EAAAw1E,WAAmB,CAAGx1E,EAAAi1E,WAAmB,CAAGj1E,EAAAi0E,cAAsB,CAAGj0E,EAAAk0E,SAAiB,CAAGl0E,EAAAm0E,aAAqB,CAAGn0E,EAAAw0E,iBAAyB,CAAGx0E,EAAAy0E,gBAAwB,CAAGz0E,EAAAszE,cAAsB,CAAGtzE,EAAA8vD,UAAkB,CAAG9vD,EAAAq/D,KAAa,CAAGr/D,EAAA4nE,sBAA8B,CAAG5nE,EAAA47D,MAAc,CAAG57D,EAAA6nE,cAAsB,CAAG7nE,EAAA+nE,SAAiB,CAAG/nE,EAAAgoE,OAAe,CAAGhoE,EAAA8nE,gBAAwB,CAAG9nE,EAAA27D,iBAAyB,CAAG37D,EAAAshE,cAAsB,CAAGthE,EAAA85D,SAAiB,CAAG95D,EAAA4hE,aAAqB,CAAG5hE,EAAAuhE,gBAAwB,CAAGvhE,EAAAwhE,gBAAwB,CAAGxhE,EAAA6hE,QAAgB,CAAG7hE,EAAA0hE,aAAqB,CAAG1hE,EAAA2hE,aAAqB,CAAG3hE,EAAAyhE,mBAA2B,CAAGzhE,EAAAs3D,QAAgB,CAAGt3D,EAAAq7D,mBAA2B,CAAGr7D,EAAAo7D,mBAA2B,CAAGp7D,EAAAqP,OAAe,QACzqCrP,EAAAwiF,SAAiB,CAAGxiF,EAAAyiF,OAAe,CAAGziF,EAAA0iF,WAAmB,CAAG1iF,EAAA2iF,iBAAyB,CAAG3iF,EAAA4iF,cAAsB,CAAG5iF,EAAA6iF,iBAAyB,CAAG7iF,EAAA8iF,iBAAyB,CAAG9iF,EAAA+iF,cAAsB,CAAG/iF,EAAAgjF,uBAA+B,CAAGhjF,EAAAijF,cAAsB,CAAGjjF,EAAAkjF,iBAAyB,CAAGljF,EAAAmjF,kBAA0B,CAAGnjF,EAAAojF,kBAA0B,CAAGpjF,EAAAqjF,YAAoB,CAAGrjF,EAAAsjF,eAAuB,CAAGtjF,EAAAujF,eAAuB,CAAGvjF,EAAAwjF,aAAqB,CAAGxjF,EAAAyjF,eAAuB,CAAGzjF,EAAA0jF,kBAA0B,CAAG1jF,EAAA2jF,gBAAwB,CAAG3jF,EAAA4jF,gBAAwB,CAAG5jF,EAAA6jF,UAAkB,CAAG7jF,EAAA8jF,YAAoB,CAAG9jF,EAAA+jF,cAAsB,CAAG/jF,EAAAu8E,mBAA2B,CAAGv8E,EAAAq8E,kBAA0B,CAAGr8E,EAAAk7E,GAAW,CAAGl7E,EAAAgkF,OAAe,CAAGhkF,EAAAikF,KAAa,CAAGjkF,EAAAkkF,kBAA0B,CAAGlkF,EAAAmkF,eAAuB,CAAGnkF,EAAAokF,gBAAwB,CAAGpkF,EAAAqkF,oBAA4B,CAAGrkF,EAAAskF,uBAA+B,CAAGtkF,EAAAukF,cAAsB,CAAGvkF,EAAAmvD,aAAqB,CAAGnvD,EAAAqwD,WAAmB,CAAGrwD,EAAAwkF,SAAiB,CAAGxkF,EAAAykF,QAAgB,CAAGzkF,EAAA0kF,WAAmB,CAAG1kF,EAAA2kF,YAAoB,CAAG3kF,EAAAqO,EAAU,CAAGrO,EAAAq+E,UAAkB,CAAGr+E,EAAA01C,SAAiB,CAAG11C,EAAAm+E,IAAY,CAAGn+E,EAAAs+E,UAAkB,CAAGt+E,EAAAkhD,MAAc,CAAGlhD,EAAA09C,MAAc,CAAG19C,EAAA0lD,MAAc,CAAG1lD,EAAA46C,MAAc,QAC5pC56C,EAAA4kF,OAAe,CAAG5kF,EAAA48D,SAAiB,CAAG58D,EAAA+gE,SAAiB,CAAG/gE,EAAA6kF,WAAmB,CAAG7kF,EAAA8kF,iBAAyB,CAAG9kF,EAAA+kF,aAAqB,CAAG/kF,EAAAglF,YAAoB,CAAGhlF,EAAA28E,YAAoB,CAAG38E,EAAAsgE,OAAe,CAAGtgE,EAAA25E,eAAuB,CAAG35E,EAAAk7D,SAAiB,CAAGl7D,EAAA2lE,aAAqB,CAAG3lE,EAAAilF,eAAuB,CAAGjlF,EAAAk6D,mBAA2B,CAAGl6D,EAAAw5D,cAAsB,CAAGx5D,EAAAi9D,MAAc,CAAGj9D,EAAAw6E,iBAAyB,CAAGx6E,EAAAq2D,gBAAwB,CAAGr2D,EAAA6rE,YAAoB,CAAG7rE,EAAAu7D,YAAoB,CAAGv7D,EAAAklF,cAAsB,CAAGllF,EAAAmlF,WAAmB,CAAGnlF,EAAAspE,WAAmB,CAAGtpE,EAAAg7D,OAAe,CAAGh7D,EAAAs9D,YAAoB,CAAGt9D,EAAA+6D,QAAgB,CAAG/6D,EAAA8qE,SAAiB,CAAG9qE,EAAA49D,UAAkB,CAAG59D,EAAAgrD,MAAc,CAAGhrD,EAAAolF,YAAoB,CAAGplF,EAAAqlF,YAAoB,CAAGrlF,EAAAslF,YAAoB,CAAGtlF,EAAAulF,YAAoB,CAAGvlF,EAAAwlF,WAAmB,CAAGxlF,EAAAylF,cAAsB,CAAGzlF,EAAA0lF,cAAsB,CAAG1lF,EAAA2lF,aAAqB,CAAG3lF,EAAA4lF,mBAA2B,CAAG5lF,EAAAo3E,WAAmB,CAAGp3E,EAAA6lF,mBAA2B,CAAG7lF,EAAA8lF,gBAAwB,CAAG9lF,EAAA+lF,uBAA+B,CAAG/lF,EAAAgmF,qBAA6B,CAAGhmF,EAAAimF,qBAA6B,CAAGjmF,EAAAkmF,uBAA+B,CAAGlmF,EAAAmmF,aAAqB,CAAGnmF,EAAAomF,aAAqB,CAAGpmF,EAAAqmF,4BAAoC,CAAGrmF,EAAAsmF,oBAA4B,CAAGtmF,EAAAumF,eAAuB,QACtsCvmF,EAAAwmF,SAAiB,CAAGxmF,EAAAymF,YAAoB,CAAGzmF,EAAA0mF,WAAmB,CAAG1mF,EAAA2mF,MAAc,CAAG3mF,EAAA4mF,QAAgB,CAAG5mF,EAAA6mF,uBAA+B,CAAG7mF,EAAA8mF,mBAA2B,CAAG9mF,EAAA+mF,mBAA2B,CAAG/mF,EAAAgnF,uBAA+B,CAAGhnF,EAAAinF,oBAA4B,CAAGjnF,EAAAknF,cAAsB,CAAGlnF,EAAAmnF,eAAuB,CAAGnnF,EAAAonF,qBAA6B,CAAGpnF,EAAAqnF,cAAsB,CAAGrnF,EAAAsnF,WAAmB,CAAGtnF,EAAAunF,MAAc,CAAGvnF,EAAAwnF,gBAAwB,CAAGxnF,EAAAynF,YAAoB,CAAGznF,EAAA0nF,UAAkB,CAAG1nF,EAAA2nF,QAAgB,CAAG3nF,EAAA4nF,MAAc,CAAG5nF,EAAA20E,SAAiB,CAAG30E,EAAA6nF,SAAiB,CAAG7nF,EAAA8nF,cAAsB,CAAG9nF,EAAAy7D,YAAoB,CAAGz7D,EAAA+nF,gBAAwB,CAAG/nF,EAAAs7D,WAAmB,CAAGt7D,EAAAgoF,UAAkB,CAAGhoF,EAAAioF,WAAmB,CAAGjoF,EAAAkoF,UAAkB,CAAGloF,EAAAmoF,WAAmB,CAAGnoF,EAAAiiC,IAAY,CAAGjiC,EAAAihE,MAAc,CAAGjhE,EAAAkhE,QAAgB,CAAGlhE,EAAAooF,UAAkB,CAAGpoF,EAAAi/D,QAAgB,CAAGj/D,EAAAu/D,OAAe,CAAGv/D,EAAA++D,QAAgB,CAAG/+D,EAAAq9D,SAAiB,QACl3B,IAAAgrB,EAAoBvkF,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAk3E,EAAAh5E,OAAA,IACjF,IAAAkoD,EAAiBzzD,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAA6D,mBAAA,IAC7Ft7D,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAA8D,mBAAA,IAC7Fv7D,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAD,QAAA,IAClFx3D,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAkK,mBAAA,IAC7F3hE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAoK,aAAA,IACvF7hE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAmK,aAAA,IACvF5hE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAsK,QAAA,IAClF/hE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAiK,gBAAA,IAC1F1hE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAgK,gBAAA,IAC1FzhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAqK,aAAA,IACvF9hE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAuC,SAAA,IACnFh6D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAA+J,cAAA,IACxFxhE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAoE,iBAAA,IAC3F77D,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAuQ,gBAAA,IAC1FhoE,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAyQ,OAAA,IACjFloE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAwQ,SAAA,IACnFjoE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAsQ,cAAA,IACxF/nE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAqE,MAAA,IAChF97D,OAAAC,cAAA,CAAAC,EAAA,yBAAyD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAAqQ,sBAAA,IAChG9nE,OAAAC,cAAA,CAAAC,EAAA,QAAwC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomD,EAAA8H,KAAA,IAC/E,IAAAlH,EAAiBr0D,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAArI,UAAA,IACpFhwD,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAAmb,cAAA,IACxFxzE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAAsc,gBAAA,IAC1F30E,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAAqc,iBAAA,IAC3F10E,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAAgc,aAAA,IACvFr0E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAA+b,SAAA,IACnFp0E,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgnD,EAAA8b,cAAA,IACxF,IAAA7b,EAAiBt0D,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAA6c,WAAA,IACrFn1E,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAAod,WAAA,IACrF11E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAAmd,UAAA,IACpFz1E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAAkd,SAAA,IACnFx1E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAAid,SAAA,IACnFv1E,OAAAC,cAAA,CAAAC,EAAA,IAAoC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAA1U,CAAA,IAC3E5jD,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAA8c,QAAA,IAClFp1E,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAAgd,WAAA,IACrFt1E,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAinD,EAAA+c,aAAA,IACvF,IAAAmT,EAAiBxkF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAAzS,YAAA,IACtF/1E,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAAr3B,QAAA,IAClFnxD,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAA5M,eAAA,IACzF57E,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAApQ,oBAAA,IAC9Fp4E,OAAAC,cAAA,CAAAC,EAAA,6BAA6D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAArM,0BAAA,IACpGn8E,OAAAC,cAAA,CAAAC,EAAA,8BAA8D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAAjP,2BAAA,IACrGv5E,OAAAC,cAAA,CAAAC,EAAA,8BAA8D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAAnQ,2BAAA,IACrGr4E,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAAtN,QAAA,IAClFl7E,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAm3E,EAAArN,iBAAA,IAC3F,IAAAsN,EAAiBzkF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA1K,WAAA,IACrF/9E,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAAlgF,WAAA,IACrFvI,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA3c,SAAA,IACnF9rE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA3pC,SAAA,IACnF9+C,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA3tC,MAAA,IAChF96C,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA7iC,MAAA,IAChF5lD,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA7qC,MAAA,IAChF59C,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAArnC,MAAA,IAChFphD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAAjK,UAAA,IACpFx+E,OAAAC,cAAA,CAAAC,EAAA,OAAuC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAApK,IAAA,IAC9Er+E,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAA7yC,SAAA,IACnF51C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAo3E,EAAAlK,UAAA,IACpF,IAAAmK,EAAiB1kF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,KAAqC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAn6E,EAAA,IAC5EvO,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAA7D,YAAA,IACtF7kF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAA9D,WAAA,IACrF5kF,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAA/D,QAAA,IAClF3kF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAhE,SAAA,IACnF1kF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAn4B,WAAA,IACrFvwD,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAr5B,aAAA,IACvFrvD,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAjE,cAAA,IACxFzkF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAlE,uBAAA,IACjGxkF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAAnE,oBAAA,IAC9FvkF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAApE,gBAAA,IAC1FtkF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAq3E,EAAArE,eAAA,IACzF,IAAAsE,EAAiB3kF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAvE,kBAAA,IAC5FpkF,OAAAC,cAAA,CAAAC,EAAA,QAAwC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAxE,KAAA,IAC/EnkF,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAzE,OAAA,IACjFlkF,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAvN,GAAA,IAC7Ep7E,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAApM,kBAAA,IAC5Fv8E,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAlM,mBAAA,IAC7Fz8E,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA1E,cAAA,IACxFjkF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA3E,YAAA,IACtFhkF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA5E,UAAA,IACpF/jF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA7E,gBAAA,IAC1F9jF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA9E,gBAAA,IAC1F7jF,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA/E,kBAAA,IAC5F5jF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAhF,eAAA,IACzF3jF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAjF,aAAA,IACvF1jF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAlF,eAAA,IACzFzjF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAnF,eAAA,IACzFxjF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAApF,YAAA,IACtFvjF,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAArF,kBAAA,IAC5FtjF,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAtF,kBAAA,IAC5FrjF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAvF,iBAAA,IAC3FpjF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAxF,cAAA,IACxFnjF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAzF,uBAAA,IACjGljF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA1F,cAAA,IACxFjjF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA3F,iBAAA,IAC3FhjF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA5F,iBAAA,IAC3F/iF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA7F,cAAA,IACxF9iF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA9F,iBAAA,IAC3F7iF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA/F,WAAA,IACrF5iF,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAhG,OAAA,IACjF3iF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAjG,SAAA,IACnF1iF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAlC,eAAA,IACzFzmF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAnC,oBAAA,IAC9FxmF,OAAAC,cAAA,CAAAC,EAAA,+BAA+D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAApC,4BAAA,IACtGvmF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAArC,aAAA,IACvFtmF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAtC,aAAA,IACvFrmF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAvC,uBAAA,IACjGpmF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAxC,qBAAA,IAC/FnmF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAAzC,qBAAA,IAC/FlmF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA1C,uBAAA,IACjGjmF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA3C,gBAAA,IAC1FhmF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA5C,mBAAA,IAC7F/lF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAArR,WAAA,IACrFt3E,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAs3E,EAAA7C,mBAAA,IAC7F,IAAA8C,EAAiB5kF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAu3E,EAAA/C,aAAA,IACvF7lF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAu3E,EAAAhD,cAAA,IACxF5lF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAu3E,EAAAjD,cAAA,IACxF3lF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAu3E,EAAAlD,WAAA,IACrF,IAAAmD,EAAiB7kF,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAApD,YAAA,IACtFzlF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAArD,YAAA,IACtFxlF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAtD,YAAA,IACtFvlF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAvD,YAAA,IACtFtlF,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA39B,MAAA,IAChFlrD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA/qB,UAAA,IACpF99D,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA7d,SAAA,IACnFhrE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA5tB,QAAA,IAClFj7D,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAArrB,YAAA,IACtFx9D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA3tB,OAAA,IACjFl7D,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAArf,WAAA,IACrFxpE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAxD,WAAA,IACrFrlF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAzD,cAAA,IACxFplF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAptB,YAAA,IACtFz7D,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA9c,YAAA,IACtF/rE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAtyB,gBAAA,IAC1Fv2D,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAnO,iBAAA,IAC3F16E,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA1rB,MAAA,IAChFn9D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAnvB,cAAA,IACxF15D,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAzuB,mBAAA,IAC7Fp6D,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA1D,eAAA,IACzFnlF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAhjB,aAAA,IACvF7lE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAztB,SAAA,IACnFp7D,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAhP,eAAA,IACzF75E,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAroB,OAAA,IACjFxgE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAhM,YAAA,IACtF78E,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA3D,YAAA,IACtFllF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA5D,aAAA,IACvFjlF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA7D,iBAAA,IAC3FhlF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA9D,WAAA,IACrF/kF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA5nB,SAAA,IACnFjhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA/rB,SAAA,IACnF98D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA/D,OAAA,IACjF9kF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAtrB,SAAA,IACnFv9D,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA5pB,QAAA,IAClFj/D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAppB,OAAA,IACjFz/D,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA1pB,QAAA,IAClFn/D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAP,UAAA,IACpFtoF,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAznB,QAAA,IAClFphE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA1nB,MAAA,IAChFnhE,OAAAC,cAAA,CAAAC,EAAA,OAAuC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAA1mD,IAAA,IAC9EniC,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAR,WAAA,IACrFroF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAT,UAAA,IACpFpoF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAV,WAAA,IACrFnoF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAX,UAAA,IACpFloF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAArtB,WAAA,IACrFx7D,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAZ,gBAAA,IAC1FjoF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAltB,YAAA,IACtF37D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAb,cAAA,IACxFhoF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAd,SAAA,IACnF/nF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAhU,SAAA,IACnF70E,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAw3E,EAAAf,MAAA,IAChF,IAAAgB,EAAkB9kF,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAjB,QAAA,IAClF7nF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAlB,UAAA,IACpF5nF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAnB,YAAA,IACtF3nF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAApB,gBAAA,IAC1F1nF,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAArB,MAAA,IAChFznF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAtB,WAAA,IACrFxnF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAvB,cAAA,IACxFvnF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAxB,qBAAA,IAC/FtnF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAAzB,eAAA,IACzFrnF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA1B,cAAA,IACxFpnF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA3B,oBAAA,IAC9FnnF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA5B,uBAAA,IACjGlnF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA7B,mBAAA,IAC7FjnF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA9B,mBAAA,IAC7FhnF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAy3E,EAAA/B,uBAAA,IACjG,IAAAgC,EAAkB/kF,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA03E,EAAAjC,QAAA,IAClF9mF,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA03E,EAAAlC,MAAA,IAChF7mF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA03E,EAAAnC,WAAA,IACrF5mF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA03E,EAAApC,YAAA,IACtF3mF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA03E,EAAArC,SAAA,wCC/MnF1mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqO,EAAU,QACV,IAAAkpD,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,MAe3B9D,CAAAA,EAAAqO,EAAU,CAHV,SAAApO,CAAA,EACA,SAAAs3D,EAAAqU,SAAA,KAAAzT,EAAAmD,WAAA,EAAAr7D,GACA,sCCXAH,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAmkF,eAAuB,CAAGnkF,EAAAokF,gBAAwB,CAAGpkF,EAAAqkF,oBAA4B,CAAGrkF,EAAAskF,uBAA+B,CAAGtkF,EAAAukF,cAAsB,CAAGvkF,EAAAmvD,aAAqB,CAAGnvD,EAAAqwD,WAAmB,CAAGrwD,EAAAwkF,SAAiB,CAAGxkF,EAAAykF,QAAgB,CAAGzkF,EAAA0kF,WAAmB,CAAG1kF,EAAA2kF,YAAoB,CAAG3kF,EAAAqO,EAAU,QAC3R,IAAAy6E,EAAchlF,EAAQ,OACtBhE,OAAAC,cAAA,CAAAC,EAAA,KAAqC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA23E,EAAAz6E,EAAA,IAC5E,IAAA06E,EAAoBjlF,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA43E,EAAApE,YAAA,IACtF7kF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA43E,EAAArE,WAAA,IACrF5kF,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA43E,EAAAtE,QAAA,IAClF3kF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA43E,EAAAvE,SAAA,IACnF,IAAAwE,EAAmBllF,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA63E,EAAA34B,WAAA,IACrFvwD,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA63E,EAAA75B,aAAA,IACvF,IAAA85B,EAAoBnlF,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA83E,EAAA1E,cAAA,IACxFzkF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA83E,EAAA3E,uBAAA,IACjGxkF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA83E,EAAA5E,oBAAA,IAC9F,IAAA6E,EAAsBplF,EAAQ,OAC9BhE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+3E,EAAA9E,gBAAA,IAC1FtkF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+3E,EAAA/E,eAAA,wCCxBzFrkF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAmvD,aAAqB,CAAGnvD,EAAAqwD,WAAmB,QAC3C,IAAAkH,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OA6B3B,SAAAusD,EAAA3X,CAAA,EAIA,MAHA,iBAAAA,GACAA,CAAAA,EAAA,GAAA4vC,EAAAhtB,WAAA,EAAA5iB,EAAA,EAEA,GAAA6e,EAAAqU,SAAA,KAAA0c,EAAAt9B,MAAA,GACA,GAAAs9B,EAAAhtB,WAAA,EAAAnD,EAAAgd,aAAA,EACA,GAAAmT,EAAAhtB,WAAA,EAAAznD,OAAA6kC,EAAA35C,MAAA,GACA25C,EACA,EACA,CACA14C,EAAAqwD,WAAmB,CAAAA,EASnBrwD,EAAAmvD,aAAqB,CAJrB,SAAAzW,CAAA,CAAA7J,CAAA,EACA,IAAAjnC,EAAAyoD,EAAA3X,GACA,SAAA0f,EAAAqtB,cAAA,EAAA79E,EAAAinC,EACA,sCCpDA/uC,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwkF,SAAiB,CAAGxkF,EAAAykF,QAAgB,CAAGzkF,EAAA0kF,WAAmB,CAAG1kF,EAAA2kF,YAAoB,QACjF,IAAAptB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3BqlF,EAAwBrlF,EAAQ,OAChCslF,EAAA,IAAA1qF,WAAA,IAEA,SAAA2qF,EAAAvmD,CAAA,EAEA,MADA,GAAAq1B,EAAAqB,cAAA,EAAA12B,IAAAA,EAAA/jC,MAAA,qCAAyE,OAAA+jC,GACzEA,CACA,CACA,SAAAwmD,EAAA1qF,CAAA,EACA,IAAAC,EAAA,GAAAs5D,EAAAmD,WAAA,EAAAqpB,EAAA/lF,IACAwnE,EAAA,GACA,GAAAxnE,IAAAA,EAAAG,MAAA,CACA,OAAAqnE,EAEA,IAAArrC,EAAA,EACA,QAAA94B,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IAGtC,KAFApD,CAAA,CAAAoD,EAAA,GAGAmkE,EAAAthE,IAAA,CAAAukF,EAAAxqF,EAAAiR,KAAA,CAAAirB,EAAA94B,KACA84B,EAAA94B,EAAA,GAMA,MAFA,GAAAk2D,EAAAqB,cAAA,EAAAz+B,EAAAl8B,EAAAE,MAAA,qCAA2E,OAAAH,GAC3EwnE,EAAAthE,IAAA,CAAAukF,EAAAxqF,EAAAiR,KAAA,CAAAirB,KACAqrC,CACA,CAIA,SAAAue,EAAA/lF,CAAA,EACA,IACA,GAAAA,IAAAA,EAAAG,MAAA,CACA,2BAEA,SAAAoqF,EAAAI,aAAA,EAAA3qF,EACA,CACA,MAAAgP,EAAA,CACA,GAAAuqD,EAAAqB,cAAA,0BAAmE5rD,EAAA8qC,OAAA,CAAc,UAAA95C,EACjF,CACA,CAtCAwqF,EAAAnjF,IAAA,IAuCAjG,EAAA2kF,YAAoB,CAAAA,EAWpB3kF,EAAA0kF,WAAmB,CAPnB,SAAA9lF,CAAA,EACA,IACA,OAAA0qF,IAAAA,EAAA1qF,GAAAG,MAAA,CAEA,MAAA6O,EAAA,EACA,QACA,EAeA5N,EAAAykF,QAAgB,CAVhB,SAAA7lF,CAAA,EACA,GAAAu5D,EAAAqB,cAAA,mBAAA56D,EAAA,iCAAkF,OAAAA,GAClF,GAAAu5D,EAAAqB,cAAA,EAAA56D,EAAAG,MAAA,yCAAAH,GACA,IAAAmR,EAAAq5E,EACAhjB,EAAAkjB,EAAA1qF,GACA,KAAAwnE,EAAArnE,MAAA,EACAgR,EAAA,GAAAwnD,EAAAqU,SAAA,KAAAzT,EAAAnN,MAAA,GAAAj7C,EAAA,GAAAwnD,EAAAqU,SAAA,EAAAxF,EAAAzjD,GAAA,OAEA,SAAAw1C,EAAA6C,OAAA,EAAAjrD,EACA,EAmBA/P,EAAAwkF,SAAiB,CAXjB,SAAA5lF,CAAA,CAAA4qF,CAAA,EACA,IAAAzqF,EAAA,MAAAyqF,EAAAA,EAAA,GAEA,MADA,GAAArxB,EAAAqB,cAAA,EAAAz6D,GAAA,mDAAAA,GACA,GAAAo5D,EAAA6C,OAAA,KAAA7C,EAAAnN,MAAA,EAAAs+B,EAAA1qF,GAAAyb,GAAA,KACA,GAAA89C,EAAAqB,cAAA,EAAA12B,EAAA/jC,MAAA,EAAAA,EAAA,SAAuEmR,KAAAC,SAAA,CAAAvR,GAAA,SAAsB,EAAUG,EAAA,MAAQ,SAAAH,GAC/G,IAAAC,EAAA,IAAAH,WAAAokC,EAAA/jC,MAAA,IAGA,OAFAF,EAAAyI,GAAA,CAAAw7B,EAAA,GACAjkC,CAAA,IAAAA,EAAAE,MAAA,GACAF,CACA,KAAK,IACL,sCCvFAiB,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqkF,oBAA4B,CAAGrkF,EAAAskF,uBAA+B,CAAGtkF,EAAAukF,cAAsB,QACvF,IAAAhtB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3B2lF,EAAA,0BACAC,EAAA,4BACAC,EAAA,+BAiEA,SAAApF,EAAA3qB,CAAA,CAAAK,CAAA,EACA,GAAA7B,EAAAoB,cAAA,EAAAI,EAAA76D,MAAA,GAAAk7D,EAAAl7D,MAAA,sDAAsH,SAAAk7D,GACtH,IAAA2vB,EAAA,GAIA,OAHAhwB,EAAA1lD,OAAA,UAAAyG,CAAA,CAAAL,CAAA,EACAsvE,EAAA9kF,IAAA,CAAA+kF,SApEAA,EAAAlvE,CAAA,CAAA1a,CAAA,CAAA0T,CAAA,EACA,OAAAgH,GACA,cACA,GAAAhH,EACA,SAAAykD,EAAA2C,QAAA,KAAA3C,EAAAyT,YAAA,EAAA5rE,EAAA,KAEA,SAAAm4D,EAAA2C,QAAA,KAAAxD,EAAAzH,UAAA,EAAA7vD,GACA,cACA,SAAAm4D,EAAAkD,WAAA,EAAAr7D,EACA,aACA,SAAAm4D,EAAA2C,QAAA,EAAA96D,EACA,YAEA,GADAA,EAAA,gBACA0T,EACA,SAAAykD,EAAA2C,QAAA,KAAA3C,EAAAyT,YAAA,EAAA5rE,EAAA,KAEA,SAAAm4D,EAAA2C,QAAA,EAAA96D,EACA,CACA,IAAAg4B,EAAAtd,EAAAsd,KAAA,CAAAyxD,GACA,GAAAzxD,EAAA,CACA,IAAA6oC,EAAA7oC,QAAAA,CAAA,IACApI,EAAAhe,SAAAomB,CAAA,YAQA,MAPA,GAAAmgC,EAAAoB,cAAA,IAAAvhC,CAAA,KAAAA,CAAA,MAAApkB,OAAAgc,EAAA,GAAAA,EAAA,MAAAA,IAAAA,GAAAA,GAAA,iCAAAlV,GACAhH,GACAkc,CAAAA,EAAA,KAEAixC,GACA7gE,CAAAA,EAAA,GAAAm4D,EAAA6I,MAAA,EAAAhhE,EAAA4vB,EAAA,EAEA,GAAAuoC,EAAA2C,QAAA,KAAA3C,EAAAyT,YAAA,KAAAzT,EAAAiF,SAAA,EAAAp9D,GAAA4vB,EAAA,GACA,CAEA,GADAoI,EAAAtd,EAAAsd,KAAA,CAAAwxD,GACA,CACA,IAAA55D,EAAAhe,SAAAomB,CAAA,WAGA,CAFA,GAAAmgC,EAAAoB,cAAA,EAAA3lD,OAAAgc,KAAAoI,CAAA,KAAApI,IAAAA,GAAAA,GAAA,+BAAAlV,GACA,GAAAy9C,EAAAoB,cAAA,KAAApB,EAAAwF,UAAA,EAAA39D,KAAA4vB,EAAA,qBAAwGlV,EAAK,UAAA1a,GAC7G0T,GACA,GAAAykD,EAAA2C,QAAA,KAAA3C,EAAAmD,YAAA,EAAAt7D,EAAA,KAEAA,CACA,CAEA,GAAAg4B,CADAA,EAAAtd,EAAAsd,KAAA,CAAA0xD,EAAA,GACA9/E,MAAA8J,OAAA,CAAA1T,GAAA,CACA,IAAAi5D,EAAAjhC,CAAA,IACAtY,EAAA9N,SAAAomB,CAAA,KAAApkB,OAAA5T,EAAAlB,MAAA,GACA,GAAAq5D,EAAAoB,cAAA,EAAA75C,IAAA1f,EAAAlB,MAAA,6BAA2F4b,EAAK,UAAA1a,GAChG,IAAA8P,EAAA,GAIA,OAHA9P,EAAAiU,OAAA,UAAAjU,CAAA,EACA8P,EAAAjL,IAAA,CAAA+kF,EAAA3wB,EAAAj5D,EAAA,IACA,GACA,GAAAm4D,EAAA2C,QAAA,KAAA3C,EAAApN,MAAA,EAAAj7C,GACA,CACA,GAAAqoD,EAAAoB,cAAA,2BAAA7+C,EACA,EAeAA,EAAAs/C,CAAA,CAAA3/C,EAAA,EACA,GACA,GAAA89C,EAAA4C,OAAA,KAAA5C,EAAApN,MAAA,EAAA4+B,GACA,CACA5pF,EAAAukF,cAAsB,CAAAA,EAatBvkF,EAAAskF,uBAA+B,CAH/B,SAAA1qB,CAAA,CAAAK,CAAA,EACA,SAAA9B,EAAAyT,SAAA,EAAA2Y,EAAA3qB,EAAAK,GACA,EAcAj6D,EAAAqkF,oBAA4B,CAH5B,SAAAzqB,CAAA,CAAAK,CAAA,EACA,SAAA9B,EAAAvd,MAAA,EAAA2pC,EAAA3qB,EAAAK,GACA,sCCzGAn6D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAmkF,eAAuB,CAAGnkF,EAAAokF,gBAAwB,QAElD,IAAA7sB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BglF,EAAgBhlF,EAAQ,OACxBgmF,EAAA,IAAAprF,WAAA,IACAorF,EAAA7jF,IAAA,IACA,IAAA8jF,EAAAtoF,OAAA,IACAk/D,EAAAl/D,OAAA,GACAm/D,EAAAn/D,OAAA,GACAo/D,EAAAp/D,OAAA,sEAWAuoF,EAAA,GAAA1B,EAAA/oB,OAAA,EAAAqB,EAAA,IACAqpB,EAAA,GAAA3B,EAAA/oB,OAAA,EAAAoB,EAAA,IACAupB,EAAA,CACAtrF,KAAA,SACAyQ,QAAA,SACAC,QAAA,UACA66E,kBAAA,UACAjsC,KAAA,SACA,EACAksC,EAAA,CACA,sDACA,CACA,SAAAC,EAAAh6E,CAAA,EACA,gBAAApQ,CAAA,EAEA,MADA,GAAAqoF,EAAA9uB,cAAA,mBAAAv5D,EAAA,4BAAgGiQ,KAAAC,SAAA,CAAAE,GAAoB,YAAaA,EAAI,EAAApQ,GACrIA,CACA,CACA,CACA,IAAAqqF,EAAA,CACA1rF,KAAAyrF,EAAA,QACAh7E,QAAAg7E,EAAA,WACA/6E,QAAA,SAAA8vD,CAAA,EACA,IAAAn/D,EAAA,GAAAqoF,EAAAvnB,SAAA,EAAA3B,EAAA,wBAEA,CADA,GAAAkpB,EAAA9uB,cAAA,EAAAv5D,GAAA,sCAAAm/D,GACAhhE,OAAAC,aAAA,CAAA4B,IACA7B,OAAA6B,GAEA,GAAAqoF,EAAAF,UAAA,EAAAnoF,EACA,EACAkqF,kBAAA,SAAAlqF,CAAA,EACA,IACA,SAAAs3D,EAAAzH,UAAA,EAAA7vD,GAAA0R,WAAA,EACA,CACA,MAAA/D,EAAA,EACA,GAAA06E,EAAA9uB,cAAA,2EAAAv5D,EACA,EACAi+C,KAAA,SAAAj+C,CAAA,EACA,IAAApB,EAAA,GAAAypF,EAAAvtB,QAAA,EAAA96D,EAAA,eAEA,MADA,GAAAqoF,EAAA9uB,cAAA,EAAA36D,KAAAA,EAAAE,MAAA,6CAAAkB,GACA,GAAAqoF,EAAAttB,OAAA,EAAAn8D,EACA,CACA,EACA,SAAA0rF,EAAA5vE,CAAA,EAEA,CACA,IAAAsd,EAAAtd,EAAAsd,KAAA,mBACA,GAAAA,EAAA,CACA,IAAA6oC,EAAA7oC,KAAAA,CAAA,IACA20C,EAAA/6D,SAAAomB,CAAA,KACA,GAAAqwD,EAAA9uB,cAAA,EAAAoT,EAAA,MAAAA,IAAAA,GAAAA,GAAA,KAAA30C,CAAA,MAAApkB,OAAA+4D,GAAA,+BAAAjyD,GACA,IAAA6vE,EAAA,GAAAlC,EAAArmD,IAAA,EAAA4+B,EAAAC,EAAA8L,EAAA,EAAAA,GACA6d,EAAA3pB,EAAA,CAAA0pB,EAAA5pB,CAAA,EAAAmpB,EAAAppB,EACA,gBAAAvB,CAAA,EACA,IAAAn/D,EAAA,GAAAqoF,EAAAvnB,SAAA,EAAA3B,EAAA,SAEA,MADA,GAAAkpB,EAAA9uB,cAAA,EAAAv5D,GAAAwqF,GAAAxqF,GAAAuqF,EAAA,2BAAwH7vE,EAAK,UAAA1a,GAC7H,GAAAqoF,EAAA/oB,OAAA,EAAAuB,EAAA,GAAAwnB,EAAArnB,MAAA,EAAAhhE,EAAA,KAAAA,EAAA,GACA,CACA,CACA,CAEA,CACA,IAAAg4B,EAAAtd,EAAAsd,KAAA,iBACA,GAAAA,EAAA,CACA,IAAA20C,EAAA/6D,SAAAomB,CAAA,KAEA,MADA,GAAAqwD,EAAA9uB,cAAA,EAAAoT,IAAAA,GAAAA,GAAA,IAAA30C,CAAA,MAAApkB,OAAA+4D,GAAA,6BAAAjyD,GACA,SAAA1a,CAAA,EACA,IAAApB,EAAA,GAAAypF,EAAAvtB,QAAA,EAAA96D,GAEA,MADA,GAAAqoF,EAAA9uB,cAAA,EAAA36D,EAAAE,MAAA,GAAA6tE,EAAA,sBAA6FjyD,EAAK,UAAA1a,GAClGyqF,SA5EAzqF,CAAA,EACA,IAAApB,EAAA,GAAAypF,EAAAvtB,QAAA,EAAA96D,GACAu8C,EAAA39C,EAAAE,MAAA,WACA,EACA,GAAAupF,EAAAt9B,MAAA,GAAAnsD,EAAAirF,EAAAh6E,KAAA,CAAA0sC,GAAA,EAEA,GAAA8rC,EAAAttB,OAAA,EAAAn8D,EACA,EAqEAoB,EACA,CACA,CACA,CACA,OAAA0a,GACA,8BAAA1a,CAAA,EACA,SAAAqoF,EAAAzc,YAAA,KAAAtU,EAAAzH,UAAA,EAAA7vD,GAAA,GACA,CACA,4BAAAA,CAAA,EACA,SAAA+pF,EAAAC,CACA,CACA,6BAAAhqF,CAAA,EACA,SAAAk4D,EAAAyT,SAAA,EAAA3rE,EACA,CACA,8BAAAA,CAAA,EACA,SAAA6oF,EAAAz6E,EAAA,EAAApO,EACA,CACA,CACA,WACA,CACA,SAAA0qF,EAAA/rF,CAAA,CAAAgsF,CAAA,EACA,SAAchsF,EAAK,GAAGgsF,EAAAvwE,GAAA,GAAczb,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,CAAY,GAAAA,EAAA,IAAA/b,GAAAwuD,IAAA,MAAoC,GAIpF,SAAAy9B,EAAAlwE,CAAA,EACA,IAAAsd,EAAAtd,EAAAsd,KAAA,uDACA,EACA,CACAgG,KAAAhG,CAAA,IACA3d,MAAA2d,CAAA,IAAAA,CAAA,IACAntB,MAAA,CACAmzB,KAAAhG,CAAA,IACAnjB,OAAAmjB,CAAA,IAAAA,CAAA,IACAtY,MAAAsY,CAAA,IAAApmB,SAAAomB,CAAA,OACA,CACA,EAEA,CAAagG,KAAAtjB,CAAA,CACb,CASA,MAAAypE,EASA0G,WAAA,EACAlxB,CAAA,KAIAA,OAAA,CACA,OAAA1pD,KAAAF,KAAA,OAAA4pD,CAAA,CACA,CACA,CAAAmxB,CAAA,EACAC,CAAA,aAQAC,CAAA,EACA,MAAAF,CAAA,KAAA16C,IACA,MAAA26C,CAAA,KAAA36C,IAEA,IAAA66C,EAAA,IAAA76C,IAEA86C,EAAA,IAAA96C,IAEA+6C,EAAA,IAAA/6C,IACAupB,EAAA,GAkBA,QAAAh7D,KAjBAkB,OAAA6xD,IAAA,CAAAs5B,GAAA/2E,OAAA,KACA0lD,CAAA,CAAAj/C,EAAA,CAAAswE,CAAA,CAAAtwE,EAAA,CAAAN,GAAA,GAA8Czb,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,CAAY,IAE1D,IAAsBsjB,KAAAA,CAAA,CAAA3jB,MAAAA,CAAA,EAAcuwE,EAAAlwE,GAOpC,MANA,QAAAsjB,GAAAgtD,EAAA,KACAhtD,CAAAA,EAAA,UAEA,SAAAA,GAAAgtD,EAAA,MACAhtD,CAAAA,EAAA,WAEA,CAAyBr/B,KAAAA,EAAA+b,KAAAsjB,EAAA3jB,CAAAA,GAAA,IACzB,GACA4wE,EAAA5jF,GAAA,CAAAqT,EAAA,IAAAonD,KACAopB,EAAA7jF,GAAA,CAAAqT,EAAA,IACAywE,EAAA9jF,GAAA,CAAAqT,EAAA,IAAAonD,IACA,GACA,MAAAnI,CAAA,CAAA1pD,KAAAC,SAAA,CAAAypD,GACAA,EAAA,CACA,IAAAyH,EAAA,IAAAU,IACA,QAAAr8B,KAAAk0B,CAAA,CAAAh7D,EAAA,EAEA,GAAA0pF,EAAA9uB,cAAA,GAAA6H,EAAA/U,GAAA,CAAA5mB,EAAA9mC,IAAA,6BAAwGsR,KAAAC,SAAA,CAAAu1B,EAAA9mC,IAAA,MAA4B,EAAKsR,KAAAC,SAAA,CAAAvR,GAAqB,UAAAqsF,GAC9J5pB,EAAA7gE,GAAA,CAAAklC,EAAA9mC,IAAA,EAEA,IAAAs6D,EAAA2xB,EAAAnlD,EAAA/qB,IAAA,EAAAsjB,IAAA,CACA,GAAAqqD,EAAA9uB,cAAA,EAAAN,IAAAt6D,EAAA,8BAAgGsR,KAAAC,SAAA,CAAA+oD,GAAyB,UAAA+xB,GAEzHV,EAAArxB,KAIA,GAAAovB,EAAA9uB,cAAA,EAAA2xB,EAAA7+B,GAAA,CAAA4M,GAAA,gBAAsFhpD,KAAAC,SAAA,CAAA+oD,GAAyB,UAAA+xB,GAE/GE,EAAAh6E,GAAA,CAAA+nD,GAAAp0D,IAAA,CAAAlG,GACAssF,EAAA/5E,GAAA,CAAAvS,GAAA4B,GAAA,CAAA04D,GACA,CACA,CAEA,IAAAmyB,EAAAxhF,MAAAC,IAAA,CAAAqhF,EAAAx5B,IAAA,IAAAl3B,MAAA,IAAA0wD,IAAAA,EAAAh6E,GAAA,CAAAhT,GAAAY,MAAA,EAuBA,QAAAH,EAAA0I,EAAA,GAtBA,GAAAghF,EAAA9uB,cAAA,EAAA6xB,IAAAA,EAAAtsF,MAAA,gCAAAksF,GACA,GAAA3C,EAAA9uB,cAAA,EAAA6xB,IAAAA,EAAAtsF,MAAA,6CAA8GssF,EAAAhxE,GAAA,IAAAnK,KAAAC,SAAA,CAAApL,IAAAqoD,IAAA,OAAwD,UAAA69B,GACtK,GAAA3C,EAAAjyB,gBAAA,QAAiDy0B,YAAAO,CAAA,OAkBjDC,SAhBAA,EAAA3wE,CAAA,CAAA4wE,CAAA,EAGA,QAAAC,KAFA,GAAAlD,EAAA9uB,cAAA,GAAA+xB,EAAAj/B,GAAA,CAAA3xC,GAAA,8BAA2FzK,KAAAC,SAAA,CAAAwK,GAAqB,UAAAswE,GAChHM,EAAA/qF,GAAA,CAAAma,GACAuwE,EAAA/5E,GAAA,CAAAwJ,IACA,GAAAwwE,EAAA7+B,GAAA,CAAAk/B,GAMA,QAAAC,KAFAH,EAAAE,EAAAD,GAEAA,GACAH,EAAAj6E,GAAA,CAAAs6E,GAAAjrF,GAAA,CAAAgrF,GAGAD,EAAAr6C,MAAA,CAAAv2B,EACA,EACA,KAAAmwE,WAAA,KAAA/oB,KAEAqpB,GAAA,CACA,IAAAM,EAAA7hF,MAAAC,IAAA,CAAAxC,GACAokF,EAAAjuE,IAAA,GACA,MAAAstE,CAAA,CAAAzjF,GAAA,CAAA1I,EAAA+rF,EAAA/rF,EAAAg7D,CAAA,CAAAh7D,EAAA,EAAA8sF,EAAArxE,GAAA,IAAAswE,EAAA5lF,EAAA60D,CAAA,CAAA70D,EAAA,GAAAqoD,IAAA,KACA,CACA,CAIAu+B,WAAAhxE,CAAA,EACA,IAAAixE,EAAA,MAAAZ,CAAA,CAAA75E,GAAA,CAAAwJ,GAKA,OAJAixE,IACAA,EAAA,MAAAD,CAAA,CAAAhxE,GACA,MAAAqwE,CAAA,CAAA1jF,GAAA,CAAAqT,EAAAixE,IAEAA,CACA,CACA,CAAAD,CAAA,CAAAhxE,CAAA,EAEA,CACA,IAAAixE,EAAArB,EAAA5vE,GACA,GAAAixE,EACA,OAAAA,CAEA,CAEA,IAAA9gF,EAAA+/E,EAAAlwE,GAAA7P,KAAA,CACA,GAAAA,EAAA,CACA,IAAA2gF,EAAA3gF,EAAAgK,MAAA,CACA+2E,EAAA,KAAAF,UAAA,CAAAF,GACA,WACA,GAAAnD,EAAA9uB,cAAA,EAAA1uD,KAAAA,EAAA6U,KAAA,EAAA7U,EAAA6U,KAAA,GAAA1f,EAAAlB,MAAA,yCAA2H,EAAkB+L,EAAA6U,KAAA,CAAY,UAAA1f,GACzJ,IAAA8P,EAAA9P,EAAAoa,GAAA,CAAAwxE,GAIA,OAHA,MAAAd,CAAA,CAAAz+B,GAAA,CAAAm/B,IACA17E,CAAAA,EAAAA,EAAAsK,GAAA,CAAA89C,EAAAyT,SAAA,GAEA,GAAAzT,EAAAyT,SAAA,KAAA0c,EAAAt9B,MAAA,EAAAj7C,GACA,CACA,CAEA,IAAA66E,EAAA,KAAAhxB,KAAA,CAAAj/C,EAAA,CACA,GAAAiwE,EAAA,CACA,IAAAkB,EAAA,GAAAhD,EAAAz6E,EAAA,QAAA08E,CAAA,CAAA55E,GAAA,CAAAwJ,IACA,WACA,IAAAs/C,EAAA2wB,EAAAvwE,GAAA,GAA6Czb,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,CAAY,IACzD,IAAA5K,EAAA,KAAA47E,UAAA,CAAAhxE,GAAA1a,CAAA,CAAArB,EAAA,SACA,MAAAmsF,CAAA,CAAAz+B,GAAA,CAAA3xC,GACA,GAAAw9C,EAAAyT,SAAA,EAAA77D,GAEAA,CACA,GAEA,OADAkqD,EAAA8xB,OAAA,CAAAD,GACA,GAAAxD,EAAAt9B,MAAA,EAAAiP,EACA,CACA,CACA,GAAAquB,EAAA9uB,cAAA,sBAA+D7+C,EAAK,SAAAA,EACpE,CAIAgwE,WAAA/rF,CAAA,EACA,IAAAmR,EAAA,MAAAg7E,CAAA,CAAA55E,GAAA,CAAAvS,GAEA,MADA,GAAA0pF,EAAA9uB,cAAA,EAAAzpD,EAAA,iBAAgEG,KAAAC,SAAA,CAAAvR,GAAqB,SAAAA,GACrFmR,CACA,CAIAi8E,WAAArxE,CAAA,CAAA1a,CAAA,EACA,YAAA0rF,UAAA,CAAAhxE,GAAA1a,EACA,CAIAgsF,WAAArtF,CAAA,CAAAqB,CAAA,EACA,SAAAk4D,EAAAyT,SAAA,OAAAogB,UAAA,CAAAptF,EAAAqB,GACA,CAIA4L,OAAA5L,CAAA,EACA,YAAA+rF,UAAA,MAAAlB,WAAA,CAAA7qF,EACA,CAIAhB,KAAAgB,CAAA,EACA,YAAAgsF,UAAA,MAAAnB,WAAA,CAAA7qF,EACA,CAIAisF,OAAAvxE,CAAA,CAAA1a,CAAA,CAAAyuB,CAAA,EAIA,GADA67D,EAAA5vE,GAEA,OAAA+T,EAAA/T,EAAA1a,GAIA,IAAA6K,EAAA+/E,EAAAlwE,GAAA7P,KAAA,CACA,GAAAA,EAEA,MADA,GAAAw9E,EAAA9uB,cAAA,EAAA1uD,KAAAA,EAAA6U,KAAA,EAAA7U,EAAA6U,KAAA,GAAA1f,EAAAlB,MAAA,yCAAuH,EAAkB+L,EAAA6U,KAAA,CAAY,UAAA1f,GACrJA,EAAAoa,GAAA,SAAA6xE,MAAA,CAAAphF,EAAAgK,MAAA,CAAAyzB,EAAA7Z,IAGA,IAAAk8D,EAAA,KAAAhxB,KAAA,CAAAj/C,EAAA,CACA,GAAAiwE,EACA,OAAAA,EAAA3kD,MAAA,EAAAu2B,EAAA,CAA2C59D,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,CAAY,IACvD6hD,CAAA,CAAA59D,EAAA,MAAAstF,MAAA,CAAAvxE,EAAA1a,CAAA,CAAArB,EAAA,CAAA8vB,GACA8tC,GACa,IAEb,GAAA8rB,EAAA9uB,cAAA,sBAA+D7+C,EAAK,SAAAA,EACpE,CAQAwxE,MAAAlsF,CAAA,CAAAyuB,CAAA,EACA,YAAAw9D,MAAA,MAAApB,WAAA,CAAA7qF,EAAAyuB,EACA,CAIA,OAAA5kB,KAAA8vD,CAAA,EACA,WAAAwqB,EAAAxqB,EACA,CAIA,OAAAwyB,eAAAxyB,CAAA,EACA,OAAAwqB,EAAAt6E,IAAA,CAAA8vD,GAAAkxB,WAAA,CAKA,OAAAmB,WAAArtF,CAAA,CAAAg7D,CAAA,CAAA35D,CAAA,EACA,OAAAmkF,EAAAt6E,IAAA,CAAA8vD,GAAAqyB,UAAA,CAAArtF,EAAAqB,EACA,CAIA,OAAAosF,WAAAp9E,CAAA,EACA,IAAAq9E,EAAA,GACA,QAAA1tF,KAAAqQ,EAAA,CACA,GAAAA,MAAAA,CAAA,CAAArQ,EAAA,CACA,SAEA,IAAA+b,EAAAuvE,CAAA,CAAAtrF,EAAA,CACA,GAAA0pF,EAAA9uB,cAAA,EAAA7+C,EAAA,kCAAmFzK,KAAAC,SAAA,CAAAvR,GAAqB,WAAAqQ,GACxGq9E,EAAAxnF,IAAA,EAAgClG,KAAAA,EAAA+b,KAAAA,CAAA,EAChC,CAIA,OAHA2xE,EAAA7uE,IAAA,EAAAhf,EAAAF,IACA6rF,EAAAl8D,OAAA,CAAAzvB,EAAAG,IAAA,EAAAwrF,EAAAl8D,OAAA,CAAA3vB,EAAAK,IAAA,GAEAwlF,EAAA6H,UAAA,iBAA6DM,aAAAD,CAAA,EAA4Br9E,EACzF,CAIA,OAAApD,OAAAoD,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EACA,SAAAqoF,EAAAt9B,MAAA,GACA,SACAo5B,EAAAiI,UAAA,CAAAp9E,GACAm1E,EAAAt6E,IAAA,CAAA8vD,GAAA36D,IAAA,CAAAgB,GACA,CACA,CAIA,OAAAhB,KAAAgQ,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EACA,SAAAk4D,EAAAyT,SAAA,EAAAwY,EAAAv4E,MAAA,CAAAoD,EAAA2qD,EAAA35D,GACA,CAMA,aAAAusF,aAAAv9E,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,CAAAs0E,CAAA,EAIA,QAAAlkE,KAFApB,EAAAnP,OAAAwM,MAAA,IAAiC2C,GAGjC,MAAAA,CAAA,CAAAoB,EAAA,EACA,OAAApB,CAAA,CAAAoB,EAAA,CAIA,IAAAo8E,EAAA,EAEAx9E,CAAAA,EAAAk7E,iBAAA,MAAA7B,EAAAhf,WAAA,EAAAr6D,EAAAk7E,iBAAA,MACAsC,CAAAA,CAAA,CAAAx9E,EAAAk7E,iBAAA,QAGA,IAAAyB,EAAAxH,EAAAt6E,IAAA,CAAA8vD,GASA,QAAAh7D,KAPAgtF,EAAAO,KAAA,CAAAlsF,EAAA,CAAA0a,EAAA1a,KACA,YAAA0a,GAAA,GAAA2tE,EAAAhf,WAAA,EAAArpE,EAAA,KACAwsF,CAAAA,CAAA,CAAAxsF,EAAA,OAEAA,IAGAwsF,EACAA,CAAA,CAAA7tF,EAAA,OAAA21E,EAAA31E,GAaA,OAVAqQ,EAAAk7E,iBAAA,EAAAsC,CAAA,CAAAx9E,EAAAk7E,iBAAA,GACAl7E,CAAAA,EAAAk7E,iBAAA,CAAAsC,CAAA,CAAAx9E,EAAAk7E,iBAAA,GAGAlqF,EAAA2rF,EAAAO,KAAA,CAAAlsF,EAAA,CAAA0a,EAAA1a,IACA,YAAA0a,GAAA8xE,CAAA,CAAAxsF,EAAA,CACAwsF,CAAA,CAAAxsF,EAAA,CAEAA,GAEA,CAAiBgP,OAAAA,EAAAhP,MAAAA,CAAA,CACjB,CAKA,OAAAysF,WAAAz9E,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EAEAmkF,EAAAiI,UAAA,CAAAp9E,GAEA,IAAA09E,EAAA,GACAC,EAAA,GACAxC,EAAAl2E,OAAA,KACA,IAAAjU,EAAAgP,CAAA,CAAArQ,EAAA,OACAqB,IAGA0sF,CAAA,CAAA/tF,EAAA,CAAA0rF,CAAA,CAAA1rF,EAAA,CAAAqB,GACA2sF,EAAA9nF,IAAA,EAA+BlG,KAAAA,EAAA+b,KAAAuvE,CAAA,CAAAtrF,EAAA,GAC/B,GACA,IAAAgtF,EAAAxH,EAAAt6E,IAAA,CAAA8vD,GAGAizB,EAAA/sF,OAAAwM,MAAA,IADAstD,EAAAgyB,EAAAhyB,KAAA,EAMA,MAJA,GAAA0uB,EAAA9uB,cAAA,EAAAqzB,MAAAA,EAAAN,YAAA,iEAAA3yB,GACAizB,EAAAN,YAAA,CAAAK,EAEAhB,EAAA//E,MAAA,CAAA5L,GACA,CACA25D,MAAAizB,EACA59E,OAAA09E,EACA7B,YAAAc,EAAAd,WAAA,CACApyC,QAAAkzC,EAAAO,KAAA,CAAAlsF,EAAA,CAAA0a,EAAA1a,KAEA,GAAA0a,EAAAsd,KAAA,gBACA,SAAAqwD,EAAAttB,OAAA,KAAAstB,EAAAvtB,QAAA,EAAA96D,IAGA,GAAA0a,EAAAsd,KAAA,WACA,SAAAqwD,EAAAvnB,SAAA,EAAA9gE,GAAA+J,QAAA,GAEA,OAAA2Q,GACA,cACA,OAAA1a,EAAA0R,WAAA,EACA,YACA,QAAA1R,CACA,cAEA,MADA,GAAAqoF,EAAA9uB,cAAA,mBAAAv5D,EAAA,yBAAAA,GACAA,CACA,CACA,GAAAqoF,EAAA9uB,cAAA,+BAAA7+C,EACA,EACA,CACA,CACA,CACA3a,EAAAokF,gBAAwB,CAAAA,EAOxBpkF,EAAAmkF,eAAuB,CAHvB,SAAAl1E,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,CAAAo4C,CAAA,EACA,SAAA+f,EAAAqtB,cAAA,EAAArB,EAAAnlF,IAAA,CAAAgQ,EAAA2qD,EAAA35D,GAAAo4C,EACA,sCCxgBAv4C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0wD,MAAc,QACd,IAAAo8B,EAAgBhpF,EAAQ,OAQxB4sD,EAAAo8B,EAAA5gC,YAAA,CAAoCpoD,EAAQ,OAC5C9D,CAAAA,EAAA0wD,MAAc,CAAAA,EACdo8B,EAAA17E,YAAA,CAAqBtN,EAAQ,OAAa9D,uCCL1CF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4jF,gBAAwB,CAAG5jF,EAAA6lF,mBAA2B,QAQtD,IAAAtuB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BykF,EAAmBzkF,EAAQ,OAC3B0kF,EAAmB1kF,EAAQ,OAC3BipF,EAA0BjpF,EAAQ,OAClCkpF,EAAoBlpF,EAAQ,OAC5BmpF,EAAqBnpF,EAAQ,OAC7BkyE,EAAsBlyE,EAAQ,OAC9BopF,EAAgCppF,EAAQ,OAExCy8E,EAAA9+E,OAAA,GAEA,SAAA0rF,EAAAltF,CAAA,EACA,OAAAA,GAAA,mBAAAA,EAAAkqD,IAAA,CAEA,SAAAijC,EAAAt4E,CAAA,CAAA7U,CAAA,EACA,OAAA6U,EAAA,IAAA5E,KAAAC,SAAA,CAAAlQ,EAAA,CAAA2Q,EAAA23B,KACA,GAAAA,MAAAA,EACA,aAEA,oBAAAA,EACA,gBAA6BA,EAAAv+B,QAAA,GAAa,EAE1C,oBAAAu+B,EACA,OAAAA,EAAA52B,WAAA,GAGA,oBAAA42B,GAAA,CAAA1+B,MAAA8J,OAAA,CAAA40B,GAAA,CACA,IAAAopB,EAAA7xD,OAAA6xD,IAAA,CAAAppB,GAEA,OADAopB,EAAAl0C,IAAA,GACAk0C,EAAA1rB,MAAA,EAAAu2B,EAAAnsD,KACAmsD,CAAA,CAAAnsD,EAAA,CAAAk4B,CAAA,CAAAl4B,EAAA,CACAmsD,GACa,GACb,CACA,OAAAj0B,CACA,EACA,CAMA,MAAAs9C,EAIAjnF,IAAA,aAIAA,CAAA,EAAwB,GAAA4pF,EAAAnyB,gBAAA,QAAyCz3D,KAAAA,CAAA,EAAM,CACvEu0B,OAAA,EACAolD,MAAA,EACA8U,MAAAC,CAAA,GACA7hC,QAAA,EACA,CAKA,SAAA8hC,EAAAt9D,CAAA,EAGA,MADAA,CADAA,EAAApmB,MAAAC,IAAA,KAAAi4D,IAAA9xC,GAAAgqC,MAAA,KACAx8C,IAAA,GACAwS,CACA,CACA,eAAAu9D,EAAAC,CAAA,CAAA//B,CAAA,EACA,GAAA+/B,MAAAA,EACA,6BAMA,GAHA5jF,MAAA8J,OAAA,CAAA85E,IACAA,CAAAA,EAAA,CAAmB/hB,OAAA+hB,CAAA,GAEnB,iBAAAA,EACA,OAAAA,GACA,YACA,YACA,YACA,gBACA,cACA,cACA,WACA,OAAyB9yE,KAAA8yE,EAAAzyC,IAAAyyC,CAAA,CAEzB,CAEA,MAAAjF,EAAAlf,WAAA,EAAAmkB,EAAA,KACA,IAAAxuF,EAAAwuF,EAAA97E,WAAA,GACA,OAAiBgJ,KAAA,cAAAqgC,IAAAoyC,EAAA,MAAyCnuF,KAAAA,CAAA,GAAMA,KAAAA,CAAA,CAChE,CACA,GAAAwuF,EAAAC,MAAA,EACA,IAAAjW,EAAAgW,EAEA,OAAiB9yE,KAAA,SAAAqgC,IAAAoyC,EAAA,SAAA3V,GAAAh9C,OAnCjBvqB,KAAAF,KAAA,CAAAE,KAAAC,SAAA,CAmCiBsnE,GAAA,CACjB,CACA,GAAAgW,EAAAv+E,OAAA,EAAAu+E,EAAA/hB,MAAA,EACA,IAAA+L,EAAAgW,EACAhzD,EAAA,CACAixC,OAAA,CAAA+L,EAAA/L,MAAA,MAAArxD,GAAA,IACA,MAAAtV,EACA,KAEA8E,MAAA8J,OAAA,CAAA5O,GACAwoF,EAAAxoF,EAAAsV,GAAA,IAAAtV,EAAA4M,WAAA,KAEA5M,EAAA4M,WAAA,GAEA,EACA,GAAA8lE,EAAAvoE,OAAA,EACA,IAAAy+E,EAAA,GACA3nB,EAAA,GACA4nB,EAAA,IACA,GAAApF,EAAAlf,WAAA,EAAArb,GACA0/B,EAAA7oF,IAAA,CAAAmpD,GAGA+X,EAAAlhE,IAAA,YACA6oF,EAAA7oF,IAAA,UAAAyyD,EAAA0c,cAAA,EAAAhmB,EAAAP,GACA,KAEA,EACA7jD,MAAA8J,OAAA,CAAA8jE,EAAAvoE,OAAA,EACAuoE,EAAAvoE,OAAA,CAAAgF,OAAA,CAAA05E,GAGAA,EAAAnW,EAAAvoE,OAAA,EAEA82D,EAAAjnE,MAAA,EACA,MAAA2qD,QAAA6F,GAAA,CAAAyW,GAEAvrC,EAAAvrB,OAAA,CAAAq+E,EAAAI,EAAAtzE,GAAA,IAAA5b,EAAAkT,WAAA,IACA,CACA,OAAiB8oB,OAAAA,EAAAugB,IAAAoyC,EAAA,QAAA3yD,GAAA9f,KAAA,QACjB,CACA,GAAA6tE,EAAAhvB,cAAA,qCAAAi0B,EACA,CACA,SAAAz+B,IAAqB,WAAAxjD,OAAAwjD,OAAA,GAhFrBhvD,EAAA6lF,mBAA2B,CAAAA,EAiF3B,IAAAgI,EAAA,CACAC,aAAA,IACAC,gBAAA,GACA,CAOA,OAAAnK,EACA,CAAAhM,CAAA,EACAoW,CAAA,EAEAC,CAAA,EACAxuF,CAAA,EACAyuF,CAAA,EACAC,CAAA,EACAC,CAAA,EAEAC,CAAA,EACAC,CAAA,EACAC,CAAA,EACAC,CAAA,EACAzpD,CAAA,aAMA0pD,CAAA,CAAA1pD,CAAA,EAEA,GADA,MAAAA,CAAA,CAAAjlC,OAAAwM,MAAA,IAAwCuhF,EAAA9oD,GAAA,IACxC0pD,QAAAA,EACA,MAAAN,CAAA,IACA,MAAAD,CAAA,WAEA,GAAAO,EAAA,CACA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAN,CAAA,IACA,MAAAD,CAAA,CAAAxkC,QAAAC,OAAA,CAAA+kC,GACAC,WAAA,KAA+B,KAAA1W,IAAA,WAAAyW,EAAA,OAAsC,EACrE,MAEA,MAAAP,CAAA,IACA,MAAAD,CAAA,KAEA,OAAAG,CAAA,IACA,MAAAD,CAAA,KAAA/9C,IACA,MAAAunC,CAAA,KAAAvnC,IACA,MAAA29C,CAAA,KAAA39C,IACA,MAAA49C,CAAA,MACA,MAAAxuF,CAAA,IACA,MAAA6uF,CAAA,GACA,MAAAC,CAAA,KAAAl+C,IACA,MAAAm+C,CAAA,GACA,CACA,IAAAT,iBAAA,CAA4B,aAAAhpD,CAAA,CAAAgpD,eAAA,CAK5B,IAAArgC,UAAA,CAAqB,YAIrB,IAAAsgC,SAAA,CACA,OAAAnkF,MAAAC,IAAA,OAAAkkF,CAAA,CAAA/zB,MAAA,GACA,CAIA20B,aAAAC,CAAA,EACA,SAAAb,CAAA,CAAA78E,GAAA,CAAA09E,EAAAjwF,IAAA,EACA,+CAA+DiwF,EAAAjwF,IAAA,EAAa,GAG5E,OADA,MAAAovF,CAAA,CAAA1mF,GAAA,CAAAunF,EAAAjwF,IAAA,CAAAiwF,EAAA/U,OAAA,QACA,KAKAgV,UAAAlwF,CAAA,EACA,aAAAovF,CAAA,CAAA78E,GAAA,CAAAvS,IAAA,IACA,CAKA,IAAA4vF,iBAAA,CAA4B,aAAAA,CAAA,CAC5B,IAAAA,gBAAAvuF,CAAA,EAAiC,MAAAuuF,CAAA,GAAAvuF,CAAA,CAEjC,OAAA8uF,CAAA,CAAAC,CAAA,EACA,IAAAvS,EAAA,MAAA13C,CAAA,CAAA+oD,YAAA,CAEA,GAAArR,EAAA,EACA,kBAAAwS,QAAA,CAAAD,GAGA,IAAAh0C,EAAAoyC,EAAA4B,EAAA7jB,MAAA,CAAA6jB,GACAD,EAAA,MAAAX,CAAA,CAAAj9E,GAAA,CAAA6pC,GAUA,OATA+zC,IACAA,EAAA,KAAAE,QAAA,CAAAD,GACA,MAAAZ,CAAA,CAAA9mF,GAAA,CAAA0zC,EAAA+zC,GACAJ,WAAA,KACA,MAAAP,CAAA,CAAAj9E,GAAA,CAAA6pC,KAAA+zC,GACA,MAAAX,CAAA,CAAAl9C,MAAA,CAAA8J,EAEA,EAAayhC,IAEb,MAAAsS,CACA,CAIA,MAAAG,cAAAv0B,CAAA,CAAAw0B,CAAA,CAAAC,CAAA,EACA,QAAAZ,eAAA,EAAAY,IAAAA,EAAArwF,MAAA,EAAA47D,MAAAA,EAAA7yD,EAAA,CACA,YAEA,IAAAunF,EAAA10B,EAAA7yD,EAAA,CAAA6J,WAAA,GACA7K,EAAAqoF,EAAAx9E,WAAA,GACA29E,EAAA,GACA,QAAArtF,EAAA,EAAwBA,EAAAmtF,EAAArwF,MAAA,CAAiBkD,IAAA,CACzC,IAAAstF,EAAAH,CAAA,CAAAntF,EAAA,CAEAutF,EAAAD,EAAA39E,OAAA,YAA8Cy9E,GAAAz9E,OAAA,UAA0B9K,GAOxE2oF,EAAA,IAAAjH,EAAAxD,YAAA,CAAAwK,EACmC,MAAnCD,EAAArhE,OAAA,YACAuhE,CAAAA,EAAAplC,IAAA,EAAiCvjD,KAAAA,EAAAuoF,OAAAA,CAAA,GAEjC,KAAApX,IAAA,UAAiCvd,OAAA,2BAAA+0B,QAAAA,EAAAn1E,MAAArY,EAAAmtF,KAAAA,CAAA,GACjC,IAAAM,EAAA,gBACAC,EAAA,MAAAF,EAAA7V,IAAA,GACA,IACA,IAAA7pE,EAAA4/E,EAAAC,QAAA,CACA,GAAA7/E,EAAAjJ,IAAA,CAEA,OADA,KAAAmxE,IAAA,UAAyCvd,OAAA,6BAAA+0B,QAAAA,EAAA1/E,OAAAA,CAAA,GACzCA,EAAAjJ,IAAA,CAEAiJ,EAAA2oC,OAAA,EACAg3C,CAAAA,EAAA3/E,EAAA2oC,OAAA,EAEA,KAAAu/B,IAAA,UAAqCvd,OAAA,4BAAA+0B,QAAAA,EAAA1/E,OAAAA,CAAA,EACrC,CACA,MAAAnC,EAAA,EAEA,GAAA46E,EAAAvrB,MAAA,EAAA0yB,EAAAE,UAAA,MAAAF,EAAAE,UAAA,+CAA6HH,EAAa,oBAAuB70B,OAAA,uBAAAI,YAAAN,EAAA6D,KAAA,CAAyD+wB,IAAAA,EAAAG,aAAAA,CAAA,IAE1NJ,EAAAxqF,IAAA,CAAA4qF,EACA,CACA,GAAAlH,EAAAvrB,MAAA,6CAA8EqyB,EAAAj1E,GAAA,IAAAnK,KAAAC,SAAA,CAAAQ,IAAAy8C,IAAA,OAAuD,oBACrIyN,OAAA,mBACAI,YAAAN,EAAA6D,KAAA,CAAqC4wB,KAAAA,EAAAE,cAAAA,CAAA,CACrC,EACA,CAMAQ,WAAA7vF,CAAA,CAAAyuF,CAAA,EACA,WAAA1Y,EAAAiO,KAAA,IAAA+I,EAAA+C,WAAA,EAAA9vF,GAAA,KACA,CAMA+vF,SAAA/vF,CAAA,CAAAyuF,CAAA,EACA,WAAA1Y,EAAAkF,GAAA,IAAA8R,EAAAiD,SAAA,EAAAhwF,GAAA,KACA,CAMAiwF,wBAAAjwF,CAAA,CAAAyuF,CAAA,EACA,WAAA1Y,EAAAqG,kBAAA,IAAA2Q,EAAAmD,wBAAA,EAAAlwF,GAAA,KACA,CAMAmwF,yBAAAz1B,CAAA,CAAA+zB,CAAA,EACA,WAAA1Y,EAAAuG,mBAAA,IAAAyQ,EAAAqD,yBAAA,EAAA11B,GAAA,KACA,CAOA21B,gBAAA,CACA,GAAA9H,EAAAvrB,MAAA,gEACAC,UAAA,gBACA,EACA,CAOA,MAAA+xB,SAAAD,CAAA,EACA,GAAAxG,EAAAvrB,MAAA,4BAA6D+xB,EAAA7jB,MAAA,CAAW,2BACxEjO,UAAA8xB,EAAA7jB,MAAA,CACA3M,KAAAwwB,CACA,EACA,CAEA,MAAAuB,gBAAA,CACA,IAAAC,EAAA,GAAAhI,EAAA5rB,SAAA,cAAAmyB,CAAA,EAA4E5jB,OAAA,mBAA0B,aAItG,OAHA,MAAAkjB,CAAA,KACA,OAAAA,CAAA,CAAAmC,CAAA,EAEAA,CACA,CAMAC,YAAAvhF,CAAA,EACA,SAAAqoD,EAAA0c,cAAA,EAAA/kE,EAAA,KACA,CAKAwhF,aAAAC,CAAA,EACA,GAAAA,MAAAA,EACA,eAEA,OAAAA,GACA,eACA,WACA,iBACA,aACA,cACA,WACA,OAAAA,CACA,OACA,GAAAnI,EAAAlf,WAAA,EAAAqnB,GACA,GAAAnI,EAAAlf,WAAA,EAAAqnB,EAAA,IACAA,EAEA,GAAAnI,EAAAJ,UAAA,EAAAuI,IAEA,iBAAAA,GACAA,CAAAA,EAAA,GAAAnI,EAAA5rB,SAAA,EAAA+zB,EAAA,aAEA,iBAAAA,GACA,KACA,GAAAnI,EAAAJ,UAAA,EAAAuI,GAEA,MAAAtC,CAAA,IACA,GAAA7F,EAAAJ,UAAA,QAAAiG,CAAA,CAAAsC,GAEA,KAAAJ,cAAA,GAAApmC,IAAA,OAAAq+B,EAAAJ,UAAA,EAAA7pF,EAAAoyF,QAEA,GAAAnI,EAAAhvB,cAAA,mCAAAm3B,EACA,CAMAC,WAAAn2D,CAAA,MA0DAogD,EAIAC,EA5DA,IAAApP,EAAA,CAAAjxC,EAAAixC,MAAA,MAAArxD,GAAA,IACA,MAAAtV,EACA,KAEA8E,MAAA8J,OAAA,CAAA5O,GACAwoF,EAAAxoF,EAAAsV,GAAA,IAAAtV,EAAA4M,WAAA,KAEA5M,EAAA4M,WAAA,IAEAk/E,EAAA,cAAAp2D,EAAAA,EAAAo2D,SAAA,CAAA7tF,KAAAA,EACA2mD,EAAA,CAAAmnC,EAAAjW,EAAAC,SACA5rE,EACA,OAAA4hF,EAAA/xF,MAAA,EACA,YACA,QACAmQ,EAAA4hF,CAAA,IACA,KACA,SACAA,EAAArzE,IAAA,GACAvO,EAAA4hF,CACA,CACA,GAAAD,GACAhW,CAAAA,MAAAA,GAAAC,MAAAA,CAAA,EACA,8BAGA,IAAArgD,EAAA,GAgBA,OAfAvrB,GACAurB,CAAAA,EAAAvrB,OAAA,CAAAA,CAAA,EAEAw8D,EAAA3sE,MAAA,EACA07B,CAAAA,EAAAixC,MAAA,CAAAA,CAAA,EAEAmP,GACApgD,CAAAA,EAAAogD,SAAA,CAAAA,CAAA,EAEAC,GACArgD,CAAAA,EAAAqgD,OAAA,CAAAA,CAAA,EAEA+V,GACAp2D,CAAAA,EAAAo2D,SAAA,CAAAA,CAAA,EAEAp2D,CACA,EAEAvrB,EAAA,GACA,GAAAurB,EAAAvrB,OAAA,EACA,GAAArF,MAAA8J,OAAA,CAAA8mB,EAAAvrB,OAAA,EACA,QAAA++C,KAAAxzB,EAAAvrB,OAAA,CACAA,EAAApK,IAAA,MAAA2rF,WAAA,CAAAxiC,SAIA/+C,EAAApK,IAAA,MAAA2rF,WAAA,CAAAh2D,EAAAvrB,OAAA,SAIA,cAAAurB,GACAogD,CAAAA,EAAA,KAAA6V,YAAA,CAAAj2D,EAAAogD,SAAA,GAMA,CAHA,YAAApgD,GACAqgD,CAAAA,EAAA,KAAA4V,YAAA,CAAAj2D,EAAAqgD,OAAA,GAEA5rE,EAAAurB,MAAA,qBAAAh8B,GAAAM,MAAA,EACA87E,MAAAA,GAAA,iBAAAA,GACAC,MAAAA,GAAA,iBAAAA,GACApxB,QAAA6F,GAAA,EAAA7F,QAAA6F,GAAA,CAAArgD,GAAA2rE,EAAAC,EAAA,EAAA3wB,IAAA,IACAR,EAAA55C,CAAA,IAAAA,CAAA,IAAAA,CAAA,MAGA45C,EAAAz6C,EAAA2rE,EAAAC,EACA,CAMAiW,uBAAAC,CAAA,EACA,IAAAvB,EAAA,GAAAzZ,EAAAoB,WAAA,EAAA4Z,GACAhrB,EAAA,GAaA,GAZA,cAAA9xD,OAAA,KACA,GAAAu7E,MAAAA,CAAA,CAAAp/E,EAAA,CACA,OAEA,IAAA49C,EAAA,GAAAsJ,EAAA0c,cAAA,EAAAwb,CAAA,CAAAp/E,EAAA,OACA88E,EAAAl/B,GACA+X,EAAAlhE,IAAA,kBAAmD2qF,CAAA,CAAAp/E,EAAA,OAAA49C,CAAA,KAGnDwhC,CAAA,CAAAp/E,EAAA,CAAA49C,CAEA,GACAwhC,MAAAA,EAAAkB,QAAA,EACA,IAAAA,EAAA,KAAAD,YAAA,CAAAjB,EAAAkB,QAAA,EACAxD,EAAAwD,GACA3qB,EAAAlhE,IAAA,kBAAmD2qF,EAAAkB,QAAA,OAAAA,CAAA,KAGnDlB,EAAAkB,QAAA,CAAAA,CAEA,QACA,EAAA5xF,MAAA,CACA,iBAEA,OADA,MAAA2qD,QAAA6F,GAAA,CAAAyW,GACAypB,CACA,IAEAA,CACA,CACA,MAAAwB,YAAA,CAEA,eAAA/C,CAAA,EAEA,IAAAgD,EAAA,WACA,IACA,IAAAxC,EAAA,WAAA4B,cAAA,GAEA,OADA,KAAArY,IAAA,WAAAyW,EAAA,MACAA,CACA,CACA,MAAA9gF,EAAA,CAIA,MAHA,MAAAsgF,CAAA,GAAAgD,GACA,OAAAhD,CAAA,OAEAtgF,CACA,CACA,KAEA,OADA,MAAAsgF,CAAA,CAAAgD,EACA,OAAAA,CAAA,EAAAhlF,KAAA,EACA,CACA,IAAAgiF,EAAA,MAAAA,CAAA,CACA,CAAAv9B,EAAAwgC,EAAA,OAAAznC,QAAA6F,GAAA,EACA2+B,EACA,KAAAoC,cAAA,GACA,EAiBA,OAhBA3/B,EAAArhD,OAAA,GAAA6hF,EAAA7hF,OAAA,GACA,MAAA6+E,CAAA,EAEA,KAAAlW,IAAA,WAAAkZ,EAAAxgC,GAEA,MAAAu9B,CAAA,GAAAA,GACA,OAAAA,CAAA,CAAAxkC,QAAAC,OAAA,CAAAwnC,EAAA,GAKA,GAAA3I,EAAAvrB,MAAA,yBAAkEtM,EAAArhD,OAAA,KAAkB,EAAK6hF,EAAA7hF,OAAA,EAAgB,mBACzGmoE,MAAA,SACA,IAGA9mB,EAAAzkD,KAAA,EACA,CACA,MAAAklF,YAAA,CACA,IAAA1C,EAAA,WAAAuC,UAAA,GACAI,EAAA,UACA,IAAoBC,OAAAA,CAAA,CAAAC,SAAAA,CAAA,CAAAC,YAAAA,CAAA,EAAgC,SAAAhJ,EAAAhO,iBAAA,GACpD8W,OAAA,MAAA1U,CAAA,cACA2U,SAAA,WACA,IACA,IAAAtxF,EAAA,YAAA8uF,CAAA,EAA4D5jB,OAAA,gBAC5D,SAAAqd,EAAAznB,SAAA,EAAA9gE,EAAA,YACA,CACA,MAAA2N,EAAA,EACA,WACA,KACA4jF,YAAA,WACA,IACA,IAAAvxF,EAAA,YAAA8uF,CAAA,EAA4D5jB,OAAA,mBAC5D,SAAAqd,EAAAznB,SAAA,EAAA9gE,EAAA,YACA,CACA,MAAA2N,EAAA,EACA,WACA,IACA,GACA6jF,EAAA,KACAC,EAAA,KAEA57B,EAAA,KAAAg6B,UAAA,CAAAwB,EAAA5C,GAKA,OAJA54B,GAAAA,EAAA67B,aAAA,GACAD,EAAA,MAAAF,EAAAA,EAAA/vF,OAAA,cACAgwF,EAAA,EAAAE,aAAA,CAAApR,EAAAmR,GAEA,IAAA1b,EAAAgO,OAAA,CAAAuN,EAAAE,EAAAC,EACA,EAEA7C,EAAAH,EAAAI,SAAA,qDACA,GAAAD,EAAA,CACA,IAAAG,EAAA,IAAAxG,EAAAxD,YAAA,CAAA6J,EAAAU,GAAA,EACAqC,EAAA,MAAA/C,EAAAgD,WAAA,CAAAR,EAAA,KAAArC,GACA,WAAAhZ,EAAAgO,OAAA,CAAA4N,EAAAL,QAAA,CAAAK,EAAAH,YAAA,CAAAG,EAAAF,oBAAA,CACA,CACA,aAAAL,GACA,CACA,MAAAjb,YAAA0b,CAAA,EACA,IAAAn3B,EAAA,KAAAo2B,sBAAA,CAAAe,GAIA,OAHA3E,EAAAxyB,IACAA,CAAAA,EAAA,MAAAA,CAAA,EAEA,GAAA6tB,EAAAznB,SAAA,cAAAguB,CAAA,EACA5jB,OAAA,cAAAlQ,YAAAN,CACA,GAAS,YACT,CACA,OAAAtuD,CAAA,CAAAsuD,CAAA,CAAAg2B,CAAA,CAAAoB,CAAA,EACA,GAAAvJ,EAAAvrB,MAAA,EAAA80B,EA9lBA,GA8lBA,4DACAl3B,OAAA,qBACAI,YAAAn7D,OAAAwM,MAAA,IAAyCquD,EAAA,CAAQg2B,SAAAA,EAAAqB,eAAA,IACjD,GAEA,IAAA/2B,EAAA,GAAA+a,EAAAoB,WAAA,EAAAzc,GACA,IACA,SAAA6tB,EAAAxtB,OAAA,aAAAi0B,QAAA,EAAiE9jB,OAAA,OAAAlQ,YAAAA,EAAA01B,SAAAA,CAAA,GACjE,CACA,MAAA/iF,EAAA,CAEA,SAAA4gF,eAAA,KAAAhG,EAAA7O,eAAA,EAAA/rE,IAAAA,EAAA9G,IAAA,EAAAirF,GAAA,GAAApB,WAAAA,GAAA11B,MAAAA,EAAAnzD,EAAA,oBAAA0gF,EAAA1d,SAAA,EAAAl9D,EAAA9G,IAAA,WAIAmrF,EAHA,IAAAnrF,EAAA8G,EAAA9G,IAAA,CACAorF,EAAA,SAAA36B,EAAA0c,cAAA,EAAAhZ,EAAAnzD,EAAA,OAGA,IACAmqF,EAAAE,SAsqBArrF,CAAA,EACA,IAAAiJ,EAAA,CACAs/E,OAAA,GAAAD,KAAA,GAAAD,SAAA,GAAApoB,SAAA,GAAAqrB,UAAA,GAAAC,UAAA,IAEA,GAAA7J,EAAAvrB,MAAA,KAAAurB,EAAA5qB,UAAA,EAAA92D,IAAA,yDACA+zD,OAAA,kCACA,GACA,IAAAw0B,EAAA,GAAA7G,EAAA1d,SAAA,EAAAhkE,EAAA,MACA,GAAA0hF,EAAAvrB,MAAA,KAAAurB,EAAA1d,SAAA,EAAAukB,EAAA,WAAA7G,EAAA1d,SAAA,EAAAwnB,EAAA,wDACAz3B,OAAA,+BACA,GACA9qD,EAAAs/E,MAAA,IAAA7G,EAAA1d,SAAA,EAAAukB,EAAA,IAEA,IACA,IAAAD,EAAA,GACAmD,EAAA,GAAA/J,EAAA5rB,SAAA,KAAA4rB,EAAA1d,SAAA,EAAAhkE,EAAA,QACA0rF,EAAA,GAAAhK,EAAA5rB,SAAA,KAAA4rB,EAAA1d,SAAA,EAAAhkE,EAAAyrF,EAAAA,EAAA,KACAE,EAAA,GAAAjK,EAAA1d,SAAA,EAAAhkE,EAAAyrF,EAAA,IACA,QAAAjnE,EAAA,EAAwBA,EAAAknE,EAAgBlnE,IAAA,CACxC,IAAAikE,EAAAmD,SAhFA3iF,CAAA,CAAAojB,CAAA,EACA,IACA,IAAAt0B,EAAA8zF,EAAA5iF,EAAAojB,GACA,GAAAt0B,EACA,SAAA2pF,EAAA/sB,YAAA,EAAA58D,EAEA,CACA,MAAA+O,EAAA,EACA,WACA,EAuEA6kF,EAAAnnE,GAAAA,GACA,GAAAikE,MAAAA,EACA,qBAEAH,EAAAtqF,IAAA,CAAAyqF,EACA,CACAx/E,EAAAq/E,IAAA,CAAAA,CACA,CACA,MAAAxhF,EAAA,CACA,GAAA46E,EAAAvrB,MAAA,qDACApC,OAAA,6BACA,EACA,CAEA,IACA,IAAAs0B,EAAAwD,EAAA7rF,EAAA,IACA,GAAAqoF,MAAAA,EACA,oBAEAp/E,CAAAA,EAAAo/E,QAAA,CAAAA,CACA,CACA,MAAAvhF,EAAA,CACA,GAAA46E,EAAAvrB,MAAA,yDACApC,OAAA,iCACA,EACA,CAEA,GAAA2tB,EAAAvrB,MAAA,KAAAurB,EAAA1d,SAAA,EAAAhkE,EAAA,cAAA0hF,EAAA1d,SAAA,EAAAwnB,EAAA,mEACAz3B,OAAA,0CACA,GACA9qD,EAAAg3D,QAAA,IAAAyhB,EAAA1d,SAAA,EAAAhkE,EAAA,QAEA,IACA,IAAAsrF,EAAAO,EAAA7rF,EAAA,KACA,GAAAsrF,MAAAA,EACA,oBAEAriF,CAAAA,EAAAqiF,SAAA,CAAAA,CACA,CACA,MAAAxkF,EAAA,CACA,GAAA46E,EAAAvrB,MAAA,0DACApC,OAAA,kCACA,EACA,CAEA,OADA9qD,EAAAsiF,SAAA,2CAAA/wF,KAAA,MAAA+Y,GAAA,IAAAtK,CAAA,CAAAa,EAAA,EACAb,CACA,EAvuBA,GAAAy4E,EAAA1d,SAAA,EAAAl9D,EAAA9G,IAAA,IACA,CACA,MAAA8G,EAAA,CACA,GAAA46E,EAAAvrB,MAAA,KAAArvD,EAAA8qC,OAAA,mBACAmiB,OAAA,WAAAI,YAAAA,EAAAuD,KAAA,CAAiE13D,KAAAA,CAAA,CACjE,EACA,CAEA,GAAA0hF,EAAAvrB,MAAA,EAAAg1B,EAAA5C,MAAA,CAAA19E,WAAA,KAAAugF,EAAAvgF,WAAA,iDACA+oD,OAAA,OACA5zD,KAAAA,EACA+zD,OAAA,iBACAI,YAAAA,EACAE,WAAA,KACAL,OAAA,CACAziB,UAAA,sDACAz5C,KAAA,iBACAgmC,KAAAqtD,EAAAI,SAAA,CAEA,GACA,IAAAO,EAAA,WAAA1D,aAAA,CAAAj0B,EAAAg3B,EAAA9C,QAAA,CAAA8C,EAAA7C,IAAA,EACA,GAAA5G,EAAAvrB,MAAA,EAAA21B,MAAAA,EAAA,mDACA/3B,OAAA,eAAAI,YAAAA,EAAAuD,KAAA,CAAiE13D,KAAA8G,EAAA9G,IAAA,CAAAurF,UAAAJ,EAAAI,SAAA,CACjE,GACA,IAAA13B,EAAA,CACA7yD,GAAAoqF,EACAprF,KAAA,GAAA0hF,EAAAx9B,MAAA,GAAAinC,EAAAlrB,QAAA,CAAA8rB,SAwnBAC,CAAA,EACA,IAAA/iF,EAAA,GACAgjF,EAAA,EAEA,QAAA9wF,EAAA,EAAoBA,EAAA6wF,EAAA/zF,MAAA,CAAkBkD,IACtC8N,EAAAjL,IAAA,CAAAyT,GACAw6E,GAAA,GAEA,QAAA9wF,EAAA,EAAoBA,EAAA6wF,EAAA/zF,MAAA,CAAkBkD,IAAA,CACtC,IAAA6E,EAAA,GAAA0hF,EAAAztB,QAAA,EAAA+3B,CAAA,CAAA7wF,EAAA,CAEA8N,CAAAA,CAAA,CAAA9N,EAAA,CAAA+wF,EAAAD,GAEAhjF,EAAAjL,IAAA,CAAAkuF,EAAAlsF,EAAA/H,MAAA,GACAgR,EAAAjL,IAAA,CAAAmuF,SAxBAhzF,CAAA,EACA,KAAAlB,MAAA,OACA,OAAAkB,EAEA,IAAA8P,EAAA,IAAArR,WAAAwI,GAAAA,KAAA4oB,IAAA,CAAA7vB,EAAAlB,MAAA,MAEA,OADAgR,EAAAzI,GAAA,CAAArH,GACA8P,CACA,EAiBAjJ,IACAisF,GAAA,GAAA7rF,GAAAA,KAAA4oB,IAAA,CAAAhpB,EAAA/H,MAAA,IACA,CACA,SAAAypF,EAAAx9B,MAAA,EAAAj7C,EACA,EA1oBA,CAAA6iF,EAAAX,EAAAG,SAAA,IACA,EACA,KAAAna,IAAA,UAAqCvd,OAAA,mBAAAO,YAAAN,CAAA,GACrC,IACA,IAAA5qD,EAAA,YAAA1D,CAAA,CAAAsuD,EAAAg2B,EAAAoB,EAAA,GAEA,OADA,KAAA9Z,IAAA,UAAyCvd,OAAA,4BAAAO,YAAAn7D,OAAAwM,MAAA,IAAkEquD,GAAA5qD,OAAAA,CAAA,GAC3GA,CACA,CACA,MAAAnC,EAAA,CAEA,MADA,KAAAqqE,IAAA,UAAyCvd,OAAA,2BAAAO,YAAAn7D,OAAAwM,MAAA,IAAiEquD,GAAA/sD,MAAAA,CAAA,GAC1GA,CACA,CACA,CACA,MAAAA,CACA,CACA,CACA,OAAAslF,CAAA,CAAA7e,CAAA,EACA,IAAgBp0E,MAAAA,CAAA,EAAQ,SAAAuoF,EAAAhO,iBAAA,GACxBkU,QAAA,KAAAuC,UAAA,GACAhxF,MAAAo0E,CACA,GACA,OAAAp0E,CACA,CACA,MAAAoM,KAAAylF,CAAA,EACA,IAAgBn3B,GAAAA,CAAA,CAAAg2B,SAAAA,CAAA,EAAe,SAAAnI,EAAAhO,iBAAA,GAC/B7f,GAAA,KAAAo2B,sBAAA,CAAAe,GACAnB,SAAA,KAAAD,YAAA,CAAAoB,EAAAnB,QAAA,CACA,GACA,mBAAAuC,CAAA,OAAA7mF,CAAA,CAAAsuD,EAAAg2B,EAAAmB,EAAAE,cAAA,OACA,CAEA,OAAAmB,CAAA,CAAA1D,CAAA,CAAAqB,CAAA,CAAAsC,CAAA,EACA,IAAAlkF,EAAA,KAAAuhF,WAAA,CAAAK,GACAH,EAAA,KAAAD,YAAA,CAAA0C,GAIA,MAHA,kBAAAlkF,GAAA,iBAAAyhF,CAAA,GACA,EAAAzhF,EAAAyhF,EAAA,OAAAjnC,QAAA6F,GAAA,EAAArgD,EAAAyhF,EAAA,GAEA,YAAAuC,CAAA,OAAAnE,CAAA,CAAAjvF,OAAAwM,MAAA,CAAAmjF,EAAA,CAA+EvgF,QAAAA,EAAAyhF,SAAAA,CAAA,IAC/E,CACA,MAAA0C,WAAAnkF,CAAA,CAAAyhF,CAAA,EACA,SAAAnI,EAAAznB,SAAA,cAAAoyB,CAAA,EAAuEhoB,OAAA,cAAsBj8D,EAAAyhF,GAAA,YAC7F,CACA,MAAA2C,oBAAApkF,CAAA,CAAAyhF,CAAA,EACA,SAAAnI,EAAA5rB,SAAA,cAAAu2B,CAAA,EAAuEhoB,OAAA,uBAA+Bj8D,EAAAyhF,GAAA,YACtG,CACA,MAAA1W,QAAA/qE,CAAA,CAAAyhF,CAAA,EACA,SAAAnI,EAAAxtB,OAAA,cAAAm4B,CAAA,EAAqEhoB,OAAA,WAAmBj8D,EAAAyhF,GACxF,CACA,MAAA4C,WAAArkF,CAAA,CAAAskF,CAAA,CAAA7C,CAAA,EACA,IAAA8C,EAAA,GAAAjL,EAAAznB,SAAA,EAAAyyB,EAAA,YACA,SAAAhL,EAAAxtB,OAAA,cAAAm4B,CAAA,EAAqEhoB,OAAA,aAAAsoB,SAAAA,CAAA,EAAgCvkF,EAAAyhF,GACrG,CAEA,MAAA+C,qBAAAC,CAAA,EACA,IAAgBnD,YAAAA,CAAA,CAAAvxF,KAAAA,CAAA,CAAAyvF,QAAAA,CAAA,EAA6B,SAAAlG,EAAAhO,iBAAA,GAC7CgW,YAAA,KAAAD,cAAA,GACAtxF,KAAA,KAAAgwF,QAAA,EACA9jB,OAAA,uBACAyoB,kBAAAD,CACA,GACAjF,QAAA,KAAAuC,UAAA,EACA,GACAt2B,EAAA4tB,EAAA/C,WAAA,CAAA17E,IAAA,CAAA6pF,GACA,GAAAh5B,EAAA17D,IAAA,GAAAA,EACA,sDAEA,YAAAmxF,wBAAA,CAAAz1B,EAAA+zB,GAAAmF,sBAAA,CAAArD,EACA,CACA,OAAA5T,CAAA,CAAA9mB,CAAA,CAAAg+B,CAAA,EAEA,MAAAtL,EAAAlf,WAAA,EAAAxT,EAAA,IACA,mBAAAi5B,CAAA,EACA5jB,OAAA,WAAA0lB,UAAA/6B,EAAAg+B,oBAAAA,CACA,GAEA,IAAAnD,EAAA,KAAAD,YAAA,CAAA56B,GAIA,MAHA,iBAAA66B,GACAA,CAAAA,EAAA,MAAAA,CAAA,EAEA,YAAA5B,CAAA,EACA5jB,OAAA,WAAAwlB,SAAAA,EAAAmD,oBAAAA,CACA,EACA,CAEA,MAAAlX,SAAA9mB,CAAA,CAAAi+B,CAAA,EACA,IAAgBrF,QAAAA,CAAA,CAAA5gC,OAAAA,CAAA,EAAkB,SAAA06B,EAAAhO,iBAAA,GAClCkU,QAAA,KAAAuC,UAAA,GACAnjC,OAAA,MAAA8uB,CAAA,CAAA9mB,EAAA,EAAAi+B,EACA,UACA,MAAAjmC,EACA,KAEA,KAAAgiC,UAAA,CAAAhiC,EAAA4gC,EACA,CACA,MAAA7R,eAAA59E,CAAA,EACA,IAAgByvF,QAAAA,CAAA,CAAA5gC,OAAAA,CAAA,EAAkB,SAAA06B,EAAAhO,iBAAA,GAClCkU,QAAA,KAAAuC,UAAA,GACAnjC,OAAA,MAAAihC,CAAA,EAAoC5jB,OAAA,iBAAAlsE,KAAAA,CAAA,EACpC,UACA,MAAA6uD,EACA,KAEA,KAAAsiC,wBAAA,CAAAtiC,EAAA4gC,EACA,CACA,MAAA5R,sBAAA79E,CAAA,EACA,IAAgByvF,QAAAA,CAAA,CAAA5gC,OAAAA,CAAA,EAAkB,SAAA06B,EAAAhO,iBAAA,GAClCkU,QAAA,KAAAuC,UAAA,GACAnjC,OAAA,MAAAihC,CAAA,EAAoC5jB,OAAA,wBAAAlsE,KAAAA,CAAA,EACpC,GACA,GAAA6uD,MAAAA,EACA,YAIA,GAAAA,MAAAA,EAAAyjC,QAAA,EAAAzjC,MAAAA,EAAAkmC,iBAAA,EACA,IAAAr5B,EAAA,YAAAo0B,CAAA,EAA6C5jB,OAAA,iBAAAlsE,KAAAA,CAAA,GAC7C,GAAA07D,MAAAA,EACA,kEAEA7M,CAAAA,EAAAkmC,iBAAA,CAAAr5B,EAAA42B,QAAA,CAEA,YAAArB,uBAAA,CAAApiC,EAAA4gC,EACA,CACA,MAAAuF,qBAAAh1F,CAAA,EACA,IAAgB8Q,OAAAA,CAAA,EAAS,SAAAy4E,EAAAhO,iBAAA,GACzBkU,QAAA,KAAAuC,UAAA,GACAlhF,OAAA,MAAAg/E,CAAA,EAAoC5jB,OAAA,uBAAAlsE,KAAAA,CAAA,EACpC,UACA,MAAA8Q,EACA,KAEA,GAAAy4E,EAAAxtB,OAAA,EAAAjrD,EACA,CAEA,MAAAgrE,QAAAmZ,CAAA,EACA,IAAAz5D,EAAA,KAAAm2D,UAAA,CAAAsD,GACA/G,EAAA1yD,IACAA,CAAAA,EAAA,MAAAA,CAAA,EAEA,IAAgBi0D,QAAAA,CAAA,CAAA5gC,OAAAA,CAAA,EAAkB,SAAA06B,EAAAhO,iBAAA,GAClCkU,QAAA,KAAAuC,UAAA,GACAnjC,OAAA,MAAAihC,CAAA,EAAoC5jB,OAAA,UAAA1wC,OAAAA,CAAA,EACpC,GACA,OAAAqzB,EAAAzzC,GAAA,SAAA21E,QAAA,CAAA3+E,EAAAq9E,GACA,CAEAyF,aAAA7kF,CAAA,EACA,GAAAk5E,EAAAvrB,MAAA,0EACAC,UAAA,gBACA,EACA,CACA,MAAAsZ,YAAA53E,CAAA,EACA,aAAAmuF,EAAArK,WAAA,CAAA0R,QAAA,MAAAx1F,EACA,CACA,MAAAy1F,UAAAz1F,CAAA,EACA,IAAA01E,EAAA,WAAAkC,WAAA,CAAA53E,UACA,EACA,MAAA01E,EAAA+f,SAAA,GAEA,IACA,CACA,MAAA9f,YAAA31E,CAAA,EACA,IAAA01E,EAAA,WAAAkC,WAAA,CAAA53E,UACA,EACA,MAAA01E,EAAAxkB,UAAA,GAEA,IACA,CACA,MAAAwkC,cAAAplF,CAAA,EACAA,EAAA,GAAAqoD,EAAAzH,UAAA,EAAA5gD,GACA,IAAA2sB,EAAA,GAAAysD,EAAA7D,QAAA,EAAAv1E,EAAAuxD,SAAA,IAAA9uD,WAAA,oBACA,IACA,IAAA4iF,EAAA,MAAAxH,EAAArK,WAAA,CAAA8R,aAAA,OACAC,EAAA,IAAAr8B,EAAAnH,QAAA,CAAAsjC,EAAA,CACA,oDACA,OACAjgB,EAAA,MAAAmgB,EAAAngB,QAAA,CAAAz4C,GACA,GAAAy4C,MAAAA,GAAAA,IAAAnc,EAAA8c,WAAA,CACA,YAEA,IAAAyf,EAAA,IAAAt8B,EAAAnH,QAAA,CAAAqjB,EAAA,CACA,+CACA,OACA11E,EAAA,MAAA81F,EAAA91F,IAAA,CAAAi9B,GAGA,GAAA4lD,MADA,KAAAlN,WAAA,CAAA31E,KACAsQ,EACA,YAEA,OAAAtQ,CACA,CACA,MAAAgP,EAAA,CAEA,MAAA46E,EAAAloB,OAAA,EAAA1yD,EAAA,aAAAA,OAAAA,EAAA3N,KAAA,EAIA,GAAAuoF,EAAAloB,OAAA,EAAA1yD,EAAA,kBAHA,WAMA,OAAAA,CACA,CACA,WACA,CACA,MAAA+mF,mBAAA11F,CAAA,CAAA21F,CAAA,CAAAnY,CAAA,EACA,IAAAD,EAAA,MAAAoY,EAAAA,EAAA,SACA,IAAApY,EACA,KAAAM,qBAAA,CAAA79E,GAEA,IAAAyqD,QAAA,MAAAC,EAAAC,KACA,IAAAirC,EAAA,KACA/c,EAAA,MAAA0Y,IACA,IACA,IAAA9T,EAAA,WAAAI,qBAAA,CAAA79E,GACA,GAAAy9E,MAAAA,GACA8T,EAAA9T,EAAA8T,WAAA,IAAAhU,EAAA,CACA7yB,EAAA+yB,GAEAmY,IACAC,aAAAD,GACAA,EAAA,MAEA,MACA,CAEA,CACA,MAAAjnF,EAAA,CACAD,QAAAI,GAAA,OAAAH,EACA,CACA,KAAAirE,IAAA,SAAAf,EACA,CACA,OAAA2E,GACAoY,CAAAA,EAAAlG,WAAA,KACA,MAAAkG,IAGAA,EAAA,KACA,KAAApc,GAAA,SAAAX,GACAluB,EAAA,GAAA4+B,EAAAttB,SAAA,uBAA6EL,OAAA,aAC7E,EAAiB4hB,EAAA,EAEjB3E,EAAA,WAAAyY,cAAA,GACA,EACA,CACA,MAAAwE,aAAApE,CAAA,EACA,GAAAnI,EAAAvrB,MAAA,8CACAC,UAAA,cACA,EACA,CAIA83B,cAAAC,CAAA,EACA,IAAAJ,EAAA,MAAAtG,CAAA,CAAAp9E,GAAA,CAAA8jF,GACAJ,IAGAA,EAAAA,KAAA,EACAC,aAAAD,EAAAA,KAAA,EAEA,MAAAtG,CAAA,CAAAr9C,MAAA,CAAA+jD,GACA,CASAC,YAAAC,CAAA,CAAA1Y,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,GAEA,IAAAwY,EAAA,MAAA3G,CAAA,GACA36D,EAAA,KACA,MAAA46D,CAAA,CAAAr9C,MAAA,CAAA+jD,GACAE,GACA,EACA,QAAAC,MAAA,CACA,MAAA7G,CAAA,CAAAjnF,GAAA,CAAA2tF,EAAA,CAAwCJ,MAAA,KAAAlhE,KAAAA,EAAA66B,KAAAiuB,CAAA,OAExC,CACA,IAAAoY,EAAAlG,WAAAh7D,EAAA8oD,GACA,MAAA8R,CAAA,CAAAjnF,GAAA,CAAA2tF,EAAA,CAAwCJ,MAAAA,EAAAlhE,KAAAA,EAAA66B,KAAAQ,GAAA,EACxC,CACA,OAAAimC,CACA,CAIAI,mBAAA1hE,CAAA,EACA,QAAA6V,KAAA,MAAAouC,CAAA,CAAA3d,MAAA,GACAtmC,EAAA6V,EAAA8rD,UAAA,CAEA,CAKAC,eAAA/rD,CAAA,EACA,OAAAA,EAAA7uB,IAAA,EACA,YACA,YACA,cACA,WAAAkrE,EAAAr8C,EAAA7uB,IAAA,CACA,cACA,IAAA26E,EAAA,IAAApI,EAAAsI,sBAAA,OAEA,OADAF,EAAAvH,eAAA,MAAAA,eAAA,CACAuH,CACA,CACA,WACA,gBACA,WAAApI,EAAAuI,yBAAA,MAAAjsD,EAAA7uB,IAAA,CACA,aACA,WAAAuyE,EAAAwI,sBAAA,MAAAlsD,EAAA/O,MAAA,CACA,mBACA,WAAAyyD,EAAAyI,4BAAA,MAAAnsD,EAAAvqC,IAAA,CACA,cACA,WAAAiuF,EAAA0I,uBAAA,MAAApsD,EAAA/O,MAAA,CACA,CACA,kCAA8C+O,EAAA7uB,IAAA,CAAS,EACvD,CAUAk7E,mBAAAC,CAAA,CAAAC,CAAA,EACA,QAAAvsD,KAAA,MAAAouC,CAAA,CAAA3d,MAAA,GACA,GAAAzwB,EAAA8rD,UAAA,GAAAQ,EAAA,CACAtsD,EAAAgvC,OAAA,EACAhvC,EAAA8rD,UAAA,CAAA/c,IAAA,GAEA/uC,EAAA8rD,UAAA,CAAAS,EACAvsD,EAAAgvC,OAAA,EACAud,EAAA5iE,KAAA,GAEA,YAAA86D,CAAA,EACA8H,EAAA1I,KAAA,OAAAY,CAAA,EAEA,KACA,CAEA,CACA,OAAAtW,CAAA,CAAAF,CAAA,CAAAue,CAAA,EACA,IAAAxsD,EAAA,MAAAgkD,EAAA/V,EAAA,MAMA,MAHA,UAAAjuC,EAAA7uB,IAAA,EAAAq7E,GAAAA,EAAAj3F,MAAA,IAAAi3F,CAAA,IAAAA,CAAA,IAAAC,OAAA,EACAzsD,CAAAA,EAAA,MAAAgkD,EAAA,CAA0CE,OAAA,WAAA3/E,IAAAioF,CAAA,KAAsC,OAEhF,MAAApe,CAAA,CAAAzmE,GAAA,CAAAq4B,EAAAwR,GAAA,OACA,CACA,OAAA68B,CAAA,CAAAJ,CAAA,EACA,IAAAye,EAAA,MAAA1I,EAAA/V,EAAA,MAEAz8B,EAAAk7C,EAAAl7C,GAAA,CACAxR,EAAA,MAAAouC,CAAA,CAAAzmE,GAAA,CAAA6pC,GAQA,MAPA,CAAAxR,IAIAA,EAAA,CAAoB8rD,WAHpB,KAAAC,cAAA,CAAAW,GAGoBl7C,IAAAA,EAAAm7C,eAFpB,IAAA1hC,QAEoB2hC,QADpB,IAAA/lD,IACoBmoC,QAAA,GAAAH,UAAA,IACpB,MAAAT,CAAA,CAAAtwE,GAAA,CAAA0zC,EAAAxR,IAEAA,CACA,CACA,MAAA8uC,GAAAb,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,YAAAquC,CAAA,CAAAJ,GASA,OARAjuC,EAAA6uC,SAAA,CAAAvzE,IAAA,EAA6BgzE,SAAAA,EAAAe,KAAA,KAC7BrvC,EAAAgvC,OAAA,GACAhvC,EAAA8rD,UAAA,CAAAniE,KAAA,GACAqW,EAAAgvC,OAAA,IACA,YAAAyV,CAAA,EACAzkD,EAAA8rD,UAAA,CAAAjI,KAAA,OAAAY,CAAA,GAGA,KAEA,MAAApV,KAAApB,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,YAAAquC,CAAA,CAAAJ,GASA,OARAjuC,EAAA6uC,SAAA,CAAAvzE,IAAA,EAA6BgzE,SAAAA,EAAAe,KAAA,KAC7BrvC,EAAAgvC,OAAA,GACAhvC,EAAA8rD,UAAA,CAAAniE,KAAA,GACAqW,EAAAgvC,OAAA,IACA,YAAAyV,CAAA,EACAzkD,EAAA8rD,UAAA,CAAAjI,KAAA,OAAAY,CAAA,GAGA,KAEA,MAAAhW,KAAAR,CAAA,IAAA7yC,CAAA,EACA,IAAA4E,EAAA,YAAAmuC,CAAA,CAAAF,EAAA7yC,GAGA,IAAA4E,GAAAA,IAAAA,EAAA6uC,SAAA,CAAAt5E,MAAA,CACA,SAGA,IAAA4gB,EAAA6pB,EAAA6uC,SAAA,CAAAt5E,MAAA,CAeA,OAdAyqC,EAAA6uC,SAAA,CAAA7uC,EAAA6uC,SAAA,CAAA59C,MAAA,GAAgDq9C,SAAAA,CAAA,CAAAe,KAAAA,CAAA,CAAgB,IAChE,IAAAwd,EAAA,IAAA7N,EAAA7L,YAAA,MAAA9D,EAAA,KAAAf,EAAAL,GACA,IACAK,EAAAzrE,IAAA,SAAAu4B,EAAAyxD,EACA,CACA,MAAAzoF,EAAA,EACA,OAAAirE,CACA,GACA,IAAArvC,EAAA6uC,SAAA,CAAAt5E,MAAA,GACAyqC,EAAAgvC,OAAA,EACAhvC,EAAA8rD,UAAA,CAAA/c,IAAA,GAEA,MAAAX,CAAA,CAAA1mC,MAAA,CAAA1H,EAAAwR,GAAA,GAEAr7B,EAAA,CACA,CACA,MAAAw7D,cAAA1D,CAAA,EACA,GAAAA,EAAA,CACA,IAAAjuC,EAAA,YAAAmuC,CAAA,CAAAF,UACA,EAGAjuC,EAAA6uC,SAAA,CAAAt5E,MAAA,CAFA,CAGA,CACA,IAAA+4B,EAAA,EACA,QAAqBugD,UAAAA,CAAA,IAAY,MAAAT,CAAA,CAAA3d,MAAA,GACjCniC,GAAAugD,EAAAt5E,MAAA,CAEA,OAAA+4B,CACA,CACA,MAAAugD,UAAAZ,CAAA,EACA,GAAAA,EAAA,CACA,IAAAjuC,EAAA,YAAAmuC,CAAA,CAAAF,UACA,EAGAjuC,EAAA6uC,SAAA,CAAAh+D,GAAA,GAAwCy9D,SAAAA,CAAA,CAAU,GAAAA,GAFlD,GAIA,IAAA/nE,EAAA,GACA,QAAqBsoE,UAAAA,CAAA,IAAY,MAAAT,CAAA,CAAA3d,MAAA,GACjClqD,EAAAA,EAAAi7C,MAAA,CAAAqtB,EAAAh+D,GAAA,GAAoDy9D,SAAAA,CAAA,CAAU,GAAAA,IAE9D,OAAA/nE,CACA,CACA,MAAA0oE,IAAAhB,CAAA,CAAAK,CAAA,EACA,IAAAtuC,EAAA,YAAAmuC,CAAA,CAAAF,GACA,IAAAjuC,EACA,YAEA,GAAAsuC,EAAA,CACA,IAAAx9D,EAAAkvB,EAAA6uC,SAAA,CAAAh+D,GAAA,GAA+Cy9D,SAAAA,CAAA,CAAU,GAAAA,GAAA5pD,OAAA,CAAA4pD,GACzDx9D,GAAA,GACAkvB,EAAA6uC,SAAA,CAAAzO,MAAA,CAAAtvD,EAAA,EAEA,CAOA,OANAw9D,GAAAtuC,IAAAA,EAAA6uC,SAAA,CAAAt5E,MAAA,GACAyqC,EAAAgvC,OAAA,EACAhvC,EAAA8rD,UAAA,CAAA/c,IAAA,GAEA,MAAAX,CAAA,CAAA1mC,MAAA,CAAA1H,EAAAwR,GAAA,GAEA,KAEA,MAAAogC,mBAAA3D,CAAA,EACA,GAAAA,EAAA,CACA,IAAoBz8B,IAAAA,CAAA,CAAAw9B,QAAAA,CAAA,CAAA8c,WAAAA,CAAA,EAA2B,YAAAzd,CAAA,CAAAJ,GAC/Ce,GACA8c,EAAA/c,IAAA,GAEA,MAAAX,CAAA,CAAA1mC,MAAA,CAAA8J,EACA,MAEA,QAAAA,EAAA,CAA+Bw9B,QAAAA,CAAA,CAAA8c,WAAAA,CAAA,CAAqB,UAAA1d,CAAA,CACpDY,GACA8c,EAAA/c,IAAA,GAEA,MAAAX,CAAA,CAAA1mC,MAAA,CAAA8J,GAGA,YAGA,MAAAqgC,YAAA5D,CAAA,CAAAK,CAAA,EACA,kBAAAQ,EAAA,CAAAb,EAAAK,EACA,CAEA,MAAAwD,eAAA7D,CAAA,CAAAK,CAAA,EACA,YAAAW,GAAA,CAAAhB,EAAAK,EACA,CAQA,IAAAr4E,WAAA,CACA,aAAAA,CAAA,CAQAkI,SAAA,CAIA,QAAAstF,KAFA,KAAA7Z,kBAAA,GAEA,MAAAmT,CAAA,CAAA58B,IAAA,IACA,KAAAqjC,aAAA,CAAAC,EAEA,OAAAx1F,CAAA,GACA,CAYA,IAAA21F,QAAA,CAAmB,mBAAAnH,CAAA,CACnB,IAAAmH,OAAA/H,CAAA,EACA,EAAAA,IAAA,KAAA+H,MAAA,GAGA,KAAAA,MAAA,CACA,KAAA3pC,MAAA,GAGA,KAAA4hC,KAAA,KAEA,CAMAA,MAAAC,CAAA,EAEA,GADA,MAAAe,CAAA,IACA,YAAAJ,CAAA,EACA,KAAAX,GAAA,MAAAW,CAAA,CACA,OAEA,GAAAzF,EAAAvrB,MAAA,8CAAqE,yBACrEC,UAAA,OACA,EACA,CAGA,QAAA23B,KAFA,KAAAQ,kBAAA,IAAAlzF,EAAAkrF,KAAA,CAAAC,IACA,MAAAW,CAAA,GAAAX,EACA,MAAAiB,CAAA,CAAAt0B,MAAA,IAEA46B,EAAAA,KAAA,EACAC,aAAAD,EAAAA,KAAA,EAGAA,EAAArmC,IAAA,CAAAQ,IAAA6lC,EAAArmC,IAAA,CAMA/C,QAAA,CACA,eAAAwiC,CAAA,CAKA,QAAA4G,KAFA,KAAAQ,kBAAA,IAAAlzF,EAAAspD,MAAA,IACA,MAAAwiC,CAAA,MACA,MAAAM,CAAA,CAAAt0B,MAAA,KAEA,IAAAwiB,EAAAoY,EAAArmC,IAAA,CACAiuB,EAAA,GACAA,CAAAA,EAAA,GAGAoY,EAAArmC,IAAA,CAAAQ,IAEA2/B,WAAAkG,EAAAlhE,IAAA,CAAA8oD,EACA,CACA,CACA,CAYA,SAAAkW,EAAA5iF,CAAA,CAAAojB,CAAA,EACA,GAAApjB,OAAAA,EACA,YAEA,IACA,IAAAqrB,EAAA,GAAAotD,EAAA5rB,SAAA,KAAA4rB,EAAA1d,SAAA,EAAA/6D,EAAAojB,EAAAA,EAAA,KACAp0B,EAAA,GAAAypF,EAAA5rB,SAAA,KAAA4rB,EAAA1d,SAAA,EAAA/6D,EAAAqrB,EAAAA,EAAA,KACA,SAAAotD,EAAA1d,SAAA,EAAA/6D,EAAAqrB,EAAA,GAAAA,EAAA,GAAAr8B,EACA,CACA,MAAA6O,EAAA,EACA,WACA,CACA,SAAAolF,EAAA/yF,CAAA,EACA,IAAA8P,EAAA,GAAAy4E,EAAAnrB,SAAA,EAAAp9D,GACA,GAAA8P,EAAAhR,MAAA,IACA,2CAEA,IAAAu3F,EAAA,IAAA53F,WAAA,IAEA,OADA43F,EAAAhvF,GAAA,CAAAyI,EAAA,GAAAA,EAAAhR,MAAA,EACAu3F,CACA,CA/BAt2F,EAAA4jF,gBAAwB,CAAAA,EAwCxB,IAAArrE,EAAA,IAAA7Z,WAAA,IAqBA4zF,EAAA,yGCjzCAxyF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA6jF,UAAkB,CAAG7jF,EAAA+jF,cAAsB,QAQ3C,IAAAxsB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BkyE,EAAsBlyE,EAAQ,OAC9B,SAAAyyF,EAAAC,CAAA,CAAAt5B,CAAA,EACA,GAAAs5B,EAAA9oC,QAAA,CACA,OAAA8oC,EAAA9oC,QAAA,CAEA,GAAA0K,EAAA6E,MAAA,iDAAiFC,UAAAA,CAAA,EACjF,CACA,eAAAu5B,EAAAD,CAAA,CAAA77B,CAAA,EACA,IAAAh4C,EAAA,GAAAqzD,EAAAoB,WAAA,EAAAzc,GAIA,GAHA,MAAAh4C,EAAA7a,EAAA,EACA6a,CAAAA,EAAA7a,EAAA,IAAAyvD,EAAA0c,cAAA,EAAAtxD,EAAA7a,EAAA,CAAA0uF,EAAA,EAEA7zE,MAAAA,EAAA7Y,IAAA,EACA,IAAAA,EAAA6Y,EAAA7Y,IAAA,CACA6Y,EAAA7Y,IAAA,CAAA4/C,QAAA6F,GAAA,EACAinC,EAAA1mC,UAAA,GACA,GAAAyH,EAAA0c,cAAA,EAAAnqE,EAAA0sF,GACA,EAAArsC,IAAA,GAAAj7C,EAAApF,EAAA,IACA,GAAAsuD,EAAAoB,cAAA,EAAAtqD,EAAAyC,WAAA,KAAA7H,EAAA6H,WAAA,yCAAA7H,GACAoF,GAEA,MAEAyT,EAAA7Y,IAAA,CAAA0sF,EAAA1mC,UAAA,GAEA,gBAAAsI,EAAAoiB,iBAAA,EAAA73D,EACA,CAOA,MAAAohE,EAIAr2B,QAAA,aAIAA,CAAA,EACA,GAAA0K,EAAA/B,gBAAA,QAAiD3I,SAAAA,GAAA,MACjD,CACA,MAAAgpC,SAAA/F,CAAA,EACA,OAAA4F,EAAA,4BAAAjD,mBAAA,YAAAxjC,UAAA,GAAA6gC,EACA,CACA,MAAAgG,aAAAh8B,CAAA,EAEA,OADA,MAAA87B,EAAA,KAAA97B,EAEA,CACA,MAAA4e,oBAAA5e,CAAA,EACA,IAAAjN,EAAA6oC,EAAA,4BACA5zE,EAAA,MAAA8zE,EAAA,KAAA97B,EACA,OAAAh4C,EAAAnT,KAAA,EACAmT,CAAAA,EAAAnT,KAAA,YAAAknF,QAAA,aAEA,MAAA/zE,EAAAi0E,QAAA,EACAj0E,CAAAA,EAAAi0E,QAAA,YAAAxgB,WAAA,CAAAzzD,EAAA,EAGA,IAAA+rE,EAAA,WAAAhhC,QAAA,CAAAujC,UAAA,GACA,GAAAtuE,MAAAA,EAAArT,OAAA,EACA,IAAAA,EAAA,GAAA8oD,EAAA2I,SAAA,EAAAp+C,EAAArT,OAAA,EACA,GAAA8oD,EAAAoB,cAAA,EAAAlqD,IAAAo/E,EAAAp/E,OAAA,6CAAAqrD,EAAArrD,OAAA,CACA,MAEAqT,EAAArT,OAAA,CAAAo/E,EAAAp/E,OAAA,CAGA,IAAAunF,EAAAl0E,MAAAA,EAAA8uE,YAAA,EAAA9uE,MAAAA,EAAA+uE,oBAAA,CAOA,GANA/uE,MAAAA,EAAA4uE,QAAA,EAAA5uE,CAAAA,IAAAA,EAAAhI,IAAA,EAAAk8E,CAAA,EACA,GAAAz+B,EAAAoB,cAAA,yDAAAmB,GAEAh4C,CAAAA,IAAAA,EAAAhI,IAAA,EAAAgI,IAAAA,EAAAhI,IAAA,GAAAk8E,GACA,GAAAz+B,EAAAoB,cAAA,sFAAAmB,GAEA,CAAAh4C,IAAAA,EAAAhI,IAAA,EAAAgI,MAAAA,EAAAhI,IAAA,GAAAgI,MAAAA,EAAA8uE,YAAA,EAAA9uE,MAAAA,EAAA+uE,oBAAA,CAEA/uE,EAAAhI,IAAA,QAEA,GAAAgI,IAAAA,EAAAhI,IAAA,EAAAgI,IAAAA,EAAAhI,IAAA,EAGA,IAAAi3E,EAAA,MAAAlkC,EAAA0jC,UAAA,GACA,GAAAh5B,EAAA6E,MAAA,EAAA20B,MAAAA,EAAAL,QAAA,8DACAr0B,UAAA,aACA,GAEA,MAAAv6C,EAAA4uE,QAAA,EACA5uE,CAAAA,EAAA4uE,QAAA,CAAAK,EAAAL,QAAA,CAEA,KACA,CAEA,IAAAK,EAAA,MAAAlkC,EAAA0jC,UAAA,GACA,GAAAzuE,MAAAA,EAAAhI,IAAA,EAEA,GAAAi3E,MAAAA,EAAAH,YAAA,EAAAG,MAAAA,EAAAF,oBAAA,EAIA,GADA/uE,EAAAhI,IAAA,GACAgI,MAAAA,EAAA4uE,QAAA,EAGA,IAAAA,EAAA5uE,EAAA4uE,QAAA,QACA5uE,EAAA4uE,QAAA,CACA5uE,EAAA8uE,YAAA,CAAAF,EACA5uE,EAAA+uE,oBAAA,CAAAH,CACA,MAGA,MAAA5uE,EAAA8uE,YAAA,EACA9uE,CAAAA,EAAA8uE,YAAA,CAAAG,EAAAH,YAAA,EAEA,MAAA9uE,EAAA+uE,oBAAA,EACA/uE,CAAAA,EAAA+uE,oBAAA,CAAAE,EAAAF,oBAAA,OAIAE,MAAAA,EAAAL,QAAA,EAGA,GAAAn5B,EAAA6E,MAAA,GAAA45B,EAAA,6DACA35B,UAAA,qBACA,GAEA,MAAAv6C,EAAA4uE,QAAA,EACA5uE,CAAAA,EAAA4uE,QAAA,CAAAK,EAAAL,QAAA,EAIA5uE,EAAAhI,IAAA,IAIA,GAAAy9C,EAAA6E,MAAA,kEACAC,UAAA,mBACA,OAGAv6C,CAAAA,IAAAA,EAAAhI,IAAA,EAAAgI,IAAAA,EAAAhI,IAAA,IAGA,MAAAgI,EAAA8uE,YAAA,EACA9uE,CAAAA,EAAA8uE,YAAA,CAAAG,EAAAH,YAAA,EAEA,MAAA9uE,EAAA+uE,oBAAA,EACA/uE,CAAAA,EAAA+uE,oBAAA,CAAAE,EAAAF,oBAAA,EAGA,CAGA,gBAAAt5B,EAAAoiB,iBAAA,EAAA73D,EACA,CACA,MAAAyzD,YAAAzb,CAAA,EACA,OAAA47B,EAAA,oBAAAngB,WAAA,YAAAugB,YAAA,CAAAh8B,GACA,CACA,MAAAtuD,KAAAsuD,CAAA,EACA,OAAA47B,EAAA,aAAAlqF,IAAA,YAAAsqF,YAAA,CAAAh8B,GACA,CACA,MAAA4Z,YAAA31E,CAAA,EACA,IAAA8uD,EAAA6oC,EAAA,oBACA,aAAA7oC,EAAA6mB,WAAA,CAAA31E,EACA,CACA,MAAA23E,gBAAA5b,CAAA,EACA,IAAAjN,EAAA6oC,EAAA,wBACA5zE,EAAA,WAAA42D,mBAAA,CAAA5e,EACA,QAAAh4C,EAAA7Y,IAAA,CACA,IAAAgtF,EAAA3+B,EAAAqtB,WAAA,CAAA17E,IAAA,CAAA6Y,GACA,aAAA+qC,EAAAgmC,oBAAA,YAAAqD,eAAA,CAAAD,GACA,CACA,CACA92F,EAAA+jF,cAAsB,CAAAA,CAStB,OAAAF,UAAAE,EAIA70E,OAAA,aAKAA,CAAA,CAAAw+C,CAAA,EACA,MAAAA,GACA,GAAA0K,EAAA/B,gBAAA,QAAiDnnD,QAAAA,CAAA,EACjD,CACA,MAAA4gD,YAAA,CAAyB,YAAA5gD,OAAA,CACzB4qE,QAAApsB,CAAA,EACA,WAAAm2B,EAAA,KAAA30E,OAAA,CAAAw+C,EACA,CACA,CAAAspC,CAAA,CAAA7wF,CAAA,CAAA+2D,CAAA,EACA,GAAA9E,EAAA6E,MAAA,+BAAgE92D,EAAO,2BAA8B+2D,UAAAA,CAAA,EACrG,CACA,MAAA65B,gBAAAp8B,CAAA,EACA,MAAAq8B,CAAA,kCACA,CACA,MAAAC,YAAAv+C,CAAA,EACA,MAAAs+C,CAAA,0BACA,CACA,MAAAE,cAAAjoF,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EACA,MAAA+2F,CAAA,8BACA,CACA,CACAh3F,EAAA6jF,UAAkB,CAAAA,mCC1NlB/jF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4lF,mBAA2B,QAE3B,IAAAuR,EAAA,IAAAp1B,GA2BA/hE,CAAAA,EAAA4lF,mBAA2B,CAlB3B,SAAAwR,CAAA,EACAD,EAAA7qC,GAAA,CAAA8qC,KAGAD,EAAA32F,GAAA,CAAA42F,GACAzpF,QAAAI,GAAA,+BACAJ,QAAAI,GAAA,8BAA6CqpF,EAAA,oCAAS,GACtDzpF,QAAAI,GAAA,KACAJ,QAAAI,GAAA,8EACAJ,QAAAI,GAAA,uEACAJ,QAAAI,GAAA,KACAJ,QAAAI,GAAA,4EACAJ,QAAAI,GAAA,2EACAJ,QAAAI,GAAA,kFACAJ,QAAAI,GAAA,KACAJ,QAAAI,GAAA,wDACAJ,QAAAI,GAAA,+BACA,sCCpCAjO,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAkkF,kBAA0B,QAC1B,IAAA3sB,EAAmBzzD,EAAQ,OAC3BuzF,EAA2BvzF,EAAQ,OACnCwzF,EAA8BxzF,EAAQ,OACtCyzF,EAAiCzzF,EAAQ,OACzC0zF,EAAiC1zF,EAAQ,OACzC2zF,EAAgC3zF,EAAQ,OACxC4zF,EAA6B5zF,EAAQ,OAErC6zF,EAAgC7zF,EAAQ,OACxC8zF,EAA+B9zF,EAAQ,OACvC+zF,EAA8B/zF,EAAQ,MACtCmpF,EAAqBnpF,EAAQ,OAC7Bg0F,EAAgCh0F,EAAQ,OAKxCi0F,EAAA,sFAAAz2F,KAAA,KA0KAtB,CAAAA,EAAAkkF,kBAA0B,CA7H1B,SAAAwK,CAAA,CAAA3pD,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,IAEA,IAAAizD,EAAA,GACA,MAAAjzD,CAAA,CAAAnmC,EAAA,GAGA,iBAAAmmC,EAAAkzD,SAAA,CACAr5F,IAAAmmC,EAAAkzD,SAAA,EAEApuF,MAAA8J,OAAA,CAAAoxB,EAAAkzD,SAAA,GACAlzD,KAAAA,EAAAkzD,SAAA,CAAA/pE,OAAA,CAAAtvB,IAIA,oBAAA8vF,GAAAA,EAAAz2D,KAAA,aACA,WAAA4/D,EAAApU,eAAA,CAAAiL,GAEA,oBAAAA,GAAAA,EAAAz2D,KAAA,YAnEAh4B,GAAA,mBAAAA,EAAA25E,IAAA,EACA,mBAAA35E,EAAAi4F,KAAA,CAmEA,WAAAJ,EAAAnV,iBAAA,CAAA+L,GAGA,IAAAyJ,EAAA,KACA,IACAA,EAAAlL,EAAAxK,OAAA,CAAA34E,IAAA,CAAA4kF,EACA,CACA,MAAA9gF,EAAA,EACA,IAAAwqF,EAAA,GASA,GARAJ,EAAA,kBAAAG,IACAA,UAAAA,EAAAv5F,IAAA,CACAw5F,EAAAtzF,IAAA,KAAA+yF,EAAApU,eAAA,4BAAA0U,EAAA,CAAmHA,cAAAA,CAAA,IAEnH,eAAAA,EAAAv5F,IAAA,EACAw5F,EAAAtzF,IAAA,KAAA+yF,EAAApU,eAAA,wCAAA0U,EAAA,CAA+HA,cAAAA,CAAA,KAG/HH,EAAA,WACA,IACAI,EAAAtzF,IAAA,KAAAwyF,EAAAhU,eAAA,CAAAoL,EAAA3pD,EAAAszD,OAAA,EACA,CACA,MAAAzqF,EAAA,EAEA,GAAAoqF,EAAA,SAAAjzD,MAAAA,EAAAuzD,IAAA,CACA,IACAF,EAAAtzF,IAAA,KAAAuyF,EAAAhU,YAAA,CAAAqL,EAAA3pD,EAAAuzD,IAAA,EACA,CACA,MAAA1qF,EAAA,EAEA,GAAAoqF,EAAA,cACA,IACAI,EAAAtzF,IAAA,KAAAyyF,EAAAnU,kBAAA,CAAAsL,EAAA3pD,EAAAwzD,UAAA,EACA,CACA,MAAA3qF,EAAA,EAEA,GAAAoqF,EAAA,cACA,IACAI,EAAAtzF,IAAA,KAAA0yF,EAAArU,kBAAA,CAAAuL,GACA,CACA,MAAA9gF,EAAA,EAEA,GAAAoqF,EAAA,aACA,IACAI,EAAAtzF,IAAA,KAAA2yF,EAAAvU,iBAAA,CAAAwL,EAAA3pD,EAAAyzD,SAAA,EACA,CACA,MAAA5qF,EAAA,EAEA,GAAAoqF,EAAA,UACA,IACA,IACAS,EADAC,EAAA3zD,EAAA4zD,MAAA,CAEA,iBAAAD,IACAD,EAAAC,EAAAD,aAAA,CACAC,EAAAA,EAAAA,SAAA,EAEAN,EAAAtzF,IAAA,KAAA4yF,EAAAzU,cAAA,CAAAyL,EAAAgK,EAAAD,GACA,CACA,MAAA7qF,EAAA,EAiBA,GAAAoqF,EAAA,aACA,IACA,IAAAl0B,EAAA/+B,EAAA6zD,SAAA,CACAR,EAAAtzF,IAAA,KAAA6yF,EAAA7U,iBAAA,CAAA4L,EAAA5qB,GACA,CACA,MAAAl2D,EAAA,EAMA,GAJA,GAAA2pD,EAAA0F,MAAA,EAAAm7B,EAAAr5F,MAAA,wDACAm+D,UAAA,oBACA,GAEAk7B,IAAAA,EAAAr5F,MAAA,CACA,OAAAq5F,CAAA,IAIA,IAAAS,EAAA3xF,KAAAuC,KAAA,CAAA2uF,EAAAr5F,MAAA,IAaA,OAZA85F,EAAA,GACAA,CAAAA,EAAA,GAIAV,GAAAJ,KAAAA,EAAA7pE,OAAA,CAAAiqE,EAAAv5F,IAAA,GACAi6F,CAAAA,EAAA,GAGA9zD,GAAAA,EAAA8zD,MAAA,EACAA,CAAAA,EAAA9zD,EAAA8zD,MAAA,EAEA,IAAAjB,EAAAjU,gBAAA,CAAAyU,EAAAp1F,KAAAA,EAAA,CAA+E61F,OAAAA,CAAA,EAC/E,sCCtLA/4F,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0iF,WAAmB,CAAG1iF,EAAA84F,4BAAoC,CAAG94F,EAAAkmF,uBAA+B,QAC5F,IAAA3uB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BykF,EAAmBzkF,EAAQ,OAG3B,SAAAi1F,EAAAp1B,CAAA,EAUA,OATAA,EAAA1rC,KAAA,sBACA0rC,EAAAA,EAAAlD,SAAA,KAEAkD,EAAA1rC,KAAA,gBACA0rC,EAAAA,EAAAlD,SAAA,IAGA,GAAA8nB,EAAA/uB,cAAA,sCAAAmK,GAEA,gCAA4CA,EAAK,EAOjD,MAAAuiB,EAIAtnF,IAAA,aAIAA,CAAA,EACA,GAAA2pF,EAAAlyB,gBAAA,QAAiDz3D,KAAAA,CAAA,EACjD,CACAk7E,QAAAkf,CAAA,EACA,YAKAC,iBAAAC,CAAA,EACA,QACA,CAIA,MAAAC,cAAAD,CAAA,CAAAhqF,CAAA,EACA,+BACA,CAIA,MAAAkqF,cAAAF,CAAA,CAAApyF,CAAA,EACA,+BACA,CACA,CACA9G,EAAAkmF,uBAA+B,CAAAA,CAO/B,OAAA4S,UAAA5S,EAIAvnF,aAAA,CACA,MAXA,6CAYA,CACA,CACAqB,EAAA84F,4BAAoC,CAAAA,EACpC,IAAAO,EAAA,8BACAC,EAAA,CACA,+BACA,4BACAD,EACA,+CACA,OAKA3W,EAIAh1B,QAAA,CAIAx+C,OAAA,CAIAtQ,IAAA,EAEA26F,CAAA,EACAjlB,CAAA,aACA5mB,CAAA,CAAAx+C,CAAA,CAAAtQ,CAAA,EACA,GAAA2pF,EAAAlyB,gBAAA,QAAiD3I,SAAAA,EAAAx+C,QAAAA,EAAAtQ,KAAAA,CAAA,GACjD,MAAA26F,CAAA,MACA,MAAAjlB,CAAA,KAAAlc,EAAAnH,QAAA,CAAA/hD,EAAA,CACA,yDACA,sDACA,gDACA,oDACA,uDACA,qDACA,CAAAw+C,EACA,CAIA,MAAA8rC,kBAAA,CAkBA,OAjBA,YAAAD,CAAA,EACA,OAAAA,CAAA,YACA,IACA,mBAAAjlB,CAAA,CAAAmlB,iBAAA,cACA,CACA,MAAA7rF,EAAA,CAGA,MAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,kBACA,QAIA,OADA,MAAA2rF,CAAA,MACA3rF,CACA,CACA,IAAa,EAEb,YAAA2rF,CAAA,CAEA,OAAAG,CAAA,CAAA/7E,CAAA,CAAAmwC,CAAA,EACAA,EAAA,CAAAA,GAAA,IAAAh+C,KAAA,GACA,IAAAqpE,EAAA,MAAA7E,CAAA,CAAAwC,SAAA,CAEAhpB,EAAAi+B,OAAA,IAAAzD,EAAA7D,QAAA,OAAA7lF,IAAA,GACA,IAAAi0D,EAAA,IACA,YAAA2mC,gBAAA,KACA3mC,EAAAsmB,EAAA/P,WAAA,CAAAzrD,GACA,GAAA4qE,EAAAtrB,MAAA,EAAApK,EAAA,oCACA2L,KAAA,CAAwB7gD,SAAAA,CAAA,CACxB,GACAmwC,EAAA,CACA,GAAAw6B,EAAA9D,SAAA,OAAA5lF,IAAA,MACAu6E,EAAAlO,kBAAA,CAAApY,EAAA/E,GACA,CACAnwC,EAAA,wBAEAmwC,EAAAhpD,IAAA,EACAktF,eAAA,EACA,GACA,IACA,IAAAjiF,EAAA,YAAAukE,CAAA,CAAA32D,EAAA,IAAAmwC,GACA,GAAA+E,EACA,OAAAsmB,EAAAjO,oBAAA,CAAArY,EAAA9iD,EAAA,IAEA,OAAAA,CACA,CACA,MAAAnC,EAAA,CACA,OAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,kBACA,MAAAA,CAEA,CACA,WACA,CAKA,MAAAkiD,WAAAopC,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,IAEAA,KAAAA,EACA,IACA,IAAAnpF,EAAA,YAAA2pF,CAAA,kBAEA,GAAA3pF,MAAAA,GAAAA,IAAAooD,EAAA8c,WAAA,CACA,YAEA,OAAAllE,CACA,CACA,MAAAnC,EAAA,CACA,MAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,kBACA,WAEA,OAAAA,CACA,CAGA,GAAAsrF,GAAA,GAAAA,EAAA,YACA,IAAAS,EAAAT,EAAA,WACApyF,EAAA,YAAA4yF,CAAA,uBAAAC,EAAA,EACA,MAAApR,EAAAjf,WAAA,EAAAxiE,EAAA,IACA,SAAAywD,EAAAzH,UAAA,EAAAhpD,EAEA,CACA,IAAA8yF,EAAA,KACA,QAAA/K,KAAA,KAAAnhC,QAAA,CAAAsgC,OAAA,CACA,GAAAa,aAAA3I,GAGA2I,EAAAoK,gBAAA,CAAAC,GAAA,CACAU,EAAA/K,EACA,KACA,CAEA,GAAA+K,MAAAA,EACA,YAGA,IAAA9yF,EAAA,YAAA4yF,CAAA,uBAAAR,EAAA,EAEA,GAAApyF,MAAAA,GAAAA,OAAAA,EACA,YAGA,IAAAoI,EAAA,MAAA0qF,EAAAR,aAAA,CAAAF,EAAApyF,GACA,GAAAoI,MAAAA,EACA,OAAAA,EAEA,GAAAq5E,EAAAtrB,MAAA,kDACAC,UAAA,cAAqCg8B,EAAS,GAC9C16B,KAAA,CAAoB06B,SAAAA,EAAApyF,KAAAA,CAAA,CACpB,EACA,CAKA,MAAA+yF,QAAAxpF,CAAA,EACA,IAAAvJ,EAAA,YAAA4yF,CAAA,yBAAArpF,EAAA,SACA,MAAAvJ,GAAAA,OAAAA,EACA,KAEAA,CACA,CAIA,MAAAgzF,gBAAA,CAEA,IAAAhzF,EAAA,YAAA4yF,CAAA,yBAEA,GAAA5yF,MAAAA,GAAAA,OAAAA,EACA,YAGA,IAAAizF,EAAAjzF,EAAAmxB,KAAA,6EACA,GAAA8hE,EAAA,CACA,IAAAvrF,EAAA,aAAAurF,CAAA,kBACAh7F,EAAA8S,SAAAkoF,CAAA,QACA,GAAAA,CAAA,IAAAh7F,MAAA,GAAAA,EAAAA,EACA,SAA0ByP,EAAO,KAAM,GAAA+5E,EAAAjD,YAAA,OAAAyU,CAAA,KAA6C,EAIpF,IAAAC,EAAAlzF,EAAAmxB,KAAA,kCACA,GAAA+hE,GAAAA,KAAAA,CAAA,IAAAj7F,MAAA,CACA,eAA6Bi7F,CAAA,IAAS,EAEtC,GAAAzR,EAAAtrB,MAAA,yEACAC,UAAA,mBACAsB,KAAA,CAAoB13D,KAAAA,CAAA,CACpB,EACA,CASA,MAAAutF,WAAA,CAEA,MAAA4F,CADA,WAAAC,UAAA,IACA3K,GAAA,CAUA,MAAA2K,YAAA,CACA,IAAAC,EAAA,EAA2Bx/E,KAAA,OAAA1a,MAAA,KAAArB,IAAA,EAAgC,CAC3D,IAGA,IAAAq7F,EAAA,WAAAJ,OAAA,WACA,GAAAI,MAAAA,EAEA,OADAE,EAAAr1F,IAAA,EAA+B6V,KAAA,UAAA1a,MAAA,KAC/B,CAAyBsvF,IAAA,KAAA4K,QAAAA,CAAA,EAEzBA,EAAAr1F,IAAA,EAA2B6V,KAAA,SAAA1a,MAAAg6F,CAAA,GAC3B,QAAAh4F,EAAA,EAA4BA,EAAAq3F,EAAAv6F,MAAA,CAAqBkD,IAAA,CACjD,IAAAg2B,EAAAgiE,EAAAhiE,KAAA,CAAAqhE,CAAA,CAAAr3F,EAAA,EACA,GAAAg2B,MAAAA,EACA,SAEA,IAAAzpB,EAAAypB,CAAA,IAAAtmB,WAAA,GACA,OAAAnD,GACA,YACA,WAEA,OADA2rF,EAAAr1F,IAAA,EAAuC6V,KAAA,MAAA1a,MAAAg6F,CAAA,GACvC,CAAiCE,QAAAA,EAAA5K,IAAA0K,CAAA,CACjC,aACA,IAAA1K,EAAAwJ,EAAAkB,GAGA,OAFAE,EAAAr1F,IAAA,EAAuC6V,KAAA,OAAA1a,MAAAg6F,CAAA,GACvCE,EAAAr1F,IAAA,EAAuC6V,KAAA,MAAA1a,MAAAsvF,CAAA,GACvC,CAAiC4K,QAAAA,EAAA5K,IAAAA,CAAA,CACjC,CACA,aACA,eAEA,IAAAxoB,EAAA,WAAAv4D,EAAA,mCACA2rF,EAAAr1F,IAAA,EAAuC6V,KAAAnM,EAAAvO,MAAAg6F,CAAA,GAEvC,IAAAG,EAAA,WAAAtqC,UAAA,GACA,GAAAsqC,MAAAA,EAEA,OADAD,EAAAr1F,IAAA,EAA2C6V,KAAA,SAAA1a,MAAA,KAC3C,CAAqCsvF,IAAA,KAAA4K,QAAAA,CAAA,EAErC,IAAA/zB,EAAA,CAAAnuC,CAAA,SAAA32B,KAAA,MACA,GAAA8kE,IAAAA,EAAArnE,MAAA,CAEA,OADAo7F,EAAAr1F,IAAA,EAA2C6V,KAAA,IAAUnM,EAAO,MAAAvO,MAAAg4B,CAAA,UAC5D,CAAqCs3D,IAAA,KAAA4K,QAAAA,CAAA,EAErC,IAAAE,EAAAj0B,CAAA,IACAsQ,EAAA,IAAAte,EAAAnH,QAAA,CAAAmV,CAAA,KAEA,gDACA,gDAEA,2CACA,2DACA,MAAA1Y,QAAA,EAEA,GAAAl/C,WAAAA,EAAA,CACA,IAAA8rF,EAAA,MAAA5jB,EAAA6jB,OAAA,CAAAF,GACA,GAAAD,IAAAE,EAEA,OADAH,EAAAr1F,IAAA,EAA+C6V,KAAA,SAAA1a,MAAAq6F,CAAA,GAC/C,CAAyC/K,IAAA,KAAA4K,QAAAA,CAAA,EAEzCA,EAAAr1F,IAAA,EAA2C6V,KAAA,QAAA1a,MAAAq6F,CAAA,EAC3C,MACA,GAAA9rF,YAAAA,EAAA,CACA,IAAAgsF,EAAA,MAAA9jB,EAAA+jB,SAAA,CAAAL,EAAAC,GACA,IAAAG,EAEA,OADAL,EAAAr1F,IAAA,EAA+C6V,KAAA,WAAA1a,MAAA,MAC/C,CAAyCsvF,IAAA,KAAA4K,QAAAA,CAAA,EAEzCA,EAAAr1F,IAAA,EAA2C6V,KAAA,UAAA1a,MAAAu6F,EAAAxwF,QAAA,IAC3C,CAEA,IAAA0wF,EAAA,MAAAhkB,CAAA,CAAA3P,EAAA,CAAAszB,GACA,GAAAK,MAAAA,GAAAA,OAAAA,EAEA,OADAP,EAAAr1F,IAAA,EAA2C6V,KAAA,gBAAA1a,MAAA,KAC3C,CAAqCsvF,IAAA,KAAA4K,QAAAA,CAAA,EAErCA,EAAAr1F,IAAA,EAAuC6V,KAAA,oBAAA1a,MAAAy6F,CAAA,GAEvC,YAAAlsF,IACAksF,EAAAA,EAAA9oF,OAAA,QAAmE,GAAA22E,EAAAhpB,OAAA,EAAA86B,EAAA,IAAA55B,SAAA,KACnE05B,EAAAr1F,IAAA,EAA2C6V,KAAA,wBAAA1a,MAAAy6F,CAAA,IAG3CA,EAAAziE,KAAA,aACAyiE,CAAAA,EAAA3B,EAAA2B,EAAA,EAEAP,EAAAr1F,IAAA,EAAuC6V,KAAA,eAAA1a,MAAAy6F,CAAA,GAEvC,IAAArxC,EAAA,GACAsxC,EAAA,UAAApS,EAAAvD,YAAA,CAAA0V,GAAA9gB,IAAA,GACA+gB,EAAAC,QAAA,GACA,IACAvxC,EAAAsxC,EAAA/K,QAAA,CAEA,MAAAhiF,EAAA,CACA,IACAusF,EAAAr1F,IAAA,EAA+C6V,KAAA,YAAA1a,MAAA06F,EAAAE,QAAA,EAC/C,CACA,MAAAjtF,EAAA,CACA,IAAA/O,EAAA87F,EAAAtwC,IAAA,CACAxrD,GACAs7F,EAAAr1F,IAAA,EAAmD6V,KAAA,YAAA1a,MAAA,GAAAsoF,EAAAvtB,OAAA,EAAAn8D,EAAA,EAGnD,CACA,OAAqC0wF,IAAA,KAAA4K,QAAAA,CAAA,CACrC,CACA,IAAA9wC,EAEA,OADA8wC,EAAAr1F,IAAA,EAA2C6V,KAAA,YAAA1a,MAAA,KAC3C,CAAqCsvF,IAAA,KAAA4K,QAAAA,CAAA,EAErCA,EAAAr1F,IAAA,EAAuC6V,KAAA,WAAA1a,MAAAiQ,KAAAC,SAAA,CAAAk5C,EAAA,GAEvC,IAAAyxC,EAAAzxC,EAAA0xC,KAAA,CACA,oBAAAD,EAEA,OADAX,EAAAr1F,IAAA,EAA2C6V,KAAA,YAAA1a,MAAA,KAC3C,CAAqCsvF,IAAA,KAAA4K,QAAAA,CAAA,EAErC,GAAAW,EAAA7iE,KAAA,8BAGA,CAEA,IAAA8hE,EAAAe,EAAA7iE,KAAA,CAAAohE,GACA,GAAAU,MAAAA,EAEA,OADAI,EAAAr1F,IAAA,EAA+C6V,KAAA,iBAAA1a,MAAA66F,CAAA,GAC/C,CAAyCvL,IAAA,KAAA4K,QAAAA,CAAA,EAEzCA,EAAAr1F,IAAA,EAA2C6V,KAAA,gBAAA1a,MAAA66F,CAAA,GAC3CA,EAAA/B,EAAA+B,EACA,CAEA,OADAX,EAAAr1F,IAAA,EAAuC6V,KAAA,MAAA1a,MAAA66F,CAAA,GACvC,CAAiCX,QAAAA,EAAA5K,IAAAuL,CAAA,CACjC,CACA,CACA,CACA,CACA,MAAAltF,EAAA,EACA,OAAiBusF,QAAAA,EAAA5K,IAAA,KACjB,CACA,aAAAiF,cAAA9mC,CAAA,EACA,IAAAghC,EAAA,MAAAhhC,EAAAujC,UAAA,GACA+J,EAAAtM,EAAAI,SAAA,mCAKA,MAHA,GAAAvG,EAAAtrB,MAAA,EAAA+9B,EAAA,wDACA99B,UAAA,gBAAAsB,KAAA,CAAgDkwB,QAAAA,CAAA,CAChD,GACAsM,EAAA9rF,OAAA,CAEA,cAAAsnE,EAAA,CAAA9oB,CAAA,CAAA9uD,CAAA,EACA,IAAA21F,EAAA,MAAA7R,EAAA8R,aAAA,CAAA9mC,GACA,IACA,IAAAgpB,EAAA,IAAAte,EAAAnH,QAAA,CAAAsjC,EAAA,CACA,oDACA,CAAA7mC,GACAO,EAAA,MAAAyoB,EAAApC,QAAA,IAAAgU,EAAA7D,QAAA,EAAA7lF,GAAA,CACAozF,eAAA,EACA,GACA,GAAA/jC,IAAAkK,EAAA8c,WAAA,CACA,YAEA,OAAAhnB,CACA,CACA,MAAArgD,EAAA,CAGA,MAAAA,CACA,CACA,WACA,CAKA,aAAAwmF,SAAA1mC,CAAA,CAAA9uD,CAAA,EACA,IAAAq8F,EAAAr8F,EACA,QACA,QAAAq8F,GAAAA,MAAAA,GAKAr8F,QAAAA,GAAAq8F,QAAAA,EAJA,YAQA,IAAAhtC,EAAA,MAAAy0B,EAAA,CAAAlM,EAAA,CAAA9oB,EAAAutC,GAEA,GAAAhtC,MAAAA,EAAA,CACA,IAAAqmB,EAAA,IAAAoO,EAAAh1B,EAAAO,EAAArvD,GAEA,GAAAq8F,IAAAr8F,GAAA,OAAA01E,EAAAklB,gBAAA,GACA,YAEA,OAAAllB,CACA,CAEA2mB,EAAAA,EAAA35F,KAAA,MAAAwO,KAAA,IAAAs9C,IAAA,KACA,CACA,CACA,CACAptD,EAAA0iF,WAAmB,CAAAA,sCCnfnB5iF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqwF,yBAAiC,CAAGrwF,EAAAmwF,wBAAgC,CAAGnwF,EAAAk7F,gBAAwB,CAAGl7F,EAAA+vF,WAAmB,CAAG/vF,EAAAiwF,SAAiB,CAAGjwF,EAAAm7F,aAAqB,CAAGn7F,EAAAo7F,UAAkB,CAAGp7F,EAAAq7F,UAAkB,CAAGr7F,EAAAs7F,aAAqB,CAAGt7F,EAAAstC,MAAc,CAAGttC,EAAAu7F,OAAe,CAAGv7F,EAAAw7F,SAAiB,QAI1R,IAAAjkC,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3B68D,EAAAl/D,OAAA,GACA,SAAA+5F,EAAA51B,CAAA,CAAA61B,CAAA,EACA,gBAAAx7F,CAAA,SACA,MAAAA,EACAw7F,EAEA71B,EAAA3lE,EACA,CACA,CAEA,SAAAs7F,EAAA31B,CAAA,CAAA41B,CAAA,EACA,WACA,GAAAA,GAAA1wF,MAAAA,EACA,YAEA,IAAAjB,MAAA8J,OAAA,CAAA7I,GACA,4BAEA,OAAAA,EAAAuP,GAAA,IAAAurD,EAAA3jE,GACA,CACA,CAKA,SAAAqrC,EAAAs4B,CAAA,CAAA81B,CAAA,EACA,WACA,IAAA3rF,EAAA,GACA,QAAAM,KAAAu1D,EAAA,CACA,IAAA+1B,EAAAtrF,EACA,GAAAqrF,GAAArrF,KAAAqrF,GAAA,CAAAC,CAAAA,KAAA17F,CAAA,EACA,SAAA27F,KAAAF,CAAA,CAAArrF,EAAA,CACA,GAAAurF,KAAA37F,EAAA,CACA07F,EAAAC,EACA,KACA,CACA,CAEA,IACA,IAAAryD,EAAAq8B,CAAA,CAAAv1D,EAAA,CAAApQ,CAAA,CAAA07F,EAAA,CACA34F,MAAAA,IAAAumC,GACAx5B,CAAAA,CAAA,CAAAM,EAAA,CAAAk5B,CAAA,CAEA,CACA,MAAA37B,EAAA,CACA,IAAA8qC,EAAA,aAAApK,MAAA1gC,EAAA8qC,OAAA,gBACA,GAAA4vC,EAAArrB,MAAA,gCAAyE5sD,EAAA,EAAK,EAAGqoC,EAAQ,eAAkBz4C,MAAAA,CAAA,EAC3G,CACA,CACA,OAAA8P,CACA,CACA,CAEA,SAAAurF,EAAAr7F,CAAA,EACA,OAAAA,GACA,OACA,WACA,QACA,QACA,YACA,QACA,CACA,GAAAqoF,EAAA9uB,cAAA,uBAA4D,EAAEtpD,KAAAC,SAAA,CAAAlQ,GAAsB,UAAAA,EACpF,CAEA,SAAAo7F,EAAAp7F,CAAA,EAEA,MADA,GAAAqoF,EAAA9uB,cAAA,KAAA8uB,EAAAhf,WAAA,EAAArpE,EAAA,2BAAAA,GACAA,CACA,CAEA,SAAAm7F,EAAAn7F,CAAA,EAEA,MADA,GAAAqoF,EAAA9uB,cAAA,KAAA8uB,EAAAhf,WAAA,EAAArpE,EAAA,2BAAAA,GACAA,CACA,CAhEAD,EAAAw7F,SAAiB,CAAAA,EAYjBx7F,EAAAu7F,OAAe,CAAAA,EA+Bfv7F,EAAAstC,MAAc,CAAAA,EAYdttC,EAAAs7F,aAAqB,CAAAA,EAKrBt7F,EAAAq7F,UAAkB,CAAAA,EAKlBr7F,EAAAo7F,UAAkB,CAAAA,EAOlBp7F,EAAAm7F,aAAqB,CANrB,SAAAl7F,CAAA,EACA,OAAAqoF,EAAAhf,WAAA,EAAArpE,GACA,+BAEA,SAAAqoF,EAAAzc,YAAA,EAAA5rE,EAAA,GACA,EAEA,IAAA47F,EAAAvuD,EAAA,CACAp+B,QAAAqoD,EAAAzH,UAAA,CACA+gC,UAAAuK,EACA5K,YAAAlI,EAAA1rB,SAAA,CACA91D,KAAAu0F,EACA/gF,MAAAguE,EAAA1rB,SAAA,CACAq5B,QAAAuF,EAAAF,EAAA,IACA5vB,OAAA6vB,EAAAH,GACAU,gBAAAV,EACAW,iBAAAzT,EAAA1rB,SAAA,EACC,CACDtiD,MAAA,cAKAta,CAAAA,EAAAiwF,SAAiB,CAHjB,SAAAhwF,CAAA,EACA,OAAA47F,EAAA57F,EACA,EAEA,IAAA+7F,EAAA1uD,EAAA,CACAruC,KAAAu8F,EAAAJ,GACAa,WAAAb,EACAc,sBAAAV,EAAAJ,EAAA,MACAl9F,OAAAoqF,EAAA1rB,SAAA,CACAu/B,UAAA7T,EAAA1rB,SAAA,CACAptD,MAAAgsF,EAAAH,GACAe,WAAA9T,EAAAvnB,SAAA,CACA61B,SAAAtO,EAAAvnB,SAAA,CACAs7B,QAAA/T,EAAAvnB,SAAA,CACAu7B,UAAAd,EAAAJ,EAAA,MACAmB,aAAAf,EAAAJ,EAAA,MACAoB,YAAAhB,EAAAlT,EAAAvnB,SAAA,OACA07B,cAAAjB,EAAAlT,EAAAvnB,SAAA,OACA27B,MAAAlB,EAAAjkC,EAAAzH,UAAA,EACA6sC,WAAAnB,EAAAJ,EAAA,MACAhJ,UAAAiJ,EACA1J,cAAA6J,EAAAlT,EAAAvnB,SAAA,CACA,EAAC,CACD47B,WAAA,aAYA38F,CAAAA,EAAA+vF,WAAmB,CAVnB,SAAA9vF,CAAA,EACA,IAAA8P,EAAAisF,EAAA/7F,GAOA,OANA8P,EAAA6sF,YAAA,CAAA38F,EAAA28F,YAAA,CAAAviF,GAAA,IACA,iBAAAsgD,EACAA,EAEA01B,EAAA11B,IAEA5qD,CACA,EAEA,IAAA8sF,EAAAvvD,EAAA,CACAyuD,iBAAAzT,EAAA1rB,SAAA,CACA4zB,YAAAlI,EAAA1rB,SAAA,CACAk/B,gBAAAV,EACAlsF,QAAAqoD,EAAAzH,UAAA,CACA4b,OAAA6vB,EAAAH,GACAt0F,KAAAu0F,EACA/gF,MAAAguE,EAAA1rB,SAAA,CACAi0B,UAAAuK,CACA,EAAC,CACD9gF,MAAA,eAEA,SAAA4gF,EAAAj7F,CAAA,EACA,OAAA48F,EAAA58F,EACA,CACAD,EAAAk7F,gBAAwB,CAAAA,EACxB,IAAA4B,EAAAxvD,EAAA,CACAxlC,GAAA0zF,EAAAjkC,EAAAzH,UAAA,OACAhmD,KAAA0xF,EAAAjkC,EAAAzH,UAAA,OACAitC,gBAAAvB,EAAAjkC,EAAAzH,UAAA,OAEAx1C,MAAAguE,EAAA1rB,SAAA,CACAhhC,KAAA4/D,EAAAlT,EAAAttB,OAAA,EACAqhC,QAAA/T,EAAAvnB,SAAA,CACAy7B,YAAAhB,EAAAlT,EAAAvnB,SAAA,OACAi8B,UAAAxB,EAAAH,GACAxK,UAAAuK,EACAn8F,KAAAm8F,EACA9e,KAAAif,EAAAL,GACA1K,YAAAlI,EAAA1rB,SAAA,CAEAqgC,kBAAA3U,EAAAvnB,SAAA,CACAizB,kBAAAwH,EAAAlT,EAAAvnB,SAAA,EACAm8B,aAAA1B,EAAAlT,EAAAvnB,SAAA,OACAo8B,OAAA3B,EAAAlT,EAAA1rB,SAAA,EACAjiD,KAAA6gF,EAAAlT,EAAA1rB,SAAA,GACA,EAAC,CACDo3B,kBAAA,aACA/0F,KAAA,oBACAqb,MAAA,uBAMA,SAAA+1E,EAAApwF,CAAA,EAGAA,EAAA6H,EAAA,KAAAwgF,EAAAvnB,SAAA,EAAA9gE,EAAA6H,EAAA,IAAA64D,GACA1gE,CAAAA,EAAA6H,EAAA,+CAEA,IAAAiI,EAAAu9B,EAAA,CACAruC,KAAAm8F,EAEA9gF,MAAAkhF,EAAAlT,EAAA1rB,SAAA,CAAA55D,KAAAA,GACA2X,KAAA,GACA,OAAA1a,GAAAA,MAAAA,EACA,EAEA,GAAAqoF,EAAA1rB,SAAA,EAAA38D,GAEAm9F,WAAA5B,EAAApjC,EAAAutB,aAAA,OACA0X,oBAAA7B,EAAAD,EAAAH,EAAA,UACAvK,UAAA2K,EAAAJ,EAAA,MACA5K,YAAAgL,EAAAlT,EAAA1rB,SAAA,OACAm/B,iBAAAP,EAAAlT,EAAA1rB,SAAA,OACA9yD,KAAAytD,EAAAzH,UAAA,CAEAyhC,SAAAiK,EAAAlT,EAAAvnB,SAAA,EACA2wB,qBAAA8J,EAAAlT,EAAAvnB,SAAA,EACA0wB,aAAA+J,EAAAlT,EAAAvnB,SAAA,EACAu8B,iBAAA9B,EAAAlT,EAAAvnB,SAAA,OACA61B,SAAAtO,EAAAvnB,SAAA,CACAj5D,GAAA0zF,EAAAjkC,EAAAzH,UAAA,OACA7vD,MAAAqoF,EAAAvnB,SAAA,CACAvxD,MAAA84E,EAAA1rB,SAAA,CACA91D,KAAAu0F,EACAkC,QAAA/B,EAAAjkC,EAAAzH,UAAA,OACAxgD,QAAAksF,EAAAlT,EAAAvnB,SAAA,MACA,EAAK,CACLj6D,KAAA,UACA8vF,SAAA,QACAt8E,MAAA,uBACKra,GAkBL,GAhBA,MAAA8P,EAAAjI,EAAA,EAAAiI,MAAAA,EAAAwtF,OAAA,EACAxtF,CAAAA,EAAAwtF,OAAA,IAAAhmC,EAAAkd,gBAAA,EAAA1kE,EAAA,EAIA9P,CAAAA,IAAAA,EAAA0a,IAAA,EAAA1a,IAAAA,EAAA0a,IAAA,GAAA1a,MAAAA,EAAAm9F,UAAA,EACArtF,CAAAA,EAAAqtF,UAAA,KAGAn9F,EAAAo4C,SAAA,CACAtoC,EAAAsoC,SAAA,CAAA8f,EAAAziB,SAAA,CAAA5rC,IAAA,CAAA7J,EAAAo4C,SAAA,EAGAtoC,EAAAsoC,SAAA,CAAA8f,EAAAziB,SAAA,CAAA5rC,IAAA,CAAA7J,GAGA8P,MAAAA,EAAAT,OAAA,EACA,IAAAA,EAAAS,EAAAsoC,SAAA,CAAAwoC,aAAA,OACAvxE,GACAS,CAAAA,EAAAT,OAAA,CAAAA,CAAA,CAEA,CAuCA,OAHAS,EAAA8gF,SAAA,KAAAvI,EAAAvnB,SAAA,EAAAhxD,EAAA8gF,SAAA,IAAAlwB,GACA5wD,CAAAA,EAAA8gF,SAAA,OAEA9gF,CACA,CAtGA/P,EAAAmwF,wBAAgC,CAHhC,SAAAlwF,CAAA,EACA,OAAA68F,EAAA78F,EACA,EAwGAD,EAAAqwF,yBAAiC,CAAAA,sCCpRjCvwF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAgmF,qBAA6B,CAAGhmF,EAAA+lF,uBAA+B,CAAG/lF,EAAAimF,qBAA6B,CAAGjmF,EAAA8lF,gBAAwB,CAAG9lF,EAAA2iF,iBAAyB,CAAG3iF,EAAA4iF,cAAsB,CAAG5iF,EAAA6iF,iBAAyB,CAAG7iF,EAAA8iF,iBAAyB,CAAG9iF,EAAA+iF,cAAsB,CAAG/iF,EAAAgjF,uBAA+B,CAAGhjF,EAAAijF,cAAsB,CAAGjjF,EAAAumF,eAAuB,CAAGvmF,EAAAkjF,iBAAyB,CAAGljF,EAAAojF,kBAA0B,CAAGpjF,EAAAmjF,kBAA0B,CAAGnjF,EAAAqjF,YAAoB,CAAGrjF,EAAAsjF,eAAuB,CAAGtjF,EAAAujF,eAAuB,CAAGvjF,EAAAwjF,aAAqB,CAAGxjF,EAAAyjF,eAAuB,CAAGzjF,EAAA0jF,kBAA0B,CAAG1jF,EAAA2jF,gBAAwB,CAAG3jF,EAAAo3E,WAAmB,CAAGp3E,EAAAu8E,mBAA2B,CAAGv8E,EAAAq8E,kBAA0B,CAAGr8E,EAAAk7E,GAAW,CAAGl7E,EAAAgkF,OAAe,CAAGhkF,EAAAikF,KAAa,CAAGjkF,EAAAqmF,4BAAoC,CAAGrmF,EAAAsmF,oBAA4B,CAAGtmF,EAAAwiF,SAAiB,CAAGxiF,EAAAomF,aAAqB,CAAGpmF,EAAAmmF,aAAqB,CAAGnmF,EAAA8jF,YAAoB,CAAG9jF,EAAAyiF,OAAe,CAAGziF,EAAAkmF,uBAA+B,CAAGlmF,EAAA0iF,WAAmB,CAAG1iF,EAAAkkF,kBAA0B,CAAGlkF,EAAA4lF,mBAA2B,CAAG5lF,EAAA6jF,UAAkB,CAAG7jF,EAAA+jF,cAAsB,CAAG/jF,EAAA6lF,mBAA2B,CAAG7lF,EAAA4jF,gBAAwB,QAC9mC,IAAA4Z,EAA6B15F,EAAQ,OACrChE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqsF,EAAA5Z,gBAAA,IAC1F9jF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqsF,EAAA3X,mBAAA,IAC7F,IAAA4X,EAA2B35F,EAAQ,OACnChE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAssF,EAAA1Z,cAAA,IACxFjkF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAssF,EAAA5Z,UAAA,IACpF,IAAA6Z,EAAqB55F,EAAQ,MAC7BhE,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusF,EAAA9X,mBAAA,IAC7F,IAAA+X,EAA4B75F,EAAQ,OACpChE,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwsF,EAAAzZ,kBAAA,IAC5F,IAAA6I,EAAwBjpF,EAAQ,OAChChE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA47E,EAAArK,WAAA,IACrF5iF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA47E,EAAA7G,uBAAA,IACjG,IAAA+G,EAAmBnpF,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA87E,EAAAxK,OAAA,IACjF,IAAAmb,EAA+B95F,EAAQ,OACvChE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAysF,EAAA9Z,YAAA,IACtF,IAAA+Z,EAA2B/5F,EAAQ,MACnChE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0sF,EAAA1X,aAAA,IACvFrmF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0sF,EAAAzX,aAAA,IACvFtmF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0sF,EAAArb,SAAA,IACnF1iF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0sF,EAAAvX,oBAAA,IAC9FxmF,OAAAC,cAAA,CAAAC,EAAA,+BAA+D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0sF,EAAAxX,4BAAA,IACtG,IAAArQ,EAAoBlyE,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,QAAwC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAiO,KAAA,IAC/EnkF,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAgO,OAAA,IACjFlkF,OAAAC,cAAA,CAAAC,EAAA,MAAsC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAkF,GAAA,IAC7Ep7E,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAqG,kBAAA,IAC5Fv8E,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAuG,mBAAA,IAC7Fz8E,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6kE,EAAAoB,WAAA,IACrF,IAAAwgB,EAA6B9zF,EAAQ,OACrChE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAymF,EAAAjU,gBAAA,IAC1F,IAAAkU,EAA4B/zF,EAAQ,MACpChE,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0mF,EAAAnU,kBAAA,IAC5F5jF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0mF,EAAApU,eAAA,IACzF3jF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0mF,EAAArU,aAAA,IACvF,IAAAsa,EAA4Bh6F,EAAQ,MACpChE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA2sF,EAAAva,eAAA,IACzF,IAAA+T,EAA4BxzF,EAAQ,OACpChE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAmmF,EAAAhU,eAAA,IACzF,IAAA+T,EAAyBvzF,EAAQ,OACjChE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAkmF,EAAAhU,YAAA,IACtF,IAAAmU,EAA+B1zF,EAAQ,OACvChE,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqmF,EAAArU,kBAAA,IAC5F,IAAAoU,EAA+BzzF,EAAQ,OACvChE,OAAAC,cAAA,CAAAC,EAAA,qBAAqD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAomF,EAAAnU,kBAAA,IAC5F,IAAAqU,EAA8B3zF,EAAQ,OACtChE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmF,EAAAvU,iBAAA,IAC3FpjF,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmF,EAAAlR,eAAA,IACzF,IAAAmR,EAA2B5zF,EAAQ,OACnChE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAumF,EAAAzU,cAAA,IACxFnjF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAumF,EAAA1U,uBAAA,IACjG,IAAA+a,EAA2Bj6F,EAAQ,OACnChE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4sF,EAAAhb,cAAA,IACxF,IAAA4U,EAA8B7zF,EAAQ,OACtChE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwmF,EAAA7U,iBAAA,IAC3F,IAAAkb,EAAgCl6F,EAAQ,OACxChE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6sF,EAAAnb,iBAAA,IAC3F,IAAAob,EAA2Bn6F,EAAQ,OACnChE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8sF,EAAArb,cAAA,IACxF,IAAAkV,EAA8Bh0F,EAAQ,OACtChE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA2mF,EAAAnV,iBAAA,IAC3F,IAAAub,EAA2Bp6F,EAAQ,OACnChE,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+sF,EAAApY,gBAAA,IAC1FhmF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+sF,EAAAjY,qBAAA,IAC/FnmF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+sF,EAAAnY,uBAAA,IACjGjmF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+sF,EAAAlY,qBAAA,wCCzE/FlmF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAyiF,OAAe,QACf,IAAAlrB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B+5F,EAA6B/5F,EAAQ,MAkBrCq6F,EAAA,IAAA9tD,GAKA,OAAAoyC,EACA,CAAA7jF,EAAA,EACA0Q,EAAA,EACA0+E,CAAA,aAIApvF,CAAA,CAAA0Q,CAAA,EACA,MAAA1Q,EAAA,CAAAA,EACA,MAAA0Q,EAAA,IAAA6oD,EAAA4I,SAAA,EAAAzxD,GACA,MAAA0+E,CAAA,KAAA39C,GACA,CAIA8wC,QAAA,CACA,OAAiBviF,KAAA,KAAAA,IAAA,CAAA0Q,QAAAuE,OAAA,KAAAvE,OAAA,EACjB,CAOA,IAAA1Q,MAAA,CAAiB,aAAAA,EAAA,CACjB,IAAAA,KAAAqB,CAAA,EAAsB,MAAArB,EAAA,CAAAqB,CAAA,CAItB,IAAAqP,SAAA,CAAoB,aAAAA,EAAA,CACpB,IAAAA,QAAArP,CAAA,EAAyB,MAAAqP,EAAA,IAAA6oD,EAAA4I,SAAA,EAAA9gE,EAAA,WAQzBm+F,QAAA7tD,CAAA,EACA,GAAAA,MAAAA,EACA,SAEA,oBAAAA,EAAA,CACA,IACA,YAAAjhC,OAAA,MAAA6oD,EAAA4I,SAAA,EAAAxwB,EACA,CACA,MAAA3iC,EAAA,EACA,YAAAhP,IAAA,GAAA2xC,CACA,CACA,oBAAAA,GAAA,iBAAAA,EAAA,CACA,IACA,YAAAjhC,OAAA,MAAA6oD,EAAA4I,SAAA,EAAAxwB,EACA,CACA,MAAA3iC,EAAA,EACA,QACA,CACA,oBAAA2iC,EAAA,CACA,GAAAA,MAAAA,EAAAjhC,OAAA,EACA,IACA,YAAAA,OAAA,MAAA6oD,EAAA4I,SAAA,EAAAxwB,EAAAjhC,OAAA,CACA,CACA,MAAA1B,EAAA,EACA,QACA,CACA,GAAA2iC,MAAAA,EAAA3xC,IAAA,CACA,YAAAA,IAAA,GAAA2xC,EAAA3xC,IAAA,CAIA,QACA,CAIA,IAAAovF,SAAA,CACA,OAAAnkF,MAAAC,IAAA,OAAAkkF,CAAA,CAAA/zB,MAAA,GACA,CAKA20B,aAAAC,CAAA,EACA,SAAAb,CAAA,CAAA78E,GAAA,CAAA09E,EAAAjwF,IAAA,EACA,+CAA+DiwF,EAAAjwF,IAAA,EAAa,GAG5E,OADA,MAAAovF,CAAA,CAAA1mF,GAAA,CAAAunF,EAAAjwF,IAAA,CAAAiwF,EAAA3iF,KAAA,IACA,KAOA4iF,UAAAlwF,CAAA,EACA,aAAAovF,CAAA,CAAA78E,GAAA,CAAAvS,IAAA,IACA,CAKAy/F,WAAAC,CAAA,EACA,YAAAtQ,OAAA,CAAAvzD,MAAA,IAAAppB,EAAAzS,IAAA,CAAA0C,KAAA,WAAAg9F,EACA,CAIApyF,OAAA,CACA,IAAAA,EAAA,IAAAu2E,EAAA,KAAA7jF,IAAA,MAAA0Q,OAAA,EAIA,OAHA,KAAA0+E,OAAA,CAAA95E,OAAA,KACAhI,EAAA0iF,YAAA,CAAAC,EAAA3iF,KAAA,GACA,GACAA,CACA,CAOAqyF,oBAAA5jC,CAAA,EACA,IAAA6jC,EAAA,KAAA1P,SAAA,4CAAA+O,EAAAzX,aAAA,CACAhf,EAAAo3B,EAAAC,MAAA,CAIA,GAHA,MAAA9jC,EAAA7yD,EAAA,EACAs/D,CAAAA,GAAAo3B,EAAAE,QAAA,EAEA/jC,EAAA7zD,IAAA,CACA,QAAA7E,EAAA,EAA4BA,EAAA04D,EAAA7zD,IAAA,CAAA/H,MAAA,CAAoBkD,GAAA,EAChD04D,OAAAA,EAAA7zD,IAAA,CAAA25D,SAAA,CAAAx+D,EAAAA,EAAA,GACAmlE,GAAAo3B,EAAAG,UAAA,CAGAv3B,GAAAo3B,EAAAI,aAAA,CAIA,GAAAjkC,EAAAyiC,UAAA,EACA,IAAAA,EAAA,GAAA7lC,EAAAouB,aAAA,EAAAhrB,EAAAyiC,UAAA,EACA,QAAAnvC,KAAAmvC,EACAh2B,GAAAo3B,EAAAK,mBAAA,CAAAL,EAAAM,sBAAA,CAAA1B,CAAA,CAAAnvC,EAAA,CAAA8wC,WAAA,CAAAhgG,MAAA,CAGA,OAAAqoE,CACA,CAIA,OAAAt9D,KAAA4kF,CAAA,EAGA,GAFAsQ,WAmHAC,IAGAA,EAAA,GAwBAC,EAAA,aAAgCC,WAAA,EAAAzD,SAAA,gBAChCwD,EAAA,aAAgCC,WAAA,IAChCD,EAAA,aAAgCC,WAAA,IAChCD,EAAA,YAA+BC,WAAA,IAC/BD,EAAA,YAA+BC,WAAA,KAC/BD,EAAA,oBAAuCC,WAAA,WACvCD,EAAA,gBAAoCC,WAAA,OACpCD,EAAA,iBACAA,EAAA,qBACAA,EAAA,kBACAC,WAAA,CACA,GACAD,EAAA,6BACAA,EAAA,8BACAA,EAAA,aAAgCC,WAAA,IAChCD,EAAA,wBACAA,EAAA,yBACAA,EAAA,UAA6BC,WAAA,IAC7BD,EAAA,cACAA,EAAA,eAAkCC,WAAA,IAClCD,EAAA,yBACAA,EAAA,0BACAA,EAAA,aACAC,WAAA,EACAnR,QAAA,CACAoR,EAAA,4CACA,GAEAF,EAAA,uBACAA,EAAA,sBACAxD,SAAA,2BACA1N,QAAA,CACAoR,EAAA,oDACA,GAEAF,EAAA,eACAC,WAAA,EACAnR,QAAA,KAEAkR,EAAA,0BACAA,EAAA,gCACAA,EAAA,YAA+BC,WAAA,KA/D/B,SAAAD,EAAAtgG,CAAA,CAAA0Q,CAAA,CAAAy1B,CAAA,EACA,IAAApR,EAAA,WACA,IAAA+6D,EAAA,IAAAjM,EAAA7jF,EAAA0Q,GASA,OAPA,MAAAy1B,EAAAo6D,UAAA,EACAzQ,EAAAE,YAAA,KAAAiP,EAAArb,SAAA,MAAAz9C,EAAAo6D,UAAA,GAEAzQ,EAAAE,YAAA,KAAAiP,EAAAzX,aAAA,EACA,CAAArhD,EAAAipD,OAAA,MAAA95E,OAAA,KACAw6E,EAAAE,YAAA,CAAAC,EACA,GACAH,CACA,EAEAjM,EAAArE,QAAA,CAAAx/E,EAAA+0B,GACA8uD,EAAArE,QAAA,CAAA9uE,EAAAqkB,GACAoR,EAAA22D,QAAA,EACA32D,EAAA22D,QAAA,CAAAxnF,OAAA,KACAuuE,EAAArE,QAAA,CAAAx/E,EAAA+0B,EACA,EAEA,CA2CA,IAtLA+6D,MAAAA,EACA,OAAAjM,EAAA34E,IAAA,YAMA,GAHA,iBAAA4kF,GACAA,CAAAA,EAAAjtF,OAAAitF,EAAA,EAEA,iBAAAA,GAAA,iBAAAA,EAAA,CACA,IAAA2Q,EAAAlB,EAAAhtF,GAAA,CAAAu9E,GACA,GAAA2Q,EACA,OAAAA,IAEA,oBAAA3Q,EACA,WAAAjM,EAAA,UAAAiM,GAEA,GAAAv2B,EAAAqB,cAAA,iCAAAk1B,EACA,CAEA,sBAAAA,EAAAxiF,KAAA,CAIA,OAHAwiF,EAAAxiF,KAAA,GAMA,oBAAAwiF,EAAA,CACA,GAAAv2B,EAAAqB,cAAA,mBAAAk1B,EAAA9vF,IAAA,mBAAA8vF,EAAAp/E,OAAA,oDAAAo/E,GACA,IAAA4Q,EAAA,IAAA7c,EAAAiM,EAAA9vF,IAAA,CAAA8vF,EAAAp/E,OAAA,EAOA,MANAo/E,CAAAA,EAAA6Q,UAAA,EAAA7Q,MAAAA,EAAAyQ,UAAA,GACAG,EAAA1Q,YAAA,KAAAiP,EAAArb,SAAA,CAAAkM,EAAA6Q,UAAA,CAAA7Q,EAAAyQ,UAAA,GAKAG,CACA,CACA,GAAAnnC,EAAAqB,cAAA,iCAAAk1B,EACA,CAKA,OAAAtQ,SAAAohB,CAAA,CAAAH,CAAA,EACA,iBAAAG,GACAA,CAAAA,EAAA/9F,OAAA+9F,EAAA,EAEA,IAAAC,EAAAtB,EAAAhtF,GAAA,CAAAquF,GACAC,GACA,GAAAtnC,EAAAqB,cAAA,gCAA6EtpD,KAAAC,SAAA,CAAAsvF,EAAA7gG,IAAA,EAA8B,kBAAA4gG,GAE3GrB,EAAA72F,GAAA,CAAAk4F,EAAAH,EACA,CACA,CAMA,SAAArX,EAAA5oB,CAAA,CAAAsgC,CAAA,EACA,IAAAz/F,EAAA4T,OAAAurD,GACA,IAAAn/D,EAAAg4B,KAAA,cACA,mCAA+CmnC,EAAO,GAGtD,IAAAgH,EAAAnmE,EAAAqB,KAAA,MAKA,GAJA,IAAA8kE,EAAArnE,MAAA,EACAqnE,EAAAthE,IAAA,KAGAshE,IAAAA,EAAArnE,MAAA,CACA,mCAA+CqgE,EAAO,GAGtD,KAAAgH,CAAA,IAAArnE,MAAA,CAAA2gG,GACAt5B,CAAA,SAGA,GAAAA,CAAA,IAAArnE,MAAA,IACA,IAAA4gG,EAAAl+F,OAAA2kE,CAAA,IAAA3F,SAAA,MACA,EAAA2F,CAAA,IAAA3F,SAAA,IAAAxoC,KAAA,UACA0nE,IAEAv5B,CAAA,IAAAu5B,EAAA31F,QAAA,EACA,CACA,OAAAvI,OAAA2kE,CAAA,IAAAA,CAAA,IACA,CAEA,SAAAg5B,EAAA7P,CAAA,EACA,WAAAsO,EAAAxX,4BAAA,CAAAkJ,EAAA,MAAAqQ,EAAAlyC,EAAA+hC,SAGAkL,EADAlL,EAAAoQ,SAAA,wBAEA,IACA,IAAAC,EAAAC,EAAA,OAAAr2C,QAAA6F,GAAA,EACAkgC,EAAA7V,IAAA,GAAAgmB,IACA,EAEAvJ,EAAAsE,CADAA,EAAAmF,CAAA,EACAlQ,QAAA,CAAAoQ,QAAA,CAMA,MALA,CACAzO,SAAAwO,EAAAxO,QAAA,CACAE,aAAAzJ,EAAAqO,EAAA4J,MAAA,IACAvO,qBAAA1J,EAAAqO,EAAA6J,cAAA,GACA,CAEA,CACA,MAAAtyF,EAAA,CACA,GAAAuqD,EAAA8E,MAAA,oDAAyF/sD,KAAAC,SAAA,CAAAs/E,EAAAF,GAAA,EAA4B,mBAAsBE,QAAAA,EAAAkL,SAAAA,EAAA/sF,MAAAA,CAAA,EAC3I,CACA,EACA,CAxDA5N,EAAAyiF,OAAe,CAAAA,EA0Df,IAAAwc,EAAA,sCCrSAn/F,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqmF,4BAAoC,CAAGrmF,EAAAsmF,oBAA4B,CAAGtmF,EAAAwiF,SAAiB,CAAGxiF,EAAAomF,aAAqB,CAAGpmF,EAAAmmF,aAAqB,QACvI,IAAA/kB,EAAwBt9D,EAAQ,OAChCyzD,EAAmBzzD,EAAQ,MAK3B,OAAAqiF,EAOAvnF,IAAA,aAIAA,CAAA,EACA,GAAAwiE,EAAA/K,gBAAA,QAAsDz3D,KAAAA,CAAA,EACtD,CAIAsN,OAAA,CACA,WAAAi6E,EAAA,KAAAvnF,IAAA,CACA,CACA,CACAoB,EAAAmmF,aAAqB,CAAAA,CAKrB,OAAAC,UAAAD,EAOAga,cAAA,CAIA1B,MAAA,CAIAC,QAAA,CAIAC,UAAA,CAIAC,aAAA,CAIAE,sBAAA,CAIAD,mBAAA,aAMAsB,CAAA,CAAA3B,CAAA,EACA,MAAA2B,GACAA,CAAAA,EAAA,GAEA,4CAAoDA,GAAA,EAAsB,GAC1E,IAAAC,EAAA,CAAwBD,eAAAA,CAAA,EACxB,SAAA74F,EAAA1I,CAAA,CAAAyhG,CAAA,EACA,IAAApgG,EAAA,CAAAu+F,GAAA,GAAoC,CAAA5/F,EAAA,OACpCqB,GACAA,CAAAA,EAAAogG,CAAA,EAEA,GAAA9oC,EAAAiC,cAAA,mBAAAv5D,EAAA,qBAA6FrB,EAAK,UAAA4/F,GAClG4B,CAAA,CAAAxhG,EAAA,CAAAqB,CACA,CACAqH,EAAA,eACAA,EAAA,iBACAA,EAAA,gBACAA,EAAA,oBACAA,EAAA,+BACAA,EAAA,4BACA,GAAA85D,EAAA/K,gBAAA,OAAA+pC,EACA,CACAl0F,OAAA,CACA,WAAAk6E,EAAA,KAAA+Z,cAAA,MACA,CACA,CACAngG,EAAAomF,aAAqB,CAAAA,CAUrB,OAAA5D,UAAA2D,EAIAj3E,OAAA,CAIAoxF,aAAA,aAMApxF,CAAA,CAAAoxF,CAAA,EACA,wCACA,GAAAl/B,EAAA/K,gBAAA,QACAnnD,QAAAA,GAxHA,6CAyHAoxF,cAAA,MAAAA,EAAA,EAAAA,CACA,EACA,CACAp0F,OAAA,CACA,WAAAs2E,EAAA,KAAAtzE,OAAA,MAAAoxF,aAAA,CACA,CACA,CACAtgG,EAAAwiF,SAAiB,CAAAA,CAQjB,OAAA8D,UAAAH,EACA,CAAAoa,EAAA,KAIAA,aAAA,CACA,aAAAA,EAAA,CAKA5hG,YAAA4hG,CAAA,EACA,4CACA,MAAAA,EAAA,CAAAA,CACA,CAIA,MAAAnP,WAAA1jC,CAAA,EACA,mBAAA6yC,EAAA,CAAA7yC,EACA,CACAxhD,OAAA,CACA,WAAAo6E,EAAA,MAAAia,EAAA,CACA,CACA,CACAvgG,EAAAsmF,oBAA4B,CAAAA,CAC5B,OAAAD,UAAAF,EACA,CAAAoJ,EAAA,EACAsC,EAAA,KAIAtC,KAAA,CAAgB,aAAAA,EAAA,CAIhB,IAAAsC,aAAA,CAAwB,aAAAA,EAAA,CAKxBlzF,YAAA4wF,CAAA,CAAAsC,CAAA,EACA,0DACA,MAAAtC,EAAA,CAAAA,EACA,MAAAsC,EAAA,CAAAA,CACA,CAEA3lF,OAAA,CAAc,YACd,CACAlM,EAAAqmF,4BAAoC,CAAAA,sCCrKpCvmF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAsjF,eAAuB,QACvB,IAAA/rB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtC08F,EAAA,kCA+CA,OAAAld,UAAAuU,EAAApU,eAAA,CACAgd,MAAA,aACAhS,CAAA,CAAAgS,CAAA,EACA,MAAAhS,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAgS,GACAA,CAAAA,EAAAD,CAAA,EAGA,MADAld,EAAAod,UAAA,CAAAhS,EAAA+R,GACA/R,EAAA,CAAkCyJ,cAAAzJ,CAAA,GAClC,GAAAn3B,EAAAlB,gBAAA,QAAiDoqC,OAAAA,CAAA,EACjD,CACAtM,aAAA7kF,CAAA,EACA,IACA,WAAAg0E,EAAAh0E,EAAA,KAAAmxF,MAAA,CACA,CACA,MAAA7yF,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CACA,MAAA2/E,SAAAD,CAAA,EAEA,GAAAA,yBAAAA,EAAA7jB,MAAA,MAQArkE,EAPA,IAAoB4O,MAAAA,CAAA,CAAAilD,GAAAA,CAAA,EAAY,SAAApD,EAAAijB,iBAAA,GAChC9kE,MAAA,KAAAkkE,IAAA,sBAAAoV,EAAA/vF,IAAA,GACA07D,GAAA,KAAAkiB,cAAA,CAAAmS,EAAA/vF,IAAA,CACA,GACA,GAAAyW,MAAAA,GAAAilD,MAAAA,EACA,YAGA,IAAA/sD,EAAA,GACA,IACA9G,EAAA4O,CAAA,IAAA3F,MAAA,CAAApQ,MAAA,CACAiO,EAAA8H,aAAAA,CAAA,IAAA9H,KAAA,CAEA,MAAAA,EAAA,EACA,GAAA9G,EASA,MARA,GAAAywD,EAAA0F,MAAA,GAAArvD,EAAA,oEACA8sD,OAAA,uBACA5zD,KAAAA,EACA+zD,OAAA,KACAI,YAAAN,EACAQ,WAAA,KACAL,OAAA,IACA,GACAh0D,EAEA,GAAAywD,EAAA0F,MAAA,gDAAwFh9D,MAAAyV,CAAA,EACxF,CACA,mBAAAu5E,SAAAD,EACA,CACA2R,qBAAA,CACA,YAAAF,MAAA,GAAAD,CACA,CACA,OAAAE,WAAAhS,CAAA,CAAA+R,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAAD,CAAA,EAEA,IAAA/Q,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SA1GhEhiG,CAAA,EACA,OAAAA,GACA,cACA,iCACA,cACA,gCACA,eACA,iCACA,gBACA,iCACA,uBACA,gCACA,wBACA,iCACA,YACA,kCACA,mBACA,iCACA,oBACA,kCACA,aACA,qCACA,kBACA,kCACA,oBACA,oCACA,gBACA,iCACA,uBACA,gCACA,wBACA,iCACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EAwEgE8vF,EAAA9vF,IAAA,EAAsB,MAAM6hG,EAAO,GAQnG,OAPAhR,EAAAoR,SAAA,IACAJ,IAAAD,GACA/Q,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,aACA,GACA,EAEA6J,CACA,CACA,CACAzvF,EAAAsjF,eAAuB,CAAAA,sCCpJvBxjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqjF,YAAoB,QAwBpB,IAAA9rB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtC08F,EAAA,kEA2CA,OAAAnd,UAAAwU,EAAApU,eAAA,CAIAgd,MAAA,aAOAhS,CAAA,CAAAgS,CAAA,EACA,MAAAhS,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAgS,GACAA,CAAAA,EAAAD,CAAA,EAKA,MADAnd,EAAAqd,UAAA,CAAAhS,EAAA+R,GACA/R,EAFA,CAA0BqS,QAAA,GAAA5I,cAAAzJ,CAAA,GAG1B,GAAAn3B,EAAAlB,gBAAA,QAAiDoqC,OAAAA,CAAA,EACjD,CACAtM,aAAA7kF,CAAA,EACA,IACA,WAAA+zE,EAAA/zE,EAAA,KAAAmxF,MAAA,CACA,CACA,MAAA7yF,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CAKA,OAAAoxF,WAAAhS,CAAA,CAAA+R,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAAD,CAAA,EAEA,IAAA/Q,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SAlFhEhiG,CAAA,EACA,OAAAA,GACA,cACA,wBACA,cACA,+BACA,eACA,gCACA,gBACA,6BACA,YACA,yBACA,mBACA,gCACA,oBACA,iCACA,WACA,wBACA,YACA,uCACA,aACA,4BACA,oBACA,mCACA,gBACA,6BACA,uBACA,qCACA,wBACA,qCACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EAkDgE8vF,EAAA9vF,IAAA,EAAsB,GAAG6hG,EAAO,GAQhG,OAPAhR,EAAAoR,SAAA,IACAJ,IAAAD,GACA/Q,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,kBACA,GACA,EAEA6J,CACA,CACAuR,YAAA3K,CAAA,CAAAzoF,CAAA,EAMA,MALA,2BAAAyoF,EAAAlrB,MAAA,EACAv9D,GAAAA,EAAAA,KAAA,EAAAA,kDAAAA,EAAAA,KAAA,CAAA8qC,OAAA,EACA9qC,CAAAA,EAAAA,KAAA,CAAA8qC,OAAA,wCAGA,MAAAsoD,YAAA3K,EAAAzoF,EACA,CACA+yF,qBAAA,CACA,YAAAF,MAAA,GAAAD,CACA,CACA,CACAxgG,EAAAqjF,YAAoB,CAAAA,qCCtIpBvjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAujF,eAAuB,QACvB,IAAAhsB,EAAmBzzD,EAAQ,OAC3B+zF,EAA8B/zF,EAAQ,KAOtC,OAAAy/E,UAAAsU,EAAAoJ,yBAAA,CACA,CAAAxR,EAAA,aAKAyR,CAAA,CAAAxS,CAAA,CAAAyS,CAAA,EAEA,IAAAp8D,EAAAjlC,OAAAwM,MAAA,IAAwC,MAAA60F,EAAAA,EAAA,GAAqC,CAAKC,cAAA,IAClF,GAAA7pC,EAAAiC,cAAA,EAAA0nC,GAAAA,EAAAzR,OAAA,wCAAAyR,GACA,MAAAxS,EAAA3pD,GACA,MAAA0qD,EAAA,OAAAtkB,EAAArd,KACA,IAAAuoC,EAAA,CAA8BlrB,OAAAA,EAAArd,OAAAA,CAAA,EAC9B,KAAAmqB,IAAA,UAAiCvd,OAAA,qBAAA27B,QAAAA,CAAA,GACjC,IACA,IAAAtmF,EAAA,MAAAmxF,EAAAzR,OAAA,CAAA4G,GAEA,OADA,KAAApe,IAAA,UAAqCvd,OAAA,uBAAA3qD,OAAAA,CAAA,GACrCA,CACA,CACA,MAAAw1B,EAAA,CACA,IAAA33B,EAAA,MAAA23B,EAAAmT,OAAA,CAKA,OAJA9qC,EAAAwoB,IAAA,CAAAmP,EAAAnP,IAAA,CACAxoB,EAAA9G,IAAA,CAAAy+B,EAAAz+B,IAAA,CACA8G,EAAAyoF,OAAA,CAAAA,EACA,KAAApe,IAAA,UAAqCvd,OAAA,sBAAA9sD,MAAAA,CAAA,GACrCA,CACA,CACA,CACA,CACA,MAAAgsE,KAAAzO,CAAA,CAAArd,CAAA,EAEA,OADA,WAAAuzC,MAAA,GACA,YAAAznB,KAAAzO,EAAArd,EACA,CACA,MAAAwzC,MAAAjL,CAAA,EACA,GAAA9+B,EAAAiC,cAAA,GAAA3vD,MAAA8J,OAAA,CAAA0iF,GAAA,oDAAAA,GACA,IACA,IAAAtmF,EAAA,YAAA0/E,EAAA,CAAA4G,EAAAlrB,MAAA,CAAAkrB,EAAAvoC,MAAA,MACA,QAAsBz/C,GAAAgoF,EAAAhoF,EAAA,CAAA0B,OAAAA,CAAA,EAAwB,CAE9C,MAAAw1B,EAAA,CACA,QACAl3B,GAAAgoF,EAAAhoF,EAAA,CACAT,MAAA,CAA6BwoB,KAAAmP,EAAAnP,IAAA,CAAAtvB,KAAAy+B,EAAAz+B,IAAA,CAAA4xC,QAAAnT,EAAAmT,OAAA,CAC7B,EAAiB,CAEjB,CACAsoD,YAAA3K,CAAA,CAAAzoF,CAAA,EAIA,OAAAA,CAHAA,EAAAsC,KAAAF,KAAA,CAAAE,KAAAC,SAAA,CAAAvC,GAAA,EAGAA,KAAA,CAAAwoB,IAAA,MACA,UACAxoB,EAAAA,KAAA,CAAA8qC,OAAA,wBAA6D9qC,EAAAA,KAAA,CAAA8qC,OAAA,CAAoB,EACjF,KACA,WACA9qC,EAAAA,KAAA,CAAA8qC,OAAA,wBAA6D9qC,EAAAA,KAAA,CAAA8qC,OAAA,CAAoB,EAGjF,aAAAsoD,YAAA3K,EAAAzoF,EACA,CAIA,MAAA2zF,UAAAryF,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,GAEA,IAAAsyF,EAAA,WAAA5nB,IAAA,0BACA,iBAAA1qE,EACAsyF,EAAAziG,MAAA,CAAAmQ,GAEAA,EAAAA,EAAAyC,WAAA,GACA6vF,IAAAA,EAAA/mE,MAAA,IAAAh8B,EAAAkT,WAAA,KAAAzC,GAAAnQ,MAAA,CACA,CACA,MAAA0iG,UAAAvyF,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,GAEA,YAAAqyF,SAAA,CAAAryF,GACA,IAEA,YAAAugF,EAAA,0BAEA,CACA,MAAA7hF,EAAA,CACA,IAAAyoF,EAAAzoF,EAAAyoF,OAAA,OACA,KAAA2K,WAAA,CAAA3K,EAAA,CAAkDhoF,GAAAgoF,EAAAhoF,EAAA,CAAAT,MAAAA,CAAA,EAClD,CAEA,mBAAA6zF,UAAAvyF,EACA,CACA,CACAlP,EAAAujF,eAAuB,CAAAA,sCCtGvBzjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAojF,kBAA0B,QAc1B,IAAA7rB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtC,SAAA49F,EAAA9iG,CAAA,EACA,OAAAA,GACA,sDACA,wDACA,mDACA,qDACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,CAuBA,MAAAwkF,UAAAyU,EAAApU,eAAA,CAIAgd,MAAA,aAIAhS,CAAA,CAAAgS,CAAA,EACA,MAAAhS,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAgS,GACAA,CAAAA,EAAAiB,EAAAhT,EAAA9vF,IAAA,GAGA,MADAwkF,EAAAsd,UAAA,CAAAhS,EAAA+R,GACA/R,EAAA,CAAkCyJ,cAAAzJ,CAAA,GAClC,GAAAn3B,EAAAlB,gBAAA,QAAiDoqC,OAAAA,CAAA,EACjD,CACAtM,aAAA7kF,CAAA,EACA,IACA,WAAA8zE,EAAA9zE,EAAA,KAAAmxF,MAAA,CACA,CACA,MAAA7yF,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CACAqxF,qBAAA,CACA,YAAAF,MAAA,GAAAiB,EAAA,KAAAjT,QAAA,CAAA7vF,IAAA,CACA,CAKA,OAAA8hG,WAAAhS,CAAA,CAAA+R,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAAiB,EAAAhT,EAAA9vF,IAAA,GAEA,IAAA6wF,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SA5DhEhiG,CAAA,EACA,OAAAA,GACA,cACA,4CACA,gBACA,4CACA,WACA,uCACA,aACA,2CACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EAgDgE8vF,EAAA9vF,IAAA,EAAsB,GAAG6hG,EAAO,GAQhG,OAPAhR,EAAAoR,SAAA,IACAJ,IAAAiB,EAAAhT,EAAA9vF,IAAA,GACA6wF,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,wBACA,GACA,EAEA6J,CACA,CACA,CACAzvF,EAAAojF,kBAA0B,CAAAA,sCC9F1BtjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAmjF,kBAA0B,QAC1B,IAAA5rB,EAAmBzzD,EAAQ,OAC3BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,KAItC,OAAAq/E,UAAA0U,EAAApU,eAAA,CACA9kF,YAAA8vF,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,GACA,GAAAl3B,EAAAiC,cAAA,EAAAk1B,YAAAA,EAAA9vF,IAAA,iCAAA6vF,GACA,oCAAAC,EAAA,CAAyDyJ,cAAAzJ,CAAA,EACzD,CACA,CACA1uF,EAAAmjF,kBAA0B,CAAAA,sCCE1BrjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAkjF,iBAAyB,CAAGljF,EAAAumF,eAAuB,QACnD,IAAAhvB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3B05F,EAA+B15F,EAAQ,OACvCmpF,EAAqBnpF,EAAQ,OAC7B+5F,EAA6B/5F,EAAQ,MACrC45F,EAAuB55F,EAAQ,MAK/B69F,EAAA,uCAOA,OAAApb,UAAAsX,EAAA1X,aAAA,CAIAyb,OAAA,aAKAA,CAAA,EACA,MAAAD,GACA,GAAArZ,EAAAjyB,gBAAA,QAAiDurC,QAAAA,CAAA,EACjD,CACA11F,OAAA,CACA,WAAAq6E,EAAA,KAAAqb,OAAA,CACA,CACA,CACA5hG,EAAAumF,eAAuB,CAAAA,EACvB,IAAAsb,EAAA,mBACAC,EAAA,CAWA,OAAA5e,UAAAsa,EAAA5Z,gBAAA,CAIA8K,OAAA,CAIA+R,MAAA,EACA5R,EAAA,aAIAJ,CAAA,CAAAsT,CAAA,EAEA,QACA,IAAArT,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAI,EAAA,CAAAH,EAAAI,SAAA,CAAA6S,GACA,GAAArZ,EAAAjyB,gBAAA,QAAiDoqC,OAJjD,MAAAsB,EAAAA,EAAA,KAIiDrT,QAAAA,CAAA,GAEjD,KAAAsT,UAAA,EACA,CAQAA,YAAA,CACA,SAAAnT,EAAA,CACA,aAAAA,EAAA,CAAA+S,OAAA,CAEA,YAAAlT,OAAA,CAAA9vF,IAAA,EACA,cACA,gCACA,cACA,uCACA,eACA,wCACA,eACA,wCACA,gBACA,+BACA,uBACA,sCACA,YACA,gCACA,oBACA,wCACA,WACA,+BACA,YACA,uCACA,aACA,mCACA,kBACA,wCACA,oBACA,2CACA,gBACA,2CACA,uBACA,kDAEA,CACA,GAAA0pF,EAAA9uB,cAAA,0CAAAk1B,OAAA,CACA,CAIAuT,OAAA/vF,CAAA,CAAA47C,CAAA,EACA,IAAA8E,EAAA9yD,OAAA6xD,IAAA,CAAA7D,GAAA7nB,MAAA,EAAAu2B,EAAAnsD,KACA,IAAApQ,EAAA6tD,CAAA,CAAAz9C,EAAA,CAIA,OAHA,MAAApQ,GACAu8D,CAAAA,GAAA,IAA6BnsD,EAAI,GAAGpQ,EAAM,GAE1Cu8D,CACA,EAAS,IACTikC,EAAA,KAAAA,MAAA,YAAmD,KAAAA,MAAA,CAAY,KAC/D,SAAkB,KAAAuB,UAAA,GAAkB,cAAc9vF,EAAO,EAAE0gD,EAAM,EAAE6tC,EAAO,EAK1EyB,YAAA,CACA,SAAkB,KAAAF,UAAA,GAAkB,MAKpCG,YAAAjwF,CAAA,CAAA47C,CAAA,EAGA,OAFAA,EAAA57C,MAAA,CAAAA,EACA47C,EAAAs0C,MAAA,MAAA3B,MAAA,CACA3yC,CACA,CACA,MAAAojC,eAAA,CACA,YAAAxC,OAAA,CAOA,MAAAgL,MAAAxnF,CAAA,CAAA47C,CAAA,CAAAu0C,CAAA,EACA,IAAAh0F,EAAAyzF,IACAvS,EAAA8S,EAAA,KAAAH,UAAA,QAAAD,MAAA,CAAA/vF,EAAA47C,GACAuoC,EAAAgM,EAAA,KAAAF,WAAA,CAAAjwF,EAAA47C,GAAA,KACA,KAAAmqB,IAAA,UAA6Bvd,OAAA,cAAArsD,GAAAA,EAAAkhF,IAAAA,EAAA8G,QAAAA,CAAA,GAC7B,IAAA5G,EAAA,IAAAnH,EAAAtD,YAAA,CAAAuK,GACAE,EAAA6S,iBAAA,EAAoCC,aAAA,MACpC9S,EAAAqR,SAAA,EAAA9R,EAAAW,EAAAoC,KACA,KAAA4O,mBAAA,IACA,GAAAjD,EAAA9X,mBAAA,eAEAl8B,QAAAC,OAAA,MAEA8lC,EAAAoC,WAAA,OAAApC,EAAAkL,KACA,IAAA5qF,EAAA4qF,EAAA6H,OAAA,GAAAtyF,KAAAF,KAAA,IAAAs4E,EAAA7sB,YAAA,EAAAk/B,EAAAtwC,IAAA,MACAo4C,EAAA,kBAAA1yF,EAAAA,MAAA,CAAAA,EAAAA,MAAA,KAAA4B,WAAA,GAAAuc,OAAA,kBAcA,MAbAhc,UAAAA,EAEAnC,GAAAA,GAAAA,EAAAotF,MAAA,EAAAptF,SAAAA,EAAA2oC,OAAA,EAAA+pD,IACA,KAAAxqB,IAAA,UAAyCvd,OAAA,eAAArsD,GAAAA,EAAAwsD,OAAA,cAAAjtD,MAAAmC,CAAA,GACzC4qF,EAAA+H,kBAAA,CAAA3yF,EAAAA,MAAA,CArKA,MAyKA0yF,IACA,KAAAxqB,IAAA,UAAyCvd,OAAA,eAAArsD,GAAAA,EAAAwsD,OAAA,cAAAjtD,MAAAmC,EAAAA,MAAA,GACzC4qF,EAAA+H,kBAAA,CAAA3yF,EAAAA,MAAA,CA3KA,MA8KA4qF,CACA,EACAtE,IACA5G,EAAAoQ,SAAA,oEACApQ,EAAAplC,IAAA,CAAAvqD,OAAA6xD,IAAA,CAAA0kC,GAAAh8E,GAAA,OAA8DzJ,EAAE,GAAGylF,CAAA,CAAAzlF,EAAA,CAAW,GAAAw8C,IAAA,OAE9E,IAAAutC,EAAA,MAAAlL,EAAA7V,IAAA,GACA,IACA+gB,EAAAC,QAAA,EACA,CACA,MAAAhtF,EAAA,CACA,KAAAqqE,IAAA,UAAiCvd,OAAA,eAAArsD,GAAAA,EAAAT,MAAAA,EAAAitD,OAAA,aACjC,GAAAytB,EAAArrB,MAAA,sCAA8EwyB,QAAAA,EAAAkL,SAAAA,CAAA,EAC9E,CACAA,EAAA6H,OAAA,KACA,KAAAvqB,IAAA,UAAiCvd,OAAA,eAAArsD,GAAAA,EAAAT,MAAA,eAAAitD,OAAA,cACjC,GAAAytB,EAAArrB,MAAA,wCAAgFwyB,QAAAA,EAAAkL,SAAAA,CAAA,IAEhF,IAAA5qF,EAAAG,KAAAF,KAAA,IAAAs4E,EAAA7sB,YAAA,EAAAk/B,EAAAtwC,IAAA,SACAn4C,UAAAA,GACA,OAAAnC,EAAA4yF,OAAA,GACA,KAAA1qB,IAAA,UAAqCvd,OAAA,eAAArsD,GAAAA,EAAA0B,OAAAA,EAAA8qD,OAAA,qBACrC,GAAAytB,EAAArrB,MAAA,yEAAqHwyB,QAAAA,EAAAkL,SAAAA,EAAAn8B,KAAA,CAA2BzuD,OAAAA,CAAA,KAEhJA,EAAAnC,KAAA,GACA,KAAAqqE,IAAA,UAAqCvd,OAAA,eAAArsD,GAAAA,EAAA0B,OAAAA,EAAA8qD,OAAA,mBACrC,GAAAytB,EAAArrB,MAAA,sCAAkFwyB,QAAAA,EAAAkL,SAAAA,EAAAn8B,KAAA,CAA2BzuD,OAAAA,CAAA,MAO7G,GAAAA,EAAAotF,MAAA,EAAAptF,CAAAA,qBAAAA,EAAA2oC,OAAA,EAAA3oC,0BAAAA,EAAA2oC,OAAA,GAIA3oC,GAAAA,EAAAotF,MAAA,oBAAAptF,EAAA2oC,OAAA,EAAA3oC,EAAA2oC,OAAA,CAAAzgB,KAAA,WACA,KAAAggD,IAAA,UAAqCvd,OAAA,eAAArsD,GAAAA,EAAA0B,OAAAA,CAAA,GACrC,GAAAu4E,EAAArrB,MAAA,sCAAkFwyB,QAAAA,EAAAkL,SAAAA,EAAAn8B,KAAA,CAA2BzuD,OAAAA,CAAA,KAL7G,KAAAkoE,IAAA,UAAqCvd,OAAA,iBAAArsD,GAAAA,EAAA0B,OAAAA,CAAA,GACrCA,EAAAA,MAAA,CAaA6yF,wBAAA3nC,CAAA,EACA,IAAAlrD,EAAA,GACA,QAAAM,KAAA4qD,EAAA,CACA,GAAA4mC,EAAA3zE,OAAA,CAAA7d,IAAA,GAGA4qD,MAAAA,CAAA,CAAA5qD,EAAA,CAFA,SAKA,IAAApQ,EAAAg7D,CAAA,CAAA5qD,EAAA,CACA,GAAAA,CAAAA,SAAAA,GAAApQ,IAAAA,CAAA,GAGAoQ,CAAAA,aAAAA,GAAApQ,WAAAA,CAAA,GAIA,KAAkB0a,KAAA,GAAAi8E,SAAA,GAAArF,SAAA,GAAAsR,YAAA,GAAAnR,qBAAA,GAAAliF,MAAA,GAAAvP,MAAA,IAAqH,CAAAoQ,EAAA,CACvIpQ,EAAA,GAAAqoF,EAAAF,UAAA,EAAAnoF,QAEA,GAAAoQ,eAAAA,EACApQ,EAAA,OAAAm4D,EAAAutB,aAAA,EAAA1lF,GAAAoa,GAAA,IACA,WAA6B,EAAW/S,EAAA4H,OAAA,CAAY,kBAAkB5H,EAAAy3F,WAAA,CAAA3xC,IAAA,QAA4B,GAAG,GACpFA,IAAA,eAEjB,GAAA/8C,wBAAAA,EAAA,CACA,GAAApQ,IAAAA,EAAAlB,MAAA,CACA,SAGA,GAAAupF,EAAArrB,MAAA,mFACAC,UAAA,0BACAsB,KAAA,CAA4BvD,YAAAA,CAAA,CAC5B,EACA,MAEAh7D,EAAA,GAAAqoF,EAAAttB,OAAA,EAAA/6D,EAEA8P,CAAAA,CAAA,CAAAM,EAAA,CAAApQ,EACA,CACA,OAAA8P,CACA,CAIA+yF,YAAA9T,CAAA,CAAAphF,CAAA,CAAAqtD,CAAA,EAEA,IAAAviB,EAAA,GACA,MAAA4vC,EAAAhoB,OAAA,EAAA1yD,EAAA,iBAEA,IACA8qC,EAAA9qC,EAAA4wD,IAAA,CAAAzuD,MAAA,CAAAnC,KAAA,CAAA8qC,OAAA,CAEA,MAAAnT,EAAA,EACA,IAAAmT,EACA,IACAA,EAAA9qC,EAAA4wD,IAAA,CAAA9lB,OAAA,CAEA,MAAAnT,EAAA,EAEA,CAQA,GAPA,gBAAAypD,EAAA7jB,MAAA,EACA,CAAAzyB,EAAAzgB,KAAA,aAAAygB,EAAAzgB,KAAA,yBACA,GAAAqwD,EAAArrB,MAAA,gDACAhC,YAAA+zB,EAAA/zB,WAAA,GAIA+zB,CAAAA,SAAAA,EAAA7jB,MAAA,EAAA6jB,gBAAAA,EAAA7jB,MAAA,GACAzyB,EAAAzgB,KAAA,yBACA,IAAAnxB,EAAA,GACA,IACAA,EAAA8G,EAAA4wD,IAAA,CAAAzuD,MAAA,CAAAnC,KAAA,CAAA9G,IAAA,CAEA,MAAA8G,EAAA,EACA,IAAA23B,EAAAgyB,EAAAD,QAAA,CAAAmD,uBAAA,CAAAu0B,EAAA7jB,MAAA,CAAA6jB,EAAA/zB,WAAA,CAAAn0D,EAEA,OADAy+B,EAAAi5B,IAAA,EAA2BixB,QAAAT,EAAAphF,MAAAA,CAAA,EAC3B23B,CACA,CAEA,GAAAmT,GACAs2C,yBAAAA,EAAA7jB,MAAA,EACA,IAAAlQ,EAAA7C,EAAAotB,WAAA,CAAA17E,IAAA,CAAAklF,EAAA4E,iBAAA,EACAl7C,EAAAzgB,KAAA,kBAAAygB,EAAAzgB,KAAA,kBACA,GAAAqwD,EAAArrB,MAAA,0DACAhC,YAAAA,CACA,GAEAviB,EAAAzgB,KAAA,wBACA,GAAAqwD,EAAArrB,MAAA,+EACAhC,YAAAA,CACA,GAEAviB,EAAAzgB,KAAA,+EACA,GAAAqwD,EAAArrB,MAAA,oDACAhC,YAAAA,CACA,EAEA,CAGA,MAAArtD,CACA,CACA,MAAA0iF,gBAAA,CACA,YAAA5B,OAAA,CAEA,MAAAO,SAAAD,CAAA,EACA,OAAAA,EAAA7jB,MAAA,EACA,cACA,YAAAujB,OAAA,CAAAp/E,OAAA,KACA,iBACA,YAAAoqF,KAAA,UAA6Ch/B,OAAA,mBAC7C,mBACA,YAAAg/B,KAAA,UAA6Ch/B,OAAA,gBAC7C,sBAEA,oBAAAg0B,OAAA,CAAA9vF,IAAA,CACA,mBAEA,qBAAA8vF,OAAA,CAAA9vF,IAAA,CACA,eAGA,0DA6BA,kBAEA,YAAA86F,KAAA,YACAh/B,OAAA,UACAxrD,QAAA8/E,EAAA9/E,OAAA,CACA8rC,IAAAg0C,EAAA2B,QAAA,EAEA,2BACA,YAAA+I,KAAA,UACAh/B,OAAA,0BACAxrD,QAAA8/E,EAAA9/E,OAAA,CACA8rC,IAAAg0C,EAAA2B,QAAA,EAEA,eACA,YAAA+I,KAAA,UACAh/B,OAAA,cACAxrD,QAAA8/E,EAAA9/E,OAAA,CACA8rC,IAAAg0C,EAAA2B,QAAA,EAEA,kBACA,YAAA+I,KAAA,UACAh/B,OAAA,mBACAxrD,QAAA8/E,EAAA9/E,OAAA,CACAukF,SAAAzE,EAAAyE,QAAA,CACAz4C,IAAAg0C,EAAA2B,QAAA,EAEA,4BACA,YAAA+I,KAAA,UACAh/B,OAAA,yBACAxwD,IAAA8kF,EAAA4E,iBAAA,EACiB,IAAA/lC,KAAA,IACjB,KAAAi1C,WAAA,CAAA9T,EAAAphF,EAAAohF,EAAA4E,iBAAA,EAEA,gBACA,gBAAA5E,EACA,YAAA0K,KAAA,UACAh/B,OAAA,uBACA1f,IAAAg0C,EAAA2B,QAAA,CACAvjD,QAAA4hD,EAAA8E,mBAAA,eACA,GAEA,GAAAxL,EAAArrB,MAAA,iFACAC,UAAA,qBACA,EACA,sBACA,YAAAw8B,KAAA,UACAh/B,OAAA,2BACAqoC,OAAA/T,EAAA/vF,IAAA,EAEA,6BACA,YAAAy6F,KAAA,UACAh/B,OAAA,4BACAqoC,OAAA/T,EAAA/vF,IAAA,EAEA,aACA,GAAA+vF,WAAAA,EAAA2B,QAAA,CACA,oEAEA,IAAAqS,EAAA,KAAAJ,uBAAA,CAAA5T,EAAA/zB,WAAA,CACA+nC,CAAAA,EAAA9wF,MAAA,SACA8wF,EAAAtoC,MAAA,YACA,IACA,kBAAAg/B,KAAA,SAAAsJ,EAAA,GACA,CACA,MAAAp1F,EAAA,CACA,YAAAk1F,WAAA,CAAA9T,EAAAphF,EAAAohF,EAAA/zB,WAAA,CACA,CACA,CACA,mBACA,IAAA+nC,EAAA,KAAAJ,uBAAA,CAAA5T,EAAA/zB,WAAA,CACA+nC,CAAAA,EAAA9wF,MAAA,SACA8wF,EAAAtoC,MAAA,mBACA,IACA,kBAAAg/B,KAAA,SAAAsJ,EAAA,GACA,CACA,MAAAp1F,EAAA,CACA,YAAAk1F,WAAA,CAAA9T,EAAAphF,EAAAohF,EAAA/zB,WAAA,CACA,CACA,CAwDA,CACA,aAAAg0B,SAAAD,EACA,CACA,MAAAiC,YAAA,CACA,YAAAvC,OAAA,CAOA,MAAAuU,eAAA,OACA,iBAAAvU,OAAA,CAAA9vF,IAAA,CACA,EAEAskG,WAAA,YAAAxJ,KAAA,UAAuDh/B,OAAA,YAAoB,EAAAyoC,MAAA,CAC3E,CAKA,MAAAC,YAAAtS,CAAA,MAhhBA7wF,EAihBA,IAAAiP,EAAA,KAAAuhF,WAAA,CAAAK,IAjhBA7wF,EAkhBAiP,IAjhBA,mBAAAjP,EAAAkqD,IAAA,EAkhBAj7C,CAAAA,EAAA,MAAAA,CAAA,EAEA,IACA,IAAAygF,EAAA,WAAA+J,KAAA,aACAh/B,OAAA,SAAAxrD,QAAAA,CACA,GACA45D,EAAA54D,KAAAF,KAAA,CAAA2/E,GACA,WAAAx3B,EAAAlH,QAAA,CAAA/hD,EAAA45D,EAAA,KACA,CACA,MAAAl7D,EAAA,CACA,WACA,CACA,CACA+yF,qBAAA,CACA,kBAAAF,MAAA,CAEA,CACAzgG,EAAAkjF,iBAAyB,CAAAA,sCCxkBzBpjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2jF,gBAAwB,QAOxB,IAAApsB,EAAmBzzD,EAAQ,OAC3B05F,EAA+B15F,EAAQ,OACvCmpF,EAAqBnpF,EAAQ,OAC7B88D,EAAAn/D,OAAA,KACA8+E,EAAA9+E,OAAA,KAYA,SAAAutD,IAAqB,WAAAxjD,OAAAwjD,OAAA,GACrB,SAAA7+C,EAAAlQ,CAAA,EACA,OAAAiQ,KAAAC,SAAA,CAAAlQ,EAAA,CAAAoQ,EAAApQ,IACA,iBAAAA,EACA,CAAqB0a,KAAA,SAAA1a,MAAAA,EAAA+J,QAAA,IAErB/J,EAEA,CAEA,IAAAojG,EAAA,CAAwBC,aAAA,IAAAC,SAAA,EAAAC,OAAA,GACxBC,EAAA,CACAjT,YAAA,GAAAkT,SAAA,EAAAC,cAAA,EAAAC,eAAA,EACAC,UAAA,GAAAC,kBAAA,EAAAC,gBAAA,EAAAC,MAAA,EACAvV,SAAA,KAAAwV,cAAA,KAAAC,WAAA,EACAC,gBAAA,KAAAC,yBAAA,CACA,EACA,eAAAC,EAAAhuF,CAAA,CAAAm6E,CAAA,EACA,KAAAn6E,CAAAA,EAAAm6E,WAAA,IAAAn6E,EAAAm6E,WAAA,CAAAA,CAAA,IACAn6E,EAAA4tF,aAAA,EACA5tF,CAAAA,EAAA4tF,aAAA,YACA,IACA,IAAAzT,EAAA,MAAAn6E,EAAAq3C,QAAA,CAAA6iC,cAAA,GACAC,EAAAn6E,EAAAm6E,WAAA,EACAn6E,CAAAA,EAAAm6E,WAAA,CAAAA,CAAA,CAEA,CACA,MAAA5iF,EAAA,CACAyI,EAAAm6E,WAAA,IACAn6E,EAAA8tF,eAAA,CAAAv2F,EACAyI,EAAA+tF,wBAAA,CAAAp1C,GACA,CACA34C,EAAA4tF,aAAA,KACA,IAAa,EAEb,MAAA5tF,EAAA4tF,aAAA,CACA5tF,EAAAwtF,SAAA,IACAxtF,EAAA8tF,eAAA,IAIA,CACA,SAAAG,EAAArkG,CAAA,EACA,GAAAA,MAAAA,EACA,aAEA,GAAA4J,MAAA8J,OAAA,CAAA1T,GACA,YAAAoa,GAAA,CAAAiqF,GAAAl3C,IAAA,UAEA,oBAAAntD,GAAA,mBAAAA,EAAAkhF,MAAA,CACA,OAAAmjB,EAAArkG,EAAAkhF,MAAA,IAEA,cAAAlhF,GACA,cACA,aACA,OAAAA,EAAA+J,QAAA,EACA,cACA,aACA,OAAAvI,OAAAxB,GAAA+J,QAAA,EACA,cACA,OAAAkG,KAAAC,SAAA,CAAAlQ,EACA,eACA,IAAA0xD,EAAA7xD,OAAA6xD,IAAA,CAAA1xD,GAEA,OADA0xD,EAAAl0C,IAAA,GACA,IAAqBk0C,EAAAt3C,GAAA,OAAuBnK,KAAAC,SAAA,CAAAS,GAAkB,GAAG0zF,EAAArkG,CAAA,CAAA2Q,EAAA,EAAqB,GAAAw8C,IAAA,SACtF,CACA,CAEA,MADAz/C,QAAAI,GAAA,uBAAA9N,GACA,eACA,CACA,SAAAskG,EAAAtkG,CAAA,EACA,aAAAA,EAAA,CACA,IAAA2N,EAAA3N,EAAA2N,KAAA,CACA,OAAiBotC,IAAAspD,EAAA12F,GAAA3N,MAAA2N,CAAA,CACjB,CACA,IAAAmC,EAAA9P,EAAA8P,MAAA,CACA,OAAairC,IAAAspD,EAAAv0F,GAAA9P,MAAA8P,CAAA,CACb,CAGA,SAAAy0F,EAAA3L,CAAA,CAAA4L,CAAA,EACA,IAAAC,EAAA,IAAAr0D,IACA,QAAiBpwC,MAAAA,CAAA,CAAA+6C,IAAAA,CAAA,CAAAwoD,OAAAA,CAAA,IAAqBiB,EAAA,CACtC,IAAA1/F,EAAA2/F,EAAAvzF,GAAA,CAAA6pC,IAAA,CAAsC/6C,MAAAA,EAAAujG,OAAA,EACtCz+F,CAAAA,EAAAy+F,MAAA,EAAAA,EACAkB,EAAAp9F,GAAA,CAAA0zC,EAAAj2C,EACA,CACA,IAAA4/F,EAAA,KACA,QAAAl8D,KAAAi8D,EAAAzqC,MAAA,GACAxxB,EAAA+6D,MAAA,EAAA3K,GAAA,EAAA8L,GAAAl8D,EAAA+6D,MAAA,CAAAmB,EAAAnB,MAAA,GACAmB,CAAAA,EAAAl8D,CAAAA,EAGA,GAAAk8D,EACA,OAAAA,EAAA1kG,KAAA,CAIA,SAAA2kG,EAAA/L,CAAA,CAAA4L,CAAA,EACA,IAAAI,EAAA,EACAC,EAAA,IAAAz0D,IACA00D,EAAA,KACA9qC,EAAA,GACA,QAAiBh6D,MAAAA,CAAA,CAAA+6C,IAAAA,CAAA,CAAAwoD,OAAAA,CAAA,IAAqBiB,EACtC,GAAAxkG,aAAAquC,MAAA,CACA,IAAA/I,EAAAu/D,EAAA3zF,GAAA,CAAA6pC,IAAA,CAA6C/6C,MAAAA,EAAAujG,OAAA,EAC7Cj+D,CAAAA,EAAAi+D,MAAA,EAAAA,EACAsB,EAAAx9F,GAAA,CAAA0zC,EAAAzV,GACAw/D,CAAAA,MAAAA,GAAAx/D,EAAAi+D,MAAA,CAAAuB,EAAAvB,MAAA,GACAuB,CAAAA,EAAAx/D,CAAAA,CAEA,MAEA00B,EAAAn1D,IAAA,CAAArD,OAAAxB,IACA4kG,GAAArB,EAGA,GAAAqB,EAAAhM,SAEA,GAAAkM,EAAAvB,MAAA,EAAA3K,EACAkM,EAAA9kG,KAAA,CAGA,OAGAg6D,EAAAx8C,IAAA,EAAAhf,EAAAF,IAAA,EAAAA,EAAA,KAAAE,EAAA,KACA,IAAAumG,EAAA99F,KAAAuC,KAAA,CAAAwwD,EAAAl7D,MAAA,WAEA,EAAAA,MAAA,GACAk7D,CAAA,CAAA+qC,EAAA,CAGA,CAAA/qC,CAAA,CAAA+qC,EAAA,GAAA/qC,CAAA,CAAA+qC,EAAA,CAAApkC,CAAA,EAAA2f,CACA,CACA,SAAA0kB,EAAApM,CAAA,CAAA4L,CAAA,EAEA,IAAA10F,EAAAy0F,EAAA3L,EAAA4L,GACA,GAAA10F,KAAA/M,IAAA+M,EACA,OAAAA,EAGA,QAAA04B,KAAAg8D,EACA,GAAAh8D,EAAAxoC,KAAA,CACA,OAAAwoC,EAAAxoC,KAAA,CA0CA,MAAA0jF,UAAA6Z,EAAA5Z,gBAAA,CAKAiV,MAAA,CAIAqM,WAAA,CAIAC,YAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,aAQAlN,CAAA,CAAA1J,CAAA,CAAA3pD,CAAA,EACA,MAAA2pD,EAAA3pD,GACA,MAAAqgE,EAAA,CAAAhN,EAAA/9E,GAAA,IACA,aAAAmjF,EAAA5Z,gBAAA,CACA9jF,OAAAwM,MAAA,EAAuCohD,SAAAr8C,CAAA,EAAagyF,EAAAI,GAGpD3jG,OAAAwM,MAAA,IAAuC+2F,EAAAhyF,EAAAoyF,IAGvC,MAAA4B,EAAA,IACA,MAAAC,EAAA,MACAvgE,GAAAA,MAAAA,EAAA8zD,MAAA,CACA,KAAAA,MAAA,CAAA9zD,EAAA8zD,MAAA,CAGA,KAAAA,MAAA,CAAA3xF,KAAA4oB,IAAA,OAAAs1E,EAAA,CAAAn/D,MAAA,EAAAu2B,EAAAnmD,IACAmmD,GAAAnmD,EAAAmtF,MAAA,CAEa,MAEb,KAAA0B,WAAA,GACA,KAAAC,YAAA,GACA,GAAA5tC,EAAAiC,cAAA,OAAAq/B,MAAA,QAAAuM,EAAA,CAAAn/D,MAAA,EAAAxnC,EAAAosB,IAAApsB,EAAAosB,EAAA24E,MAAA,kDAAA3K,MAAA,CACA,CACA,IAAA0M,iBAAA,CACA,aAAAH,EAAA,CAAA/qF,GAAA,KACA,IAAAtK,EAAAjQ,OAAAwM,MAAA,IAA2Cue,GAC3C,QAAAxa,KAAAN,EACA,MAAAM,CAAA,KACA,OAAAN,CAAA,CAAAM,EAAA,CAGA,OAAAN,CACA,EACA,CACA,MAAAugF,gBAAA,CACA,OAAArD,EAAAxK,OAAA,CAAA34E,IAAA,IAAAytD,EAAAwJ,SAAA,aAAAkuB,QAAA,EAAyF9jB,OAAA,aACzF,CAQA,MAAAq6B,kBAAA93C,CAAA,CAAAshC,CAAA,EACA,OAAAA,EAAA7jB,MAAA,EACA,2BACA,aAAAzd,EAAAgmC,oBAAA,CAAA1E,EAAA4E,iBAAA,CACA,YACA,aAAAlmC,EAAArhD,IAAA,CAAAvM,OAAAwM,MAAA,IAA2D0iF,EAAA/zB,WAAA,EAAqB01B,SAAA3B,EAAA2B,QAAA,GAChF,eACA,aAAAjjC,EAAAujC,UAAA,IAAA3hF,OAAA,KACA,cACA,aAAAo+C,EAAA0oB,WAAA,CAAA4Y,EAAA/zB,WAAA,CACA,kBACA,aAAAvN,EAAA2lC,UAAA,CAAArE,EAAA9/E,OAAA,CAAA8/E,EAAA2B,QAAA,CACA,iBACA,IAAA76B,EAAA,cAAAk5B,EAAAA,EAAA6B,SAAA,CAAA7B,EAAA2B,QAAA,CACA,aAAAjjC,EAAAkvB,QAAA,CAAA9mB,EAAAk5B,EAAA8E,mBAAA,CACA,CACA,qBACA,aAAApmC,EAAA6iC,cAAA,EACA,eACA,aAAA7iC,EAAAusB,OAAA,CAAA+U,EAAA9/E,OAAA,CAAA8/E,EAAA2B,QAAA,CACA,mBACA,aAAAjjC,EAAA0jC,UAAA,IAAAG,QAAA,KACA,iBACA,aAAA7jC,EAAA0jC,UAAA,IAAAM,oBAAA,KACA,UACA,aAAAhkC,EAAAqtB,OAAA,CAAAiU,EAAAv0D,MAAA,CACA,kBACA,aAAAizB,EAAA6lC,UAAA,CAAAvE,EAAA9/E,OAAA,CAAA8/E,EAAAyE,QAAA,CAAAzE,EAAA2B,QAAA,CACA,sBACA,aAAAjjC,EAAAmvB,cAAA,CAAAmS,EAAA/vF,IAAA,CACA,2BACA,aAAAyuD,EAAA4lC,mBAAA,CAAAtE,EAAA9/E,OAAA,CAAA8/E,EAAA2B,QAAA,CACA,6BACA,aAAAjjC,EAAAovB,qBAAA,CAAAkS,EAAA/vF,IAAA,CACA,4BACA,aAAAyuD,EAAAumC,oBAAA,CAAAjF,EAAA/vF,IAAA,CACA,CACA,CAGA,CAAAwmG,EAAA,CAAAC,CAAA,EAIA,IAAAN,EAAAv7F,MAAAC,IAAA,CAAA47F,GAAArrF,GAAA,IAAAouB,EAAApyB,MAAA,EAEAsvF,EAAA,MAAAP,EAAA,CAAAt1F,KAAA,GAGA,QAAAuG,MAFAuvF,SA1TA96F,CAAA,EACA,QAAA7I,EAAA6I,EAAA/L,MAAA,GAAmCkD,EAAA,EAAOA,IAAA,CAC1C,IAAA+C,EAAAkC,KAAAuC,KAAA,CAAAvC,KAAA2+F,MAAA,GAAA5jG,CAAAA,EAAA,IACAyK,EAAA5B,CAAA,CAAA7I,EAAA,CACA6I,CAAA,CAAA7I,EAAA,CAAA6I,CAAA,CAAA9F,EAAA,CACA8F,CAAA,CAAA9F,EAAA,CAAA0H,CACA,CACA,EAmTAi5F,GACAA,EAAAloF,IAAA,EAAAhf,EAAAF,IAAAE,EAAA8kG,QAAA,CAAAhlG,EAAAglG,QAAA,EACAoC,GACA,IAAAtvF,EAAA8tF,eAAA,EAGAiB,KAAAA,EAAAl3E,OAAA,CAAA7X,GACA,OAAAA,EAGA,WACA,CAEA,CAAAyvF,EAAA,CAAAJ,CAAA,CAAA1W,CAAA,EACA,IAAA34E,EAAA,MAAAovF,EAAA,CAAAC,GAEA,GAAArvF,MAAAA,EACA,YAGA,IAAAsgE,EAAA,CACAtgE,OAAAA,EAAAtG,OAAA,KAAAg2F,QAAA,GACAhX,QAAA,KAAAiX,QAAA,IACA,EACAv6F,EAAAujD,IAwBA,OAtBA2nB,EAAAoY,OAAA,YACA,IACA14E,EAAAqtF,QAAA,GACA,IAAA3zF,EAAA,WAAAy1F,iBAAA,CAAAnvF,EAAAq3C,QAAA,CAAAshC,EACArY,CAAAA,EAAA5mE,MAAA,EAAkCA,OAAAA,CAAA,CAClC,CACA,MAAAnC,EAAA,CACAyI,EAAAutF,cAAA,GACAjtB,EAAA5mE,MAAA,EAAkCnC,MAAAA,CAAA,CAClC,CACA,IAAAq4F,EAAAj3C,IAAAvjD,CACA4K,CAAAA,EAAA6tF,UAAA,EAAA+B,EACA5vF,EAAA0tF,eAAA,KAAA1tF,EAAA0tF,eAAA,KAAAkC,EACAtvB,EAAAoY,OAAA,KACA,KAGApY,EAAAqvB,OAAA,gBA7VAE,CA8VA,QA9VAA,EA8VA7vF,EAAAitF,YAAA,CA7VA,IAAA55C,QAAA,IAAsCilC,WAAAhlC,EAAAu8C,EAAA,IA8VtCvvB,EAAAqvB,OAAA,KACA,KACAN,EAAAllG,GAAA,CAAAm2E,GACAA,CACA,CAGA,OAAAwvB,EAAA,GACA,IAAAA,EAAA,MAAAb,EAAA,CACA,IAAAa,EAAA,CACA,IAAAngC,EAAA,GACA,MAAAo/B,EAAA,CAAAlxF,OAAA,KACA8xD,EAAAlhE,IAAA,YACA,MAAAu/F,EAAAhuF,EAAA,GACAA,EAAA8tF,eAAA,EACA9tF,CAAAA,EAAAo4E,QAAA,OAAAp4E,EAAAq3C,QAAA,CAAAujC,UAAA,GAEA,KACA,GACA,MAAAqU,EAAA,CAAAa,EAAA,WAEA,MAAAz8C,QAAA6F,GAAA,CAAAyW,GAEA,IAAA12D,EAAA,KACA,QAAA+G,KAAA,MAAA+uF,EAAA,EACA,GAAA/uF,EAAA8tF,eAAA,CACA,SAEA,IAAAzV,EAAAr4E,EAAAo4E,QAAA,OACAn/E,EACAA,EAAAo/E,EAAAp/E,OAAA,CAEAo/E,EAAAp/E,OAAA,GAAAA,GACA,GAAAioD,EAAA0F,MAAA,2EACAC,UAAA,sBACA,EAEA,CACA,IACA,CACA,MAAAipC,CACA,CACA,OAAA3B,EAAA,CAAAkB,CAAA,CAAA1W,CAAA,EAEA,IAAAyV,EAAA,GACA,QAAA9tB,KAAA+uB,EACA,GAAA/uB,MAAAA,EAAA5mE,MAAA,EACA,IAAwBirC,IAAAA,CAAA,CAAA/6C,MAAAA,CAAA,EAAaskG,EAAA5tB,EAAA5mE,MAAA,EACrC00F,EAAA3/F,IAAA,EAA+Bk2C,IAAAA,EAAA/6C,MAAAA,EAAAujG,OAAA7sB,EAAAtgE,MAAA,CAAAmtF,MAAA,EAC/B,CAGA,IAAAiB,CAAAA,EAAAx+D,MAAA,EAAAxnC,EAAAgqC,IAAAhqC,EAAAgqC,EAAA+6D,MAAA,SAAA3K,MAAA,GAGA,OAAA7J,EAAA7jB,MAAA,EACA,sBAEA,WAAAk6B,EAAA,EACA,OAAAA,EAAA,CAAAn+F,KAAA4oB,IAAA,IAAAynC,EAAAqF,SAAA,EAAAgoC,EAAA,KAAA/L,MAAA,OAAAuM,EAAA,CAAA3qE,MAAA,KAAA5P,EAAAs5E,eAAA,EAAA9pF,GAAA,MACApa,MAAA4qB,EAAA2lE,WAAA,CACAx1C,IAAA,GAAAuc,EAAAqF,SAAA,EAAA/xC,EAAA2lE,WAAA,EAAAxmF,QAAA,GACAw5F,OAAA34E,EAAA24E,MAAA,CACA,KAAqB,EAIrB,IAAAr0E,EAAAi3E,SAzQAvN,CAAA,CAAA4L,CAAA,MAiBA4B,EAhBA,GAAAxN,IAAAA,EACA,SAAAthC,EAAAqF,SAAA,EAAAgoC,EAAA/L,EAAA4L,GAAA,aAEA,IAAAC,EAAA,IAAAr0D,IACA7vC,EAAA,CAAAuP,EAAAyzF,KACA,IAAAz+F,EAAA2/F,EAAAvzF,GAAA,CAAApB,IAAA,CAAyCA,OAAAA,EAAAyzF,OAAA,EACzCz+F,CAAAA,EAAAy+F,MAAA,EAAAA,EACAkB,EAAAp9F,GAAA,CAAAyI,EAAAhL,EACA,EACA,QAAiBy+F,OAAAA,CAAA,CAAAvjG,MAAAA,CAAA,IAAgBwkG,EAAA,CACjC,IAAAh8D,EAAA,GAAA8uB,EAAAqF,SAAA,EAAA38D,GACAO,EAAAioC,EAAA,EAAA+6D,GACAhjG,EAAAioC,EAAA+6D,GACAhjG,EAAAioC,EAAA,EAAA+6D,EACA,CACA,IAAA8C,EAAA,EAEA,QAAiB9C,OAAAA,CAAA,CAAAzzF,OAAAA,CAAA,IAAiB20F,EAAAzqC,MAAA,GAIlCupC,GAAA3K,GAAA2K,CAAAA,EAAA8C,GAAAD,MAAAA,GAAA7C,IAAA8C,GAAAv2F,EAAAs2F,CAAA,IACAC,EAAA9C,EACA6C,EAAAt2F,GAGA,OAAAs2F,CACA,EA6OA,KAAAxN,MAAA,CAAA4L,GACA,GAAAt1E,KAAAnsB,IAAAmsB,EACA,OAKA,OAHAA,EAAA,MAAAk2E,EAAA,EACA,OAAAA,EAAA,CAAAl2E,CAAA,EAEA,MAAAk2E,EAAA,CAEA,kBACA,qBACA,kBACA,OAAAT,EAAA,KAAA/L,MAAA,CAAA4L,EACA,gBAGA,gBAAAzV,GAAAA,YAAAA,EAAA2B,QAAA,CACA,OAAAsU,EAAA,KAAApM,MAAA,CAAA4L,GAEA,OAAAD,EAAA,KAAA3L,MAAA,CAAA4L,EACA,YACA,cACA,iBACA,0BACA,cACA,iBACA,qBACA,4BACA,cACA,OAAAD,EAAA,KAAA3L,MAAA,CAAA4L,EACA,4BACA,OAAAQ,EAAA,KAAApM,MAAA,CAAA4L,EACA,CACA,GAAAltC,EAAA0F,MAAA,mDACAC,UAAA,YAAmC/sD,EAAA6+E,EAAA7jB,MAAA,EAAsB,KAEzD,CACA,OAAAo7B,EAAA,CAAAb,CAAA,CAAA1W,CAAA,EACA,GAAA0W,IAAAA,EAAA71E,IAAA,CACA,4BAIA,IAAA22E,EAAA,GACAC,EAAA,EACA,QAAA9vB,KAAA+uB,EAAA,CAMA,GAJA/uB,EAAAoY,OAAA,EACAyX,EAAA1hG,IAAA,CAAA6xE,EAAAoY,OAAA,EAGApY,EAAAqvB,OAAA,EACAQ,EAAA1hG,IAAA,CAAA6xE,EAAAqvB,OAAA,EACA,QACA,EAEArvB,EAAAovB,OAAA,GAIApvB,EAAAovB,OAAA,IACAU,IACA,CAEA,IAAAxmG,EAAA,YAAAukG,EAAA,CAAAkB,EAAA1W,GACA,GAAA/uF,KAAA+C,IAAA/C,EAAA,CACA,GAAAA,aAAAquC,MACA,MAAAruC,EAEA,OAAAA,CACA,CAGA,QAAAgC,EAAA,EAAwBA,EAAAwkG,EAAgBxkG,IACxC,MAAA6jG,EAAA,CAAAJ,EAAA1W,GAWA,MARA,GAAAz3B,EAAA0F,MAAA,EAAAupC,EAAAznG,MAAA,oCACA0wF,QAAA,gBACAjxB,KAAA,CAAoBixB,QAAAT,EAAAyV,QAAA56F,MAAAC,IAAA,CAAA47F,GAAArrF,GAAA,IAAAlK,EAAAs4B,EAAA14B,MAAA,GACpB,GAEA,MAAA25C,QAAAg9C,IAAA,CAAAF,GAGA,YAAAD,EAAA,CAAAb,EAAA1W,EACA,CACA,MAAAC,SAAAD,CAAA,EAIA,GAAAA,yBAAAA,EAAA7jB,MAAA,EAGA,IAAAs5B,EAAA,MAAAW,EAAA,CAAA/qF,GAAA,UACAssF,EAAA,MAAAvB,EAAA,CAAA/qF,GAAA,QAA0DqzC,SAAAA,CAAA,CAAA81C,OAAAA,CAAA,CAAkB,CAAAlpF,KAC5E,IACA,IAAAvK,EAAA,MAAA29C,EAAAuhC,QAAA,CAAAD,EACAyV,CAAAA,CAAA,CAAAnqF,EAAA,CAAAxa,OAAAwM,MAAA,CAAAi4F,EAAA,CAAqEx0F,OAAAA,CAAA,GAAQ,CAAKyzF,OAAAA,CAAA,EAClF,CACA,MAAA51F,EAAA,CACA62F,CAAA,CAAAnqF,EAAA,CAAAxa,OAAAwM,MAAA,CAAAi4F,EAAA,CAAqE32F,MAAAA,CAAA,GAAO,CAAK41F,OAAAA,CAAA,EACjF,CACA,GAEA,QAGA,QAA6BvjG,MAAAA,CAAA,IAD7BwkG,EAAAhqE,MAAA,IAAAgO,MAAAA,GAEA,IAAAxoC,CAAAA,aAAAquC,KAAA,EACA,OAAAruC,EASA,IAAA8P,EAAAy0F,EAAA,KAAA3L,MAAA,CAAA4L,EAAAhqE,MAAA,IAAAgO,MAAAA,IACA,MAAA8uB,EAAA+I,OAAA,EAAAvwD,EAAA,sBACA,MAAAA,EAGA,IAAA62F,EAAAD,EAAAlsE,MAAA,EAAAl8B,EAAA0D,IAAAwiG,MAAAA,CAAA,CAAAxiG,EAAA,EACA,GAAA2kG,IAAAA,EAAA7nG,MAAA,CACA,KAEA,OAAA2qD,QAAAg9C,IAAA,CAAAE,EACA,CAGA,IAAA72F,EAAAk1F,EAAA,KAAApM,MAAA,CAAA4L,GAKA,GAJA,GAAAltC,EAAA0F,MAAA,EAAAltD,KAAA/M,IAAA+M,EAAA,6CACA0/E,QAAA,gBACAjxB,KAAA,CAAwBixB,QAAAT,EAAAyV,QAAAA,EAAApqF,GAAA,CAAAlK,EAAA,CACxB,GACAJ,aAAAu+B,MACA,MAAAv+B,EAEA,OAAAA,CACA,CACA,YAAAo2F,EAAA,GAEA,IAAAT,EAAA,IAAA3jC,IACA8kC,EAAA,EACA,QACA,IAAAlwB,EAAA,MAAAmvB,EAAA,CAAAJ,EAAA1W,GACA,SAAArY,GAIAkwB,CADAA,GAAAlwB,EAAAtgE,MAAA,CAAAmtF,MAAA,GACA,KAAA3K,MAAA,CAHA,KAMA,CACA,IAAA9oF,EAAA,YAAAw2F,EAAA,CAAAb,EAAA1W,GAGA,QAAArY,KAAA+uB,EACA/uB,EAAAoY,OAAA,EAAApY,MAAAA,EAAA5mE,MAAA,EACA4mE,EAAAtgE,MAAA,CAAAstF,aAAA,GAGA,OAAA5zF,CACA,CACA,MAAApI,SAAA,CACA,QAAqB+lD,SAAAA,CAAA,IAAW,MAAA03C,EAAA,CAChC13C,EAAA/lD,OAAA,GAEA,MAAAA,SACA,CACA,CACA3H,EAAA2jF,gBAAwB,CAAAA,sCCpmBxB7jF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAijF,cAAsB,CAAGjjF,EAAAgjF,uBAA+B,QA8BxD,IAAAzrB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtCg0F,EAAgCh0F,EAAQ,OACxCgjG,EAAA,kCAuDA,OAAA9jB,UAAA8U,EAAAnV,iBAAA,CAIA+V,SAAA,CAOAD,aAAA,aAIA/J,CAAA,CAAAgK,CAAA,EACA,IAAAhrC,EAAA,IAAAu1B,EAAAyL,EAAAgK,GACA1J,EAAAthC,EAAAq5C,cAAA,GACA,GAAAxvC,EAAA0F,MAAA,GAAA+xB,EAAAgY,WAAA,yEAA4H9pC,UAAA,0CAE5H,MADA8xB,EAAAO,GAAA,CAAA39E,OAAA,gBAAAA,OAAA,mBACA87C,EAAA+gC,QAAA,EACA,GAAAl3B,EAAAlB,gBAAA,QACAqiC,UAAAhrC,EAAAgrC,SAAA,CACAD,cAAA/qC,EAAA+qC,aAAA,EAEA,CACAkI,qBAAA,CACA,YAAAjI,SAAA,GAAAoO,CACA,CACA,CACA9mG,EAAAgjF,uBAA+B,CAAAA,CAU/B,OAAAC,UAAA4U,EAAApU,eAAA,CAIAiV,SAAA,CAOAD,aAAA,aAIAhK,CAAA,CAAAiK,CAAA,CAAAD,CAAA,EACA,MAAAhK,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAAiK,GACAA,CAAAA,EAAAoO,CAAA,EAEA,MAAArO,GACAA,CAAAA,EAAA,MAGA,MADAxV,EAAAyd,UAAA,CAAAhS,EAAAgK,EAAAD,GACA/J,EAAA,CAAkCyJ,cAAAzJ,CAAA,GAClC,GAAAn3B,EAAAlB,gBAAA,QAAiDqiC,UAAAA,EAAAD,cAAAA,CAAA,EACjD,CACAtE,aAAA7kF,CAAA,EACA,IACA,WAAA2zE,EAAA3zE,EAAA,KAAAopF,SAAA,MAAAD,aAAA,CACA,CACA,MAAA7qF,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CACAqxF,qBAAA,CACA,YAAAjI,SAAA,GAAAoO,CACA,CAIA,OAAAG,qBAAAvY,CAAA,CAAAgK,CAAA,EACA,WAAA1V,EAAA0L,EAAAgK,EACA,CAKA,OAAAgI,WAAAhS,CAAA,CAAAgK,CAAA,CAAAD,CAAA,EACA,MAAAC,GACAA,CAAAA,EAAAoO,CAAA,EAEA,MAAArO,GACAA,CAAAA,EAAA,MAEA,IAAAhJ,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SAvJhEhiG,CAAA,EACA,OAAAA,GACA,cACA,yBACA,cACA,wBACA,eACA,yBACA,gBACA,kCACA,uBACA,iCACA,wBACA,kCACA,YACA,8BACA,oBACA,6BACA,oBACA,8BACA,WACA,uCACA,YACA,uCACA,aACA,+BACA,oBACA,8BACA,qBACA,+BACA,aACA,iCACA,kBACA,8BACA,oBACA,gCACA,gBACA,kCACA,uBACA,iCACA,wBACA,kCACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EA2GgE8vF,EAAA9vF,IAAA,EAAsB,MAAM85F,EAAU,GAWtG,OAVAjJ,EAAAoR,SAAA,IACApI,GACAhJ,EAAAyX,cAAA,IAAAzO,GAEAC,IAAAoO,GACArX,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,oBACA,GACA,EAEA6J,CACA,CACA,CACAzvF,EAAAijF,cAAsB,CAAAA,oCC1MtBnjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA6iF,iBAAyB,QAEzB7iF,EAAA6iF,iBAAyB,CADzB7/E,KAAAA,qCCSAlD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAyjF,eAAuB,CAAGzjF,EAAAihG,yBAAiC,CAAGjhG,EAAA0jF,kBAA0B,CAAG1jF,EAAAwjF,aAAqB,QAIhH,IAAAjsB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BykF,EAAmBzkF,EAAQ,OAC3B05F,EAA+B15F,EAAQ,OACvC25F,EAA6B35F,EAAQ,OACrCmpF,EAAqBnpF,EAAQ,OAC7BqjG,EAAiCrjG,EAAQ,OACzCopF,EAAgCppF,EAAQ,OACxCsjG,EAAA,+CAAA9lG,KAAA,OAEA,SAAA+lG,EAAApnG,CAAA,EACA,SAAAA,GAAAmnG,EAAAl5E,OAAA,QAAAjuB,IAAA,GAIA,mBAAAA,EAAA6vD,UAAA,CAHA,OAAA7vD,EAMA,GAAA4J,MAAA8J,OAAA,CAAA1T,GACA,OAAAA,EAAAoa,GAAA,CAAAgtF,GAEA,oBAAApnG,EACA,OAAAH,OAAA6xD,IAAA,CAAA1xD,GAAAgmC,MAAA,EAAAu2B,EAAAnsD,KACAmsD,CAAA,CAAAnsD,EAAA,CAAApQ,CAAA,CAAAoQ,EAAA,CACAmsD,GACS,GAET,mCAA0Cv8D,EAAA,EAAO,EAAG,OAAAA,EAAe,GACnE,CAIA,SAAAqnG,EAAArnG,CAAA,SACA,EACAA,EAAA0R,WAAA,GAEA1R,CACA,CACA,SAAAsnG,EAAAtnG,CAAA,EACA,OAAAA,GAAA,iBAAAA,EAAA8tF,eAAA,CAEA,IAAAF,EAAA,CACAkT,QAAA,GACA5I,cAAA,KACAqP,eAAA,GACAC,aAAA,QACArG,cAAA,IACAtT,aAAA,IACAC,gBAAA,GACA,CAEA,OAAAvK,UAAAia,EAAA1Z,cAAA,CACA70E,OAAA,aACAw+C,CAAA,CAAAx+C,CAAA,EACA,MAAAw+C,GACAx+C,EAAA,GAAAipD,EAAArI,UAAA,EAAA5gD,GACA,GAAAq5E,EAAAlyB,gBAAA,QAAiDnnD,QAAAA,CAAA,EACjD,CACA4qE,QAAApsB,CAAA,EACA,GAAA66B,EAAAtrB,MAAA,+DACAC,UAAA,gBACA,EACA,CACA,MAAApN,YAAA,CACA,YAAA5gD,OAAA,CAGA,MAAAqqE,oBAAA5e,CAAA,EACA,kBAAAg8B,YAAA,CAAAh8B,EACA,CAGA,MAAA+sC,yBAAA5V,CAAA,EACA,IAAAn3B,EAAA0sC,EAAAvV,GACA9rB,EAAA,GAEA,GAAArL,EAAA7wD,IAAA,EACA,IAAA8qE,EAAAja,EAAA7wD,IAAA,CACAk8D,EAAAlhE,IAAA,YACA,IAAAgF,EAAA,SAAAquD,EAAA8b,cAAA,EAAAW,EAAA,KAAAlnB,QAAA,EACA,GAAA66B,EAAA/uB,cAAA,EAAA1vD,MAAAA,GAAAA,EAAA6H,WAAA,UAAAzC,OAAA,CAAAyC,WAAA,yCAAAmgF,GACAn3B,EAAA7wD,IAAA,CAAAA,CACA,KACA,MAEA6wD,EAAA7wD,IAAA,MAAAoF,OAAA,CAWA,GANA,MAAAyrD,EAAAi8B,QAAA,EACA5wB,EAAAlhE,IAAA,YACA61D,EAAAi8B,QAAA,YAAAlpC,QAAA,CAAA0oB,WAAA,EAAgE,GAAAzb,CAAA,CAAA7wD,KAAA,KAAAoF,OAAA,EAChE,MAGAyrD,MAAAA,EAAA7yD,EAAA,EACA,IAAA6/F,EAAAhtC,EAAA7yD,EAAA,CACAk+D,EAAAlhE,IAAA,YACA61D,EAAA7yD,EAAA,UAAAqwD,EAAA8b,cAAA,EAAA0zB,EAAA,KAAAj6C,QAAA,CACA,KACA,CAEAsY,EAAAjnE,MAAA,EACA,MAAA2qD,QAAA6F,GAAA,CAAAyW,GAEA,IAAA4hC,EAAA,KAAAl6C,QAAA,CAAAm6C,iBAAA,CAAAltC,GACA,YAAAjN,QAAA,CAAAksB,IAAA,wBAAAguB,EAAA,CACA,CACA,MAAArxB,gBAAA5b,CAAA,EAEA,IAAA61B,EAAA,WAAA9iC,QAAA,CAAA6iC,cAAA,GAEAtxF,EAAA,WAAAyoG,wBAAA,CAAA/sC,GAIA,iBAAAjR,QAAA,CAAAC,EAAAC,KACA,IAAAk+C,EAAA,UACAC,EAAA,EACAC,EAAA,UACA,IAEA,IAAArtC,EAAA,WAAAjN,QAAA,CAAAmvB,cAAA,CAAA59E,GACA,GAAA07D,MAAAA,EAAA,CACAhR,EAAAgR,EAAAk5B,sBAAA,CAAArD,IACA,MACA,CACA,CACA,MAAA5iF,EAAA,CAKA,MAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,iBAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,aACA,GAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,iBAAiI,CACjI,MAAAA,EAAA4wD,IAAA,EACA5wD,CAAAA,EAAA4wD,IAAA,KAEA5wD,EAAA4wD,IAAA,CAAAypC,mBAAA,CAAAhpG,EACA2qD,EAAAh8C,GACA,MACA,CAEA,MAAA26E,EAAAjoB,OAAA,EAAA1yD,EAAA,sBACAm6F,IACA,MAAAn6F,EAAA4wD,IAAA,EACA5wD,CAAAA,EAAA4wD,IAAA,KAEA5wD,EAAA4wD,IAAA,CAAAypC,mBAAA,CAAAhpG,EACA8oG,EAAA,KACAn+C,EAAAh8C,GACA,MACA,CAIA,KAAA8/C,QAAA,CAAAuqB,IAAA,YAAAsQ,EAAArtB,SAAA,+EAA0JttD,MAAAA,CAAA,GAC1J,CAEA,KAAA8/C,QAAA,CAAAwnC,WAAA,MAAkD8S,GAAA,EAAYF,EAAAnlF,GAAA,QAC9D,EACAqlF,GACA,EACA,CACA,MAAAjR,gBAAAjF,CAAA,EACA,IAAAn3B,EAAA0sC,EAAAvV,GAEA,GAAAn3B,EAAA7wD,IAAA,EACA,IAAAA,EAAA,SAAAquD,EAAA8b,cAAA,EAAAtZ,EAAA7wD,IAAA,MAAA4jD,QAAA,EACA,GAAA66B,EAAA/uB,cAAA,EAAA1vD,MAAAA,GAAAA,EAAA6H,WAAA,UAAAzC,OAAA,CAAAyC,WAAA,yCAAAmgF,GACAn3B,EAAA7wD,IAAA,CAAAA,CACA,MAEA6wD,EAAA7wD,IAAA,MAAAoF,OAAA,CAEA,IAAA04F,EAAA,KAAAl6C,QAAA,CAAAm6C,iBAAA,CAAAltC,GACA,kBAAAjN,QAAA,CAAAksB,IAAA,wBAAAguB,EAAA,CACA,CACA,MAAA3Q,YAAAiR,CAAA,EACA,IAAAxvD,EAAA,iBAAAwvD,EAAA,GAAA3f,EAAAjtB,WAAA,EAAA4sC,GAAAA,EACA,kBAAAx6C,QAAA,CAAAksB,IAAA,kBACA,GAAA2O,EAAAvtB,OAAA,EAAAtiB,GAAA,KAAAxpC,OAAA,CAAAyC,WAAA,GACA,CACA,CACA,MAAAulF,cAAAjoF,CAAA,CAAA2qD,CAAA,CAAAwF,CAAA,EACA,IAAAn/D,EAAAonG,EAAAjoC,GAEA+oC,EAAA,MAAA/vC,EAAAgsB,gBAAA,CAAAoI,YAAA,CAAAv9E,EAAA2qD,EAAA35D,EAAA,MAAAA,IACA,IAAAiP,EAAA,SAAAipD,EAAA8b,cAAA,EAAAh0E,GAEA,MADA,GAAAsoF,EAAA/uB,cAAA,EAAAtqD,MAAAA,EAAA,kDAAAjP,GACAiP,CACA,GACA,kBAAAw+C,QAAA,CAAAksB,IAAA,yBACA,KAAA1qE,OAAA,CAAAyC,WAAA,GACAzB,KAAAC,SAAA,CAAAioD,EAAAgsB,gBAAA,CAAAsI,UAAA,CAAAyb,EAAAl5F,MAAA,CAAA2qD,EAAAuuC,EAAAloG,KAAA,GACA,CACA,CACA,MAAAmoG,OAAAnqD,CAAA,EACA,YAAAyP,QAAA,CAAAksB,IAAA,2BACA,KAAA1qE,OAAA,CAAAyC,WAAA,GAAAssC,EAAA,KACA,CACA,CAEA,MAAAoqD,mBAAAH,CAAA,EACA,IAAAxvD,EAAA,iBAAAwvD,EAAA,GAAA3f,EAAAjtB,WAAA,EAAA4sC,GAAAA,EACA,kBAAAx6C,QAAA,CAAAksB,IAAA,aACA,KAAA1qE,OAAA,CAAAyC,WAAA,MAAA42E,EAAAvtB,OAAA,EAAAtiB,GACA,CACA,CACA,CACA14C,EAAAwjF,aAAqB,CAAAA,CAWrB,OAAAE,UAAA8Z,EAAA5Z,gBAAA,CACA,CAAA7+C,CAAA,EAEA+8D,EAAA,EAEAwG,EAAA,EACAC,EAAA,EACAC,EAAA,EACA9Z,EAAA,EACA+Z,EAAA,EACAC,EAAA,GACA,SAAAH,EAAA,CACA,OAGA,IAAAI,EAAA,SAAAC,UAAA,yBAAAA,UAAA,kBACA,OAAAL,EAAA,CAAA5Z,WAAA,KACA,MAAA4Z,EAAA,MACA,IAAAD,EAAA,MAAAA,EAAA,CAEA,IADA,MAAAA,EAAA,IACAA,EAAAvpG,MAAA,GAEA,IAAA8pG,EAAA,CAAAP,EAAAviG,KAAA,IACA,KACA,EADAhH,MAAA,EACA8pG,EAAA9pG,MAAA,SAAAgmC,CAAA,CAAAq8D,aAAA,EAKA,GAFAyH,EAAA/jG,IAAA,CAAAwjG,EAAAviG,KAAA,IAEAlH,KADAsR,SAAA,CAAA04F,EAAAxuF,GAAA,IAAAhJ,EAAAglF,OAAA,GACAt3F,MAAA,OAAAgmC,CAAA,CAAA0iE,YAAA,EACAa,EAAAvc,OAAA,CAAA8c,EAAAlmF,GAAA,IACA,KACA,CAGA,WACA,IAAA0zE,EAAA,IAAAwS,EAAA9pG,MAAA,CAAA8pG,CAAA,IAAAxS,OAAA,CAAAwS,EAAAxuF,GAAA,IAAAhJ,EAAAglF,OAAA,EACA,KAAApe,IAAA,UAAyCvd,OAAA,iBAAA27B,QAAAA,CAAA,GACzC,IACA,IAAAtmF,EAAA,WAAAuxF,KAAA,CAAAjL,GAGA,QAAqC1sC,QAAAA,CAAA,CAAAC,OAAAA,CAAA,CAAAysC,QAAAA,CAAA,IAFrC,KAAApe,IAAA,UAA6Cvd,OAAA,mBAAA3qD,OAAAA,CAAA,GAEmB84F,GAAA,CAChE,QAAAppG,SAAA,EACAmqD,EAAA,GAAA2+B,EAAArtB,SAAA,0CAAsF,yBAA+CgC,UAAAm5B,EAAAlrB,MAAA,IACrI,QACA,CAEA,IAAAwkB,EAAA5/E,EAAA0qB,MAAA,IAAAgO,EAAAp6B,EAAA,GAAAgoF,EAAAhoF,EAAA,KAEA,GAAAshF,MAAAA,EAAA,CACA,IAAA/hF,EAAA,GAAA26E,EAAArtB,SAAA,6CACAj7D,MAAA8P,EAAAyuD,KAAA,CAA2D63B,QAAAA,CAAA,CAC3D,GACA,KAAApe,IAAA,SAAArqE,GACAg8C,EAAAh8C,GACA,QACA,CAEA,aAAA+hF,EAAA,CACA/lC,EAAA,KAAAo3C,WAAA,CAAA3K,EAAA1G,IACA,QACA,CAEAhmC,EAAAgmC,EAAA5/E,MAAA,CACA,CACA,CACA,MAAAnC,EAAA,CAEA,QAAqCg8C,OAAAA,CAAA,IADrC,KAAAquB,IAAA,UAA6Cvd,OAAA,kBAAA9sD,MAAAA,CAAA,GACCi7F,GAE9Cj/C,EAAAh8C,EAEA,CACA,IACA,CACA,EAAS+6F,EACT,CACAhqG,YAAA+vF,CAAA,CAAA3pD,CAAA,EACA,MAAA2pD,EAAA3pD,GACA,MAAA+8D,EAAA,GACA,MAAA/8D,CAAA,CAAAjlC,OAAAwM,MAAA,IAAwCuhF,EAAA9oD,GAAA,IACxC,MAAAujE,EAAA,IACA,MAAAC,EAAA,MACA,MAAA7Z,EAAA,MACA,MAAA+Z,EAAA,KACA,EACA,IAAA9+C,EAAA,KACA0qB,EAAA,IAAA3qB,QAAA,IACAC,EAAAm/C,CACA,EACA,OAAAN,EAAA,EAA+Bn0B,QAAAA,EAAA1qB,QAAAA,CAAA,CAC/B,CACA,IAAAwuC,EAAA,KAAAyQ,UAAA,iBACA,mBAAAzQ,GACA,GAAA5P,EAAA/uB,cAAA,GAAA2+B,GAAAzJ,QAAAA,EAAA,kEAAA3pD,GACAozD,GAAAzJ,MAAAA,GACA,OAAAA,EAAA,CAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA4kF,EAAA,GAGAyJ,IAEA,GAAA5P,EAAA/uB,cAAA,EAAAk1B,MAAAA,GAAAyJ,EAAAiG,OAAA,CAAA1P,GAAA,oDAAA3pD,GACA,MAAA2pD,EAAA,CAAAyJ,EAEA,CAMAyQ,WAAAv4F,CAAA,EACA,aAAA00B,CAAA,CAAA10B,EAAA,CAMA,IAAAo+E,UAAA,CAEA,MADA,GAAAlG,EAAAtrB,MAAA,QAAAyxB,EAAA,iDACA,MAAAA,EAAA,CAQA,MAAAO,SAAAD,CAAA,EAGA,GAAAA,SAAAA,EAAA7jB,MAAA,EAAA6jB,gBAAAA,EAAA7jB,MAAA,EACA,IAAAxQ,EAAAq0B,EAAA/zB,WAAA,CACA,GAAAN,GAAAA,MAAAA,EAAAhgD,IAAA,KAAA4tE,EAAAxnB,SAAA,EAAApG,EAAAhgD,IAAA,GAEAggD,MAAAA,EAAA82B,YAAA,EAAA92B,MAAAA,EAAA+2B,oBAAA,EACA,IAAAE,EAAA,WAAAR,UAAA,EACA,OAAAQ,EAAAH,YAAA,EAAAG,MAAAA,EAAAF,oBAAA,EAEA1C,CAAAA,EAAAlvF,OAAAwM,MAAA,IAA8C0iF,EAAA,CAC9C/zB,YAAAn7D,OAAAwM,MAAA,IAAyDquD,EAAA,CAAQhgD,KAAA3X,KAAAA,CAAA,EACjE,EAAyB,CAEzB,CAEA,CACA,IAAAysF,EAAA,KAAAsZ,aAAA,CAAA/Z,UACA,MAAAS,EACA,WAAA7V,IAAA,CAAA6V,EAAAtkB,MAAA,CAAAskB,EAAA7qD,IAAA,EAEA,MAAAqqD,SAAAD,EACA,CAQA,MAAAsB,gBAAA,CACA,IAAA5B,EAAA,KAAAka,UAAA,kBACA,GAAAla,EAAA,CACA,GAAAA,CAAA,IAAAA,EAMA,OAAAA,EALA,SAAAA,EAAA,CACA,aAAAA,EAAA,QAOA,MAAA+Z,EAAA,GAIA,KAAAO,KAAA,CACA,MAAAP,EAAA,YACA,IACA,IAAA14F,EAAAk9E,EAAAxK,OAAA,CAAA34E,IAAA,IAAAy+E,EAAAxnB,SAAA,aAAA6Y,IAAA,qBAEA,OADA,MAAA6uB,EAAA,MACA14F,CACA,CACA,MAAAnC,EAAA,CAEA,MADA,MAAA66F,EAAA,MACA76F,CACA,CACA,KAIA,MAAA66F,EAAA,gBAKA14F,EAJA,IAAAsmF,EAAA,CACAhoF,GAAA,MAAAyzF,EAAA,GAAA32B,OAAA,cAAArd,OAAA,GAAA60C,QAAA,KACA,EACA,KAAA1qB,IAAA,UAAiCvd,OAAA,iBAAA27B,QAAAA,CAAA,GAEjC,IACAtmF,EAAA,YAAAuxF,KAAA,CAAAjL,EAAA,KACA,MAAAoS,EAAA,KACA,CACA,MAAA76F,EAAA,CAGA,MAFA,MAAA66F,EAAA,MACA,KAAAxwB,IAAA,UAAqCvd,OAAA,kBAAA9sD,MAAAA,CAAA,GACrCA,CACA,CAEA,GADA,KAAAqqE,IAAA,UAAiCvd,OAAA,mBAAA3qD,OAAAA,CAAA,GACjC,WAAAA,EACA,OAAAk9E,EAAAxK,OAAA,CAAA34E,IAAA,IAAAy+E,EAAAxnB,SAAA,EAAAhxD,EAAAA,MAAA,EAEA,YAAAixF,WAAA,CAAA3K,EAAAtmF,EACA,MAtCA,YAAA04F,EAAA,CAgDApH,QAAA,CACA,YAAAmH,EAAA,cAAAA,EAAA,CAAA7+C,OAAA,GAGA,MAAA6+C,EAAA,CAAA7+C,OAAA,GACA,MAAA6+C,EAAA,MACA,WAEA,iBAAA9Z,EAAA,QAAAjvF,SAAA,EACA,IACA,MAAAivF,EAAA,YAAA4B,cAAA,EACA,CACA,MAAA1iF,EAAA,CACA,QAAAnO,SAAA,CACA,MAEAkO,QAAAI,GAAA,oIACA,KAAAkqE,IAAA,YAAAsQ,EAAArtB,SAAA,2DAA6Huc,MAAA,4BAAAjZ,KAAA,CAA4C5wD,MAAAA,CAAA,KACzK,MA9aA,IAAA87C,QAAA,IAAsCilC,WAAAhlC,EA8atC,IA9asC,EA+atC,CAGA,MAAA++C,EAAA,EACA,KACA,CAMA,MAAAO,iBAAA,CACA,eAAAT,EAAA,CAGA,mBAAAA,EAAA,CAAAn0B,OAAA,CAQAkhB,eAAA/rD,CAAA,QAEA,YAAAA,EAAA7uB,IAAA,CACA,IAAAwsF,EAAA+B,yBAAA,OAEA1/D,UAAAA,EAAA7uB,IAAA,CACA,KAAAiuF,UAAA,YACA,IAAA1b,EAAAwI,sBAAA,MAAAlsD,EAAA/O,MAAA,EAEA,IAAA0sE,EAAAgC,uBAAA,MAAA3/D,EAAA/O,MAAA,EAIA,WAAA+O,EAAA7uB,IAAA,EAAA6uB,aAAAA,EAAA/O,MAAA,CAAAizD,MAAA,CACA,IAAA8P,EAAA3X,mBAAA,WAEA,MAAA0P,eAAA/rD,EACA,CAIA,IAAAw/D,OAAA,CAAkB,mBAAAR,EAAA,CAMlBX,kBAAAltC,CAAA,EACA,IAAA5qD,EAAA,GA+BA,MA7BA,+FAAAmE,OAAA,KACA,GAAAymD,MAAAA,CAAA,CAAAtqD,EAAA,CACA,OAEA,IAAA+4F,EAAA/4F,CACA,cAAAA,GACA+4F,CAAAA,EAAA,OAEAr5F,CAAA,CAAAq5F,EAAA,IAAA7gB,EAAAH,UAAA,KAAAG,EAAAxnB,SAAA,EAAApG,CAAA,CAAAtqD,EAAA,OAAiGA,EAAI,GACrG,GAEA,qBAAA6D,OAAA,KACA,MAAAymD,CAAA,CAAAtqD,EAAA,EAGAN,CAAAA,CAAA,CAAAM,EAAA,IAAAk4E,EAAAvtB,OAAA,EAAAL,CAAA,CAAAtqD,EAAA,EACA,GAEAsqD,EAAAyiC,UAAA,EACArtF,CAAAA,EAAA,cAAAu4E,EAAA3C,aAAA,EAAAhrB,EAAAyiC,UAAA,GAEAziC,EAAA0iC,mBAAA,EAEAttF,CAAAA,EAAA,oBAAA4qD,EAAA0iC,mBAAA,CAAAhjF,GAAA,CAAAnb,GAAAA,EAAAyS,WAAA,KAMA5B,CACA,CAKAg5F,cAAA/Z,CAAA,EACA,OAAAA,EAAA7jB,MAAA,EACA,cACA,OAAyBA,OAAA,cAAAvmC,KAAA,GACzB,sBACA,OAAyBumC,OAAA,kBAAAvmC,KAAA,GACzB,mBACA,OAAyBumC,OAAA,eAAAvmC,KAAA,GACzB,sBACA,OAAyBumC,OAAA,2BAAAvmC,KAAA,GACzB,kBACA,OACAumC,OAAA,iBACAvmC,KAAA,CAAA0iE,EAAAtY,EAAA9/E,OAAA,EAAA8/E,EAAA2B,QAAA,EAEA,2BACA,OACAxlB,OAAA,0BACAvmC,KAAA,CAAA0iE,EAAAtY,EAAA9/E,OAAA,EAAA8/E,EAAA2B,QAAA,EAEA,eACA,OACAxlB,OAAA,cACAvmC,KAAA,CAAA0iE,EAAAtY,EAAA9/E,OAAA,EAAA8/E,EAAA2B,QAAA,EAEA,kBACA,OACAxlB,OAAA,mBACAvmC,KAAA,CACA0iE,EAAAtY,EAAA9/E,OAAA,EACA,KAAA8/E,EAAAyE,QAAA,CAAAzpF,QAAA,KACAglF,EAAA2B,QAAA,CACA,CAEA,4BACA,OACAxlB,OAAA,yBACAvmC,KAAA,CAAAoqD,EAAA4E,iBAAA,EAEA,gBACA,gBAAA5E,EACA,OACA7jB,OAAA,uBACAvmC,KAAA,CAAAoqD,EAAA2B,QAAA,GAAA3B,EAAA8E,mBAAA,GAGA,iBAAA9E,EACA,OACA7jB,OAAA,qBACAvmC,KAAA,CAAAoqD,EAAA6B,SAAA,GAAA7B,EAAA8E,mBAAA,GAGA,KACA,sBACA,OACA3oB,OAAA,2BACAvmC,KAAA,CAAAoqD,EAAA/vF,IAAA,EAEA,6BACA,OACAksE,OAAA,4BACAvmC,KAAA,CAAAoqD,EAAA/vF,IAAA,EAEA,YACA,OACAksE,OAAA,WACAvmC,KAAA,MAAAijE,iBAAA,CAAA7Y,EAAA/zB,WAAA,EAAA+zB,EAAA2B,QAAA,EAEA,mBACA,OACAxlB,OAAA,kBACAvmC,KAAA,MAAAijE,iBAAA,CAAA7Y,EAAA/zB,WAAA,GAGA,eASA,OARA+zB,EAAAv0D,MAAA,EAAAu0D,MAAAA,EAAAv0D,MAAA,CAAAvrB,OAAA,GACArF,MAAA8J,OAAA,CAAAq7E,EAAAv0D,MAAA,CAAAvrB,OAAA,EACA8/E,EAAAv0D,MAAA,CAAAvrB,OAAA,CAAA8/E,EAAAv0D,MAAA,CAAAvrB,OAAA,CAAAmL,GAAA,CAAAitF,GAGAtY,EAAAv0D,MAAA,CAAAvrB,OAAA,CAAAo4F,EAAAtY,EAAAv0D,MAAA,CAAAvrB,OAAA,GAGA,CAAyBi8D,OAAA,cAAAvmC,KAAA,CAAAoqD,EAAAv0D,MAAA,EACzB,CACA,WACA,CAOAumE,YAAA3K,CAAA,CAAAgT,CAAA,EACA,IAAgBl+B,OAAAA,CAAA,EAASkrB,EACzB,CAAgBzoF,MAAAA,CAAA,EAAQy7F,EACxB,GAAAl+B,oBAAAA,GAAAv9D,EAAA8qC,OAAA,EACA,IAAAjsC,EAAAmB,EAAA8qC,OAAA,CACA,IAAAjsC,EAAAwrB,KAAA,aAAAxrB,EAAAwrB,KAAA,wBACA,SAAAswD,EAAArtB,SAAA,6CACAD,YAAAo7B,EAAAvoC,MAAA,IACA0Q,KAAA,CAA4B63B,QAAAA,EAAAzoF,MAAAA,CAAA,CAC5B,EAEA,CACA,GAAAu9D,aAAAA,GAAAA,oBAAAA,EAAA,CACA,IAAAp7D,EAAAu5F,SAwOAA,EAAArpG,CAAA,EACA,GAAAA,MAAAA,EACA,YAGA,oBAAAA,EAAAy4C,OAAA,EAAAz4C,EAAAy4C,OAAA,CAAAzgB,KAAA,gBAAAswD,EAAAjf,WAAA,EAAArpE,EAAA6G,IAAA,EACA,OAAiB4xC,QAAAz4C,EAAAy4C,OAAA,CAAA5xC,KAAA7G,EAAA6G,IAAA,EAGjB,oBAAA7G,EAAA,CACA,QAAAoQ,KAAApQ,EAAA,CACA,IAAA8P,EAAAu5F,EAAArpG,CAAA,CAAAoQ,EAAA,EACA,GAAAN,EACA,OAAAA,CAEA,CACA,WACA,CAEA,oBAAA9P,EACA,IACA,OAAAqpG,EAAAp5F,KAAAF,KAAA,CAAA/P,GACA,CACA,MAAA2N,EAAA,EAEA,WACA,EAlQAA,GACA23B,EAAAgyB,EAAAD,QAAA,CAAAmD,uBAAA,cAAA0Q,EAAA,qBAAAkrB,EAAAvoC,MAAA,IAAA/9C,EAAAA,EAAAjJ,IAAA,OAEA,OADAy+B,EAAAi5B,IAAA,EAAuB5wD,MAAAA,EAAAyoF,QAAAA,CAAA,EACvB9wD,CACA,CAGA,IAAAmT,EAAAxoC,KAAAC,SAAA,CAAAo5F,SAkRAtpG,CAAA,EACA,IAAA8P,EAAA,GAEA,OADAy5F,SAxBAA,EAAAvpG,CAAA,CAAA8P,CAAA,EACA,GAAA9P,MAAAA,GAQA,GAJA,iBAAAA,EAAAy4C,OAAA,EACA3oC,EAAAjL,IAAA,CAAA7E,EAAAy4C,OAAA,EAGA,iBAAAz4C,EACA,QAAAoQ,KAAApQ,EACAupG,EAAAvpG,CAAA,CAAAoQ,EAAA,CAAAN,GAIA,oBAAA9P,EACA,IACA,OAAAupG,EAAAt5F,KAAAF,KAAA,CAAA/P,GAAA8P,EACA,CACA,MAAAnC,EAAA,GAEA,EAGA3N,EAAA8P,GACAA,CACA,EAtRAnC,IACA,oBAAAA,EAAA8qC,OAAA,EAAA9qC,EAAA8qC,OAAA,CAAAzgB,KAAA,oCAUA,SAAAswD,EAAArtB,SAAA,4CACAR,OAAA+uC,CATAC,SAAA,cACAC,cAAA,cACAC,qBAAA,gBACAC,oBAAA,kBACAC,oBAAA,kBACAC,oBAAA,gBACAC,uBAAA,eACA,CAEA,CAAA7+B,EAAA,YACAtQ,OAAA,WACA2D,KAAA,CAAwB63B,QAAAA,EAAAzoF,MAAAA,CAAA,CACxB,GAEA,GAAAu9D,2BAAAA,GAAAA,wBAAAA,EAAA,CACA,IAAAlQ,EAAAo7B,EAAAvoC,MAAA,IACA,GAAApV,EAAAzgB,KAAA,mDACA,SAAAswD,EAAArtB,SAAA,4EACAD,YAAAA,EAAAuD,KAAA,CAAyC5wD,MAAAA,CAAA,CACzC,GAEA,GAAA8qC,EAAAzgB,KAAA,YAAAygB,EAAAzgB,KAAA,aACA,SAAAswD,EAAArtB,SAAA,iDAAmGD,YAAAA,EAAAuD,KAAA,CAAqB5wD,MAAAA,CAAA,IAGxH,GAAA8qC,EAAAzgB,KAAA,8BAAAygB,EAAAzgB,KAAA,iBACA,SAAAswD,EAAArtB,SAAA,uDAAyGD,YAAAA,EAAAuD,KAAA,CAAqB5wD,MAAAA,CAAA,IAE9H,GAAA8qC,EAAAzgB,KAAA,2BACA,SAAAswD,EAAArtB,SAAA,2EACAgC,UAAAiO,EAAA3M,KAAA,CAA+CvD,YAAAA,EAAAuD,KAAA,CAAqB5wD,MAAAA,CAAA,EACpE,EAEA,CACA,IAAAq8F,EAAA,EAAAvxD,EAAAzgB,KAAA,wCAMA,CALA,CAAAgyE,GACAr8F,GAAAA,EAAAs8F,OAAA,EAAAt8F,EAAAs8F,OAAA,CAAA3jC,UAAA,0BACA0jC,CAAAA,EAAA,IAGAA,GACA,GAAA1hB,EAAArtB,SAAA,mDACAgC,UAAAm5B,EAAAlrB,MAAA,CAAA3M,KAAA,CAAmD5wD,MAAAA,EAAAyoF,QAAAA,CAAA,CACnD,GAEA,GAAA9N,EAAArtB,SAAA,8CAAwFttD,MAAAA,EAAAyoF,QAAAA,CAAA,EACxF,CAcAzc,KAAAzO,CAAA,CAAArd,CAAA,EAGA,QAAAruD,SAAA,CACA,OAAAiqD,QAAAE,MAAA,IAAA2+B,EAAArtB,SAAA,0CAAiF,yBAA+CgC,UAAAiO,CAAA,IAEhI,IAAA98D,EAAA,MAAAyzF,EAAA,GACAztB,EAAA,IAAA3qB,QAAA,CAAAC,EAAAC,KACA,MAAA0+C,EAAA,CAAAxjG,IAAA,EACA6kD,QAAAA,EAAAC,OAAAA,EACAysC,QAAA,CAA2BlrB,OAAAA,EAAArd,OAAAA,EAAAz/C,GAAAA,EAAAs0F,QAAA,MAC3B,EACA,GAGA,OADA,MAAA+F,EAAA,GACAr0B,CACA,CAaA,MAAAotB,UAAAvyF,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,GAEA,IAAAi7F,EAAA,KAAAvwB,IAAA,oBAEA,oBAAA1qE,EAAA,CACA,IAAAsyF,EAAA,MAAA2I,EACA,GAAAj7F,GAAAsyF,EAAAziG,MAAA,CACA,+BAEA,WAAAykF,EAAA,KAAAge,CAAA,CAAAtyF,EAAA,CACA,CACA,IAAgBsyF,SAAAA,CAAA,EAAW,SAAAjZ,EAAA/N,iBAAA,GAC3BkU,QAAA,KAAAuC,UAAA,GACAuQ,SAAA2I,CACA,GAGA,QAAAC,KADAl7F,EAAA,GAAAipD,EAAArI,UAAA,EAAA5gD,GACAsyF,GACA,MAAArpC,EAAArI,UAAA,EAAAs6C,KAAAl7F,EACA,WAAAs0E,EAAA,KAAAt0E,EAGA,+BACA,CACA,MAAAm7F,cAAA,CAEA,MAAA7I,CADA,WAAA5nB,IAAA,qBACAv/D,GAAA,QAAAmpE,EAAA,KAAA/kF,GACA,CACAkJ,SAAA,CAOA,QAAqB0uF,QAAAA,CAAA,CAAAzsC,OAAAA,CAAA,IALrB,MAAA2+C,EAAA,GACAzT,aAAA,MAAAyT,EAAA,EACA,MAAAA,EAAA,OAGuC,MAAAD,EAAA,EACvC1+C,EAAA,GAAA2+B,EAAArtB,SAAA,0CAAkE,yBAA+CgC,UAAAm5B,EAAAlrB,MAAA,GAEjH,OAAAm9B,EAAA,IAEA,MAAA3gG,SACA,CACA,CACA3H,EAAA0jF,kBAA0B,CAAAA,CAO1B,OAAAud,UAAAvd,EACA,CAAAqK,EAAA,aACAW,CAAA,CAAA3pD,CAAA,EACA,MAAA2pD,EAAA3pD,GACA,IAAAgpD,EAAA,KAAA6a,UAAA,mBACA,OAAA7a,GACAA,CAAAA,EAAAF,EAAAE,eAAA,EAEA,MAAAA,EAAA,CAAAA,CACA,CACAwH,eAAA/rD,CAAA,EACA,IAAA8rD,EAAA,MAAAC,eAAA/rD,GAIA,OAHA+9D,EAAAjS,IACAA,CAAAA,EAAAvH,eAAA,OAAAA,EAAA,EAEAuH,CACA,CAIA,IAAAvH,iBAAA,CAA4B,aAAAA,EAAA,CAC5B,IAAAA,gBAAA9tF,CAAA,EACA,IAAA7B,OAAAg4D,SAAA,CAAAn2D,IAAAA,EAAA,EACA,+BAEA,OAAA8tF,EAAA,CAAA9tF,EACA,KAAAo1F,kBAAA,KACAkS,EAAA/9D,IACAA,CAAAA,EAAAukD,eAAA,OAAAA,EAAA,CAEA,EACA,CACA,CACA/tF,EAAAihG,yBAAiC,CAAAA,CASjC,OAAAxd,UAAAwd,EACA,CAAAnnB,EAAA,aACAyV,CAAA,CAAAb,CAAA,CAAA3pD,CAAA,EACA,MAAAwqD,GACAA,CAAAA,EAAA,yBAEA,MAAAb,EAAA3pD,GACA,iBAAAwqD,EACA,MAAAzV,EAAA,KAAAyO,EAAAvD,YAAA,CAAAuK,GAGA,MAAAzV,EAAA,CAAAyV,EAAArjF,KAAA,EAEA,CACA66F,gBAAA,CACA,aAAAjtB,EAAA,CAAA5tE,KAAA,EACA,CACA,MAAA0tE,KAAAzO,CAAA,CAAArd,CAAA,EAKA,OADA,WAAAuzC,MAAA,GACA,YAAAznB,KAAAzO,EAAArd,EACA,CACA,MAAAwzC,MAAAjL,CAAA,EAEA,IAAA5G,EAAA,KAAAsX,cAAA,EACAtX,CAAAA,EAAAplC,IAAA,CAAAn6C,KAAAC,SAAA,CAAAkmF,GACA5G,EAAAoQ,SAAA,oCACA,IAAAlF,EAAA,MAAAlL,EAAA7V,IAAA,GACA+gB,EAAAC,QAAA,GACA,IAAAjL,EAAAgL,EAAA/K,QAAA,CAIA,OAHA/lF,MAAA8J,OAAA,CAAAg8E,IACAA,CAAAA,EAAA,CAAAA,EAAA,EAEAA,CACA,CACA,CACA3vF,EAAAyjF,eAAuB,CAAAA,sCCx4BvB3jF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+iF,cAAsB,QActB,IAAAxrB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtCwmG,EAAA,0BAuBA,OAAAvnB,UAAA8U,EAAApU,eAAA,CAIA8mB,aAAA,CAKAC,iBAAA,aAOA/b,CAAA,CAAA8b,CAAA,CAAAC,CAAA,EACA,MAAA/b,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAA8b,GACAA,CAAAA,EAAAD,CAAA,EAEA,MAAAE,GACAA,CAAAA,EAAA,MAIA,MADAznB,EAAA2d,UAAA,CAAAhS,EAAA6b,EAAAC,GACA9b,EAFA,CAA0ByJ,cAAAzJ,CAAA,GAG1B,GAAAn3B,EAAAlB,gBAAA,QAAiDk0C,cAAAA,EAAAC,kBAAAA,CAAA,EACjD,CACArW,aAAA7kF,CAAA,EACA,IACA,WAAAyzE,EAAAzzE,EAAA,KAAAi7F,aAAA,MAAAC,iBAAA,CACA,CACA,MAAA58F,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CAKA,OAAAoxF,WAAAhS,CAAA,CAAA6b,CAAA,CAAAC,CAAA,EACA,MAAAD,GACAA,CAAAA,EAAAD,CAAA,EAEA,IAAA7a,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SArEhEhiG,CAAA,EACA,OAAAA,GACA,cACA,wCACA,cACA,uCACA,aACA,yCACA,oBACA,+CACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EAyDgE8vF,EAAA9vF,IAAA,EAAsB,SAAS2rG,EAAc,GAW7G,OAVA9a,EAAAoR,SAAA,IACA2J,GACA/a,EAAAyX,cAAA,IAAAsD,GAEAD,IAAAD,GACA7a,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,oBACA,GACA,EAEA6J,CACA,CACAkR,qBAAA,CACA,YAAA4J,aAAA,GAAAD,CACA,CACA,CACAtqG,EAAA+iF,cAAsB,CAAAA,sCChFtBjjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8iF,iBAAyB,QACzB,IAAAvrB,EAAmBzzD,EAAQ,OAC3B45F,EAAuB55F,EAAQ,MAC/BmpF,EAAqBnpF,EAAQ,OAC7B+zF,EAA8B/zF,EAAQ,MACtC2mG,EAAA,0CA8EA,OAAA3nB,UAAA+U,EAAApU,eAAA,CAIA3f,KAAA,aAIA2qB,CAAA,CAAA3qB,CAAA,EACA,MAAA2qB,GACAA,CAAAA,EAAA,WAEA,IAAAC,EAAAzB,EAAAxK,OAAA,CAAA34E,IAAA,CAAA2kF,EACA,OAAA3qB,GACAA,CAAAA,EAAA2mC,CAAA,EAGA,MADA3nB,EAAA4d,UAAA,CAAAhS,EAAA5qB,GACA4qB,EAAA,CAAkCyJ,cAAAzJ,CAAA,GAClC,GAAAn3B,EAAAlB,gBAAA,QAAiDyN,MAAAA,CAAA,EACjD,CACAqwB,aAAA7kF,CAAA,EACA,IACA,WAAAwzE,EAAAxzE,EAAA,KAAAw0D,KAAA,CACA,CACA,MAAAl2D,EAAA,EACA,aAAAumF,aAAA7kF,EACA,CACAqxF,qBAAA,CACA,YAAA78B,KAAA,GAAA2mC,CACA,CAKA,OAAA/J,WAAAhS,CAAA,CAAA5qB,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA2mC,CAAA,EAEA,IAAAhb,EAAA,IAAAl4B,EAAAytB,YAAA,YAAgE4b,SAnHhEhiG,CAAA,EACA,OAAAA,GACA,cACA,2BACA,cACA,2CACA,eACA,4CACA,eACA,4CACA,gBACA,4CACA,uBACA,2CACA,wBACA,4CACA,YACA,wCACA,mBACA,uCACA,mBACA,wCACA,WACA,+BACA,YACA,uCACA,aACA,iCACA,oBACA,yCACA,gBACA,oCACA,uBACA,2CACA,wBACA,4CACA,YACA,gCACA,CACA,GAAA24D,EAAAiC,cAAA,qCAAA56D,EACA,EA2EgE8vF,EAAA9vF,IAAA,EAAsB,GAAGklE,EAAM,GAS/F,OARA2rB,EAAAoR,SAAA,IAEA/8B,IAAA2mC,GACAhb,CAAAA,EAAAqR,SAAA,OAAArR,EAAAkL,EAAA5I,KACA,GAAA2L,EAAA9X,mBAAA,uBACA,GACA,EAEA6J,CACA,CACA,CACAzvF,EAAA8iF,iBAAyB,CAAAA,sCCtJzBhjF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4iF,cAAsB,CAAG5iF,EAAAgmF,qBAA6B,CAAGhmF,EAAA+lF,uBAA+B,CAAG/lF,EAAAimF,qBAA6B,CAAGjmF,EAAA8lF,gBAAwB,QACnJ,IAAA0X,EAA+B15F,EAAQ,OACvCyzD,EAAmBzzD,EAAQ,OAC3B+zF,EAA8B/zF,EAAQ,KAKtC,OAAAgiF,EACA,CAAAp4B,EAAA,EACAjzB,CAAA,KAIAA,QAAA,CAAmB,OAAAvqB,KAAAF,KAAA,OAAAyqB,CAAA,EACnB,CAAAiwE,EAAA,EACAtV,EAAA,EACAuV,EAAA,aAKAj9C,CAAA,CAAAjzB,CAAA,EACA,MAAAizB,EAAA,CAAAA,EACA,MAAAjzB,CAAA,CAAAvqB,KAAAC,SAAA,CAAAsqB,GACA,MAAAiwE,EAAA,MACA,MAAAtV,EAAA,MACA,MAAAuV,EAAA,KACA,CACAx3E,OAAA,CACA,MAAAu3E,EAAA,OAAAh9C,EAAA,CAAAksB,IAAA,sBAAAn/C,MAAA,EAAA0vB,IAAA,KAEA,MAAAuD,EAAA,CAAAk9C,SAAA,CAAAF,EAAA,MACAA,GAEA,CACAnyB,MAAA,CACA,MAAAmyB,EAAA,CAAAvgD,IAAA,KACA,MAAAuD,EAAA,CAAAjuD,SAAA,EAGA,MAAAiuD,EAAA,CAAAksB,IAAA,oBAAA8wB,EAAA,CACA,GACA,MAAAA,EAAA,KACA,CAGArd,MAAAC,CAAA,EACA,GAAA/1B,EAAA0F,MAAA,EAAAqwB,EAAA,4FAA+IpwB,UAAA,iBAC/I,MAAAk4B,EAAA,GAAA9H,CACA,CACA7hC,QAAA,CACA,MAAA2pC,EAAA,KACA,CAIAyV,eAAAnyD,CAAA,EACA,eAAAgyD,EAAA,EAGA,aAAAtV,EAAA,EACA,IAAAuV,EAAA,MAAAA,EAAA,CAEAA,EADAA,MAAAA,EACA,KAAAhyB,KAAA,OAAAjrB,EAAA,CAAAhV,GAGAiyD,EAAAxgD,IAAA,WACA,WAAAwuB,KAAA,OAAAjrB,EAAA,CAAAhV,EACA,GAEA,MAAAiyD,EAAA,CAAAA,EAAAxgD,IAAA,MACA,MAAAwgD,EAAA,GAAAA,GACA,OAAAA,EAAA,MAEA,EACA,CACA,CAKA,MAAAhyB,MAAAjrB,CAAA,CAAAhV,CAAA,EACA,sDACA,CACA,CACA14C,EAAA8lF,gBAAwB,CAAAA,CAKxB,OAAAG,UAAAH,EAIAnnF,YAAA+uD,CAAA,EACA,MAAAA,EAAA,aACA,CACA,MAAAirB,MAAAjrB,CAAA,CAAAhV,CAAA,EACAgV,EAAAuqB,IAAA,SAAApmE,SAAA6mC,EAAAx6C,MAAA,EACA,CACA,CACA8B,EAAAimF,qBAA6B,CAAAA,CAK7B,OAAAF,UAAAD,EAIAnnF,YAAA+uD,CAAA,EACA,MAAAA,EAAA,2BACA,CACA,MAAAirB,MAAAjrB,CAAA,CAAAhV,CAAA,EACAgV,EAAAuqB,IAAA,WAAAv/B,EACA,CACA,CACA14C,EAAA+lF,uBAA+B,CAAAA,CAI/B,OAAAC,UAAAF,EACA,CAAAglB,EAAA,KAIAA,WAAA,CAAsB,OAAA56F,KAAAF,KAAA,OAAA86F,EAAA,EAItBnsG,YAAA+uD,CAAA,CAAAjzB,CAAA,EACA,MAAAizB,EAAA,QAAAjzB,EAAA,EACA,MAAAqwE,EAAA,CAAA56F,KAAAC,SAAA,CAAAsqB,EACA,CACA,MAAAk+C,MAAAjrB,CAAA,CAAAhV,CAAA,EACAgV,EAAAuqB,IAAA,MAAA6yB,SAAA,CAAAp9C,EAAAsiC,QAAA,CAAAt3C,EAAAgV,EAAA+gC,QAAA,EACA,CACA,CACAzuF,EAAAgmF,qBAA6B,CAAAA,CAM7B,OAAApD,UAAAiV,EAAAnU,kBAAA,CACA,CAAAn1E,EAAA,EAEAqpE,CAAA,EAGAmzB,EAAA,aAMArc,CAAA,CAAAyS,CAAA,EAEA,IAAAp8D,EAAAjlC,OAAAwM,MAAA,IAAwC,MAAA60F,EAAAA,EAAA,IAIxC,GAAA5pC,EAAAiC,cAAA,EAAAz0B,MAAAA,EAAAq8D,aAAA,EAAAr8D,IAAAA,EAAAq8D,aAAA,0EAAAD,GACAp8D,EAAAq8D,aAAA,GAIA,MAAAr8D,EAAAozD,aAAA,EACApzD,CAAAA,EAAAozD,aAAA,KAEA,MAAAzJ,EAAA3pD,GACA,MAAAx2B,EAAA,KAAA8hC,IACA,MAAAunC,CAAA,KAAAvnC,IACA,MAAA06D,EAAA,KAAA16D,GACA,CAUAklD,eAAA/rD,CAAA,EACA,OAAAA,EAAA7uB,IAAA,EACA,YACA,WAAA6iF,EAAA3X,mBAAA,SACA,aACA,WAAAI,EAAA,KACA,eACA,WAAAF,EAAA,KACA,aACA,WAAAC,EAAA,KAAAx8C,EAAA/O,MAAA,CACA,cAGA,GAAA+O,aAAAA,EAAA/O,MAAA,CAAAizD,MAAA,CACA,WAAA8P,EAAA3X,mBAAA,YAEA,CACA,aAAA0P,eAAA/rD,EACA,CAKAohE,UAAAF,CAAA,CAAApV,CAAA,EACA,MAAA1d,CAAA,CAAAtwE,GAAA,CAAAojG,EAAApV,GACA,IAAAyV,EAAA,MAAAA,EAAA,CAAA55F,GAAA,CAAAu5F,GACA,GAAAK,EAAA,CACA,QAAAryD,KAAAqyD,EACAzV,EAAAuV,cAAA,CAAAnyD,GAEA,MAAAqyD,EAAA,CAAA75D,MAAA,CAAAw5D,EACA,CACA,CACA,MAAApJ,MAAAjL,CAAA,EAEA,GAAA9+B,EAAAiC,cAAA,GAAA3vD,MAAA8J,OAAA,CAAA0iF,GAAA,kDAAAA,GAGA,IAAAhiB,EAAA,IAAA3qB,QAAA,CAAAC,EAAAC,KACA,MAAAr7C,EAAA,CAAAjH,GAAA,CAAA+uF,EAAAhoF,EAAA,EAA8CgoF,QAAAA,EAAA1sC,QAAAA,EAAAC,OAAAA,CAAA,EAC9C,GAKA,OAHA,WAAAq/C,eAAA,GAEA,WAAA+B,MAAA,CAAA96F,KAAAC,SAAA,CAAAkmF,IACA,OAAAhiB,EAAA,CAoBA,MAAA42B,gBAAAvyD,CAAA,EACA,IAAA3oC,EAAAG,KAAAF,KAAA,CAAA0oC,GACA,GAAA3oC,GAAA,iBAAAA,GAAA,OAAAA,EAAA,CACA,IAAA2e,EAAA,MAAAngB,EAAA,CAAA4C,GAAA,CAAApB,EAAA1B,EAAA,EACA,GAAAqgB,MAAAA,EAAA,CACA,KAAAupD,IAAA,YAAA1gB,EAAA2D,SAAA,oDACAgwC,WAAA,aACAn7F,OAAAA,CACA,IACA,MACA,CACA,MAAAxB,EAAA,CAAA2iC,MAAA,CAAAnhC,EAAA1B,EAAA,EACAqgB,EAAAi7B,OAAA,CAAA55C,EACA,MACA,GAAAA,GAAAA,qBAAAA,EAAAo7D,MAAA,EACA,IAAAu/B,EAAA36F,EAAA+9C,MAAA,CAAAooC,YAAA,CACAZ,EAAA,MAAA1d,CAAA,CAAAzmE,GAAA,CAAAu5F,GACA,GAAApV,EACAA,EAAAuV,cAAA,CAAA96F,EAAA+9C,MAAA,CAAA/9C,MAAA,MAEA,CACA,IAAAg7F,EAAA,MAAAA,EAAA,CAAA55F,GAAA,CAAAu5F,EACA,OAAAK,IACAA,EAAA,GACA,MAAAA,EAAA,CAAAzjG,GAAA,CAAAojG,EAAAK,IAEAA,EAAAjmG,IAAA,CAAAiL,EAAA+9C,MAAA,CAAA/9C,MAAA,CACA,CACA,KACA,CACA,KAAAkoE,IAAA,YAAA1gB,EAAA2D,SAAA,iDACAgwC,WAAA,qBACAn7F,OAAAA,CACA,IACA,MACA,CACA,CAKA,MAAAi7F,OAAAtyD,CAAA,EACA,6CACA,CACA,CACA14C,EAAA4iF,cAAsB,CAAAA,sCClTtB9iF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2iF,iBAAyB,QACzB,IAAAwoB,EAAgBrnG,EAAQ,OACxBm6F,EAA6Bn6F,EAAQ,MAWrC,OAAA6+E,UAAAsb,EAAArb,cAAA,CACA,CAAA9I,EAAA,EACAsxB,EAAA,KACAA,WAAA,CACA,eAAAA,EAAA,CACA,gCAEA,aAAAA,EAAA,CAEAzsG,YAAA4wF,CAAA,CAAAb,CAAA,CAAA3pD,CAAA,EACA,MAAA2pD,EAAA3pD,GACA,iBAAAwqD,GACA,MAAAzV,EAAA,KAAoC,IAAAqxB,EAAAE,SAAA,CAAA9b,GACpC,MAAA6b,EAAA,OAAAtxB,EAAA,IAEA,mBAAAyV,GACA,MAAAzV,EAAA,CAAAyV,EACA,MAAA6b,EAAA,CAAA7b,MAGA,MAAAzV,EAAA,MACA,MAAAsxB,EAAA,CAAA7b,GAEA,KAAA6b,SAAA,CAAAE,MAAA,WACA,IACA,WAAAjK,MAAA,GACA,KAAA51C,MAAA,EACA,CACA,MAAA79C,EAAA,CACAD,QAAAI,GAAA,qCAAAH,EAEA,CACA,EACA,KAAAw9F,SAAA,CAAAG,SAAA,KACA,KAAAN,eAAA,CAAAvyD,EAAA5xC,IAAA,CACA,CAgBA,CACA,MAAAkkG,OAAAtyD,CAAA,EACA,KAAA0yD,SAAA,CAAAxxB,IAAA,CAAAlhC,EACA,CACA,MAAA/wC,SAAA,CACA,YAAAyjG,EAAA,GACA,MAAAA,EAAA,CAAAlT,KAAA,GACA,MAAAkT,EAAA,OAEA,MAAAzjG,SACA,CACA,CACA3H,EAAA2iF,iBAAyB,CAAAA,sCC7EzB7iF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAu8E,mBAA2B,CAAGv8E,EAAAq8E,kBAA0B,CAAGr8E,EAAAk7E,GAAW,CAAGl7E,EAAAikF,KAAa,CAAGjkF,EAAAo3E,WAAmB,CAAGp3E,EAAAgkF,OAAe,QAE9H,IAAAzsB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B68D,EAAAl/D,OAAA,GAEA,SAAAq7D,EAAA78D,CAAA,SACA,MAAAA,EACA,KAEAA,CACA,CACA,SAAAurG,EAAAvrG,CAAA,SACA,MAAAA,EACA,KAEAA,EAAA+J,QAAA,EACA,CAMA,MAAAg6E,EAIAuN,QAAA,CAaAE,YAAA,CAUAC,oBAAA,aAKAH,CAAA,CAAAE,CAAA,CAAAC,CAAA,EACA,GAAAn6B,EAAAlB,gBAAA,QACAk7B,SAAAz0B,EAAAy0B,GACAE,aAAA30B,EAAA20B,GACAC,qBAAA50B,EAAA40B,EACA,EACA,CAIAvQ,QAAA,CACA,IAAgBoQ,SAAAA,CAAA,CAAAE,aAAAA,CAAA,CAAAC,qBAAAA,CAAA,EAA+C,KAC/D,OACAtQ,MAAA,UACAmQ,SAAAia,EAAAja,GACAE,aAAA+Z,EAAA/Z,GACAC,qBAAA8Z,EAAA9Z,EACA,CACA,CACA,CACA1xF,EAAAgkF,OAAe,CAAAA,EA4DfhkF,EAAAo3E,WAAmB,CAtDnB,SAAA4X,CAAA,EACA,IAAAj/E,EAAA,GAYA,QAAAM,KAVA2+E,EAAAlnF,EAAA,EACAiI,CAAAA,EAAAjI,EAAA,CAAAknF,EAAAlnF,EAAA,EAEAknF,EAAAllF,IAAA,EACAiG,CAAAA,EAAAjG,IAAA,CAAAklF,EAAAllF,IAAA,EAEAklF,EAAAloF,IAAA,EACAiJ,CAAAA,EAAAjJ,IAAA,IAAAywD,EAAAyD,OAAA,EAAAg0B,EAAAloF,IAAA,GAEA,qFAAAxF,KAAA,OAEA+O,KAAA2+E,GAAAA,MAAAA,CAAA,CAAA3+E,EAAA,EAGAN,CAAAA,CAAA,CAAAM,EAAA,IAAAknD,EAAAwJ,SAAA,EAAAiuB,CAAA,CAAA3+E,EAAA,YAAqEA,EAAI,IAGzE,QAAAA,IADA,aAAA/O,KAAA,MAEA+O,KAAA2+E,GAAAA,MAAAA,CAAA,CAAA3+E,EAAA,EAGAN,CAAAA,CAAA,CAAAM,EAAA,IAAAknD,EAAAqF,SAAA,EAAAoyB,CAAA,CAAA3+E,EAAA,YAAqEA,EAAI,IA4BzE,OA1BA2+E,EAAAoO,UAAA,EACArtF,CAAAA,EAAAqtF,UAAA,IAAAjlC,EAAAwtB,aAAA,EAAAqJ,EAAAoO,UAAA,GAEA,aAAApO,GACAj/E,CAAAA,EAAA4gF,QAAA,CAAA3B,EAAA2B,QAAA,EAEA,mBAAA3B,GACAj/E,CAAAA,EAAAiiF,cAAA,GAAAhD,EAAAgD,cAAA,EAEA,eAAAhD,GACAj/E,CAAAA,EAAA07F,UAAA,CAAAzc,EAAAyc,UAAA,EAEA,wBAAAzc,GAAAA,EAAAqO,mBAAA,EACAttF,CAAAA,EAAAstF,mBAAA,CAAArO,EAAAqO,mBAAA,CAAAvtF,KAAA,IAEA,QAAAk/E,GACAj/E,CAAAA,EAAA27F,GAAA,CAAA1c,EAAA0c,GAAA,EAEA,UAAA1c,GAAAA,EAAA2c,KAAA,EACA57F,CAAAA,EAAA47F,KAAA,CAAA3c,EAAA2c,KAAA,CAAAtxF,GAAA,IACA,GAAAk9C,EAAA4tB,WAAA,EAAA5mF,GACA,GAAAg5D,EAAAyD,OAAA,EAAAz8D,GAEAuB,OAAAwM,MAAA,IAAmC/N,GAC1B,EAETwR,CACA,CAMA,OAAAk0E,EAKAv2B,QAAA,CAKAxvD,MAAA,CAOAe,IAAA,CAKAk9F,SAAA,CAIAF,UAAA,CAKAC,qBAAA,CAOA1sF,KAAA,CAUA4sF,UAAA,CAIAxF,QAAA,CAIAyF,OAAA,CAKAC,SAAA,CAIAC,YAAA,CAKAC,WAAA,CAKAC,aAAA,CAKAC,KAAA,CAKAC,UAAA,CAIAvK,SAAA,CAQAT,aAAA,EACAiL,EAAA,aAOA9mC,CAAA,CAAApI,CAAA,EACA,MAAAkvC,EAAA,CAAA9mC,EAAA8mC,YAAA,CAAAviF,GAAA,IACA,iBAAAsgD,EACA,IAAA4hB,EAAA5hB,EAAAjN,GAEAiN,GAEA,GAAApD,EAAAlB,gBAAA,QACA3I,SAAAA,EACAzuD,KAAA69D,EAAAhH,EAAA72D,IAAA,EACAf,OAAA43D,EAAA53D,MAAA,CACAi+F,UAAArmC,EAAAqmC,SAAA,CACAF,WAAAnmC,EAAAmmC,UAAA,CACAC,sBAAApmC,EAAAomC,qBAAA,CACA1sF,MAAAsmD,EAAAtmD,KAAA,CACA4sF,WAAAtmC,EAAAsmC,UAAA,CACAxF,SAAA9gC,EAAA8gC,QAAA,CACAyF,QAAAvmC,EAAAumC,OAAA,CACAG,YAAA1mC,EAAA0mC,WAAA,CACAC,cAAA3mC,EAAA2mC,aAAA,CACAC,MAAA5mC,EAAA4mC,KAAA,CACAC,WAAA7/B,EAAAhH,EAAA6mC,UAAA,EACAvK,UAAAt8B,EAAAs8B,SAAA,CACAT,cAAA70B,EAAAhH,EAAA67B,aAAA,EACA2K,UAAAxmC,EAAAwmC,SAAA,CACAC,aAAAzmC,EAAAymC,YAAA,EAEA,CAKA,IAAAK,cAAA,CACA,aAAAA,EAAA,CAAAviF,GAAA,IACA,iBAAAsgD,EACAA,EAEAA,EAAA17D,IAAA,CAEA,CASA,IAAA2sG,wBAAA,CACA,IAAAC,EAAA,MAAAjP,EAAA,CAAA9sF,KAAA,UAEA,IAAA+7F,EAAA9sG,MAAA,CACA,IAGA,GAAAw4D,EAAA0F,MAAA,mBAAA4uC,CAAA,mFACA3uC,UAAA,wBACA,GACA2uC,EACA,CAIA1qB,QAAA,CACA,IAAgBwQ,cAAAA,CAAA,CAAAyK,WAAAA,CAAA,CAAAhK,UAAAA,CAAA,CAAAwE,SAAAA,CAAA,CAAAyF,QAAAA,CAAA,CAAAp9F,KAAAA,CAAA,CAAAy9F,MAAAA,CAAA,CAAAC,WAAAA,CAAA,CAAAntF,MAAAA,CAAA,CAAAtR,OAAAA,CAAA,CAAA+9F,WAAAA,CAAA,CAAAC,sBAAAA,CAAA,CAAAI,UAAAA,CAAA,CAAAC,aAAAA,CAAA,CAAAJ,UAAAA,CAAA,CAAAS,aAAAA,CAAA,EAAuL,KACvM,OACAxb,MAAA,QACAuQ,cAAA6Z,EAAA7Z,GACAyK,WAAAoP,EAAApP,GACAhK,UAAAA,EACAwE,SAAA4U,EAAA5U,GACAyF,QAAAmP,EAAAnP,GACAG,YAAAgP,EAAA,KAAAhP,WAAA,EACAC,cAAA+O,EAAA,KAAA/O,aAAA,EACAx9F,KAAAA,EAAAy9F,MAAAA,EAAAC,WAAAA,EAAAntF,MAAAA,EAAAtR,OAAAA,EAAA+9F,WAAAA,EAAAE,UAAAA,EACAD,sBAAAA,EAAAI,UAAAA,EAAAC,aAAAA,EACAK,aAAAA,CACA,CACA,CACA,CAAAjyC,OAAAC,QAAA,IACA,IAAAtwC,EAAA,EACAuxF,EAAA,KAAAjP,YAAA,CACA,OACA7yC,KAAA,IACA,OAAAhrD,MAAA,CACA,CACAkB,MAAA4rG,CAAA,CAAAvxF,IAAA,CAAA2vC,KAAA,EACA,EAEA,CAAyBhqD,MAAA+C,KAAAA,EAAAinD,KAAA,GAEzB,CACA,CAIA,IAAAlrD,QAAA,CAAmB,aAAA69F,EAAA,CAAA79F,MAAA,CAInB,IAAA0yD,MAAA,QACA,WAAA0qC,SAAA,CACA,KAEA,IAAA3wF,KAAA,SAAA2wF,SAAA,CACA,CAIA,MAAAtf,eAAAivB,CAAA,EAEA,IAAAnxC,EACA,oBAAAmxC,EACAnxC,EAAA,MAAAiiC,EAAA,CAAAkP,EAAA,KAEA,CACA,IAAA7sG,EAAA6sG,EAAAn6F,WAAA,GACA,QAAA42B,KAAA,MAAAq0D,EAAA,EACA,oBAAAr0D,EAAA,CACA,GAAAA,IAAAtpC,EACA,SAEA07D,EAAApyB,EACA,KACA,CAEA,GAAAA,EAAAtpC,IAAA,GAAAA,GAGA07D,EAAApyB,EACA,MAEA,CACA,CACA,GAAAoyB,MAAAA,EACA,gCAEA,iBAAAA,EACA,WAAAjN,QAAA,CAAAmvB,cAAA,CAAAliB,GAGAA,CAEA,CAOAoxC,yBAAAD,CAAA,EACA,IAAAD,EAAA,KAAAD,sBAAA,CACA,oBAAAE,EACA,OAAAD,CAAA,CAAAC,EAAA,CAGA,QAAAnxC,KADAmxC,EAAAA,EAAAn6F,WAAA,GACAk6F,GACA,GAAAlxC,EAAA17D,IAAA,GAAA6sG,EACA,OAAAnxC,EAGA,GAAApD,EAAAiC,cAAA,6CAAAsyC,EACA,CAKAE,SAAA,CAAgB,aAAA/sG,IAAA,CAIhBgtG,UAAA,CACA,aAAAta,aAAA,CAKAua,eAAA,CACA,SAAAF,OAAA,GACA,gBAEA,MAi2BA,CAAate,OAAA,aAAAzuF,KAAA62D,IAj2Bb,CAi2Ba72D,IAAA,CAAAf,OAAA43D,IAj2Bb,CAi2Ba53D,MAAA,CAh2Bb,CACA,CACA8B,EAAAikF,KAAa,CAAAA,CAQb,OAAA/I,EAKAxtB,QAAA,CAKAouC,eAAA,CAKAjL,SAAA,CAOAL,WAAA,CAOAyF,OAAA,CAIA/mF,OAAA,CAIApI,IAAA,CAOA4kE,MAAA,CAMApxD,KAAA,CAIAyhF,gBAAA,aAIAhuF,CAAA,CAAA2/C,CAAA,EACA,KAAAA,QAAA,CAAAA,EACA,IAAAge,EAAA5rE,OAAA4gC,MAAA,CAAA3yB,EAAA29D,MAAA,CAAA57D,KAAA,IACA,GAAAynD,EAAAlB,gBAAA,QACAylC,gBAAA/tF,EAAA+tF,eAAA,CACAjL,UAAA9iF,EAAA8iF,SAAA,CACAL,YAAAziF,EAAAyiF,WAAA,CACAyF,QAAAloF,EAAAkoF,OAAA,CACA/mF,QAAAnB,EAAAmB,OAAA,CACApI,KAAAiH,EAAAjH,IAAA,CACA4kE,OAAAA,EACApxD,MAAAvM,EAAAuM,KAAA,CACAyhF,iBAAAhuF,EAAAguF,gBAAA,EAEA,CAIA5a,QAAA,CACA,IAAgBjyE,QAAAA,CAAA,CAAA2hF,UAAAA,CAAA,CAAAL,YAAAA,CAAA,CAAA1pF,KAAAA,CAAA,CAAAwT,MAAAA,CAAA,CAAA27E,QAAAA,CAAA,CAAAvqB,OAAAA,CAAA,CAAAowB,gBAAAA,CAAA,CAAAC,iBAAAA,CAAA,EAAmG,KACnH,OACA3a,MAAA,MACAlyE,QAAAA,EAAA2hF,UAAAA,EAAAL,YAAAA,EAAA1pF,KAAAA,EAAAwT,MAAAA,EACA27E,QAAAA,EAAAvqB,OAAAA,EAAAowB,gBAAAA,EAAAC,iBAAAA,CACA,CACA,CAIA,MAAAnf,UAAA,CACA,IAAA9mB,EAAA,WAAApI,QAAA,CAAAkvB,QAAA,MAAAiU,SAAA,EAEA,MADA,GAAAt5B,EAAA0F,MAAA,IAAAnH,EAAA,iDACAA,CACA,CAIA,MAAA+mB,gBAAA,CACA,IAAAliB,EAAA,WAAAjN,QAAA,CAAAmvB,cAAA,MAAAif,eAAA,EAEA,MADA,GAAAvkC,EAAA0F,MAAA,IAAAtC,EAAA,iDACAA,CACA,CAKA,MAAAmiB,uBAAA,CACA,IAAAJ,EAAA,WAAAhvB,QAAA,CAAAovB,qBAAA,MAAAgf,eAAA,EAEA,MADA,GAAAvkC,EAAA0F,MAAA,IAAAyf,EAAA,yDACAA,CACA,CAIAyvB,cAAA,CACA,MA8uBA,CAAaze,OAAA,WAAA3/E,IAAA,CACb+tF,gBAAA/tF,IA/uBA,CA+uBA+tF,eAAA,CACAjL,UAAA9iF,IAhvBA,CAgvBA8iF,SAAA,CACAL,YAAAziF,IAjvBA,CAivBAyiF,WAAA,CACAthF,QAAAnB,IAlvBA,CAkvBAmB,OAAA,CACApI,KAAAiH,IAnvBA,CAmvBAjH,IAAA,CACA4kE,OAAA5rE,OAAA4gC,MAAA,CAAA3yB,IApvBA,CAovBA29D,MAAA,CAAA57D,KAAA,IACAwK,MAAAvM,IArvBA,CAqvBAuM,KAAA,CACA,CArvBA,CACA,CACAta,EAAAk7E,GAAW,CAAAA,CAoBX,OAAAmB,EAKA3uB,QAAA,CAIA5lD,EAAA,CAIAgC,IAAA,CAQAizF,eAAA,CAIA99F,IAAA,CAIAqb,KAAA,CAIAu2E,SAAA,CAIAL,WAAA,CAMAwM,SAAA,CAQAX,OAAA,CAIAG,WAAA,CAQAS,iBAAA,CAQA1L,QAAA,CAIA2L,YAAA,CAIAviF,IAAA,CASAwiF,MAAA,CAOAvhE,IAAA,EACA0gD,EAAA,aAIA3hB,CAAA,CAAAjN,CAAA,EACA,MAAA4uB,EAAA,CAAAx8E,OAAA4gC,MAAA,CAAAi6B,EAAA2hB,IAAA,CAAAjiE,GAAA,IACA,IAAA6gE,EAAAntE,EAAA2/C,KAEA,IAAA6jC,EAAA5wB,CACAhG,OAAAA,EAAAq5B,iBAAA,CACAzC,EAAA52B,EAAAq5B,iBAAA,CAEA,MAAAr5B,EAAA42B,QAAA,EACAA,CAAAA,EAAA52B,EAAA42B,QAAA,EAEA,GAAAh6B,EAAAlB,gBAAA,QACA3I,SAAAA,EACA5lD,GAAA6yD,EAAA7yD,EAAA,CACAgC,KAAA6wD,EAAA7wD,IAAA,CACAizF,gBAAApiC,EAAAoiC,eAAA,CACA99F,KAAA07D,EAAA17D,IAAA,CACAqb,MAAAqgD,EAAArgD,KAAA,CACAu2E,UAAAl2B,EAAAk2B,SAAA,CACAL,YAAA71B,EAAA61B,WAAA,CACAwM,UAAAriC,EAAAqiC,SAAA,CACAX,QAAA1hC,EAAA0hC,OAAA,CACAY,kBAAAtiC,EAAAsiC,iBAAA,CACAT,YAAA7hC,EAAA6hC,WAAA,CACAjL,SAAAA,EACA2L,aAAAviC,EAAAuiC,YAAA,CACAviF,KAAAggD,EAAAhgD,IAAA,CAEAwiF,OAAAxiC,EAAAwiC,MAAA,CACAvhE,KAAA++B,EAAA/+B,IAAA,EAEA,CAIA,IAAA0gD,MAAA,CAAiB,aAAAA,EAAA,CAIjB6E,QAAA,CACA,IAAgBr5E,GAAAA,CAAA,CAAAgC,KAAAA,CAAA,CAAAizF,gBAAAA,CAAA,CAAA99F,KAAAA,CAAA,CAAAqb,MAAAA,CAAA,CAAAu2E,UAAAA,CAAA,CAAAL,YAAAA,CAAA,CAAAwM,UAAAA,CAAA,CAAA1gB,KAAAA,CAAA,CAChB6gB,OAAAA,CAAA,CAAAvhE,KAAAA,CAAA,EAAuB,KACvB,OACAwlD,MAAA,qBACAyP,UAAAA,EAAAL,YAAAA,EAEAuM,gBAAAA,EACAE,kBAAAuO,EAAA,KAAAvO,iBAAA,EACAnzF,KAAAA,EACAynF,SAAAia,EAAA,KAAAja,QAAA,EACAiL,YAAAgP,EAAA,KAAAhP,WAAA,EACAU,aAAAsO,EAAA,KAAAtO,YAAA,EACAb,QAAAmP,EAAA,KAAAnP,OAAA,EACAp9F,KAAAA,EAAAqb,MAAAA,EAAAgiE,KAAAA,EAAA0gB,UAAAA,EAAAphE,KAAAA,EAAAuhE,OAAAA,EAAAr1F,GAAAA,CACA,CACA,CAIA,IAAA/I,QAAA,CAAmB,YAAAu9E,IAAA,CAAAv9E,MAAA,CACnB,CAAA4rD,OAAAC,QAAA,IACA,IAAAtwC,EAAA,EACA,OACAyvC,KAAA,IACA,OAAAhrD,MAAA,CACA,CAA6BkB,MAAA,KAAAq8E,IAAA,CAAAhiE,IAAA,CAAA2vC,KAAA,IAE7B,CAAyBhqD,MAAA+C,KAAAA,EAAAinD,KAAA,GAEzB,CACA,CAIA,IAAAmiD,KAAA,CACA,YAAA/P,OAAA,MAAA9K,QAAA,CAKA,MAAA3U,UAAA,CACA,IAAA9mB,EAAA,WAAApI,QAAA,CAAAkvB,QAAA,MAAAiU,SAAA,EACA,GAAA/6B,MAAAA,EACA,oBAEA,OAAAA,CACA,CAIA,MAAA+mB,gBAAA,CACA,IAAAliB,EAAA,WAAAjN,QAAA,CAAAmvB,cAAA,MAAA59E,IAAA,EACA,GAAA07D,MAAAA,EACA,oBAEA,OAAAA,CACA,CAOA,MAAA0xC,WAAA,CACA,kBAAA3+C,QAAA,CAAAumC,oBAAA,MAAAh1F,IAAA,CACA,CAIA,MAAAqtG,eAAA,CACA,kBAAA5+C,QAAA,CAAA6iC,cAAA,QAAAC,WAAA,EACA,CAIA2b,cAAA,CACA,OAAAI,EAAA,KACA,CAIAC,eAAAj8D,CAAA,EAEA,MADA,GAAAgnB,EAAA0F,MAAA,GAAA1sB,GAAAA,EAAAy7D,OAAA,4EAAsI9uC,UAAA,0BACtIuvC,EAAA,KAAAl8D,EACA,CACA,CACAvwC,EAAAq8E,kBAA0B,CAAAA,CAU1B,OAAAE,EAKA7uB,QAAA,CAMA8iC,WAAA,CAMAK,SAAA,CAIAv2E,KAAA,CAIArb,IAAA,CAKA0b,IAAA,CASA7S,EAAA,CAMAgC,IAAA,CASA0F,KAAA,CAMAonF,QAAA,CAaArF,QAAA,CAMAG,oBAAA,CAKAD,YAAA,CAIA6L,gBAAA,CAIAx2F,IAAA,CAKA7G,KAAA,CAIAqP,OAAA,CAIA+oC,SAAA,CAKA+kD,UAAA,CAIAC,mBAAA,EACAqP,EAAA,aAIA/xC,CAAA,CAAAjN,CAAA,EACA,KAAAA,QAAA,CAAAA,EACA,KAAA8iC,WAAA,OAAA71B,EAAA61B,WAAA,CAAA71B,EAAA61B,WAAA,MACA,KAAAK,SAAA,OAAAl2B,EAAAk2B,SAAA,CAAAl2B,EAAAk2B,SAAA,MACA,KAAA5xF,IAAA,CAAA07D,EAAA17D,IAAA,CACA,KAAAqb,KAAA,CAAAqgD,EAAArgD,KAAA,CACA,KAAAK,IAAA,CAAAggD,EAAAhgD,IAAA,CACA,KAAA7Q,IAAA,CAAA6wD,EAAA7wD,IAAA,CACA,KAAAhC,EAAA,CAAA6yD,EAAA7yD,EAAA,OACA,KAAA8uF,QAAA,CAAAj8B,EAAAi8B,QAAA,CACA,KAAApnF,KAAA,CAAAmrD,EAAAnrD,KAAA,CACA,KAAA1I,IAAA,CAAA6zD,EAAA7zD,IAAA,CACA,KAAA7G,KAAA,CAAA06D,EAAA16D,KAAA,CACA,KAAAsxF,QAAA,CAAA52B,EAAA42B,QAAA,CACA,KAAAG,oBAAA,OAAA/2B,EAAA+2B,oBAAA,CAAA/2B,EAAA+2B,oBAAA,MACA,KAAAD,YAAA,OAAA92B,EAAA82B,YAAA,CAAA92B,EAAA82B,YAAA,MACA,KAAA6L,gBAAA,OAAA3iC,EAAA2iC,gBAAA,CAAA3iC,EAAA2iC,gBAAA,MACA,KAAAhuF,OAAA,CAAAqrD,EAAArrD,OAAA,CACA,KAAA+oC,SAAA,CAAAsiB,EAAAtiB,SAAA,CACA,KAAA+kD,UAAA,OAAAziC,EAAAyiC,UAAA,CAAAziC,EAAAyiC,UAAA,MACA,KAAAC,mBAAA,OAAA1iC,EAAA0iC,mBAAA,CAAA1iC,EAAA0iC,mBAAA,MACA,MAAAqP,EAAA,GACA,CAIAvrB,QAAA,CACA,IAAgBqP,YAAAA,CAAA,CAAAK,UAAAA,CAAA,CAAAv2E,MAAAA,CAAA,CAAArb,KAAAA,CAAA,CAAA0b,KAAAA,CAAA,CAAA7S,GAAAA,CAAA,CAAAgC,KAAAA,CAAA,CAAA0F,MAAAA,CAAA,CAAA1I,KAAAA,CAAA,CAAAuxC,UAAAA,CAAA,CAAA+kD,WAAAA,CAAA,CAAAC,oBAAAA,CAAA,EAA+G,KAC/H,OACAjc,MAAA,sBACAgc,WAAAA,EAAA5M,YAAAA,EAAAK,UAAAA,EACAwM,oBAAAA,EACA/tF,QAAAk8F,EAAA,KAAAl8F,OAAA,EACAxI,KAAAA,EAAAgD,KAAAA,EACA8sF,SAAA4U,EAAA,KAAA5U,QAAA,EACArF,SAAAia,EAAA,KAAAja,QAAA,EACAtyF,KAAAA,EACAwyF,aAAA+Z,EAAA,KAAA/Z,YAAA,EACAC,qBAAA8Z,EAAA,KAAA9Z,oBAAA,EACA4L,iBAAAkO,EAAA,KAAAlO,gBAAA,EACA9tF,MAAAA,EAAA6oC,UAAAA,EAAAvwC,GAAAA,EAAAwS,MAAAA,EAAAK,KAAAA,EACA1a,MAAAurG,EAAA,KAAAvrG,KAAA,CACA,CACA,CAMA,MAAA28E,UAAA,CACA,IAAA4T,EAAA,KAAAA,WAAA,CACA,GAAAA,MAAAA,EAAA,CACA,IAAA71B,EAAA,WAAAkiB,cAAA,GACAliB,GACA61B,CAAAA,EAAA71B,EAAA61B,WAAA,CAEA,CACA,GAAAA,MAAAA,EACA,YAEA,IAAA16B,EAAA,KAAApI,QAAA,CAAAkvB,QAAA,CAAA4T,GACA,GAAA16B,MAAAA,EACA,oBAEA,OAAAA,CACA,CAMA,MAAA+mB,gBAAA,CACA,YAAAnvB,QAAA,CAAAmvB,cAAA,MAAA59E,IAAA,CACA,CAIA,MAAAqtG,eAAA,CACA,cAAA9b,WAAA,EACA,IAAoB71B,GAAAA,CAAA,CAAA61B,YAAAA,CAAA,EAAkB,SAAAj5B,EAAAijB,iBAAA,GACtC7f,GAAA,KAAAkiB,cAAA,GACA2T,YAAA,KAAA9iC,QAAA,CAAA6iC,cAAA,EACA,UAEA,MAAA51B,GAAAA,MAAAA,EAAA61B,WAAA,CACA,EAEAA,EAAA71B,EAAA61B,WAAA,EACA,CAEA,OAAAA,MADA,KAAA9iC,QAAA,CAAA6iC,cAAA,GACA,KAAAC,WAAA,EACA,CAUA,MAAApW,KAAAwa,CAAA,CAAA+X,CAAA,EACA,IAAAnwB,EAAA,MAAAoY,EAAA,EAAAA,EACAnY,EAAA,MAAAkwB,EAAA,EAAAA,EACAD,EAAA,MAAAA,EAAA,CACAE,EAAA,GACAC,EAAAH,KAAAA,EACAI,EAAA,UAEA,GAAAD,EACA,YAEA,IAAoBrc,YAAAA,CAAA,CAAAhhF,MAAAA,CAAA,EAAqB,SAAA+nD,EAAAijB,iBAAA,GACzCgW,YAAA,KAAA9iC,QAAA,CAAA6iC,cAAA,GACA/gF,MAAA,KAAAk+C,QAAA,CAAA4lC,mBAAA,MAAAxpF,IAAA,CACA,GAGA,GAAA0F,EAAA,KAAAA,KAAA,EACAk9F,EAAAlc,EACA,MACA,CAEA,GAAAqc,EACA,YAEA,IAAAE,EAAA,WAAAlwB,cAAA,GACA,GAAAkwB,CAAAA,GAAAA,MAAAA,EAAAvc,WAAA,CAWA,IANA,KAAAoc,GAEAA,CADAA,EAAAF,EAAA,GACA,MAAAA,EAAA,EACAE,CAAAA,EAAA,MAAAF,EAAA,EAGAE,GAAApc,GAAA,CAEA,GAAAqc,EACA,YAEA,IAAA/2C,EAAA,WAAApI,QAAA,CAAAkvB,QAAA,CAAAgwB,EAAA,IAEA,GAAA92C,MAAAA,EACA,MAGA,QAAA72D,KAAA62D,EACA,GAAA72D,IAAA,KAAAA,IAAA,CACA,OAIA,QAAAgD,EAAA,EAAgCA,EAAA6zD,EAAA/2D,MAAA,CAAkBkD,IAAA,CAClD,IAAA04D,EAAA,MAAA7E,EAAA+mB,cAAA,CAAA56E,GACA,GAAA04D,EAAA7wD,IAAA,QAAAA,IAAA,EAAA6wD,EAAAnrD,KAAA,QAAAA,KAAA,EAEA,GAAAq9F,EACA,YAEA,IAAAnwB,EAAA,WAAAhvB,QAAA,CAAAovB,qBAAA,CAAAniB,EAAA17D,IAAA,EAEA,SAAAy9E,GAIA,EAAAA,EAAA8T,WAAA,GAAAhU,EAHA,OAOA,IAAA3hB,EAAA,UACAF,CAAAA,EAAA7zD,IAAA,QAAAA,IAAA,EAAA6zD,EAAA7yD,EAAA,QAAAA,EAAA,EAAA6yD,EAAA16D,KAAA,QAAAA,KAAA,CACA46D,EAAA,WAEA,OAAAF,EAAA7zD,IAAA,EAAA6zD,EAAA7wD,IAAA,GAAA6wD,EAAA7yD,EAAA,EAAA6yD,EAAA16D,KAAA,GAAA0gE,GACA9F,CAAAA,EAAA,aAEA,GAAAtD,EAAA0F,MAAA,wDACA+vC,UAAAnyC,aAAAA,GAAAA,cAAAA,EACAA,OAAAA,EACAoyC,YAAAtyC,EAAAk5B,sBAAA,CAAA6Y,GACAztG,KAAA07D,EAAA17D,IAAA,CACAy9E,QAAAA,CACA,EACA,CACA,CACAkwB,GACA,CAEA,EACAM,EAAA,IACA,GAAAxwB,MAAAA,GAAAA,IAAAA,EAAAygB,MAAA,CACA,OAAAzgB,EAEA,GAAAnlB,EAAA0F,MAAA,wDACAvC,OAAA,kBACA5zD,KAAA,KAAA+zD,OAAA,KAAAM,WAAA,KAAAL,OAAA,KACAG,YAAA,CACAnzD,GAAA40E,EAAA50E,EAAA,CACAgC,KAAA4yE,EAAA5yE,IAAA,CACAhD,KAAA,EACA,EAAiB41E,QAAAA,CACjB,EACA,EACAA,EAAA,WAAAhvB,QAAA,CAAAovB,qBAAA,MAAA79E,IAAA,EACA,GAAAu9E,IAAAA,EACA,OAAA0wB,EAAAxwB,GAEA,GAAAA,EACA,UAAAA,EAAA4vB,aAAA,IAAA9vB,EACA,OAAA0wB,EAAAxwB,EACA,MAMA,GAFA,MAAAowB,IAEAtwB,IAAAA,EACA,YAGA,IAAA2wB,EAAA,IAAAzjD,QAAA,CAAAC,EAAAC,KAEA,IAAAwjD,EAAA,GACAC,EAAA,KAAmCD,EAAAl5F,OAAA,IAAA2W,IAAA,EAInC,GAFAuiF,EAAAtoG,IAAA,MAAoC+nG,EAAA,KAEpCpwB,EAAA,GACA,IAAAoY,EAAAlG,WAAA,KACA0e,IACAzjD,EAAA,GAAA2N,EAAA2D,SAAA,4CACA,EAAiBuhB,GACjB2wB,EAAAtoG,IAAA,MAAwCgwF,aAAAD,EAAA,EACxC,CACA,IAAAyY,EAAA,MAAA5wB,IAEA,SAAAA,EAAA4vB,aAAA,IAAA9vB,EAAA,CACA6wB,IACA,IACA1jD,EAAAujD,EAAAxwB,GACA,CACA,MAAA9uE,EAAA,CACAg8C,EAAAh8C,EACA,CACA,CACA,EAIA,GAHAw/F,EAAAtoG,IAAA,MAAoC,KAAA4oD,QAAA,CAAA+qB,GAAA,MAAAx5E,IAAA,CAAAquG,EAAA,GACpC,KAAA5/C,QAAA,CAAA4qB,EAAA,MAAAr5E,IAAA,CAAAquG,GAEAZ,GAAA,GACA,IAAAa,EAAA,UACA,IAEA,MAAAT,GACA,CACA,MAAAl/F,EAAA,CAEA,MAAA2pD,EAAA+I,OAAA,EAAA1yD,EAAA,yBACAy/F,IACAzjD,EAAAh8C,GACA,MACA,CACA,CAEAi/F,GACA,KAAAn/C,QAAA,CAAAmrB,IAAA,SAAA00B,EAEA,EACAH,EAAAtoG,IAAA,MAAwC,KAAA4oD,QAAA,CAAA+qB,GAAA,SAAA80B,EAAA,GACxC,KAAA7/C,QAAA,CAAAmrB,IAAA,SAAA00B,EACA,CACA,GACA,aAAAJ,CACA,CAYAnB,SAAA,CACA,kBAAAnb,SAAA,CASA2c,UAAA,CACA,gBAAA7yF,IAAA,CASA8yF,UAAA,CACA,gBAAA9yF,IAAA,CASAsxF,UAAA,CACA,gBAAAtxF,IAAA,CAMA+yF,UAAA,CACA,gBAAA/yF,IAAA,CAMAwxF,cAAA,CAEA,MADA,GAAA50C,EAAA0F,MAAA,OAAA+uC,OAAA,oEAAmH9uC,UAAA,kBACnHqvC,EAAA,KACA,CAKAC,eAAAj8D,CAAA,EAGA,MAFA,GAAAgnB,EAAA0F,MAAA,OAAA+uC,OAAA,oEAAmH9uC,UAAA,kBACnH,GAAA3F,EAAA0F,MAAA,GAAA1sB,GAAAA,EAAAy7D,OAAA,4EAAsI9uC,UAAA,kBACtIuvC,EAAA,KAAAl8D,EACA,CAUAsjD,uBAAA6Y,CAAA,EACA,GAAAn1C,EAAAiC,cAAA,EAAAp7D,OAAAg4D,SAAA,CAAAs2C,IAAAA,GAAA,oCAAAA,GACA,IAAA/xC,EAAA,IAAA4hB,EAAA,UAAA7uB,QAAA,EAEA,OADAiN,EAAA,CAAA+xC,EAAA,CAAAA,EACA/xC,CACA,CACA,CAKA,SAAA8xC,EAAA9xC,CAAA,CAAApqB,CAAA,EACA,OAAam9C,OAAA,sBAAA/yB,GAAAA,EAAApqB,MAAAA,CAAA,CACb,CACA,SAAAg8D,EAAA5xC,CAAA,EACA,OAAa+yB,OAAA,mBAAA/yB,GAAAA,CAAA,CACb,CATA36D,EAAAu8E,mBAA2B,CAAAA,sCC1wC3Bz8E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8jF,YAAoB,QACpB,IAAAvsB,EAAmBzzD,EAAQ,OAC3B25F,EAA6B35F,EAAQ,MAMrC,OAAAggF,UAAA2Z,EAAA1Z,cAAA,CAIAyS,MAAA,EACAmX,EAAA,EACAh3D,EAAA,aAIA6/C,CAAA,EACA,MAAAA,EAAA9oC,QAAA,EACA,GAAA6J,EAAAlB,gBAAA,QAAiDmgC,OAAAA,CAAA,GACjD,MAAAmX,EAAA,MACA,MAAAh3D,EAAA,EACA,CACA,MAAAmZ,YAAA,CACA,YAAA0mC,MAAA,CAAA1mC,UAAA,EACA,CACAgqB,QAAApsB,CAAA,EACA,WAAAo2B,EAAA,KAAA0S,MAAA,CAAA1c,OAAA,CAAApsB,GACA,CACA,MAAAgpC,SAAA/F,CAAA,EACA,GAAAA,YAAAA,EAAA,CACA,YAAAgd,EAAA,EACA,OAAAA,EAAA,OAAAjX,SAAA,YAEA,IAAA//C,EAAA,MAAAA,EAAA,CACA,mBAAAg3D,EAAA,CAAAh3D,CACA,CACA,aAAA+/C,SAAA/F,EACA,CAKA5gE,WAAA,CACA,MAAA4mB,EAAA,EACA,CAKA/J,OAAA,CACA,MAAA+J,EAAA,GACA,MAAAg3D,EAAA,KACA,CACA,MAAAp3B,gBAAA5b,CAAA,EACA,IAAAgzC,EAAA,KAAAjX,QAAA,YAMA,OALA,KAAA3mE,SAAA,GAEA4qC,CADAA,EAAA,WAAA67B,MAAA,CAAAjd,mBAAA,CAAA5e,EAAA,EACAnrD,KAAA,OAAAm+F,EAGA,WAAAnX,MAAA,CAAAjgB,eAAA,CAAA5b,EACA,CACAo8B,gBAAAp8B,CAAA,EACA,YAAA67B,MAAA,CAAAO,eAAA,CAAAp8B,EACA,CACAs8B,YAAAv+C,CAAA,EACA,YAAA89C,MAAA,CAAAS,WAAA,CAAAv+C,EACA,CACAw+C,cAAAjoF,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EACA,YAAAu2F,MAAA,CAAAU,aAAA,CAAAjoF,EAAA2qD,EAAA35D,EACA,CACA,CACAD,EAAA8jF,YAAoB,CAAAA,sCC3EpBhkF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAkpG,yBAAiC,CAAGlpG,EAAAmpG,uBAA+B,CAAGnpG,EAAA4tG,kBAA0B,QAChG,IAAAr2C,EAAmBzzD,EAAQ,OAC3BopF,EAAgCppF,EAAQ,MAcxC,OAAA8pG,EACA,CAAAlgD,EAAA,EACAmgD,EAAA,EACAC,EAAA,EACApI,EAAA,EACAhX,EAAA,EACAqf,EAAA,aAMArgD,CAAA,EACA,MAAAA,EAAA,CAAAA,EACA,MAAAmgD,EAAA,MACA,MAAAC,EAAA,OAAAE,EAAA,CAAAj2F,IAAA,OACA,MAAA2tF,EAAA,IACA,MAAAhX,EAAA,MACA,MAAAqf,EAAA,GACA,CAIAE,WAAAvgD,CAAA,EACA,4CACA,CAIAwgD,aAAAxgD,CAAA,CAAA39C,CAAA,EACA,4CACA,CAIAo+F,SAAAzgD,CAAA,EACA,4CACA,CACA,OAAAsgD,EAAA,CAAAxd,CAAA,EACA,IAEA,YAAAqd,EAAA,EACA,OAAAA,EAAA,MAAAI,UAAA,OAAAvgD,EAAA,GAGA,IAAAg9C,EAAA,KACA,IACAA,EAAA,YAAAmD,EAAA,CAEA,MAAAjgG,EAAA,CACA,OAAA2pD,EAAA+I,OAAA,EAAA1yD,EAAA,0BAAAA,kBAAAA,EAAAsvD,SAAA,CACA,MAAAtvD,CAEA,CAGA,GAAA88F,MAAAA,EAAA,CACA,MAAAmD,EAAA,MACA,MAAAngD,EAAA,CAAAmoC,kBAAA,WAAAsY,QAAA,OAAAzgD,EAAA,GACA,MACA,CACA,IAAAghC,EAAA,YAAAhhC,EAAA,CAAAujC,UAAA,GAIA,GAHA,MAAAvC,EAAA,EACA,OAAAA,EAAA,CAAAA,CAAA,EAEA,MAAAA,EAAA,CAAAp/E,OAAA,GAAAo/E,EAAAp/E,OAAA,CACA,6BAEA,SAAAy+F,EAAA,CACA,OAEA,IAAAh+F,EAAA,YAAA29C,EAAA,CAAAksB,IAAA,yBAAA8wB,EAAA,CACA,YAAAwD,YAAA,OAAAxgD,EAAA,CAAA39C,EACA,CACA,MAAAnC,EAAA,CACAD,QAAAI,GAAA,SAAAH,EACA,CACA,MAAA8/C,EAAA,CAAAmrB,IAAA,eAAAi1B,EAAA,CACA,CACA,CAAAM,EAAA,GACA,IAAAP,EAAA,MAAAA,EAAA,CACAA,IACA,MAAAA,EAAA,MACAA,EAAA1jD,IAAA,KACA,MAAAuD,EAAA,CAAAjuD,SAAA,EAGA,MAAAiuD,EAAA,CAAAksB,IAAA,wBAAA8wB,EAAA,CACA,GAEA,CACAv3E,OAAA,CACA,MAAAuyE,EAAA,GAGA,MAAAA,EAAA,IACA,MAAAsI,EAAA,KACA,CACAz1B,MAAA,CACA,MAAAmtB,EAAA,GAGA,MAAAA,EAAA,IACA,MAAAqI,EAAA,IACA,MAAAK,EAAA,GACA,MAAA1gD,EAAA,CAAA+qB,GAAA,eAAAq1B,EAAA,EACA,CACAzgB,MAAAC,CAAA,EACAA,GACA,MAAA8gB,EAAA,GAEA,MAAA1gD,EAAA,CAAA+qB,GAAA,eAAAq1B,EAAA,CACA,CACAriD,QAAA,CAAe,KAAAt4B,KAAA,GACf,CACAnzB,EAAA4tG,kBAA0B,CAAAA,CAM1B,OAAAzE,UAAAyE,EACA,CAAAn2B,EAAA,aAKA/pB,CAAA,CAAAjzB,CAAA,EACA,MAAAizB,GACA,MAAA+pB,EAAA,CA7IAvnE,KAAAF,KAAA,CAAAE,KAAAC,SAAA,CA6IAsqB,GACA,CACA0zE,SAAAzgD,CAAA,EACA,WAAAw/B,EAAAwI,sBAAA,CAAAhoC,EAAA,MAAA+pB,EAAA,CACA,CACA,MAAAw2B,WAAAvgD,CAAA,EAEA,OADA,MAAAA,EAAAksB,IAAA,wBAAAnC,EAAA,EAEA,CACA,MAAAy2B,aAAAxgD,CAAA,CAAA+2C,CAAA,EACA,QAAA10F,KAAA00F,EACA/2C,EAAAuqB,IAAA,OAAAR,EAAA,CAAA/pB,EAAAsiC,QAAA,CAAAjgF,EAAA29C,EAAA+gC,QAAA,EAEA,CACA,CACAzuF,EAAAmpG,uBAA+B,CAAAA,CAM/B,OAAAD,UAAA0E,EACA,MAAAK,WAAAvgD,CAAA,EACA,aAAAA,EAAAksB,IAAA,sCACA,CACA,MAAAs0B,aAAAxgD,CAAA,CAAA+2C,CAAA,EACA,QAAA10F,KAAA00F,EACA/2C,EAAAuqB,IAAA,WAAAloE,EAEA,CACA,CACA/P,EAAAkpG,yBAAiC,CAAAA,sCCjLjCppG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA01F,sBAA8B,CAAG11F,EAAA21F,4BAAoC,CAAG31F,EAAA41F,uBAA+B,CAAG51F,EAAAy1F,yBAAiC,CAAGz1F,EAAAquG,iBAAyB,CAAGruG,EAAAw1F,sBAA8B,CAAGx1F,EAAAsuG,oBAA4B,QACvO,IAAA/2C,EAAmBzzD,EAAQ,OAC3B,SAAAmuB,EAAA1T,CAAA,EACA,OAAArO,KAAAF,KAAA,CAAAE,KAAAC,SAAA,CAAAoO,GACA,CAiBAve,EAAAsuG,oBAA4B,CAX5B,SAAA5gD,CAAA,CAAA+pB,CAAA,QACA,UAAAA,EACA,IAAA+d,EAAA9nC,GAEA,GAAA6J,EAAA+R,WAAA,EAAAmO,EAAA,IACA,IAAAke,EAAAjoC,EAAA+pB,OAEA,GAAAlgB,EAAA0F,MAAA,0DACAC,UAAA,uBAAAsB,KAAA,CAAmDiZ,MAAAA,CAAA,CACnD,EACA,CASA,OAAA+d,EACA,CAAA9nC,EAAA,EACAogD,EAAA,EACAS,EAAA,EAGA/d,EAAA,aAIA9iC,CAAA,EACA,MAAAA,EAAA,CAAAA,EACA,MAAAogD,EAAA,MACA,MAAAS,EAAA,KACA,MAAA/d,EAAA,GACA,CAIA,IAAAzC,iBAAA,CAA4B,aAAAwgB,EAAA,CAC5B,IAAAxgB,gBAAA9tF,CAAA,EAAiC,MAAAsuG,EAAA,CAAAtuG,CAAA,CACjC,OAAA+tG,EAAA,GACA,IACA,IAAAxd,EAAA,YAAA9iC,EAAA,CAAA6iC,cAAA,GAEA,cAAAC,EAAA,EACA,MAAAA,EAAA,CAAAA,EACA,MACA,CAEA,GAAAA,IAAA,MAAAA,EAAA,EACA,QAAAjyF,EAAA,MAAAiyF,EAAA,GAAoDjyF,GAAAiyF,EAAkBjyF,IAAA,CAEtE,eAAAuvG,EAAA,CACA,MAEA,aAAApgD,EAAA,CAAAuqB,IAAA,SAAA15E,EACA,CACA,MAAAiyF,EAAA,CAAAA,CACA,CACA,CACA,MAAA5iF,EAAA,CAIA,CAEA,YAAAkgG,EAAA,EAGA,OAAAA,EAAA,OAAApgD,EAAA,CAAAwnC,WAAA,OAAA8Y,EAAA,CAAAj2F,IAAA,aAAAw2F,EAAA,EACA,CACAp7E,OAAA,CACA,MAAA26E,EAAA,GAGA,MAAAA,EAAA,OAAApgD,EAAA,CAAAwnC,WAAA,OAAA8Y,EAAA,CAAAj2F,IAAA,aAAAw2F,EAAA,EACA,MAAAP,EAAA,GACA,CACAz1B,MAAA,CACA,MAAAu1B,EAAA,GAGA,MAAApgD,EAAA,CAAAsnC,aAAA,OAAA8Y,EAAA,EACA,MAAAA,EAAA,MACA,CACAzgB,MAAAC,CAAA,EACA,KAAA/U,IAAA,GACA+U,GACA,OAAAkD,EAAA,IAEA,CACA/kC,QAAA,CACA,KAAAt4B,KAAA,EACA,CACA,CACAnzB,EAAAw1F,sBAA8B,CAAAA,CAO9B,OAAA6Y,EACA,CAAA3gD,EAAA,EACAsgD,EAAA,EACAtI,EAAA,aAIAh4C,CAAA,EACA,MAAAA,EAAA,CAAAA,EACA,MAAAg4C,EAAA,IACA,MAAAsI,EAAA,KACA,KAAAQ,KAAA,CAAAhe,EAAA,MAAA9iC,EAAA,CACA,CACA,CAIA,MAAA8gD,MAAAhe,CAAA,CAAA9iC,CAAA,EACA,6CACA,CACAv6B,OAAA,CACA,MAAAuyE,EAAA,GAGA,MAAAA,EAAA,IACA,MAAAsI,EAAA,KACA,MAAAtgD,EAAA,CAAA4qB,EAAA,eAAA01B,EAAA,EACA,CACAz1B,MAAA,CACA,MAAAmtB,EAAA,GAGA,MAAAA,EAAA,IACA,MAAAh4C,EAAA,CAAA+qB,GAAA,eAAAu1B,EAAA,EACA,CACA3gB,MAAAC,CAAA,EAA6B,KAAA/U,IAAA,GAC7B9sB,QAAA,CAAe,KAAAt4B,KAAA,GACf,CACAnzB,EAAAquG,iBAAyB,CAAAA,CACzB,OAAA5Y,UAAA4Y,EACA,CAAArzD,EAAA,EACAyzD,EAAA,aACA/gD,CAAA,CAAA1S,CAAA,EACA,MAAA0S,GACA,MAAA1S,EAAA,CAAAA,EACA,MAAAyzD,EAAA,GACA,CACAphB,MAAAC,CAAA,EACAA,GACA,OAAAmhB,EAAA,KAEA,MAAAphB,MAAAC,EACA,CACA,MAAAkhB,MAAAhe,CAAA,CAAA9iC,CAAA,EACA,IAAAoI,EAAA,MAAApI,EAAAkvB,QAAA,OAAA5hC,EAAA,CACA,OAAA8a,IAGA,WAAA24C,EAAA,CACA,MAAAA,EAAA,CAAA34C,EAAA53D,MAAA,CAEA43D,EAAA53D,MAAA,OAAAuwG,EAAA,GACA/gD,EAAAuqB,IAAA,OAAAj9B,EAAA,CAAA8a,EAAA53D,MAAA,EACA,MAAAuwG,EAAA,CAAA34C,EAAA53D,MAAA,EAEA,CACA,CACA8B,EAAAy1F,yBAAiC,CAAAA,CAMjC,OAAAG,UAAAyY,EACA,CAAA5zE,CAAA,aACAizB,CAAA,CAAAjzB,CAAA,EACA,MAAAizB,GACA,MAAAjzB,CAAA,CAAAxI,EAAAwI,EACA,CACA,MAAA+zE,MAAAhe,CAAA,CAAA9iC,CAAA,EACA,oBAEA,CACA,CACA1tD,EAAA41F,uBAA+B,CAAAA,CAO/B,OAAAD,UAAA0Y,EACA,CAAApvG,EAAA,aAKAyuD,CAAA,CAAAzuD,CAAA,EACA,MAAAyuD,GACA,MAAAzuD,EAAA,CAAAA,CACA,CACA,MAAAuvG,MAAAhe,CAAA,CAAA9iC,CAAA,EACA,IAAAiN,EAAA,MAAAjN,EAAAovB,qBAAA,OAAA79E,EAAA,EACA07D,GACAjN,EAAAuqB,IAAA,OAAAh5E,EAAA,CAAA07D,EAEA,CACA,CACA36D,EAAA21F,4BAAoC,CAAAA,CAMpC,OAAAD,EACA,CAAAhoC,EAAA,EACAjzB,CAAA,EACAqzE,EAAA,EACApI,EAAA,EAGAlV,EAAA,aAKA9iC,CAAA,CAAAjzB,CAAA,EACA,MAAAizB,EAAA,CAAAA,EACA,MAAAjzB,CAAA,CAAAxI,EAAAwI,GACA,MAAAqzE,EAAA,OAAAE,EAAA,CAAAj2F,IAAA,OACA,MAAA2tF,EAAA,IACA,MAAAlV,EAAA,GACA,CACA,OAAAwd,EAAA,CAAAxd,CAAA,EAEA,cAAAA,EAAA,CACA,OAEA,IAAA/1D,EAAAxI,EAAA,MAAAwI,CAAA,CACAA,CAAAA,EAAAogD,SAAA,OAAA2V,EAAA,GACA/1D,EAAAqgD,OAAA,CAAA0V,EACA,IAAAlU,EAAA,YAAA5uB,EAAA,CAAAqtB,OAAA,CAAAtgD,GAGA,GAAA6hD,IAAAA,EAAAv9E,MAAA,EACA,MAAAyxF,EAAA,CAAAA,EAAA,IACA,OAAAA,EAAA,CAAAA,EAAA,IAEA,MACA,CACA,QAAAziF,KAAAuuE,EACA,MAAA5uB,EAAA,CAAAuqB,IAAA,OAAAx9C,CAAA,CAAA1sB,GAIA,MAAAyiF,EAAA,CAAAziF,EAAAyiF,WAAA,CAGAr9D,OAAA,CACA,MAAAuyE,EAAA,GAGA,MAAAA,EAAA,IACA,WAAAlV,EAAA,EACA,MAAA9iC,EAAA,CAAA6iC,cAAA,GAAApmC,IAAA,KACA,MAAAqmC,EAAA,CAAAA,CACA,GAEA,MAAA9iC,EAAA,CAAA4qB,EAAA,eAAAw1B,EAAA,EACA,CACAv1B,MAAA,CACA,MAAAmtB,EAAA,GAGA,MAAAA,EAAA,IACA,MAAAh4C,EAAA,CAAA+qB,GAAA,eAAAq1B,EAAA,EACA,CACAzgB,MAAAC,CAAA,EACA,KAAA/U,IAAA,GACA+U,GACA,OAAAkD,EAAA,IAEA,CACA/kC,QAAA,CACA,KAAAt4B,KAAA,EACA,CACA,CACAnzB,EAAA01F,sBAA8B,CAAAA,sCC5S9B51F,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAqrG,SAAiB,QAcjB,IAAAqD,EAAApxB,WAZA,uBAAAC,KACA,OAAAA,KAEA,uBAAA17C,OACA,OAAAA,OAEA,QAAqB,IAAN/9B,EAAAslC,CAAM,CACrB,OAAetlC,EAAAslC,CAAM,OAErB,uCACA,IAEAiiE,SAAA,CACArrG,EAAAqrG,SAAiB,CAAAqD,sCChBjB5uG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2lF,aAAqB,QACrB,IAAApuB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B,SAAA6qG,EAAA1gD,CAAA,CAAA8wC,CAAA,EACA,OACA7vF,QAAA,GAAAqoD,EAAAzH,UAAA,EAAA7B,GACA8wC,YAAAA,EAAA1kF,GAAA,EAAAu0F,EAAAt0F,KACA,GAAA69C,EAAAqB,cAAA,KAAArB,EAAAmR,WAAA,EAAAslC,EAAA,kCAAuHt0F,EAAM,GAAAs0F,GAC7HA,EAAAj9F,WAAA,IAEA,CACA,CA0BA3R,EAAA2lF,aAAqB,CAtBrB,SAAA1lF,CAAA,EACA,GAAA4J,MAAA8J,OAAA,CAAA1T,GACA,OAAAA,EAAAoa,GAAA,EAAA/S,EAAAgT,IACA,MAAA3G,OAAA,CAAArM,IACA,GAAA6wD,EAAAqB,cAAA,EAAAlyD,IAAAA,EAAAvI,MAAA,6BAA8Fub,EAAM,GAAAhT,GACpGqnG,EAAArnG,CAAA,IAAAA,CAAA,OAEA,GAAA6wD,EAAAqB,cAAA,EAAAlyD,MAAAA,GAAA,iBAAAA,EAAA,mCAAArH,GACA0uG,EAAArnG,EAAA4H,OAAA,CAAA5H,EAAAy3F,WAAA,IAGA,GAAA5mC,EAAAqB,cAAA,EAAAv5D,MAAAA,GAAA,iBAAAA,EAAA,8BAAAA,GACA,IAAA8P,EAAAjQ,OAAA6xD,IAAA,CAAA1xD,GAAAoa,GAAA,KACA,IAAA0kF,EAAA9+F,CAAA,CAAAguD,EAAA,CAAAhoB,MAAA,EAAAu2B,EAAAoyC,KACApyC,CAAA,CAAAoyC,EAAA,IACApyC,GACS,IACT,OAAAmyC,EAAA1gD,EAAAnuD,OAAA6xD,IAAA,CAAAotC,GAAAthF,IAAA,GACA,GAEA,OADA1N,EAAA0N,IAAA,EAAAhf,EAAAF,IAAAE,EAAAyQ,OAAA,CAAAg7D,aAAA,CAAA3rE,EAAA2Q,OAAA,GACAa,CACA,sCCrCAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAylF,cAAsB,CAAGzlF,EAAA0lF,cAAsB,QAC/C,IAAAnuB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAM3B,SAAA4hF,EAAAr1E,CAAA,EACA,IAAAw+F,EAOA,OALAA,EADA,iBAAAx+F,EACA8nD,EAAAkmB,UAAA,CAAAwD,gBAAA,CAAAxxE,EAAA,IAGAA,EAAAioC,SAAA,CAEA,GAAAif,EAAAzH,UAAA,KAAAqI,EAAAyT,SAAA,OAAAijC,EAAApuC,SAAA,KAAAA,SAAA,KACA,CACAzgE,EAAA0lF,cAAsB,CAAAA,EAQtB1lF,EAAAylF,cAAsB,CAHtB,SAAA79E,CAAA,CAAAywC,CAAA,EACA,OAAAqtC,EAAAvtB,EAAAkmB,UAAA,CAAAtoC,gBAAA,CAAAnuC,EAAAywC,GACA,sCCrBAv4C,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwlF,WAAmB,CAAGxlF,EAAAylF,cAAsB,CAAGzlF,EAAA0lF,cAAsB,CAAG1lF,EAAA2lF,aAAqB,QAE7F,IAAAmpB,EAAsBhrG,EAAQ,OAC9BhE,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA29F,EAAAnpB,aAAA,IACvF,IAAAluB,EAAmB3zD,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmD,EAAAiuB,cAAA,IACxF5lF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsmD,EAAAguB,cAAA,IACxF,IAAAspB,EAAuBjrG,EAAQ,OAC/BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA49F,EAAAvpB,WAAA,wCCdrF1lF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwlF,WAAmB,QACnB,IAAAjuB,EAAmBzzD,EAAQ,OAC3B2xE,EAAuB3xE,EAAQ,OAC/Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BgrG,EAAwBhrG,EAAQ,OAChC2zD,EAAqB3zD,EAAQ,OAC7B68D,EAAAl/D,OAAA,GACA8+E,EAAA9+E,OAAA,GACA++E,EAAA/+E,OAAA,IACAg/E,EAAAh/E,OAAA,IACAi/E,EAAAj/E,OAAA,IACAutG,EAAAvtG,OAAA,sEAEA,SAAAwtG,EAAA5/F,CAAA,CAAApQ,CAAA,EACA,IAAAiwG,EAAA7/F,EAAArF,QAAA,KACA,KAAAklG,EAAAnwG,MAAA,IACAmwG,EAAA,IAAAA,EAGA,WADAA,CAAAA,GAAA,GAAA/2C,EAAAvd,MAAA,EAAA37C,GAAAwhE,SAAA,IAEA,CACA,SAAA0uC,EAAAlvG,CAAA,QACA,OAAAA,EACA,KAEA,GAAAs3D,EAAAzH,UAAA,EAAA7vD,EACA,CACA,SAAAmvG,EAAAnvG,CAAA,CAAA4sD,CAAA,EACA,IACA,SAAAiiD,EAAAnpB,aAAA,EAAA1lF,EACA,CACA,MAAA2N,EAAA,CACA,GAAAwqD,EAAAoB,cAAA,KAAA5rD,EAAA8qC,OAAA,CAAAmU,EAAA5sD,EACA,CACA,CACA,SAAAovG,EAAAjwC,CAAA,CAAAvS,CAAA,QACA,OAAAuS,EACA,EAEA,GAAAhH,EAAAwE,SAAA,EAAAwC,EAAAvS,EACA,CACA,SAAAyiD,EAAAlwC,CAAA,CAAAvS,CAAA,EACA,GAAAuS,OAAAA,EACA,OAAAuB,EAEA,IAAA1gE,EAAA,GAAAm4D,EAAA2I,SAAA,EAAA3B,EAAAvS,GAEA,MADA,GAAAuL,EAAAoB,cAAA,EAAAv5D,GAAA+uG,EAAA,0BAAAniD,EAAA5sD,GACAA,CACA,CACA,SAAAsvG,EAAAnwC,CAAA,CAAAxgE,CAAA,EACA,IAAAqB,EAAA,GAAAm4D,EAAA2I,SAAA,EAAA3B,EAAA,SACArvD,EAAA,GAAAqoD,EAAAiF,SAAA,EAAAp9D,GAEA,MADA,GAAAm4D,EAAAoB,cAAA,EAAAzpD,EAAAhR,MAAA,6BAAiFH,EAAK,EAAAqB,GACtF8P,CACA,CACA,SAAAy/F,EAAAvvG,CAAA,EACA,SAAA6uG,EAAAnpB,aAAA,EAAA1lF,GAAAoa,GAAA,KAAA/S,EAAA4H,OAAA,CAAA5H,EAAAy3F,WAAA,EACA,CAqGA,SAAA0Q,EAAA90C,CAAA,CAAAiwB,CAAA,MACA7J,EACA,IAEA,GADAA,EAAAsuB,EAAAzkB,CAAA,eACA7J,IAAAA,GAAAA,IAAAA,EACA,0BAEA,CACA,MAAAnzE,EAAA,CACA,GAAAwqD,EAAAoB,cAAA,iCAAAoxB,CAAA,IACA,CACA,IAAAniD,EAAA,GAAA2vB,EAAAyT,YAAA,EAAA+e,CAAA,QACAzoF,EAAA,GAAAi2D,EAAAyT,YAAA,EAAA+e,CAAA,QACAvyC,EAAA8f,EAAAziB,SAAA,CAAA5rC,IAAA,EAAkD2+B,EAAAA,EAAAtmC,EAAAA,EAAA4+E,QAAAA,CAAA,EAClDpmB,CAAAA,EAAAtiB,SAAA,CAAAA,CACA,CA2LA,MAAAmtC,EACA,CAAA7qE,EAAA,EACA7S,EAAA,EACAhB,CAAA,EACA0I,EAAA,EACAonF,EAAA,EACArF,EAAA,EACAG,EAAA,EACAD,EAAA,EACAxxF,EAAA,EACAqP,EAAA,EACAu/B,EAAA,EACAuuD,EAAA,EACAE,EAAA,EACAD,EAAA,EACAqO,EAAA,EACAC,EAAA,KAOAhxF,MAAA,CAAiB,aAAAA,EAAA,CACjB,IAAAA,KAAA1a,CAAA,EACA,OAAAA,GACA,UACA,MAAA0a,EAAA,MACA,KACA,QACA,aACA,MAAAA,EAAA,GACA,KACA,QACA,aACA,eACA,MAAAA,EAAA,GACA,KACA,QACA,aACA,eACA,MAAAA,EAAA,GACA,KACA,QACA,aACA,eACA,MAAAA,EAAA,GACA,KACA,SACA,GAAAy9C,EAAAoB,cAAA,2CAAAv5D,EACA,CACA,CAIA,IAAAyvG,UAAA,CACA,YAAA/0F,IAAA,EACA,qBACA,wBACA,wBACA,wBACA,CACA,WACA,CAKA,IAAA7S,IAAA,CACA,IAAA7H,EAAA,MAAA6H,EAAA,QACA,MAAA7H,GAAA,SAAA0a,IAAA,CACA86D,EAAAR,WAAA,CAEAh1E,CACA,CACA,IAAA6H,GAAA7H,CAAA,EACA,MAAA6H,EAAA,OAAA7H,EAAA,QAAAs3D,EAAAzH,UAAA,EAAA7vD,EACA,CAIA,IAAAuP,OAAA,CAAkB,aAAAA,EAAA,CAClB,IAAAA,MAAAvP,CAAA,EAAuB,MAAAuP,EAAA,IAAA4oD,EAAAwE,SAAA,EAAA38D,EAAA,SAIvB,IAAA22F,UAAA,CAAqB,aAAAA,EAAA,CACrB,IAAAA,SAAA32F,CAAA,EAA0B,MAAA22F,EAAA,IAAAx+B,EAAA2I,SAAA,EAAA9gE,EAAA,CAO1B,IAAAsxF,UAAA,CACA,IAAAtxF,EAAA,MAAAsxF,EAAA,QACA,MAAAtxF,GAAA,UAAA0a,IAAA,WAAAA,IAAA,EACAgmD,EAEA1gE,CACA,CACA,IAAAsxF,SAAAtxF,CAAA,EACA,MAAAsxF,EAAA,OAAAtxF,EAAA,QAAAm4D,EAAA2I,SAAA,EAAA9gE,EAAA,WACA,CAKA,IAAAyxF,sBAAA,CACA,IAAAzxF,EAAA,MAAAyxF,EAAA,QACA,MAAAzxF,EACA,SAAA0a,IAAA,WAAAA,IAAA,CACAgmD,EAEA,KAEA1gE,CACA,CACA,IAAAyxF,qBAAAzxF,CAAA,EACA,MAAAyxF,EAAA,OAAAzxF,EAAA,QAAAm4D,EAAA2I,SAAA,EAAA9gE,EAAA,uBACA,CAKA,IAAAwxF,cAAA,CACA,IAAAxxF,EAAA,MAAAwxF,EAAA,QACA,MAAAxxF,EACA,SAAA0a,IAAA,WAAAA,IAAA,CACAgmD,EAEA,KAEA1gE,CACA,CACA,IAAAwxF,aAAAxxF,CAAA,EACA,MAAAwxF,EAAA,OAAAxxF,EAAA,QAAAm4D,EAAA2I,SAAA,EAAA9gE,EAAA,eACA,CAKA,IAAA6G,MAAA,CAAiB,aAAAA,CAAA,CACjB,IAAAA,KAAA7G,CAAA,EAAsB,MAAA6G,CAAA,IAAAsxD,EAAA4C,OAAA,EAAA/6D,EAAA,CAItB,IAAAA,OAAA,CAAkB,aAAAA,EAAA,CAClB,IAAAA,MAAAA,CAAA,EACA,MAAAA,EAAA,IAAAm4D,EAAA2I,SAAA,EAAA9gE,EAAA,QACA,CAIA,IAAAqP,SAAA,CAAoB,aAAAA,EAAA,CACpB,IAAAA,QAAArP,CAAA,EAAyB,MAAAqP,EAAA,IAAA8oD,EAAA2I,SAAA,EAAA9gE,EAAA,CAIzB,IAAAo4C,WAAA,CAAsB,aAAAxJ,EAAA,OACtB,IAAAwJ,UAAAp4C,CAAA,EACA,MAAA4uC,EAAA,OAAA5uC,EAAA,KAAAk4D,EAAAziB,SAAA,CAAA5rC,IAAA,CAAA7J,EACA,CAOA,IAAAm9F,YAAA,CACA,IAAAn9F,EAAA,MAAAm9F,EAAA,cACA,MAAAn9F,EACA,SAAA0a,IAAA,WAAAA,IAAA,WAAAA,IAAA,CAGA,GAEA,KAEA1a,CACA,CACA,IAAAm9F,WAAAn9F,CAAA,EACA,MAAAm9F,EAAA,OAAAn9F,EAAA,QAAA6uG,EAAAnpB,aAAA,EAAA1lF,EACA,CAIA,IAAAq9F,kBAAA,CACA,IAAAr9F,EAAA,MAAAq9F,EAAA,QACA,MAAAr9F,GAAA,SAAA0a,IAAA,CACAgmD,EAEA1gE,CACA,CACA,IAAAq9F,iBAAAr9F,CAAA,EACA,MAAAq9F,EAAA,OAAAr9F,EAAA,QAAAm4D,EAAA2I,SAAA,EAAA9gE,EAAA,mBACA,CAIA,IAAAo9F,qBAAA,CAGA,IAAAp9F,EAAA,MAAAo9F,EAAA,QACA,MAAAp9F,GAAA,SAAA0a,IAAA,CACA,GAEA1a,CACA,CACA,IAAAo9F,oBAAAp9F,CAAA,EACA,GAAAA,MAAAA,EAAA,CACA,GAAAm4D,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAA1T,GAAA,+CAAAA,GACAA,EAAAA,EAAA6P,KAAA,GACA,QAAA7N,EAAA,EAA4BA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IAC9C,GAAAm2D,EAAAoB,cAAA,KAAApB,EAAAkR,WAAA,EAAArpE,CAAA,CAAAgC,EAAA,0CAAgIA,EAAE,GAAAhC,CAAA,CAAAgC,EAAA,CAElI,CACA,MAAAo7F,EAAA,CAAAp9F,CACA,CA6BA,IAAA0rG,OAAA,QACA,YAAAA,EAAA,CACA,KAEA,MAAAA,EAAA,CAAAtxF,GAAA,IAAAva,OAAAwM,MAAA,IAAsD/N,GACtD,CACA,IAAAotG,MAAAgE,CAAA,EACA,GAAAA,MAAAA,EAAA,CACA,MAAAhE,EAAA,MACA,MACA,CACA,IAAAA,EAAA,GACAiE,EAAA,GACA,QAAA3tG,EAAA,EAAwBA,EAAA0tG,EAAA5wG,MAAA,CAAmBkD,IAAA,CAC3C,IAAA4tG,EAAAF,CAAA,CAAA1tG,EAAA,CACA,MAAAm2D,EAAA+sB,WAAA,EAAA0qB,GAAA,CACA,GAAAz3C,EAAA6E,MAAA,QAAAyuC,EAAA,qEACAxuC,UAAA,aACA,GACA,IAAAp2D,EAAA,GAAAsxD,EAAA2C,QAAA,EAAA80C,GAGA,GAFA,GAAAz3C,EAAAoB,cAAA,EAAA1yD,EAAA/H,MAAA,EAvmBA,OAumBA,6BAAuGkD,EAAE,GAAA4tG,GAEzG/oG,SAAAA,EAAA/H,MAAA,EACA,IAAAu3F,EAAA,IAAA53F,WA1mBA,QA2mBA43F,EAAAhvF,GAAA,CAAAR,GACAA,EAAAwvF,CACA,CACA,IAAAwZ,EAAA,MAAApE,EAAA,CAAAqE,mBAAA,CAAAjpG,GACAkpG,EAAA,GAAA53C,EAAA4C,OAAA,QAAA0wC,EAAA,CAAAuE,mBAAA,CAAAnpG,EAAAgpG,IACAnE,EAAA7mG,IAAA,EACAgC,KAAA,GAAAsxD,EAAA4C,OAAA,EAAAl0D,GACAopG,WAAA,GAAA93C,EAAA4C,OAAA,EAAA80C,GACAE,MAAAA,CACA,GACAJ,EAAA9qG,IAAA,CAAAmqG,EAAA,EAAAa,GACA,KACA,CACA,IAAAA,EAAA,GAAA13C,EAAA4C,OAAA,EAAA60C,EAAAK,UAAA,EACAvE,EAAA7mG,IAAA,EACAgC,KAAA,GAAAsxD,EAAA4C,OAAA,EAAA60C,EAAA/oG,IAAA,EACAopG,WAAAJ,EACAE,MAAA,GAAA53C,EAAA4C,OAAA,EAAA60C,EAAAG,KAAA,CACA,GACAJ,EAAA9qG,IAAA,CAAAmqG,EAAA,EAAAa,GACA,CACA,CACA,MAAAnE,EAAA,CAAAA,EACA,MAAAtO,EAAA,CAAAuS,CACA,CACA,IAAAlE,KAAA,CAAgB,aAAAA,EAAA,CAChB,IAAAA,IAAAA,CAAA,EACA,MAAAA,EAAA,CAAAA,CACA,CAIA/sG,aAAA,CACA,MAAAgc,EAAA,MACA,MAAA7S,EAAA,MACA,MAAA0H,EAAA,GACA,MAAAonF,EAAA,CAAAj2B,EACA,MAAA4wB,EAAA,MACA,MAAAG,EAAA,MACA,MAAAD,EAAA,MACA,MAAA3qF,CAAA,MACA,MAAA7G,EAAA,CAAA0gE,EACA,MAAArxD,EAAA,CAAAqxD,EACA,MAAA9xB,EAAA,MACA,MAAAuuD,EAAA,MACA,MAAAE,EAAA,MACA,MAAAD,EAAA,MACA,MAAAsO,EAAA,MACA,MAAAD,EAAA,KACA,CAIA,IAAAzsG,MAAA,QACA,WAAAo5C,SAAA,CACA,KAEA,GAAA8f,EAAAyT,SAAA,QAAAukC,EAAA,QACA,CAOA,IAAAC,cAAA,CACA,SAAAj4C,EAAAyT,SAAA,OAAAykC,kBAAA,CACA,CAIA,IAAAvmG,MAAA,QACA,WAAAuuC,SAAA,CACA,KAEA,GAAAof,EAAAguB,cAAA,OAAA2qB,YAAA,MAAA/3D,SAAA,CACA,CAIA,IAAAi4D,eAAA,QACA,WAAAj4D,SAAA,CACA,KAEA8f,EAAAkmB,UAAA,CAAAtoC,gBAAA,MAAAq6D,YAAA,MAAA/3D,SAAA,CACA,CAOAk4D,UAAA,CACA,kBAAAl4D,SAAA,CAEA,CAAA83D,EAAA,CAAArvC,CAAA,CAAA0vC,CAAA,EACA,GAAAp4C,EAAA6E,MAAA,GAAA6D,GAAA,WAAAzoB,SAAA,8EAA0G,yBAAiE6kB,UAAA,gBAC3K,IAAAruB,EAAAiyB,EAAA,KAAAzoB,SAAA,MACA,YAAAo4D,SAAA,IACA,OACA,OAAAC,SAhnBA/1C,CAAA,CAAA9rB,CAAA,EACA,IAAA+7C,EAAA,CACA2kB,EAAA50C,EAAAnrD,KAAA,UACA+/F,EAAA50C,EAAA42B,QAAA,gBACAge,EAAA50C,EAAAi8B,QAAA,aACAj8B,EAAA7yD,EAAA,OACAynG,EAAA50C,EAAA16D,KAAA,UACA06D,EAAA7zD,IAAA,CACA,CACAwI,EAAAqxD,EACA,GAAAhG,EAAArrD,OAAA,EAAAqxD,EAEArxD,EAAA,GAAA8oD,EAAA2I,SAAA,EAAApG,EAAArrD,OAAA,eAGA,GAAA8oD,EAAAoB,cAAA,GAAA3qB,GAAAA,MAAAA,EAAA+xC,QAAA,EAAA/xC,EAAAgyC,aAAA,GAAAvxE,EAAA,kCAAAu/B,QAEA,GAAA8rB,EAAAtiB,SAAA,EAEA,IAAAs4D,EAAAh2C,EAAAtiB,SAAA,CAAAwoC,aAAA,OACA8vB,GACArhG,CAAAA,EAAAqhG,CAAA,CAEA,CAEA,IAAA9hE,EAOA,OALAv/B,IAAAqxD,IACAiqB,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAA/tD,IACAs7E,EAAA9lF,IAAA,OACA8lF,EAAA9lF,IAAA,QAEA,GAAAszD,EAAAuc,SAAA,EAAAiW,GAMA,IAAAriD,EAAA9mC,OAAA,GAAAotC,EAAAkyC,OAAA,EAWA,OAVAzxE,IAAAqxD,EACAp4B,EAAA4vB,EAAAziB,SAAA,CAAA4rC,WAAA,CAAAhyE,EAAAu/B,EAAAtG,CAAA,EAEA9mC,OAAAotC,EAAAtG,CAAA,IAAAA,GACA,GAAA6vB,EAAAoB,cAAA,uCAAA3qB,GAGA+7C,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAA90B,IACAqiD,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAApG,CAAA,GACAmiD,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAA1sC,CAAA,GACA,GAAAi2D,EAAAuc,SAAA,EAAAiW,EACA,EA8jBA,KAAA/7C,EACA,QACA,OAAA+hE,SA9eAj2C,CAAA,CAAA9rB,CAAA,EACA,IAAA+7C,EAAA,CACA2kB,EAAA50C,EAAArrD,OAAA,YACAigG,EAAA50C,EAAAnrD,KAAA,UACA+/F,EAAA50C,EAAA42B,QAAA,gBACAge,EAAA50C,EAAAi8B,QAAA,aACAj8B,EAAA7yD,EAAA,OACAynG,EAAA50C,EAAA16D,KAAA,UACA06D,EAAA7zD,IAAA,CACA0oG,EAAA70C,EAAAyiC,UAAA,MACA,CAMA,OALAvuD,IACA+7C,EAAA9lF,IAAA,CAAAyqG,EAAA1gE,EAAAkyC,OAAA,mBACA6J,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAApG,CAAA,GACAmiD,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAA1sC,CAAA,IAEA,GAAAi2D,EAAApN,MAAA,aAAAoN,EAAAuc,SAAA,EAAAiW,GAAA,CACA,EA6dA,KAAA/7C,EACA,QACA,OAAAgiE,SAzhBAl2C,CAAA,CAAA9rB,CAAA,EACA,IAAA+7C,EAAA,CACA2kB,EAAA50C,EAAArrD,OAAA,YACAigG,EAAA50C,EAAAnrD,KAAA,UACA+/F,EAAA50C,EAAA+2B,oBAAA,4BACA6d,EAAA50C,EAAA82B,YAAA,oBACA8d,EAAA50C,EAAAi8B,QAAA,aACAj8B,EAAA7yD,EAAA,OACAynG,EAAA50C,EAAA16D,KAAA,UACA06D,EAAA7zD,IAAA,CACA0oG,EAAA70C,EAAAyiC,UAAA,MACA,CAMA,OALAvuD,IACA+7C,EAAA9lF,IAAA,CAAAyqG,EAAA1gE,EAAAkyC,OAAA,aACA6J,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAApG,CAAA,GACAmiD,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAA1sC,CAAA,IAEA,GAAAi2D,EAAApN,MAAA,aAAAoN,EAAAuc,SAAA,EAAAiW,GAAA,CACA,EAugBA,KAAA/7C,EACA,QACA,OAAAiiE,SAvaAn2C,CAAA,CAAA9rB,CAAA,CAAA88D,CAAA,EACA,IAAA/gB,EAAA,CACA2kB,EAAA50C,EAAArrD,OAAA,YACAigG,EAAA50C,EAAAnrD,KAAA,UACA+/F,EAAA50C,EAAA+2B,oBAAA,4BACA6d,EAAA50C,EAAA82B,YAAA,oBACA8d,EAAA50C,EAAAi8B,QAAA,aACAj8B,EAAA7yD,EAAA,EAAA2tE,EAAAR,WAAA,CACAs6B,EAAA50C,EAAA16D,KAAA,UACA06D,EAAA7zD,IAAA,CACA0oG,EAAA70C,EAAAyiC,UAAA,MACAmS,EAAA50C,EAAA2iC,gBAAA,wBACAyT,SA5QA9wG,CAAA,CAAA4sD,CAAA,EACA,GAAAuL,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAA1T,GAAA,WAAoE4sD,EAAM,UAAA5sD,GAC1E,QAAAgC,EAAA,EAAoBA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IACtC,GAAAm2D,EAAAoB,cAAA,KAAApB,EAAAkR,WAAA,EAAArpE,CAAA,CAAAgC,EAAA,+BAAsG,SAAgBA,EAAE,GAAAhC,CAAA,CAAAgC,EAAA,EAExH,OAAAhC,CACA,EAsQA06D,EAAA0iC,mBAAA,4BACA,QACA,IACAzS,EAAA9lF,IAAA,CAAAyqG,EAAA1gE,EAAAkyC,OAAA,aACA6J,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAApG,CAAA,GACAmiD,EAAA9lF,IAAA,IAAAszD,EAAAiF,SAAA,EAAAxuB,EAAA1sC,CAAA,GAEAwpG,GACA,GAAAvzC,EAAApN,MAAA,GACA,OACA,GAAAoN,EAAAuc,SAAA,GACAiW,EACA+gB,EAAAtxF,GAAA,IAAA9b,EAAAuI,IAAA,EACA6kG,EAAAtxF,GAAA,IAAA9b,EAAA2xG,UAAA,EACAvE,EAAAtxF,GAAA,IAAA9b,EAAAyxG,KAAA,EACA,EACA,EAGA,GAAA53C,EAAApN,MAAA,aAAAoN,EAAAuc,SAAA,EAAAiW,GAAA,CACA,EAuYA,KAAA/7C,EAAA2hE,EAAA,KAAA7E,KAAA,MACA,CACA,GAAAvzC,EAAA6E,MAAA,6DAAiGC,UAAA,eACjG,CAOA,IAAAgkB,YAAA,CACA,aAAAivB,EAAA,OACA,CAOA,IAAAE,oBAAA,CACA,aAAAF,EAAA,OACA,CAKAM,WAAA,CACA,IAAA72C,EAAA,KAAAo3C,UAAA,UAEA,EAAA9iF,OAAA,OACA,EAGA0rC,EAAAj3C,GAAA,EACA,CAKAquF,YAAA,CAEA,IAAAC,EAAA,WAAA1f,QAAA,CACA2f,EAAA,WAAAzf,YAAA,aAAAC,oBAAA,CACAyf,EAAA,WAAA/T,UAAA,CACAgU,EAAA,YAAA9T,EAAA,QAAAD,EAAA,OAIA,KAAA5L,YAAA,aAAAC,oBAAA,EACA,GAAAt5B,EAAA6E,MAAA,OAAAw0B,YAAA,OAAAC,oBAAA,sDAA2IzxF,MAAA,OAK3I,GAAAm4D,EAAA6E,MAAA,GAAAi0C,GAAA,SAAAv2F,IAAA,WAAAA,IAAA,iFAAmK1a,MAAA,OACnK,GAAAm4D,EAAA6E,MAAA,WAAAtiD,IAAA,GAAAw2F,EAAA,wDAA6HlxG,MAAA,OAC7H,IAAA25D,EAAA,GA8BA,OA5BA,WAAAj/C,IAAA,CACAi/C,EAAA90D,IAAA,MAAA6V,IAAA,EAGAu2F,EACAt3C,EAAA90D,IAAA,IAEAmsG,GACAr3C,EAAA90D,IAAA,IACAqsG,GACAv3C,EAAA90D,IAAA,KAGAqsG,GACAv3C,EAAA90D,IAAA,IACA80D,EAAA90D,IAAA,MAEAssG,GAAA,KAAAtpG,EAAA,GAIA8xD,EAAA90D,IAAA,IACA80D,EAAA90D,IAAA,IACA80D,EAAA90D,IAAA,KALA80D,EAAA90D,IAAA,KASA80D,EAAAn8C,IAAA,GACAm8C,CACA,CAQA4zC,UAAA,CACA,gBAAA7yF,IAAA,CASA8yF,UAAA,CACA,gBAAA9yF,IAAA,CASAsxF,UAAA,CACA,gBAAAtxF,IAAA,CASA+yF,UAAA,CACA,gBAAA/yF,IAAA,CAKAzO,OAAA,CACA,OAAAs5E,EAAA17E,IAAA,MACA,CAIAq3E,QAAA,CACA,IAAAh/E,EAAA,GACA,MAAAomC,EACA,KAEAA,EAAAv+B,QAAA,GAEA,OACA2Q,KAAA,KAAAA,IAAA,CACA7S,GAAA,KAAAA,EAAA,CAEAhB,KAAA,KAAAA,IAAA,CACA0I,MAAA,KAAAA,KAAA,CACAonF,SAAAz0F,EAAA,KAAAy0F,QAAA,EACArF,SAAApvF,EAAA,KAAAovF,QAAA,EACAG,qBAAAvvF,EAAA,KAAAuvF,oBAAA,EACAD,aAAAtvF,EAAA,KAAAsvF,YAAA,EACAxxF,MAAAkC,EAAA,KAAAlC,KAAA,EACAqP,QAAAnN,EAAA,KAAAmN,OAAA,EACAu/B,IAAA,KAAAwJ,SAAA,MAAAA,SAAA,CAAA8oC,MAAA,QACAic,WAAA,KAAAA,UAAA,CAEA,CAKA,OAAAtzF,KAAA6wD,CAAA,EACA,GAAAA,MAAAA,EACA,WAAA6qB,EAEA,oBAAA7qB,EAAA,CACA,IAAA07B,EAAA,GAAAj+B,EAAA2C,QAAA,EAAAJ,GACA,GAAA07B,CAAA,SACA,OAAA7Q,EAAA17E,IAAA,CAAAunG,SA30BAvqG,CAAA,EACA,IAAA8jF,EAAA,GAAAxyB,EAAAyvB,SAAA,EAAA/gF,GACA,GAAAsxD,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAi3E,IAAAA,CAAAA,IAAAA,EAAA7rF,MAAA,EAAA6rF,IAAAA,EAAA7rF,MAAA,sDAAA+H,GACA,IAAA6zD,EAAA,CACAhgD,KAAA,EACAnL,MAAA6/F,EAAAzkB,CAAA,aACA2G,SAAA+d,EAAA1kB,CAAA,gBACAgM,SAAA0Y,EAAA1kB,CAAA,gBACA9iF,GAAAqnG,EAAAvkB,CAAA,KACA3qF,MAAAqvG,EAAA1kB,CAAA,aACA9jF,KAAA,GAAAsxD,EAAA4C,OAAA,EAAA4vB,CAAA,KACAt7E,QAAAqxD,CACA,EAEA,GAAAiqB,IAAAA,EAAA7rF,MAAA,CACA,OAAA47D,EAEA,IAAApyB,EAAA+mE,EAAA1kB,CAAA,SACAniD,EAAA6mE,EAAA1kB,CAAA,SACAzoF,EAAAmtG,EAAA1kB,CAAA,SACA,GAAAniD,IAAAk4B,GAAAx+D,IAAAw+D,EAEAhG,EAAArrD,OAAA,CAAAi5B,MAEA,CAEA,IAAAj5B,EAAA,CAAAi5B,EAAAm4C,CAAA,EAAAH,EACAjxE,EAAAqxD,GACArxD,CAAAA,EAAAqxD,CAAA,EAEAhG,EAAArrD,OAAA,CAAAA,EAEA,GAAA8oD,EAAAoB,cAAA,EAAAlqD,IAAAqxD,GAAAp4B,IAAAi4C,GAAAj4C,IAAAk4C,EAAA,6BAAAmK,CAAA,KACAjwB,EAAAtiB,SAAA,CAAA8f,EAAAziB,SAAA,CAAA5rC,IAAA,EACA2+B,EAAA,GAAA2vB,EAAAyT,YAAA,EAAA+e,CAAA,QACAzoF,EAAA,GAAAi2D,EAAAyT,YAAA,EAAA+e,CAAA,QACAriD,EAAAA,CACA,EAEA,CACA,OAAAoyB,CACA,EAkyBA07B,IAEA,OAAAA,CAAA,KACA,cAAA7Q,EAAA17E,IAAA,CAAAwnG,SAtrBAxqG,CAAA,EACA,IAAA8jF,EAAA,GAAAxyB,EAAAyvB,SAAA,KAAAzvB,EAAA2C,QAAA,EAAAj0D,GAAAgJ,KAAA,KACA,GAAAsoD,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAi3E,IAAAA,CAAAA,IAAAA,EAAA7rF,MAAA,EAAA6rF,KAAAA,EAAA7rF,MAAA,0DAAAq5D,EAAA4C,OAAA,EAAAl0D,IACA,IAAA6zD,EAAA,CACAhgD,KAAA,EACArL,QAAAggG,EAAA1kB,CAAA,eACAp7E,MAAA6/F,EAAAzkB,CAAA,aACA2G,SAAA+d,EAAA1kB,CAAA,gBACAgM,SAAA0Y,EAAA1kB,CAAA,gBACA9iF,GAAAqnG,EAAAvkB,CAAA,KACA3qF,MAAAqvG,EAAA1kB,CAAA,aACA9jF,KAAA,GAAAsxD,EAAA4C,OAAA,EAAA4vB,CAAA,KACAwS,WAAAgS,EAAAxkB,CAAA,iBACA,SAEA,IAAAA,EAAA7rF,MAAA,EAIA0wG,EAAA90C,EAAAiwB,EAAA96E,KAAA,KAHA6qD,CAKA,EAiqBA07B,GACA,eAAA7Q,EAAA17E,IAAA,CAAAynG,SAluBAzqG,CAAA,EACA,IAAA8jF,EAAA,GAAAxyB,EAAAyvB,SAAA,KAAAzvB,EAAA2C,QAAA,EAAAj0D,GAAAgJ,KAAA,KACA,GAAAsoD,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAi3E,IAAAA,CAAAA,IAAAA,EAAA7rF,MAAA,EAAA6rF,KAAAA,EAAA7rF,MAAA,0DAAAq5D,EAAA4C,OAAA,EAAAl0D,IACA,IAAA6zD,EAAA,CACAhgD,KAAA,EACArL,QAAAggG,EAAA1kB,CAAA,eACAp7E,MAAA6/F,EAAAzkB,CAAA,aACA8G,qBAAA4d,EAAA1kB,CAAA,4BACA6G,aAAA6d,EAAA1kB,CAAA,oBACA2G,SAAA,KACAqF,SAAA0Y,EAAA1kB,CAAA,gBACA9iF,GAAAqnG,EAAAvkB,CAAA,KACA3qF,MAAAqvG,EAAA1kB,CAAA,aACA9jF,KAAA,GAAAsxD,EAAA4C,OAAA,EAAA4vB,CAAA,KACAwS,WAAAgS,EAAAxkB,CAAA,iBACA,SAEA,IAAAA,EAAA7rF,MAAA,EAIA0wG,EAAA90C,EAAAiwB,EAAA96E,KAAA,KAHA6qD,CAKA,EA2sBA07B,GACA,eAAA7Q,EAAA17E,IAAA,CAAA0nG,SAhpBA1qG,CAAA,EACA,IAAA8jF,EAAA,GAAAxyB,EAAAyvB,SAAA,KAAAzvB,EAAA2C,QAAA,EAAAj0D,GAAAgJ,KAAA,KACA4/F,EAAA,IACA/D,EAAA,KAEA,GAAA/gB,IAAAA,EAAA7rF,MAAA,EAAA8K,MAAA8J,OAAA,CAAAi3E,CAAA,MACA8kB,EAAA,qBACA,IAAA+B,EAAA7mB,CAAA,IAAA8mB,EAAA9mB,CAAA,IAAA+mB,EAAA/mB,CAAA,IACA,GAAAxyB,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAA89F,GAAA,yDAAAA,GACA,GAAAr5C,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAA+9F,GAAA,+DAAAA,GACA,GAAAt5C,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAg+F,GAAA,0DAAAA,GACA,GAAAv5C,EAAAoB,cAAA,EAAAi4C,EAAA1yG,MAAA,GAAA2yG,EAAA3yG,MAAA,sEAAA6rF,GACA,GAAAxyB,EAAAoB,cAAA,EAAAi4C,EAAA1yG,MAAA,GAAA4yG,EAAA5yG,MAAA,iEAAA6rF,GACA+gB,EAAA,GACA,QAAA1pG,EAAA,EAAwBA,EAAA2oF,CAAA,IAAA7rF,MAAA,CAAsBkD,IAC9C0pG,EAAA7mG,IAAA,EACAgC,KAAA2qG,CAAA,CAAAxvG,EAAA,CACAiuG,WAAAwB,CAAA,CAAAzvG,EAAA,CACA+tG,MAAA2B,CAAA,CAAA1vG,EAAA,GAGA2oF,EAAAA,CAAA,IAEA,GAAAxyB,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAi3E,IAAAA,CAAAA,KAAAA,EAAA7rF,MAAA,EAAA6rF,KAAAA,EAAA7rF,MAAA,+CAAyJ2wG,EAAS,YAAAt3C,EAAA4C,OAAA,EAAAl0D,IAClK,IAAA6zD,EAAA,CACAhgD,KAAA,EACArL,QAAAggG,EAAA1kB,CAAA,eACAp7E,MAAA6/F,EAAAzkB,CAAA,aACA8G,qBAAA4d,EAAA1kB,CAAA,4BACA6G,aAAA6d,EAAA1kB,CAAA,oBACA2G,SAAA,KACAqF,SAAA0Y,EAAA1kB,CAAA,gBACA9iF,GAAAqnG,EAAAvkB,CAAA,KACA3qF,MAAAqvG,EAAA1kB,CAAA,aACA9jF,KAAA,GAAAsxD,EAAA4C,OAAA,EAAA4vB,CAAA,KACAwS,WAAAgS,EAAAxkB,CAAA,kBACA0S,iBAAAgS,EAAA1kB,CAAA,wBACAyS,oBAAAzS,CAAA,MAEA+gB,GACAhxC,CAAAA,EAAAgxC,KAAA,CAAAA,CAAA,EAEA,GAAAvzC,EAAAoB,cAAA,EAAAmB,MAAAA,EAAA7yD,EAAA,0CAA2F4nG,EAAS,SAAA5oG,GACpG,GAAAsxD,EAAAoB,cAAA,EAAA3vD,MAAA8J,OAAA,CAAAgnD,EAAA0iC,mBAAA,yDAAAv2F,GACA,QAAA7E,EAAA,EAAoBA,EAAA04D,EAAA0iC,mBAAA,CAAAt+F,MAAA,CAAmCkD,IACvD,GAAAm2D,EAAAoB,cAAA,KAAApB,EAAAkR,WAAA,EAAA3O,EAAA0iC,mBAAA,CAAAp7F,EAAA,2CAAyIA,EAAE,4BAAA6E,UAG3I,KAAA8jF,EAAA7rF,MAAA,EAMA0wG,EAAA90C,EAAAiwB,EAAA96E,KAAA,MALA6qD,CAOA,EAwlBA07B,GACA,CACA,GAAAj+B,EAAA6E,MAAA,6DAAqGC,UAAA,QACrG,CACA,IAAAntD,EAAA,IAAAy1E,EA4DA,OA3DA,MAAA7qB,EAAAhgD,IAAA,EACA5K,CAAAA,EAAA4K,IAAA,CAAAggD,EAAAhgD,IAAA,EAEA,MAAAggD,EAAA7yD,EAAA,EACAiI,CAAAA,EAAAjI,EAAA,CAAA6yD,EAAA7yD,EAAA,EAEA,MAAA6yD,EAAAnrD,KAAA,EACAO,CAAAA,EAAAP,KAAA,CAAAmrD,EAAAnrD,KAAA,EAEA,MAAAmrD,EAAAi8B,QAAA,EACA7mF,CAAAA,EAAA6mF,QAAA,CAAAj8B,EAAAi8B,QAAA,EAEA,MAAAj8B,EAAA42B,QAAA,EACAxhF,CAAAA,EAAAwhF,QAAA,CAAA52B,EAAA42B,QAAA,EAEA,MAAA52B,EAAA+2B,oBAAA,EACA3hF,CAAAA,EAAA2hF,oBAAA,CAAA/2B,EAAA+2B,oBAAA,EAEA,MAAA/2B,EAAA82B,YAAA,EACA1hF,CAAAA,EAAA0hF,YAAA,CAAA92B,EAAA82B,YAAA,EAEA,MAAA92B,EAAA2iC,gBAAA,EACAvtF,CAAAA,EAAAutF,gBAAA,CAAA3iC,EAAA2iC,gBAAA,EAEA,MAAA3iC,EAAA7zD,IAAA,EACAiJ,CAAAA,EAAAjJ,IAAA,CAAA6zD,EAAA7zD,IAAA,EAEA,MAAA6zD,EAAA16D,KAAA,EACA8P,CAAAA,EAAA9P,KAAA,CAAA06D,EAAA16D,KAAA,EAEA,MAAA06D,EAAArrD,OAAA,EACAS,CAAAA,EAAAT,OAAA,CAAAqrD,EAAArrD,OAAA,EAEA,MAAAqrD,EAAAtiB,SAAA,EACAtoC,CAAAA,EAAAsoC,SAAA,CAAA8f,EAAAziB,SAAA,CAAA5rC,IAAA,CAAA6wD,EAAAtiB,SAAA,GAEA,MAAAsiB,EAAAyiC,UAAA,EACArtF,CAAAA,EAAAqtF,UAAA,CAAAziC,EAAAyiC,UAAA,EAGA,MAAAziC,EAAA0iC,mBAAA,EACAttF,CAAAA,EAAAstF,mBAAA,CAAA1iC,EAAA0iC,mBAAA,EAIA,MAAA1iC,EAAA+wC,GAAA,EACA37F,CAAAA,EAAA27F,GAAA,CAAA/wC,EAAA+wC,GAAA,EAEA,MAAA/wC,EAAAgxC,KAAA,EACA57F,CAAAA,EAAA47F,KAAA,CAAAhxC,EAAAgxC,KAAA,EAEA,MAAAhxC,EAAA17D,IAAA,GACA,GAAAm5D,EAAAoB,cAAA,EAAAzpD,EAAAwgG,QAAA,qDAAA51C,GACA,GAAAvC,EAAAoB,cAAA,EAAAzpD,EAAA9Q,IAAA,GAAA07D,EAAA17D,IAAA,sBAAA07D,IAEA,MAAAA,EAAA7wD,IAAA,GACA,GAAAsuD,EAAAoB,cAAA,EAAAzpD,EAAAwgG,QAAA,qDAAA51C,GACA,GAAAvC,EAAAoB,cAAA,EAAAzpD,EAAAjG,IAAA,CAAA6H,WAAA,MAAAgpD,EAAA7wD,IAAA,MAAA6H,WAAA,wBAAAgpD,IAEA5qD,CACA,CACA,CACA/P,EAAAwlF,WAAmB,CAAAA,sCCz8BnB1lF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAulF,YAAoB,CAAGvlF,EAAAslF,YAAoB,QAC3C,IAAAssB,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAC5Bo7D,EAAmBp7D,EAAQ,OAC3BguG,EAAA,6DACAC,EAAA,KAYApxC,EAAAl/D,OAAA,GACAuwG,EAAAvwG,OAAA,GAqBAzB,CAAAA,EAAAslF,YAAoB,CAjBpB,SAAAlmB,CAAA,EACA,IAAAvgE,EAAA,GAAA+yG,EAAA72C,QAAA,EAAAqE,GACAn/D,EAAA,GAAAi/D,EAAAH,QAAA,EAAAlgE,GACAkR,EAAA,GACA,KAAA9P,GACA8P,EAAA+hG,CAAA,CAAA1zG,OAAA6B,EAAA+xG,GAAA,CAAAjiG,EACA9P,GAAA+xG,EAGA,QAAA/vG,EAAA,EACA,EADoBpD,EAAAE,MAAA,GACpBF,CAAA,CAAAoD,EAAA,CADsCA,IAItC8N,EAAA+hG,CAAA,IAAA/hG,EAEA,OAAAA,CACA,EAaA/P,EAAAulF,YAAoB,CARpB,SAAAtlF,CAAA,EACA,IAAA8P,EAAA4wD,EACA,QAAA1+D,EAAA,EAAoBA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IACtC8N,GAAAiiG,EACAjiG,GAAAkiG,SAzCAC,CAAA,EACA,GAAAH,MAAAA,EAAA,CACAA,EAAA,GACA,QAAA9vG,EAAA,EAAwBA,EAAA6vG,EAAA/yG,MAAA,CAAqBkD,IAC7C8vG,CAAA,CAAAD,CAAA,CAAA7vG,EAAA,EAAAR,OAAAQ,EAEA,CACA,IAAA8N,EAAAgiG,CAAA,CAAAG,EAAA,CAEA,MADA,GAAAL,EAAAr4C,cAAA,EAAAzpD,MAAAA,EAAA,gCAAAmiG,GACAniG,CACA,EA+BA9P,CAAA,CAAAgC,EAAA,EAEA,OAAA8N,CACA,sCC/DAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAolF,YAAoB,CAAGplF,EAAAqlF,YAAoB,QAC3C,IAAAusB,EAAkB9tG,EAAQ,MAS1B9D,CAAAA,EAAAqlF,YAAoB,CARpB,SAAA8sB,CAAA,EAEA,IAAArrG,EAAA,IAAApI,WAAAyzG,CADAA,EAAAC,KAAAD,EAAA,EACApzG,MAAA,EACA,QAAAkD,EAAA,EAAoBA,EAAAkwG,EAAApzG,MAAA,CAAqBkD,IACzC6E,CAAA,CAAA7E,EAAA,CAAAkwG,EAAAjnG,UAAA,CAAAjJ,GAEA,SAAA2vG,EAAA72C,QAAA,EAAAj0D,EACA,EAUA9G,EAAAolF,YAAoB,CARpB,SAAAha,CAAA,EACA,IAAAtkE,EAAA,GAAA8qG,EAAA72C,QAAA,EAAAqQ,GACA+mC,EAAA,GACA,QAAAlwG,EAAA,EAAoBA,EAAA6E,EAAA/H,MAAA,CAAiBkD,IACrCkwG,GAAAt+F,OAAAC,YAAA,CAAAhN,CAAA,CAAA7E,EAAA,EAEA,OAAAowG,KAAAF,EACA,sCCpBAryG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAu7D,YAAoB,CAAGv7D,EAAA6rE,YAAoB,CAAG7rE,EAAAklF,cAAsB,CAAGllF,EAAA8qE,SAAiB,CAAG9qE,EAAA49D,UAAkB,CAAG59D,EAAAgrD,MAAc,CAAGhrD,EAAAg7D,OAAe,CAAGh7D,EAAAmlF,WAAmB,CAAGnlF,EAAAspE,WAAmB,CAAGtpE,EAAAs9D,YAAoB,CAAGt9D,EAAA+6D,QAAgB,QAOtO,IAAA82C,EAAoB/tG,EAAQ,OAC5B,SAAAwuG,EAAAryG,CAAA,CAAArB,CAAA,CAAAqzB,CAAA,EACA,GAAAhyB,aAAAvB,kBACA,EACA,IAAAA,WAAAuB,GAEAA,EAEA,oBAAAA,GAAAA,EAAAg4B,KAAA,gCACA,IAAAloB,EAAA,IAAArR,WAAA,CAAAuB,EAAAlB,MAAA,OACAq8B,EAAA,EACA,QAAAn5B,EAAA,EAAwBA,EAAA8N,EAAAhR,MAAA,CAAmBkD,IAC3C8N,CAAA,CAAA9N,EAAA,CAAA4P,SAAA5R,EAAAwgE,SAAA,CAAArlC,EAAAA,EAAA,OACAA,GAAA,EAEA,OAAArrB,CACA,CACA,GAAA8hG,EAAAr4C,cAAA,+BAAA56D,GAAA,QAAAqB,EACA,CAQA,SAAA86D,EAAA96D,CAAA,CAAArB,CAAA,EACA,OAAA0zG,EAAAryG,EAAArB,EAAA,GACA,CAoBA,SAAA0qE,EAAArpE,CAAA,CAAAlB,CAAA,UACA,kBAAAkB,GAAAA,EAAAg4B,KAAA,uBAGA,kBAAAl5B,GAAAkB,EAAAlB,MAAA,OAAAA,CAAA,GAGAA,CAAAA,CAAA,IAAAA,GAAA,EAAAA,MAAA,MAIA,CA9BAiB,EAAA+6D,QAAgB,CAAAA,EAWhB/6D,EAAAs9D,YAAoB,CAHpB,SAAAr9D,CAAA,CAAArB,CAAA,EACA,OAAA0zG,EAAAryG,EAAArB,EAAA,GACA,EAqBAoB,EAAAspE,WAAmB,CAAAA,EAQnBtpE,EAAAmlF,WAAmB,CAHnB,SAAAllF,CAAA,EACA,OAAAqpE,EAAArpE,EAAA,KAAAA,aAAAvB,UACA,EAEA,IAAA6zG,EAAA,mBAIA,SAAAv3C,EAAAl0D,CAAA,EACA,IAAAjI,EAAAk8D,EAAAj0D,GACAiJ,EAAA,KACA,QAAA9N,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IAAA,CACtC,IAAAsmC,EAAA1pC,CAAA,CAAAoD,EAAA,CACA8N,GAAAwiG,CAAA,EAAAhqE,IAAAA,CAAA,MAAAgqE,CAAA,CAAAhqE,GAAAA,EAAA,CAEA,OAAAx4B,CACA,CAgDA,SAAAyiG,EAAA1rG,CAAA,CAAA/H,CAAA,CAAAqZ,CAAA,EACA,IAAAvZ,EAAAk8D,EAAAj0D,GACA,GAAA+qG,EAAA50C,MAAA,EAAAl+D,GAAAF,EAAAE,MAAA,iDACAuK,OAAA,IAAA5K,WAAAG,GACAE,OAAAA,EACAq8B,OAAAr8B,EAAA,CACA,GACA,IAAAgR,EAAA,IAAArR,WAAAK,GAQA,OAPAgR,EAAA9J,IAAA,IACAmS,EACArI,EAAAzI,GAAA,CAAAzI,EAAAE,EAAAF,EAAAE,MAAA,EAGAgR,EAAAzI,GAAA,CAAAzI,EAAA,GAEAm8D,EAAAjrD,EACA,CA/DA/P,EAAAg7D,OAAe,CAAAA,EAQfh7D,EAAAgrD,MAAc,CAHd,SAAA8nC,CAAA,EACA,WAAAA,EAAAz4E,GAAA,IAAA2gD,EAAAv5B,GAAAg/B,SAAA,KAAArT,IAAA,IACA,EAWAptD,EAAA49D,UAAkB,CANlB,SAAA92D,CAAA,SACA,EAAAA,EAAA,IACA,CAAAA,EAAA/H,MAAA,MAEAg8D,EAAAj0D,GAAA/H,MAAA,EAkBAiB,EAAA8qE,SAAiB,CATjB,SAAAhkE,CAAA,CAAAqsB,CAAA,CAAAjgB,CAAA,EACA,IAAArU,EAAAk8D,EAAAj0D,GAMA,OALA,MAAAoM,GAAAA,EAAArU,EAAAE,MAAA,EACA,GAAA8yG,EAAA50C,MAAA,yDACA3zD,OAAAzK,EAAAE,OAAAF,EAAAE,MAAA,CAAAq8B,OAAAloB,CACA,GAEA8nD,EAAAn8D,EAAAiR,KAAA,OAAAqjB,EAAA,EAAAA,EAAA,MAAAjgB,EAAArU,EAAAE,MAAA,CAAAmU,GACA,EAaAlT,EAAAklF,cAAsB,CAPtB,SAAAp+E,CAAA,EACA,IAAAjI,EAAAm8D,EAAAl0D,GAAA25D,SAAA,IACA,KAAA5hE,EAAA0nE,UAAA,QACA1nE,EAAAA,EAAA4hE,SAAA,IAEA,WAAA5hE,CACA,EAgCAmB,EAAA6rE,YAAoB,CAHpB,SAAA/kE,CAAA,CAAA/H,CAAA,EACA,OAAAyzG,EAAA1rG,EAAA/H,EAAA,GACA,EAeAiB,EAAAu7D,YAAoB,CAHpB,SAAAz0D,CAAA,CAAA/H,CAAA,EACA,OAAAyzG,EAAA1rG,EAAA/H,EAAA,GACA,sCC3KAe,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2lE,aAAqB,CAAG3lE,EAAAilF,eAAuB,CAAGjlF,EAAAk6D,mBAA2B,CAAGl6D,EAAAw5D,cAAsB,CAAGx5D,EAAAi9D,MAAc,CAAGj9D,EAAAk7D,SAAiB,CAAGl7D,EAAA25E,eAAuB,CAAG35E,EAAAsgE,OAAe,QACvL,IAAA+nB,EAAsBvkF,EAAQ,OAC9Bs9D,EAAwBt9D,EAAQ,OAChC,SAAAqM,EAAAlQ,CAAA,EACA,GAAAA,MAAAA,EACA,aAEA,GAAA4J,MAAA8J,OAAA,CAAA1T,GACA,aAAAoa,GAAA,CAAAlK,GAAAi9C,IAAA,YAEA,GAAAntD,aAAAvB,WAAA,CACA,IAAA+zG,EAAA,mBACA1iG,EAAA,KACA,QAAA9N,EAAA,EAAwBA,EAAAhC,EAAAlB,MAAA,CAAkBkD,IAE1C8N,GADA0iG,CAAA,CAAAxyG,CAAA,CAAAgC,EAAA,KACAwwG,CAAA,CAAAxyG,GAAAA,CAAA,CAAAgC,EAAA,EAEA,OAAA8N,CACA,CACA,oBAAA9P,GAAA,mBAAAA,EAAAkhF,MAAA,CACA,OAAAhxE,EAAAlQ,EAAAkhF,MAAA,IAEA,cAAAlhF,GACA,cACA,aAIA,aAHA,OAAAA,EAAA+J,QAAA,EACA,cACA,OAAAvI,OAAAxB,GAAA+J,QAAA,EAGA,cACA,OAAAkG,KAAAC,SAAA,CAAAlQ,EACA,eACA,IAAA0xD,EAAA7xD,OAAA6xD,IAAA,CAAA1xD,GAEA,OADA0xD,EAAAl0C,IAAA,GACA,KAAsBk0C,EAAAt3C,GAAA,OAAuBlK,EAAAS,GAAa,IAAIT,EAAAlQ,CAAA,CAAA2Q,EAAA,EAAoB,GAAAw8C,IAAA,WAClF,CACA,CACA,+BACA,CAoBA,SAAAkT,EAAA1yD,CAAA,CAAAwoB,CAAA,EACA,OAAAxoB,GAAAA,EAAAwoB,IAAA,GAAAA,CACA,CAmBA,SAAA8kC,EAAAxiB,CAAA,CAAAtiB,CAAA,CAAAooC,CAAA,EACA,IA0BA5wD,EA1BA8kG,EAAAh6D,CACA,EACA,IAAAwxD,EAAA,GACA,GAAA1rC,EAAA,CACA,eAAAA,GAAA,SAAAA,GAAA,SAAAA,EACA,sDAA0EruD,EAAAquD,GAAgB,GAE1F,QAAAnuD,KAAAmuD,EAAA,CACA,GAAAnuD,iBAAAA,EACA,SAEA,IAAApQ,EAAAu+D,CAAA,CAAAnuD,EAAA,CAEA65F,EAAAplG,IAAA,CAAAuL,EAAA,IAAAF,EAAAlQ,GAKA,CACA,CACAiqG,EAAAplG,IAAA,SAA6BsxB,EAAK,GAClC8zE,EAAAplG,IAAA,YAAgCujF,EAAAh5E,OAAA,CAAsB,GACtD66F,EAAAnrG,MAAA,EACA25C,CAAAA,GAAA,KAAAwxD,EAAA98C,IAAA,WAEA,CAEA,OAAAh3B,GACA,uBACAxoB,EAAA,UAAA8qC,GACA,KACA,qBACA,qBACA9qC,EAAA,WAAA8qC,GACA,KACA,SACA9qC,EAAA,MAAA8qC,EACA,CAQA,MAPA,GAAA0oB,EAAA/K,gBAAA,EAAAzoD,EAAA,CAAmDwoB,KAAAA,CAAA,GACnDooC,GACA1+D,OAAAwM,MAAA,CAAAsB,EAAA4wD,GAEA,MAAA5wD,EAAA8kG,YAAA,EACA,GAAAtxC,EAAA/K,gBAAA,EAAAzoD,EAAA,CAAuD8kG,aAAAA,CAAA,GAEvD9kG,CACA,CAQA,SAAAqvD,EAAAwkB,CAAA,CAAA/oC,CAAA,CAAAtiB,CAAA,CAAAooC,CAAA,EACA,IAAAijB,EACA,MAAAvmB,EAAAxiB,EAAAtiB,EAAAooC,EAEA,CA7EAx+D,EAAAsgE,OAAe,CAAAA,EAOftgE,EAAA25E,eAAuB,CAHvB,SAAA/rE,CAAA,EACA,OAAA0yD,EAAA1yD,EAAA,iBACA,EA4DA5N,EAAAk7D,SAAiB,CAAAA,EAYjBl7D,EAAAi9D,MAAc,CAAAA,EAWdj9D,EAAAw5D,cAAsB,CAHtB,SAAAioB,CAAA,CAAA/oC,CAAA,CAAA95C,CAAA,CAAAqB,CAAA,EACAg9D,EAAAwkB,EAAA/oC,EAAA,oBAAiDmnB,SAAAjhE,EAAAqB,MAAAA,CAAA,EACjD,EAkBAD,EAAAk6D,mBAA2B,CAhB3B,SAAAv6C,CAAA,CAAA8rD,CAAA,CAAA/yB,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,IAEAA,GACAA,CAAAA,EAAA,KAAAA,CAAA,EAEAukB,EAAAt9C,GAAA8rD,EAAA,mBAAA/yB,EAAA,oBACA/4B,MAAAA,EACA8rD,cAAAA,CACA,GACAxO,EAAAt9C,GAAA8rD,EAAA,qBAAA/yB,EAAA,uBACA/4B,MAAAA,EACA8rD,cAAAA,CACA,EACA,EAEA,IAAAknC,EAAA,4BAAA1sE,MAAA,EAAAu2B,EAAAo2C,KACA,IAGA,mBAAAC,SAAA,CAAAD,GACA,mBAIA,GAAAA,QAAAA,EAAA,CACA,IAAAnxB,EAAA5tE,OAAAC,YAAA,MAAA++F,SAAA,QACAliD,EAAA98C,OAAAC,YAAA,UAEA,GAAA2tE,IAAA9wB,EACA,qBAGA,CACA6L,EAAA13D,IAAA,CAAA8tG,EACA,CACA,MAAAhlG,EAAA,EACA,OAAA4uD,CACA,EAAC,GASDx8D,CAAAA,EAAAilF,eAAuB,CALvB,SAAA2tB,CAAA,EACA31C,EAAA01C,EAAAzkF,OAAA,CAAA0kF,IAAA,yEACA11C,UAAA,6BAAAsB,KAAA,CAAyDo0C,KAAAA,CAAA,CACzD,EACA,EAuBA5yG,EAAA2lE,aAAqB,CAfrB,SAAAmtC,CAAA,CAAAz2C,CAAA,CAAA02C,CAAA,EAIA,GAHA,MAAAA,GACAA,CAAAA,EAAA,IAEAD,IAAAz2C,EAAA,CACA,IAAA8O,EAAA4nC,EAAA71C,EAAA,MACA61C,IACA5nC,GAAA,IACAjO,GAAA,IAAA61C,GAEA91C,EAAA,6BAA4C,EAAMkO,EAAO,wCACzDjO,UAAAA,CACA,EACA,CACA,sCCvOAp9D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA28E,YAAoB,QAQpB,IAAAvb,EAAwBt9D,EAAQ,MAMhC,OAAA64E,EAIAliD,MAAA,CAIAu4E,OAAA,EACAl7B,EAAA,aAKAk7B,CAAA,CAAAl7B,CAAA,CAAAr9C,CAAA,EACA,MAAAq9C,EAAA,CAAAA,EACA,GAAA1W,EAAA/K,gBAAA,QAAsD28C,QAAAA,EAAAv4E,OAAAA,CAAA,EACtD,CAIA,MAAA6gD,gBAAA,CACA,YAAAxD,EAAA,EAGA,WAAAk7B,OAAA,CAAAv6B,GAAA,MAAAh+C,MAAA,OAAAq9C,EAAA,CACA,CACA,CACA93E,EAAA28E,YAAoB,CAAAA,sCC3CpB78E,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+kF,aAAqB,CAAG/kF,EAAAglF,YAAoB,CAAGhlF,EAAA8kF,iBAAyB,QAoBxE,IAAAmuB,EAAoBnvG,EAAQ,OAC5B8tG,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAC5Bs9D,EAAwBt9D,EAAQ,OAChCq9D,EAAkBr9D,EAAQ,OAC1BovG,EAAoBpvG,EAAQ,OAI5BqvG,EAAA,GAAAD,EAAAE,YAAA,IACAC,EAAA,yCAA4C,KAC5CC,EAAA,oCAEAv1B,EAAA,GAEA,eAAAw1B,EAAAhkB,CAAA,CAAAikB,CAAA,EACA,QA2yBAvzG,EA1yBA,IAAAg4B,EAAAs3D,EAAAt3D,KAAA,CAAAo7E,GACA,IAAAp7E,EACA,4BAEA,WAAA8sD,EAAA,UACA,eAAA9sD,CAAA,iBACA,EAASA,CAAA,OAAAg7E,EAAA5tB,YAAA,EAAAptD,CAAA,MAoyBTh4B,EApyBSg4B,CAAA,IAqyBT,GAAAkpC,EAAA7F,WAAA,EAAAr7D,EAAA2R,OAAA,0BAAA29C,EAAAn5B,IACAviB,OAAAC,YAAA,CAAAjC,SAAAukB,EAAA,QAryBA,CACA,MAAAxoB,EAAA,CACA,WAAAm3E,EAAA,yCAA2E,SAAAC,EAAAuK,GAC3E,CACA,CAKA,SAAAkkB,EAAA7R,CAAA,EAaA,OAZA,eAAArS,CAAA,CAAAikB,CAAA,EACA,IACA,IAAAv7E,EAAAs3D,EAAAt3D,KAAA,CAAAq7E,GACA,IAAAr7E,EACA,4BAEA,WAAA+sD,EAAA,GAAuC4c,EAAQ,EAAE3pE,CAAA,IAAS,EAC1D,CACA,MAAArqB,EAAA,CACA,WAAAm3E,EAAA,wCAA8E,SAAAC,EAAAuK,GAC9E,CACA,CAEA,CACA,IAAAmkB,EAAA,CACA,KAAAH,EACA,KAAAE,EAAA,gCACA,EACAE,EAAA,IAAAl/C,OAIA,OAAAqwB,EACA,CAAAzM,EAAA,EACA20B,EAAA,aACAvd,CAAA,EACA,MAAApX,EAAA,IACA,MAAA20B,EAAA,IACA2G,EAAArsG,GAAA,CAAAmoF,EAAA,KACA,UAAAud,EAAA,EAIA,QAAAl1B,KADA,MAAAk1B,EAAA,IACA,MAAA30B,EAAA,EACAsW,WAAA,KAAmC7W,GAAA,EAAa,EAEhD,OAAAO,EAAA,IACA,EACA,CACAgD,YAAAvD,CAAA,EACA,GAAA+5B,EAAA50C,MAAA,SAAA+vC,EAAA,qDACA9vC,UAAA,qCACA,GACA,MAAAmb,EAAA,CAAAvzE,IAAA,CAAAgzE,EACA,CACA,IAAAk1B,WAAA,CAAsB,aAAAA,EAAA,CACtB4G,aAAA,CACA,GAAA/B,EAAA50C,MAAA,QAAA+vC,SAAA,4BACA,CACA,CAGA,SAAA4G,EAAAJ,CAAA,EACA,GAAAA,MAAAA,EACA,iDAGA,OADAA,EAAAI,WAAA,GACAJ,CACA,CARAxzG,EAAA8kF,iBAAyB,CAAAA,CAuBzB,OAAAE,EACA,CAAA6uB,EAAA,EACAC,EAAA,EACAC,EAAA,EACA5oC,EAAA,EACAsR,EAAA,EACA8S,EAAA,EACAllC,EAAA,EACA2pD,EAAA,EACAC,EAAA,EAEAC,EAAA,EACAv3D,EAAA,EACAw3D,EAAA,EACAX,EAAA,EACA/Q,EAAA,EACA2R,EAAA,KAIA7kB,KAAA,CAAgB,aAAAA,EAAA,CAChB,IAAAA,IAAAA,CAAA,EACA,MAAAA,EAAA,CAAA17E,OAAA07E,EACA,CAoBA,IAAAllC,MAAA,QACA,YAAAA,EAAA,CACA,KAEA,IAAA3rD,WAAA,MAAA2rD,EAAA,CACA,CACA,IAAAA,KAAAA,CAAA,EACA,GAAAA,MAAAA,EACA,MAAAA,EAAA,CAAArnD,KAAAA,EACA,MAAAgxG,EAAA,CAAAhxG,KAAAA,OAEA,oBAAAqnD,EACA,MAAAA,EAAA,IAAA8W,EAAA7F,WAAA,EAAAjR,GACA,MAAA2pD,EAAA,mBAEA,GAAA3pD,aAAA3rD,WACA,MAAA2rD,EAAA,CAAAA,EACA,MAAA2pD,EAAA,iCAEA,oBAAA3pD,EACA,MAAAA,EAAA,IAAA8W,EAAA7F,WAAA,EAAAprD,KAAAC,SAAA,CAAAk6C,IACA,MAAA2pD,EAAA,yBAGA,2BAEA,CAIAxR,SAAA,CACA,mBAAAn4C,EAAA,CAOA,IAAA8gB,QAAA,QACA,MAAAA,EAAA,CACA,MAAAA,EAAA,CAEA,KAAAq3B,OAAA,GACA,OAEA,KACA,CACA,IAAAr3B,OAAAA,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,IAEA,MAAAA,EAAA,CAAAt3D,OAAAs3D,GAAAr5D,WAAA,EACA,CAUA,IAAAiiG,SAAA,CACA,IAAAA,EAAAj0G,OAAAwM,MAAA,IAAwC,MAAAynG,EAAA,EAcxC,OAbA,MAAAE,EAAA,EACAF,CAAAA,EAAA,uBAAgD,GAAAd,EAAA7tB,YAAA,KAAAjkB,EAAA7F,WAAA,QAAA24C,EAAA,GAAuE,GAGvH,KAAApT,SAAA,EACAkT,CAAAA,CAAA,4BAEA,MAAAA,CAAA,wBAAAC,EAAA,EACAD,CAAAA,CAAA,uBAAAC,EAAA,EAEA,KAAA3pD,IAAA,EACA0pD,CAAAA,CAAA,mBAAAlgG,OAAA,KAAAw2C,IAAA,CAAAtrD,MAAA,GAEAg1G,CACA,CAIAM,UAAAhkG,CAAA,EACA,YAAA0jG,OAAA,CAAA1jG,EAAAsB,WAAA,IAMAkuF,UAAAxvF,CAAA,CAAApQ,CAAA,EACA,MAAA8zG,EAAA,CAAAlgG,OAAAxD,GAAAsB,WAAA,IAAAkC,OAAA5T,EACA,CAIAq0G,cAAA,CACA,MAAAP,EAAA,GACA,CACA,CAAAppD,OAAAC,QAAA,IACA,IAAAmpD,EAAA,KAAAA,OAAA,CACApiD,EAAA7xD,OAAA6xD,IAAA,CAAAoiD,GACAz5F,EAAA,EACA,OACAyvC,KAAA,KACA,GAAAzvC,EAAAq3C,EAAA5yD,MAAA,EACA,IAAAsR,EAAAshD,CAAA,CAAAr3C,IAAA,CACA,OACAra,MAAA,CAAAoQ,EAAA0jG,CAAA,CAAA1jG,EAAA,EAAA45C,KAAA,EACA,CACA,CACA,OAAyBhqD,MAAA+C,KAAAA,EAAAinD,KAAA,GACzB,CACA,CACA,CAMA,IAAA+8C,aAAA,CACA,aAAAiN,EAAA,MACA,CAIA/M,eAAAqN,CAAA,CAAAt2D,CAAA,EACA,GAAA4zD,EAAAr4C,cAAA,GAAA+6C,EAAAt8E,KAAA,uEACA,MAAAg8E,EAAA,IAAyBM,EAAS,GAAGt2D,EAAS,EAM9C,IAAA4iD,WAAA,CACA,aAAAiT,EAAA,CAEA,IAAAjT,UAAA5gG,CAAA,EACA,MAAA6zG,EAAA,GAAA7zG,CACA,CAKA,IAAAu0G,6BAAA,CACA,cAAAX,EAAA,CAEA,IAAAW,4BAAAv0G,CAAA,EACA,MAAA4zG,EAAA,GAAA5zG,CACA,CAKA,IAAAw8E,SAAA,CAAoB,aAAAA,EAAA,CACpB,IAAAA,QAAAA,CAAA,EACA,GAAAo1B,EAAAr4C,cAAA,EAAAijB,GAAA,uCAAAA,GACA,MAAAA,EAAA,CAAAA,CACA,CAQA,IAAAg4B,eAAA,CACA,aAAAP,EAAA,MACA,CACA,IAAAO,cAAAP,CAAA,EACA,MAAAA,EAAA,CAAAA,CACA,CAWA,IAAAriB,aAAA,CACA,aAAAl1C,EAAA,MACA,CACA,IAAAk1C,YAAAl1C,CAAA,EACA,MAAAA,EAAA,CAAAA,CACA,CAIA,IAAAmkD,WAAA,CACA,aAAAqT,EAAA,MACA,CACA,IAAArT,UAAAqT,CAAA,EACA,MAAAA,EAAA,CAAAA,CACA,CAgBA,IAAAC,YAAA,CACA,aAAAA,EAAA,EAAAjB,CACA,CACA,IAAAiB,WAAAn0G,CAAA,EACA,MAAAm0G,EAAA,CAAAn0G,CACA,CAOAtB,YAAA4wF,CAAA,EACA,MAAAA,EAAA,CAAA17E,OAAA07E,GACA,MAAAskB,EAAA,IACA,MAAAC,EAAA,IACA,MAAAC,EAAA,IACA,MAAA5oC,EAAA,IACA,MAAAsR,EAAA,KACA,MAAAgmB,EAAA,EACAF,aAtXA,IAuXAmS,YAxXA,EAyXA,EACA,MAAAN,EAAA,KACA,CACApqG,UAAA,CACA,8BAAuCkG,KAAAC,SAAA,MAAAg7D,MAAA,OAA6B,EAAMj7D,KAAAC,SAAA,MAAAo/E,GAAA,WAA0B,EAAUr/E,KAAAC,SAAA,MAAA4jG,OAAA,QAA8B,EAAO,MAAA1pD,EAAA,IAAAunD,EAAA52C,OAAA,QAAA3Q,EAAA,SAAyD,GAM5Mi4C,kBAAAx0C,CAAA,EACA,MAAAA,EAAAy0C,YAAA,EACA,OAAAE,EAAA,CAAAF,YAAA,CAAAz0C,EAAAy0C,YAAA,EAEA,MAAAz0C,EAAA4mD,WAAA,EACA,OAAAjS,EAAA,CAAAiS,WAAA,CAAA5mD,EAAA4mD,WAAA,CAEA,CACA,OAAA96B,EAAA,CAAAmY,CAAA,CAAA4iB,CAAA,CAAAC,CAAA,CAAA5jB,CAAA,CAAA8O,CAAA,EACA,GAAA/N,GAAA,MAAA0Q,EAAA,CAAAiS,WAAA,CACA,OAAA5U,EAAA+U,eAAA,iCAEA,GAAAhD,EAAA50C,MAAA,EAAAjO,KAAA2lD,EAAA,qBACAz3C,UAAA,eAAArC,OAAA,UAAA40B,QAAAuB,CACA,GACA4jB,EAAA,GACA,MAwaA,IAAAlrD,QAAA,GAAAilC,WAAAhlC,EAxaAirD,IAEA,IAAA5lB,EAAA,KAAA9iF,KAAA,GACAsC,EAAA,CAAAwgF,EAAAO,GAAA,CAAAjuF,KAAA,cAAAqQ,WAAA,GAEA,GAAAnD,KAAAklG,EAAA,CACA,IAAA3jG,EAAA,MAAA2jG,CAAA,CAAAllG,EAAA,CAAAwgF,EAAAO,GAAA,CAAAqkB,EAAA5iB,EAAA,CAAAwiB,EAAA,GACA,GAAAzjG,aAAAg1E,EAAA,CACA,IAAA4V,EAAA5qF,EACA,QAAA8hF,WAAA,EACA+hB,EAAA5iB,EAAA,CAAAwiB,EAAA,EACA,IACA7Y,EAAA,WAAA9I,WAAA,CAAA7C,EAAA2L,EACA,CACA,MAAA/sF,EAAA,CAEAA,CAAAA,MAAAA,EAAA60F,QAAA,mBAAA70F,EAAAknG,KAAA,GACAna,EAAAka,eAAA,qCAAAjnG,GAAAgtF,QAAA,EAGA,CACA,CACA,OAAAD,CACA,CACA3L,EAAAj/E,CACA,CAEA,KAAA0kG,aAAA,EACAzlB,CAAAA,EAAA,WAAAylB,aAAA,CAAAzlB,EAAA,EAEA,IAAAW,EAAA,WAAAykB,UAAA,CAAAplB,EAAA4kB,EAAA5iB,EAAA,CAAAwiB,EAAA,GACA7Y,EAAA,IAAA5V,EAAA4K,EAAAE,UAAA,CAAAF,EAAAolB,aAAA,CAAAplB,EAAAokB,OAAA,CAAApkB,EAAAtlC,IAAA,CAAA2mC,GACA,GAAA2J,MAAAA,EAAA9K,UAAA,EAAA8K,MAAAA,EAAA9K,UAAA,EAEA,IACA,IAAAmlB,EAAAra,EAAAoZ,OAAA,CAAAiB,QAAA,KACA,OAAAhmB,EAAAimB,QAAA,CAAAD,GAAA,CAAAp7B,EAAA,CAAAmY,EAAA,EAAA4iB,EAAA,EAAA3jB,EAAA2J,EACA,CACA,MAAA/sF,EAAA,EAEA,OAAA+sF,CACA,CACA,GAAAA,MAAAA,EAAA9K,UAAA,EAEA,YAAAiR,SAAA,aAAAA,SAAA,CAAA9R,EAAA2L,EAAA5I,EAAA,GACA,IAAAmjB,EAAAva,EAAAoZ,OAAA,gBACAa,EAAA,MAAAnS,EAAA,CAAAF,YAAA,CAAAr7F,KAAAiuG,KAAA,CAAAjuG,KAAA2+F,MAAA,GAAA3+F,KAAA8gC,GAAA,GAAA+pD,IAIA,MAHA,iBAAAmjB,GAAAA,EAAAj9E,KAAA,mBACA28E,CAAAA,EAAA/iG,SAAAqjG,EAAA,EAEAlmB,EAAA9iF,KAAA,IAAA0tE,EAAA,CAAAmY,EAAA,EAAA4iB,EAAAC,EAAA5jB,EAAA2J,EACA,CAEA,QAAA9I,WAAA,EACA+hB,EAAA5iB,EAAA,CAAAwiB,EAAA,EACA,IACA7Y,EAAA,WAAA9I,WAAA,CAAA7C,EAAA2L,EACA,CACA,MAAA/sF,EAAA,CAEAA,CAAAA,MAAAA,EAAA60F,QAAA,mBAAA70F,EAAAknG,KAAA,GACAna,EAAAka,eAAA,qCAAAjnG,GAAAgtF,QAAA,GAGA,IAAAga,EAAA,MAAAnS,EAAA,CAAAF,YAAA,CAAAr7F,KAAAiuG,KAAA,CAAAjuG,KAAA2+F,MAAA,GAAA3+F,KAAA8gC,GAAA,GAAA+pD,IAKA,OAHAnkF,EAAAknG,KAAA,KACAF,CAAAA,EAAAhnG,EAAAknG,KAAA,EAEA9lB,EAAA9iF,KAAA,IAAA0tE,EAAA,CAAAmY,EAAA,EAAA4iB,EAAAC,EAAA5jB,EAAA2J,EACA,CACA,CACA,OAAAA,CACA,CAIA/gB,MAAA,CAGA,MAFA,GAAAi4B,EAAA50C,MAAA,cAAAu2C,EAAA,iDAAyGt2C,UAAA,sBACzG,MAAAs2C,EAAA,KAAA1uB,EAAA,MACA,MAAAlL,EAAA,GAAA5qB,IAAA,KAAAytB,OAAA,YAAAsI,EAAA,QAA2F,WAC3F,CAKAsoB,QAAA,CACA,GAAAwE,EAAA50C,MAAA,cAAAu2C,EAAA,sDAA8Gt2C,UAAA,wBAC9G,IAAAs2C,EAAAG,EAAAxiG,GAAA,OACA,IAAAqiG,EACA,iDAEAA,GACA,CAKAyB,SAAAD,CAAA,EAEA,IAAAI,EAAA,KAAA7lB,GAAA,CAAAjuF,KAAA,SAAAqQ,WAAA,GACAi3C,EAAAosD,EAAA1zG,KAAA,SAAAqQ,WAAA,GAKA,GAAAkgG,EAAA50C,MAAA,eAAAkO,MAAA,EAAAiqC,CAAAA,UAAAA,GAAAxsD,SAAAA,CAAA,GAAAosD,EAAA/8E,KAAA,6DACAilC,UAAA,YAAmC,KAAAiO,MAAA,EAAa,EAAEj7D,KAAAC,SAAA,MAAAo/E,GAAA,MAA0B,EAAKr/E,KAAAC,SAAA,CAAA6kG,GAAyB,KAG1G,IAAAhmB,EAAA,IAAAhK,EAAAgwB,GAaA,OAZAhmB,EAAA7jB,MAAA,OACA6jB,EAAA6R,SAAA,MAAAA,SAAA,CACA7R,EAAAvS,OAAA,MAAAA,OAAA,CACAuS,EAAA,CAAA+kB,EAAA,CAAAj0G,OAAAwM,MAAA,IAAuC,MAAAynG,EAAA,EACvC,MAAA1pD,EAAA,EACA2kC,CAAAA,EAAA,CAAA3kC,EAAA,KAAA3rD,WAAA,MAAA2rD,EAAA,GAEA2kC,EAAA,CAAAglB,EAAA,OAAAA,EAAA,CAKAhlB,CACA,CAIA9iF,OAAA,CACA,IAAAA,EAAA,IAAA84E,EAAA,KAAAuK,GAAA,EAwBA,OAtBArjF,EAAA,CAAAi/D,EAAA,OAAAA,EAAA,CAEA,MAAA9gB,EAAA,EACAn+C,CAAAA,EAAA,CAAAm+C,EAAA,OAAAA,EAAA,EAEAn+C,EAAA,CAAA8nG,EAAA,OAAAA,EAAA,CAEA9nG,EAAA,CAAA6nG,EAAA,CAAAj0G,OAAAwM,MAAA,IAAyC,MAAAynG,EAAA,EAEzC7nG,EAAA,CAAA+nG,EAAA,OAAAA,EAAA,CACA,KAAApT,SAAA,EACA30F,CAAAA,EAAA20F,SAAA,KAEA30F,EAAAuwE,OAAA,MAAAA,OAAA,CACA,KAAA+3B,2BAAA,EACAtoG,CAAAA,EAAAsoG,2BAAA,KAEAtoG,EAAA,CAAAgoG,EAAA,OAAAA,EAAA,CACAhoG,EAAA,CAAAywC,EAAA,OAAAA,EAAA,CACAzwC,EAAA,CAAAioG,EAAA,OAAAA,EAAA,CACAjoG,EAAA,CAAAu2F,EAAA,CAAA3iG,OAAAwM,MAAA,IAA0C,MAAAm2F,EAAA,EAC1Cv2F,EAAA,CAAAkoG,EAAA,OAAAA,EAAA,CACAloG,CACA,CAKA,OAAAmpG,YAAA,CACAt3B,EAAA,EACA,CAIA,OAAAu3B,WAAA9mG,CAAA,EACA,OAAAklG,CAAA,CAAAllG,EAAAmD,WAAA,SACA,CASA,OAAA4jG,gBAAA/mG,CAAA,CAAAmlB,CAAA,EAEA,GAAAnlB,SADAA,CAAAA,EAAAA,EAAAmD,WAAA,KACAnD,UAAAA,EACA,gCAAgDA,EAAA,oBAAS,GAEzD,GAAAuvE,EACA,8BAEA21B,CAAAA,CAAA,CAAAllG,EAAA,CAAAmlB,CACA,CASA,OAAA6hF,eAAAvT,CAAA,EACA,GAAAlkB,EACA,+BAEAo1B,EAAAlR,CACA,CAYA,OAAAwT,iBAAA1wE,CAAA,EACA,SAAAmuE,EAAAE,YAAA,EAAAruE,EACA,CAUA,OAAA2wE,mBAAA,CACA,OAAAnC,CACA,CAQA,OAAAoC,sBAAA/T,CAAA,EACA,OAAA6R,EAAA7R,EACA,CACA,CACA5hG,EAAAglF,YAAoB,CAAAA,CAKpB,OAAAD,EACA,CAAA8K,EAAA,EACAklB,EAAA,EACAhB,EAAA,EACA1pD,EAAA,EACAolC,EAAA,EACA7hF,EAAA,CACA5D,UAAA,CACA,+BAAwC,KAAA6lF,UAAA,OAAiB,EAAO,MAAAxlC,EAAA,IAAAunD,EAAA52C,OAAA,QAAA3Q,EAAA,SAAyD,GAKzH,IAAAwlC,YAAA,CAAuB,aAAAA,EAAA,CAIvB,IAAAklB,eAAA,CAA0B,aAAAA,EAAA,CAI1B,IAAAhB,SAAA,CAAoB,OAAAj0G,OAAAwM,MAAA,IAAuB,MAAAynG,EAAA,EAI3C,IAAA1pD,MAAA,CACA,mBAAAA,EAAA,UAAA3rD,WAAA,MAAA2rD,EAAA,CACA,CAOA,IAAAwwC,UAAA,CACA,IACA,mBAAAxwC,EAAA,OAAA8W,EAAA1F,YAAA,QAAApR,EAAA,CACA,CACA,MAAAz8C,EAAA,CACA,GAAAikG,EAAA50C,MAAA,sEACAC,UAAA,WAAAsB,KAAA,CAA+Cm8B,SAAA,KAC/C,EACA,CACA,CAOA,IAAA/K,UAAA,CACA,IACA,OAAA1/E,KAAAF,KAAA,MAAA6qF,QAAA,CACA,CACA,MAAAjtF,EAAA,CACA,GAAAikG,EAAA50C,MAAA,gEACAC,UAAA,WAAAsB,KAAA,CAA+Cm8B,SAAA,KAC/C,EACA,CACA,CACA,CAAAhwC,OAAAC,QAAA,IACA,IAAAmpD,EAAA,KAAAA,OAAA,CACApiD,EAAA7xD,OAAA6xD,IAAA,CAAAoiD,GACAz5F,EAAA,EACA,OACAyvC,KAAA,KACA,GAAAzvC,EAAAq3C,EAAA5yD,MAAA,EACA,IAAAsR,EAAAshD,CAAA,CAAAr3C,IAAA,CACA,OACAra,MAAA,CAAAoQ,EAAA0jG,CAAA,CAAA1jG,EAAA,EAAA45C,KAAA,EACA,CACA,CACA,OAAyBhqD,MAAA+C,KAAAA,EAAAinD,KAAA,GACzB,CACA,CACA,CACAtrD,YAAAkxF,CAAA,CAAAklB,CAAA,CAAAhB,CAAA,CAAA1pD,CAAA,CAAAolC,CAAA,EACA,MAAAI,EAAA,CAAAA,EACA,MAAAklB,EAAA,CAAAA,EACA,MAAAhB,EAAA,CAAAj0G,OAAA6xD,IAAA,CAAAoiD,GAAA9tE,MAAA,EAAAu2B,EAAA5rD,KACA4rD,CAAA,CAAA5rD,EAAAe,WAAA,IAAAkC,OAAAkgG,CAAA,CAAAnjG,EAAA,EACA4rD,GACS,IACT,MAAAnS,EAAA,OAAAA,EAAA,SAAA3rD,WAAA2rD,GACA,MAAAolC,EAAA,CAAAA,GAAA,KACA,MAAA7hF,EAAA,EAAwB8qC,QAAA,GACxB,CAMAm8D,gBAAAn8D,CAAA,CAAA9qC,CAAA,MACAmnG,EACAr8D,EAKAq8D,EAAA,kCAA8D,KAAAllB,UAAA,EAAiB,EAAE,KAAAklB,aAAA,GAAqB,EAAEr8D,EAAQ,IAJhHA,EAAA,GAAyB,KAAAm3C,UAAA,EAAiB,EAAE,KAAAklB,aAAA,CAAmB,EAC/DA,EAAA,kCAA8Dr8D,EAAQ,IAKtE,IAAAiiD,EAAA,IAAA5V,EAAA,IAAAgwB,EAAA,KAAAhB,OAAA,MAAA1pD,IAAA,OAAAolC,EAAA,EAAAzsF,KAAAA,GAEA,OADA23F,EAAA,CAAA/sF,EAAA,EAA4B8qC,QAAAA,EAAA9qC,MAAAA,CAAA,EAC5B+sF,CACA,CAMA+H,mBAAAhqD,CAAA,CAAAo8D,CAAA,EACAA,MAAAA,EACAA,EAAA,GAGA,GAAAjD,EAAAr4C,cAAA,EAAAp7D,OAAAg4D,SAAA,CAAA0+C,IAAAA,GAAA,kCAAAA,GAEA,IAAAlnG,EAAA,MAAA8qC,GAAA,sBAEA,MADA,GAAA0oB,EAAA/K,gBAAA,EAAAzoD,EAAA,CAAuDknG,MAAAA,EAAArS,SAAA,KACvD70F,CACA,CAIAymG,UAAAhkG,CAAA,EACA,YAAA0jG,OAAA,CAAA1jG,EAAAsB,WAAA,IAKA6wF,SAAA,CACA,mBAAAn4C,EAAA,CAKA,IAAAolC,SAAA,CAAoB,aAAAA,EAAA,CAIpBmmB,IAAA,CACA,iBAAAhoG,EAAA,CAAA8qC,OAAA,OAAAm3C,UAAA,YAAAA,UAAA,IACA,CAIA+K,UAAA,CACA,QAAAgb,EAAA,GACA,OAEA,IAAcl9D,QAAAA,CAAA,CAAA9qC,MAAAA,CAAA,EAAiB,MAAAA,EAAA,CAC/B,KAAA8qC,GACAA,CAAAA,EAAA,mBAAyC,KAAAm3C,UAAA,EAAiB,EAAE,KAAAklB,aAAA,CAAmB,GAE/E,IAAAc,EAAA,IACA,MAAApmB,OAAA,EACAomB,CAAAA,EAAA,KAAApmB,OAAA,CAAAF,GAAA,EAEA,IAAAumB,EAAA,KACA,IACA,MAAAzrD,EAAA,EACAyrD,CAAAA,EAAA,GAAA30C,EAAA1F,YAAA,QAAApR,EAAA,EAEA,CACA,MAAA9kB,EAAA,EACA,GAAAssE,EAAA50C,MAAA,KAAAvkB,EAAA,gBACA+2C,QAAA,KAAAA,OAAA,oBAAAkL,SAAA,KAAA/sF,MAAAA,EACA4wD,KAAA,CACAq3C,WAAAA,EAAAC,aAAAA,EACAC,eAAA,GAAmC,KAAAlmB,UAAA,EAAiB,EAAE,KAAAklB,aAAA,CAAmB,EAEzE,EACA,CACA,CAEA,SAAA/lD,IAAqB,WAAAxjD,OAAAwjD,OAAA,GADrBhvD,EAAA+kF,aAAqB,CAAAA,sCC90BrBjlF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA6kF,WAAmB,QAWnB,IAAA+sB,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAC5Bo7D,EAAmBp7D,EAAQ,OAC3Bs9D,EAAwBt9D,EAAQ,OAChCkyG,EAAAv0G,OAAA,IACAk/D,EAAAl/D,OAAA,GACAm/D,EAAAn/D,OAAA,GACAw0G,EAAAx0G,OAAA,GACAu6D,EAAA,GAEAotB,EAAA,OACA,KAAAA,EAAArqF,MAAA,KACAqqF,GAAAA,EAGA,SAAA8sB,EAAAxW,CAAA,EACA,IAAA3vF,EAAAq5E,EACA,KAAAr5E,EAAAhR,MAAA,CAAA2gG,GACA3vF,GAAAA,EAEA,OAAAtO,OAAA,IAAAsO,EAAA0wD,SAAA,GAAAi/B,GACA,CACA,SAAAyW,EAAAhiG,CAAA,CAAAyxD,CAAA,CAAAwwC,CAAA,EACA,IAAAxpC,EAAAnrE,OAAAmkE,EAAAgH,KAAA,EACA,GAAAhH,EAAA9E,MAAA,EACA,IAAAu1C,EAAAz1C,GAAAgM,EAAAhM,EACA,GAAAixC,EAAA50C,MAAA,EAAAm5C,MAAAA,GAAAjiG,GAAA,CAAAkiG,GAAAliG,EAAAkiG,EAAA,4BACAn5C,UAAAk5C,EAAAE,MAAA,WAAAr2G,MAAAkU,CACA,GAEAA,EADAA,EAAAwsD,EACA,GAAAzB,EAAAgC,QAAA,KAAAhC,EAAAj9B,IAAA,EAAA9tB,EAAAy4D,GAAAA,GAGA,IAAA1N,EAAAgC,QAAA,KAAAhC,EAAAj9B,IAAA,GAAA9tB,EAAAy4D,GAAAA,EAEA,KACA,CACA,IAAAypC,EAAAz1C,GAAAgM,EACA,GAAAilC,EAAA50C,MAAA,EAAAm5C,MAAAA,GAAAjiG,GAAA,GAAAA,EAAAkiG,EAAA,4BACAn5C,UAAAk5C,EAAAE,MAAA,WAAAr2G,MAAAkU,CACA,GACAA,EAAA,GAAAkiG,EAAAA,CAAA,EAAAA,EAAAA,EAAAz1C,CACA,CACA,OAAAzsD,CACA,CACA,SAAAoiG,EAAAt2G,CAAA,EACA,iBAAAA,GACAA,CAAAA,EAAA,YAA4BA,EAAM,GAElC,IAAA6gE,EAAA,GACA8L,EAAA,IACA8yB,EAAA,GACA,oBAAAz/F,GAEA,GAAAA,UAAAA,QAGA,GAAAA,WAAAA,EACA6gE,EAAA,OAEA,CACA,IAAA7oC,EAAAh4B,EAAAg4B,KAAA,iCACA,GAAA45E,EAAAr4C,cAAA,EAAAvhC,EAAA,gCAAAh4B,GACA6gE,EAAA7oC,MAAAA,CAAA,IACA20C,EAAA/6D,SAAAomB,CAAA,KACAynE,EAAA7tF,SAAAomB,CAAA,IACA,OAEA,GAAAh4B,EAAA,CAEA,IAAAsoC,EAAAtoC,EACAwhF,EAAA,CAAApxE,EAAAsK,EAAAq/C,IACA,MAAAzxB,CAAA,CAAAl4B,EAAA,CACA2pD,GAEA,GAAA63C,EAAAr4C,cAAA,SAAAjxB,CAAA,CAAAl4B,EAAA,GAAAsK,EAAA,yBAAAtK,EAAA,QAAAsK,EAAA,cAAAtK,EAAAk4B,CAAA,CAAAl4B,EAAA,EACAk4B,CAAA,CAAAl4B,EAAA,EAEAywD,EAAA2gB,EAAA,mBAAA3gB,GACA8L,EAAA6U,EAAA,iBAAA7U,GACA8yB,EAAAje,EAAA,oBAAAie,EACA,CACA,GAAAmS,EAAAr4C,cAAA,uEAAAoT,GACA,GAAAilC,EAAAr4C,cAAA,EAAAkmC,GAAA,gEAAAA,GACA,IAAA9gG,EAAA,CAAAkiE,EAAA,gBAAAjtD,OAAA+4D,GAAA,IAAA/4D,OAAA6rF,GACA,OAAa5+B,OAAAA,EAAA8L,MAAAA,EAAA8yB,SAAAA,EAAA9gG,KAAAA,CAAA,CACb,CAgEA,MAAAimF,EAIAjf,MAAA,EACAA,EAAA,EAEAzxD,EAAA,EAEAqiG,EAAA,CAMAp3C,MAAA,aAOA/C,CAAA,CAAAp8D,CAAA,CAAA2lE,CAAA,EACA,GAAAisC,EAAAlsC,aAAA,EAAAtJ,EAAAL,EAAA,eACA,MAAA7nD,EAAA,CAAAlU,EACA,MAAA2lE,EAAA,CAAAA,EACA,IAAAxG,EAAAp1D,SAzFAmK,CAAA,CAAAurF,CAAA,EACA,IAAA+W,EAAA,GACAtiG,EAAAwsD,IACA81C,EAAA,IACAtiG,GAAA6hG,GAEA,IAAArqG,EAAAwI,EAAAnK,QAAA,GAEA,GAAA01F,IAAAA,EACA,OAAA+W,EAAA9qG,EAGA,KAAAA,EAAA5M,MAAA,EAAA2gG,GACA/zF,EAAAy9E,EAAAz9E,EAGA,IAAA2O,EAAA3O,EAAA5M,MAAA,CAAA2gG,EAGA,IAFA/zF,EAAAA,EAAA80D,SAAA,GAAAnmD,GAAA,IAAA3O,EAAA80D,SAAA,CAAAnmD,GAEA3O,MAAAA,CAAA,KAAAA,MAAAA,CAAA,KACAA,EAAAA,EAAA80D,SAAA,IAGA,KAAA90D,MAAAA,CAAA,CAAAA,EAAA5M,MAAA,KAAA4M,MAAAA,CAAA,CAAAA,EAAA5M,MAAA,KACA4M,EAAAA,EAAA80D,SAAA,GAAA90D,EAAA5M,MAAA,IAEA,OAAA03G,EAAA9qG,CACA,EA8DA1L,EAAA2lE,EAAA85B,QAAA,EACA,GAAAt+B,EAAA/K,gBAAA,QAAsDuP,OAAAA,EAAAhnE,IAAA,CAAAwgE,OAAAA,CAAA,GACtD,MAAAo3C,EAAA,CAAAN,EAAAtwC,EAAA85B,QAAA,CACA,CAKA,IAAA5+B,QAAA,CAAmB,aAAA8E,EAAA,CAAA9E,MAAA,CAInB,IAAA8L,OAAA,CAAkB,aAAAhH,EAAA,CAAAgH,KAAA,CAIlB,IAAA8yB,UAAA,CAAqB,aAAA95B,EAAA,CAAA85B,QAAA,CAKrB,IAAAz/F,OAAA,CAAkB,aAAAkU,EAAA,CAClB,CAAAuiG,EAAA,CAAAnmE,CAAA,EACA,GAAAshE,EAAAr4C,cAAA,OAAAoM,MAAA,GAAAr1B,EAAAq1B,MAAA,iDAA4F,QAAAr1B,EAC5F,CACA,CAAA4lE,EAAA,CAAAhiG,CAAA,CAAAiiG,CAAA,EAwBA,WAAAvxB,EAAA7oB,EADA7nD,EAAAgiG,EAAAhiG,EAAA,MAAAyxD,EAAA,CAAAwwC,GACA,MAAAxwC,EAAA,CACA,CACA,CAAAplE,EAAA,CAAAkQ,CAAA,CAAA0lG,CAAA,EAEA,OADA,MAAAM,EAAA,CAAAhmG,GACA,MAAAylG,EAAA,OAAAhiG,EAAA,CAAAzD,EAAA,CAAAyD,EAAA,CAAAiiG,EACA,CAKAO,UAAApmE,CAAA,EAAuB,aAAA/vC,EAAA,CAAA+vC,EAAA,CAMvB/vC,IAAA+vC,CAAA,EAAiB,aAAA/vC,EAAA,CAAA+vC,EAAA,OACjB,CAAA/G,EAAA,CAAA94B,CAAA,CAAA0lG,CAAA,EAEA,OADA,MAAAM,EAAA,CAAAhmG,GACA,MAAAylG,EAAA,OAAAhiG,EAAA,CAAAzD,EAAA,CAAAyD,EAAA,CAAAiiG,EACA,CAKAQ,UAAArmE,CAAA,EAAuB,aAAA/G,EAAA,CAAA+G,EAAA,CAMvB/G,IAAA+G,CAAA,EAAiB,aAAA/G,EAAA,CAAA+G,EAAA,OACjB,CAAApK,EAAA,CAAAz1B,CAAA,CAAA0lG,CAAA,EAEA,OADA,MAAAM,EAAA,CAAAhmG,GACA,MAAAylG,EAAA,OAAAhiG,EAAA,CAAAzD,EAAA,CAAAyD,EAAA,OAAAqiG,EAAA,CAAAJ,EACA,CAKAS,UAAAtmE,CAAA,EAAuB,aAAApK,EAAA,CAAAoK,EAAA,CAMvBpK,IAAAoK,CAAA,EAAiB,aAAApK,EAAA,CAAAoK,EAAA,OAMjBumE,UAAAvmE,CAAA,EACA,MAAAmmE,EAAA,CAAAnmE,GACA,IAAAtwC,EAAA,MAAAkU,EAAA,CAAAo8B,EAAA,CAAAp8B,EAAA,CAIA,MAHA,GAAA09F,EAAA50C,MAAA,UAAAu5C,EAAA,GAAA71C,EAAA,wDACAzD,UAAA,YAAAo5C,MAAA,YAAAr2G,MAAA,OAEA,MAAAk2G,EAAA,CAAAl2G,EAAA,MAAAu2G,EAAA,aACA,CACA,CAAApwE,EAAA,CAAA11B,CAAA,CAAA0lG,CAAA,EAKA,MAJA,GAAAvE,EAAA50C,MAAA,EAAAvsD,EAAA,CAAAyD,EAAA,GAAAwsD,EAAA,oCACAzD,UAAA,MAAAo5C,MAAA,iBAAAr2G,MAAA,OAEA,MAAAy2G,EAAA,CAAAhmG,GACA,MAAAylG,EAAA,OAAAhiG,EAAA,OAAAqiG,EAAA,CAAA9lG,EAAA,CAAAyD,EAAA,CAAAiiG,EACA,CAMAW,UAAAxmE,CAAA,EAAuB,aAAAnK,EAAA,CAAAmK,EAAA,CAMvBnK,IAAAmK,CAAA,EAAiB,aAAAnK,EAAA,CAAAmK,EAAA,OAMjBymE,UAAAzmE,CAAA,EACA,GAAAshE,EAAA50C,MAAA,EAAA1sB,EAAA,CAAAp8B,EAAA,GAAAwsD,EAAA,oCACAzD,UAAA,MAAAo5C,MAAA,iBAAAr2G,MAAA,OAEA,MAAAy2G,EAAA,CAAAnmE,GACA,IAAAtwC,EAAA,MAAAkU,EAAA,OAAAqiG,EAAA,CAIA,MAHA,GAAA3E,EAAA50C,MAAA,IAAA1sB,EAAA,CAAAp8B,EAAA,GAAAwsD,EAAA,wDACAzD,UAAA,YAAAo5C,MAAA,YAAAr2G,MAAA,OAEA,MAAAk2G,EAAA,CAAAl2G,EAAAswC,EAAA,CAAAp8B,EAAA,aACA,CAQA8iG,IAAA1mE,CAAA,EACA,IAAA9xC,EAAA,KAAAwB,KAAA,CAAA1B,EAAAgyC,EAAAtwC,KAAA,CAEA02C,EAAA,KAAA+oD,QAAA,CAAAnvD,EAAAmvD,QAAA,OAQA,CAPA/oD,EAAA,EACAp4C,GAAA23G,EAAAv/D,GAEAA,EAAA,GACAl4C,CAAAA,GAAAy3G,EAAA,CAAAv/D,EAAA,EAGAl4C,EAAAF,GACA,GAEAE,EAAAF,EACA,EAEA,CACA,CAIA24G,GAAA3mE,CAAA,EAAgB,gBAAA0mE,GAAA,CAAA1mE,EAAA,CAIhB4mE,GAAA5mE,CAAA,EAAgB,cAAA0mE,GAAA,CAAA1mE,EAAA,CAIhB6mE,IAAA7mE,CAAA,EAAiB,eAAA0mE,GAAA,CAAA1mE,EAAA,CAIjB8mE,GAAA9mE,CAAA,EAAgB,YAAA0mE,GAAA,CAAA1mE,GAAA,EAIhB+mE,IAAA/mE,CAAA,EAAiB,YAAA0mE,GAAA,CAAA1mE,IAAA,EAOjB9mC,OAAA,CACA,IAAA0K,EAAA,MAAAA,EAAA,CAKA,OAJA,MAAAA,EAAA,CAAAwsD,GACAxsD,CAAAA,GAAA,MAAAqiG,EAAA,CAAA51C,CAAA,EAEAzsD,EAAA,MAAAA,EAAA,OAAAqiG,EAAA,OAAAA,EAAA,CACA,MAAAL,EAAA,CAAAhiG,EAAA,QACA,CAOAojG,SAAA,CACA,IAAApjG,EAAA,MAAAA,EAAA,CAKA,OAJA,MAAAA,EAAA,CAAAwsD,GACAxsD,CAAAA,GAAA,MAAAqiG,EAAA,CAAA51C,CAAA,EAEAzsD,EAAA,MAAAA,EAAA,OAAAqiG,EAAA,OAAAA,EAAA,CACA,MAAAL,EAAA,CAAAhiG,EAAA,UACA,CAKAzP,MAAAg7F,CAAA,EAKA,GAJA,MAAAA,GACAA,CAAAA,EAAA,GAGAA,GAAA,KAAAA,QAAA,CACA,YAEA,IAAA/oD,EAAA,KAAA+oD,QAAA,CAAAA,EACA8X,EAAAvB,EAAAC,EAAAv/D,EAAA,GACA12C,EAAA,KAAAA,KAAA,CAAAu3G,EACAhB,EAAAN,EAAAv/D,GAGA,OADAw/D,EADAl2G,EAAA,EAAAu2G,EAAAA,EACA,MAAA5wC,EAAA,UACA,IAAAif,EAAA7oB,EAAA/7D,EAAA,MAAA2lE,EAAA,CACA,CAIA6xC,QAAA,CAAe,aAAAtjG,EAAA,GAAAwsD,CAAA,CAIf+2C,YAAA,CAAmB,aAAAvjG,EAAA,CAAAwsD,CAAA,CAInB32D,UAAA,CAAiB,YAAAo1D,MAAA,CAQjBu4C,eAAA,CAAsB,OAAAzU,WAAA,KAAAl5F,QAAA,IAOtB4tG,SAAAhyC,CAAA,EACA,OAAAif,EAAAgzB,UAAA,MAAA7tG,QAAA,GAAA47D,EACA,CASA,OAAAkyC,UAAA14C,CAAA,CAAA24C,CAAA,CAAAC,CAAA,EACA,IAAAtY,EAAA,MAAAqY,EAAA,KAAA74C,EAAAtC,SAAA,EAAAm7C,GACAnyC,EAAA2wC,EAAAyB,GACA/3G,EAAA,GAAAi/D,EAAA6B,SAAA,EAAA3B,EAAA,SACAzoB,EAAA+oD,EAAA95B,EAAA85B,QAAA,CACA,GAAA/oD,EAAA,GACA,IAAA6/D,EAAAN,EAAAv/D,GACA,GAAAk7D,EAAA50C,MAAA,IAAAu5C,IAAA71C,EAAA,oDACAzD,UAAA,YAAAo5C,MAAA,YAAAr2G,MAAAm/D,CACA,GACAn/D,GAAAu2G,CACA,MACA7/D,EAAA,GACA12C,CAAAA,GAAAi2G,EAAA,CAAAv/D,EAAA,EAGA,OADAw/D,EAAAl2G,EAAA2lE,EAAA,aACA,IAAAif,EAAA7oB,EAAA/7D,EAAA2lE,EACA,CAOA,OAAAiyC,WAAAz4C,CAAA,CAAA44C,CAAA,EACA,IAAA//E,EAAAmnC,EAAAnnC,KAAA,8BACA,GAAA45E,EAAAr4C,cAAA,EAAAvhC,GAAA,KAAAl5B,MAAA,CAAAk5B,CAAA,IAAAl5B,MAAA,8CAAAqgE,GACA,IAAAwG,EAAA2wC,EAAAyB,GACAC,EAAAhgF,CAAA,SAAAigF,EAAAjgF,CAAA,QAEA,KAAAigF,EAAAn5G,MAAA,CAAA6mE,EAAA85B,QAAA,EACAwY,GAAA9uB,EAGA,GAAAyoB,EAAA50C,MAAA,EAAAi7C,EAAAz3C,SAAA,CAAAmF,EAAA85B,QAAA,EAAAznE,KAAA,yDACAilC,UAAA,aAAAo5C,MAAA,YAAAr2G,MAAAm/D,CACA,GAEA84C,EAAAA,EAAAz3C,SAAA,GAAAmF,EAAA85B,QAAA,EACA,IAAAz/F,EAAAwB,OAAAw2B,CAAA,IAAAggF,EAAAC,GAEA,OADA/B,EAAAl2G,EAAA2lE,EAAA,cACA,IAAAif,EAAA7oB,EAAA/7D,EAAA2lE,EACA,CAQA,OAAAt6B,UAAA8zB,CAAA,CAAA44C,CAAA,EACA,IAAA/3G,EAAA,GAAAi/D,EAAAH,QAAA,KAAA6yC,EAAA72C,QAAA,EAAAqE,EAAA,UACAwG,EAAA2wC,EAAAyB,GAKA,OAJApyC,EAAA9E,MAAA,EACA7gE,CAAAA,EAAA,GAAAi/D,EAAAgC,QAAA,EAAAjhE,EAAA2lE,EAAAgH,KAAA,GAEAupC,EAAAl2G,EAAA2lE,EAAA,aACA,IAAAif,EAAA7oB,EAAA/7D,EAAA2lE,EACA,CACA,CACA5lE,EAAA6kF,WAAmB,CAAAA,sCC3gBnB/kF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAiiG,MAAc,CAAGjiG,EAAAozG,YAAoB,QACrC,IAAAvB,EAAoB/tG,EAAQ,OAC5B,SAAAsvG,EAAAruE,CAAA,EAqDA,OApDA,eAAAiqD,CAAA,CAAAmpB,CAAA,MA4BAxoB,EA3BA,GAAAkiB,EAAA50C,MAAA,EAAAk7C,MAAAA,GAAA,CAAAA,EAAAnL,SAAA,iDACA,IAAAoL,EAAAppB,EAAAO,GAAA,CAAAjuF,KAAA,SAAAqQ,WAAA,GACA,GAAAkgG,EAAA50C,MAAA,EAAAm7C,SAAAA,GAAAA,UAAAA,EAAA,wBAAqGA,EAAS,2BAC9G55C,KAAA,CAAoB45C,SAAAA,CAAA,EACpBl7C,UAAA,SACA,GACA,GAAA20C,EAAA50C,MAAA,EAAAm7C,UAAAA,GAAA,CAAAppB,EAAAgY,WAAA,EAAAhY,EAAAwlB,2BAAA,wEACAt3C,UAAA,SACA,GACA,IAAAtvD,EAAA,KACAyqG,EAAA,IAAAC,gBACAzjB,EAAAlG,WAAA,KACA/gF,EAAA,GAAAikG,EAAA32C,SAAA,+BACAm9C,EAAAE,KAAA,EACA,EAASvpB,EAAAvS,OAAA,EACT07B,GACAA,EAAA98B,WAAA,MACAztE,EAAA,GAAAikG,EAAA32C,SAAA,mCACAm9C,EAAAE,KAAA,EACA,GAEA,IAAAxqF,EAAA,CACAo9C,OAAA6jB,EAAA7jB,MAAA,CACA4oC,QAAA,IAAAyE,QAAA3uG,MAAAC,IAAA,CAAAklF,IACA3kC,KAAA2kC,EAAA3kC,IAAA,EAAArnD,KAAAA,EACAwwG,OAAA6E,EAAA7E,MAAA,EAGA,IACA7jB,EAAA,MAAA+J,MAAA1K,EAAAO,GAAA,CAAAxhE,EACA,CACA,MAAAs7E,EAAA,CAEA,GADAvU,aAAAD,GACAjnF,EACA,MAAAA,CAEA,OAAAy7F,CACA,CACAvU,aAAAD,GACA,IAAAkf,EAAA,GACApkB,EAAAokB,OAAA,CAAA7/F,OAAA,EAAAjU,EAAAoQ,KACA0jG,CAAA,CAAA1jG,EAAAsB,WAAA,IAAA1R,CACA,GACA,IAAAw4G,EAAA,MAAA9oB,EAAA+oB,WAAA,GACAruD,EAAA,MAAAouD,EAAA,SAAA/5G,WAAA+5G,GACA,OACA5oB,WAAAF,EAAAwN,MAAA,CACA4X,cAAAplB,EAAAgpB,UAAA,CACA5E,QAAAA,EAAA1pD,KAAAA,CACA,CACA,CAEA,CACArqD,EAAAozG,YAAoB,CAAAA,EAEpB,IAAAwF,EAAAxF,EAAA,IACA,eAAAnR,EAAAjT,CAAA,CAAAmpB,CAAA,EACA,OAAAS,EAAA5pB,EAAAmpB,EACA,CACAn4G,EAAAiiG,MAAc,CAAAA,sCCzDdniG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAy7D,YAAoB,CAAGz7D,EAAA+nF,gBAAwB,CAAG/nF,EAAAs7D,WAAmB,CAAGt7D,EAAAgoF,UAAkB,CAAGhoF,EAAAioF,WAAmB,CAAGjoF,EAAAkoF,UAAkB,CAAGloF,EAAAmoF,WAAmB,CAAGnoF,EAAA20E,SAAiB,CAAG30E,EAAA6nF,SAAiB,CAAG7nF,EAAAq2D,gBAAwB,CAAGr2D,EAAAw6E,iBAAyB,CAAGx6E,EAAAooF,UAAkB,CAAGpoF,EAAAq9D,SAAiB,CAAGr9D,EAAAu/D,OAAe,CAAGv/D,EAAAi/D,QAAgB,CAAGj/D,EAAA++D,QAAgB,CAAG/+D,EAAA4kF,OAAe,CAAG5kF,EAAA48D,SAAiB,CAAG58D,EAAA+gE,SAAiB,CAAG/gE,EAAAiiC,IAAY,CAAGjiC,EAAAihE,MAAc,CAAGjhE,EAAAkhE,QAAgB,CAAGlhE,EAAA6kF,WAAmB,CAAG7kF,EAAA8kF,iBAAyB,CAAG9kF,EAAA+kF,aAAqB,CAAG/kF,EAAAglF,YAAoB,CAAGhlF,EAAA28E,YAAoB,CAAG38E,EAAAk7D,SAAiB,CAAGl7D,EAAAilF,eAAuB,CAAGjlF,EAAA2lE,aAAqB,CAAG3lE,EAAAk6D,mBAA2B,CAAGl6D,EAAAw5D,cAAsB,CAAGx5D,EAAAi9D,MAAc,CAAGj9D,EAAAsgE,OAAe,CAAGtgE,EAAA25E,eAAuB,CAAG35E,EAAAu7D,YAAoB,CAAGv7D,EAAA6rE,YAAoB,CAAG7rE,EAAAklF,cAAsB,CAAGllF,EAAA8qE,SAAiB,CAAG9qE,EAAA49D,UAAkB,CAAG59D,EAAAgrD,MAAc,CAAGhrD,EAAAg7D,OAAe,CAAGh7D,EAAAmlF,WAAmB,CAAGnlF,EAAAspE,WAAmB,CAAGtpE,EAAAs9D,YAAoB,CAAGt9D,EAAA+6D,QAAgB,CAAG/6D,EAAAolF,YAAoB,CAAGplF,EAAAqlF,YAAoB,CAAGrlF,EAAAslF,YAAoB,CAAGtlF,EAAAulF,YAAoB,QAC/jCvlF,EAAA4nF,MAAc,CAAG5nF,EAAA8nF,cAAsB,QACvC,IAAA+wB,EAAkB/0G,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0nG,EAAAtzB,YAAA,IACtFzlF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0nG,EAAAvzB,YAAA,IACtF,IAAA2tB,EAAkBnvG,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8hG,EAAA5tB,YAAA,IACtFvlF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8hG,EAAA7tB,YAAA,IACtF,IAAAwsB,EAAgB9tG,EAAQ,OACxBhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA72C,QAAA,IAClFj7D,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAAt0C,YAAA,IACtFx9D,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAAtoC,WAAA,IACrFxpE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAAzsB,WAAA,IACrFrlF,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA52C,OAAA,IACjFl7D,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA5mD,MAAA,IAChFlrD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAAh0C,UAAA,IACpF99D,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA9mC,SAAA,IACnFhrE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA1sB,cAAA,IACxFplF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAA/lC,YAAA,IACtF/rE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAygG,EAAAr2C,YAAA,IACtF,IAAAs2C,EAAkB/tG,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAAl4B,eAAA,IACzF75E,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAAvxC,OAAA,IACjFxgE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAA50C,MAAA,IAChFn9D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAAr4C,cAAA,IACxF15D,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAA33C,mBAAA,IAC7Fp6D,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAAlsC,aAAA,IACvF7lE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAA5sB,eAAA,IACzFnlF,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA0gG,EAAA32C,SAAA,IACnF,IAAA49C,EAAkBh1G,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA2nG,EAAAn8B,YAAA,IACtF,IAAAo8B,EAAiBj1G,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4nG,EAAA/zB,YAAA,IACtFllF,OAAAC,cAAA,CAAAC,EAAA,gBAAgD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4nG,EAAAh0B,aAAA,IACvFjlF,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA4nG,EAAAj0B,iBAAA,IAC3F,IAAAk0B,EAAuBl1G,EAAQ,OAC/BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA6nG,EAAAn0B,WAAA,IACrF,IAAA3lB,EAAiBp7D,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAgC,QAAA,IAClFphE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAA+B,MAAA,IAChFnhE,OAAAC,cAAA,CAAAC,EAAA,OAAuC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAj9B,IAAA,IAC9EniC,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAA6B,SAAA,IACnFjhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAtC,SAAA,IACnF98D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAA0lB,OAAA,IACjF9kF,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAH,QAAA,IAClFj/D,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAD,QAAA,IAClFn/D,OAAAC,cAAA,CAAAC,EAAA,UAA0C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAK,OAAA,IACjFz/D,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAA7B,SAAA,IACnFv9D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+tD,EAAAkpB,UAAA,IACpF,IAAAhnB,EAAsBt9D,EAAQ,OAC9BhE,OAAAC,cAAA,CAAAC,EAAA,oBAAoD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAiwD,EAAAoZ,iBAAA,IAC3F16E,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAiwD,EAAA/K,gBAAA,IAC1F,IAAA4iD,EAAsBn1G,EAAQ,OAC9BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8nG,EAAApxB,SAAA,IACnF,IAAAqxB,EAAsBp1G,EAAQ,OAC9BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+nG,EAAAvkC,SAAA,IACnF,IAAAwkC,EAAiBr1G,EAAQ,OACzBhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgoG,EAAAhxB,WAAA,IACrFroF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgoG,EAAAjxB,UAAA,IACpFpoF,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgoG,EAAAlxB,WAAA,IACrFnoF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgoG,EAAAnxB,UAAA,IACpF,IAAA7mB,EAAgBr9D,EAAQ,OACxBhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgwD,EAAA7F,WAAA,IACrFx7D,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgwD,EAAA4mB,gBAAA,IAC1FjoF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgwD,EAAA1F,YAAA,IACtF37D,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgwD,EAAA2mB,cAAA,IACxF,IAAAsxB,EAAgBt1G,EAAQ,OACxBhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAioG,EAAAxxB,MAAA,wCC3EhF9nF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAooF,UAAkB,CAAGpoF,EAAAq9D,SAAiB,CAAGr9D,EAAAu/D,OAAe,CAAGv/D,EAAAi/D,QAAgB,CAAGj/D,EAAA48D,SAAiB,CAAG58D,EAAA++D,QAAgB,CAAG/+D,EAAA4kF,OAAe,CAAG5kF,EAAA+gE,SAAiB,CAAG/gE,EAAAiiC,IAAY,CAAGjiC,EAAAihE,MAAc,CAAGjhE,EAAAkhE,QAAgB,QAM3M,IAAA0wC,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAC5B68D,EAAAl/D,OAAA,GACAm/D,EAAAn/D,OAAA,GA+DA,SAAAs/D,EAAA9gE,CAAA,CAAArB,CAAA,EACA,cAAAqB,GACA,oBAAAA,CACA,cAGA,MAFA,GAAA4xG,EAAAr4C,cAAA,EAAAp7D,OAAAg4D,SAAA,CAAAn2D,GAAA,YAAArB,GAAA,QAAAqB,GACA,GAAA4xG,EAAAr4C,cAAA,EAAAv5D,GAAA,mBAAAA,GAjEA,iBAiEA,WAAArB,GAAA,QAAAqB,GACAwB,OAAAxB,EACA,cACA,IACA,GAAAA,KAAAA,EACA,4BAEA,GAAAA,MAAAA,CAAA,KAAAA,MAAAA,CAAA,IACA,OAAAwB,OAAAxB,EAAAwgE,SAAA,KAEA,OAAAh/D,OAAAxB,EACA,CACA,MAAAslC,EAAA,CACA,GAAAssE,EAAAr4C,cAAA,qCAAuFj0B,EAAAmT,OAAA,CAAU,EAAA95C,GAAA,QAAAqB,EACjG,CACA,CACA,GAAA4xG,EAAAr4C,cAAA,kCAAA56D,GAAA,QAAAqB,EACA,CAMA,SAAA2kF,EAAA3kF,CAAA,CAAArB,CAAA,EACA,IAAAmR,EAAAgxD,EAAA9gE,EAAArB,GAIA,MAHA,GAAAizG,EAAA50C,MAAA,EAAAltD,GAAA4wD,EAAA,qDACA21C,MAAA,WAAAp5C,UAAA,UAAAj9D,MAAAA,CACA,GACA8P,CACA,CA1EA/P,EAAAkhE,QAAgB,CAbhB,SAAA9B,CAAA,CAAAi6C,CAAA,EACA,IAAAp5G,EAAA2kF,EAAAxlB,EAAA,SACAwN,EAAAnrE,OAAAm7D,EAAAy8C,EAAA,gBAKA,CAJA,GAAAxH,EAAA50C,MAAA,KAAA2P,IAAAjM,EAAA,4BACAzD,UAAA,WAAAo5C,MAAA,WAAAr2G,MAAAm/D,CACA,GAEAn/D,GAAA2sE,EAAAhM,GAEA,IAAA3gE,EADA,CAAA2gE,GAAAgM,CAAA,EAAAhM,CACA,EAAAA,CAAA,EAEA3gE,CACA,EA2BAD,EAAAihE,MAAc,CAnBd,SAAA7B,CAAA,CAAAi6C,CAAA,EACA,IAAAp5G,EAAA8gE,EAAA3B,EAAA,SACAwN,EAAAnrE,OAAAm7D,EAAAy8C,EAAA,UACAhD,EAAAz1C,GAAAgM,EAAAhM,SACA,EAAAD,GACA1gE,EAAA,CAAAA,EACA,GAAA4xG,EAAA50C,MAAA,EAAAh9D,GAAAo2G,EAAA,2BACAn5C,UAAA,SAAAo5C,MAAA,WAAAr2G,MAAAm/D,CACA,GAEA,EAAAn/D,EADA,CAAA2gE,GAAAgM,CAAA,EAAAhM,CACA,EAAAA,IAGA,GAAAixC,EAAA50C,MAAA,EAAAh9D,EAAAo2G,EAAA,4BACAn5C,UAAA,SAAAo5C,MAAA,WAAAr2G,MAAAm/D,CACA,GAEAn/D,EACA,EAUAD,EAAAiiC,IAAY,CALZ,SAAAm9B,CAAA,CAAAvrB,CAAA,EAGA,OAAA5zC,EAFAm/D,EAAA,SAEA,CAAAwB,GADAn/D,OAAAm7D,EAAA/oB,EAAA,QACA,EAAA+sB,CACA,EA6BA5gE,EAAA+gE,SAAiB,CAAAA,EAYjB/gE,EAAA4kF,OAAe,CAAAA,EACf,IAAA00B,EAAA,mBAKA,SAAAv6C,EAAA9+D,CAAA,EACA,GAAAA,aAAAvB,WAAA,CACA,IAAAqR,EAAA,MACA,QAAAw4B,KAAAtoC,EAEA8P,GADAupG,CAAA,CAAA/wE,GAAA,GACA+wE,CAAA,CAAA/wE,GAAAA,EAAA,CAEA,OAAA9mC,OAAAsO,EACA,CACA,OAAAgxD,EAAA9gE,EACA,CAMA,SAAA28D,EAAA38D,CAAA,CAAArB,CAAA,EACA,cAAAqB,GACA,aAEA,MADA,GAAA4xG,EAAAr4C,cAAA,EAAAv5D,GAAA,mBAAAA,GAxHA,iBAwHA,WAAArB,GAAA,QAAAqB,GACA7B,OAAA6B,EACA,cAGA,MAFA,GAAA4xG,EAAAr4C,cAAA,EAAAp7D,OAAAg4D,SAAA,CAAAn2D,GAAA,YAAArB,GAAA,QAAAqB,GACA,GAAA4xG,EAAAr4C,cAAA,EAAAv5D,GAAA,mBAAAA,GA5HA,iBA4HA,WAAArB,GAAA,QAAAqB,GACAA,CACA,cACA,IACA,GAAAA,KAAAA,EACA,4BAEA,OAAA28D,EAAAn7D,OAAAxB,GAAArB,EACA,CACA,MAAA2mC,EAAA,CACA,GAAAssE,EAAAr4C,cAAA,gCAAkFj0B,EAAAmT,OAAA,CAAU,EAAA95C,GAAA,QAAAqB,EAC5F,CACA,CACA,GAAA4xG,EAAAr4C,cAAA,6BAAA56D,GAAA,QAAAqB,EACA,CAyCA,SAAAo9D,EAAA+B,CAAA,EACA,IAAAn/D,EAAA2kF,EAAAxlB,EAAA,SACA,GAAAn/D,IAAA0gE,EACA,WAAAjiE,WAAA,IAEA,IAAAwL,EAAAjK,EAAA+J,QAAA,IACAE,CAAAA,EAAAnL,MAAA,IACAmL,CAAAA,EAAA,IAAAA,CAAA,EAEA,IAAA6F,EAAA,IAAArR,WAAAwL,EAAAnL,MAAA,IACA,QAAAkD,EAAA,EAAoBA,EAAA8N,EAAAhR,MAAA,CAAmBkD,IAAA,CACvC,IAAAm5B,EAAAn5B,EAAAA,CACA8N,CAAAA,CAAA,CAAA9N,EAAA,CAAA4P,SAAA3H,EAAAu2D,SAAA,CAAArlC,EAAAA,EAAA,MACA,CACA,OAAArrB,CACA,CAlFA/P,EAAA++D,QAAgB,CAAAA,EA2BhB/+D,EAAA48D,SAAiB,CAAAA,EAQjB58D,EAAAi/D,QAAgB,CAHhB,SAAAh/D,CAAA,EACA,OAAA28D,EAAAmC,EAAA9+D,GACA,EA6BAD,EAAAu/D,OAAe,CAvBf,SAAAH,CAAA,CAAAi6C,CAAA,EAEA,IAAAtpG,EAAA9P,EADAm/D,EAAA,SACAp1D,QAAA,KACA,GAAAqvG,MAAAA,EAEAtpG,EAAAhR,MAAA,IACAgR,CAAAA,EAAA,IAAAA,CAAA,MAGA,CACA,IAAA68D,EAAAhQ,EAAAy8C,EAAA,SAOA,IANA,GAAAxH,EAAA50C,MAAA,EAAA2P,EAAAA,GAAA78D,EAAAhR,MAAA,yBAAoF6tE,EAAA,OAAO,mBAC3F1P,UAAA,UACAo5C,MAAA,WACAr2G,MAAAm/D,CACA,GAEArvD,EAAAhR,MAAA,CAAA6tE,EAAAA,GACA78D,EAAA,IAAAA,CAEA,CACA,WAAAA,CACA,EAqBA/P,EAAAq9D,SAAiB,CAAAA,EAkBjBr9D,EAAAooF,UAAkB,CAVlB,SAAAnoF,CAAA,EACA,IAAA8P,EAAA,GAAA6hG,EAAA52C,OAAA,KAAA42C,EAAAzsB,WAAA,EAAAllF,GAAAA,EAAAo9D,EAAAp9D,IAAAwgE,SAAA,IACA,KAAA1wD,EAAAw2D,UAAA,OACAx2D,EAAAA,EAAA0wD,SAAA,IAKA,MAHA,KAAA1wD,GACAA,CAAAA,EAAA,KAEA,KAAAA,CACA,oCCjMA,eAAAyqE,EAAAv6E,CAAA,EACA,IAAA0xD,EAAA7xD,OAAA6xD,IAAA,CAAA1xD,GAEA,MAAAwkG,CADA,MAAA/6C,QAAA6F,GAAA,CAAAoC,EAAAt3C,GAAA,IAAAqvC,QAAAC,OAAA,CAAA1pD,CAAA,CAAA2Q,EAAA,KACAq1B,MAAA,EAAAu2B,EAAAj0B,EAAAjuB,KACAkiD,CAAA,CAAA7K,CAAA,CAAAr3C,EAAA,EAAAiuB,EACAi0B,GACK,GACL,CAlCA18D,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAq2D,gBAAwB,CAAGr2D,EAAAw6E,iBAAyB,QAkCpDx6E,EAAAw6E,iBAAyB,CAAAA,EAgBzBx6E,EAAAq2D,gBAAwB,CAVxB,SAAAzN,CAAA,CAAAqR,CAAA,CAAAL,CAAA,EACA,QAAAvpD,KAAA4pD,EAAA,CACA,IAAAh6D,EAAAg6D,CAAA,CAAA5pD,EAAA,CACAsK,EAAAi/C,EAAAA,CAAA,CAAAvpD,EAAA,MACAsK,GACA4+F,SA5CAt5G,CAAA,CAAA0a,CAAA,CAAA/b,CAAA,EACA,IAAAg7D,EAAAj/C,EAAArZ,KAAA,MAAA+Y,GAAA,CAAAtV,GAAAA,EAAAy0G,IAAA,IACA,QAAAv3G,EAAA,EAAoBA,EAAA23D,EAAA76D,MAAA,CAAkBkD,IACtC,OAAA0Y,GACA,UACA,MACA,cACA,cACA,aACA,aACA,UAAA1a,IAAA0a,EACA,MAEA,CAEA,IAAA/M,EAAA,gCAAsD+M,EAAK,EAI3D,OAHA/M,EAAAwoB,IAAA,oBACAxoB,EAAAiyD,QAAA,UAA8BjhE,EAAK,EACnCgP,EAAA3N,KAAA,CAAAA,EACA2N,CACA,EAwBA3N,EAAA0a,EAAAtK,GAEAvQ,OAAAC,cAAA,CAAA6oD,EAAAv4C,EAAA,CAA6Ca,WAAA,GAAAjR,MAAAA,EAAA+Q,SAAA,IAC7C,CACA,sCCtDAlR,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA6nF,SAAiB,QACjB,IAAA+pB,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAC5B21G,EAAkB31G,EAAQ,OAQ1B,SAAA41G,EAAA5yG,CAAA,CAAAs0B,CAAA,CAAAr8B,CAAA,EACA,IAAAgR,EAAA,EACA,QAAA9N,EAAA,EAAoBA,EAAAlD,EAAYkD,IAChC8N,EAAA,IAAAA,EAAAjJ,CAAA,CAAAs0B,EAAAn5B,EAAA,CAEA,OAAA8N,CACA,CACA,SAAA4pG,EAAA7yG,CAAA,CAAAs0B,CAAA,CAAAw+E,CAAA,CAAA76G,CAAA,EACA,IAAAgR,EAAA,GACA,KAAA6pG,EAAAx+E,EAAA,EAAAr8B,GAAA,CACA,IAAA86G,EAAAC,EAAAhzG,EAAA8yG,GACA7pG,EAAAjL,IAAA,CAAA+0G,EAAA9pG,MAAA,EACA6pG,GAAAC,EAAAv7C,QAAA,CACA,GAAAuzC,EAAA50C,MAAA,EAAA28C,GAAAx+E,EAAA,EAAAr8B,EAAA,yCACAuK,OAAAxC,EAAA/H,OAAAA,EAAAq8B,OAAAA,CACA,EACA,CACA,OAAakjC,SAAA,EAAAv/D,EAAAgR,OAAAA,CAAA,CACb,CAEA,SAAA+pG,EAAAhzG,CAAA,CAAAs0B,CAAA,EACA,GAAAy2E,EAAA50C,MAAA,EAAAn2D,IAAAA,EAAA/H,MAAA,oCACAuK,OAAAxC,EAAA/H,OAAA,EAAAq8B,OAAA,CACA,GACA,IAAA2+E,EAAA,IACA,GAAAlI,EAAA50C,MAAA,EAAA7hC,GAAAt0B,EAAA/H,MAAA,kDACAuK,OAAAxC,EAAA/H,OAAA+H,EAAA/H,MAAA,CAAAq8B,OAAAA,CACA,EACA,EAEA,GAAAt0B,CAAA,CAAAs0B,EAAA,OACA,IAAA4+E,EAAAlzG,CAAA,CAAAs0B,EAAA,KACA2+E,EAAA3+E,EAAA,EAAA4+E,GACA,IAAAj7G,EAAA26G,EAAA5yG,EAAAs0B,EAAA,EAAA4+E,GAEA,OADAD,EAAA3+E,EAAA,EAAA4+E,EAAAj7G,GACA46G,EAAA7yG,EAAAs0B,EAAAA,EAAA,EAAA4+E,EAAAA,EAAAj7G,EACA,CACA,GAAA+H,CAAA,CAAAs0B,EAAA,OACA,IAAAr8B,EAAA+H,CAAA,CAAAs0B,EAAA,KAEA,OADA2+E,EAAA3+E,EAAA,EAAAr8B,GACA46G,EAAA7yG,EAAAs0B,EAAAA,EAAA,EAAAr8B,EACA,CACA,GAAA+H,CAAA,CAAAs0B,EAAA,OACA,IAAA4+E,EAAAlzG,CAAA,CAAAs0B,EAAA,KACA2+E,EAAA3+E,EAAA,EAAA4+E,GACA,IAAAj7G,EAAA26G,EAAA5yG,EAAAs0B,EAAA,EAAA4+E,GACAD,EAAA3+E,EAAA,EAAA4+E,EAAAj7G,GACA,IAAAgR,EAAA,GAAA6hG,EAAA52C,OAAA,EAAAl0D,EAAAgJ,KAAA,CAAAsrB,EAAA,EAAA4+E,EAAA5+E,EAAA,EAAA4+E,EAAAj7G,IACA,OAAiBu/D,SAAA,EAAA07C,EAAAj7G,EAAAgR,OAAAA,CAAA,CACjB,CACA,GAAAjJ,CAAA,CAAAs0B,EAAA,OACA,IAAAr8B,EAAA+H,CAAA,CAAAs0B,EAAA,KACA2+E,EAAA3+E,EAAA,EAAAr8B,GACA,IAAAgR,EAAA,GAAA6hG,EAAA52C,OAAA,EAAAl0D,EAAAgJ,KAAA,CAAAsrB,EAAA,EAAAA,EAAA,EAAAr8B,IACA,OAAiBu/D,SAAA,EAAAv/D,EAAAgR,OAAAA,CAAA,CACjB,CACA,OAAauuD,SAAA,EAAAvuD,OAAAkqG,SA/Dbh6G,CAAA,EACA,IAAA8P,EAAA9P,EAAA+J,QAAA,KACA,KAAA+F,EAAAhR,MAAA,IACAgR,EAAA,IAAAA,EAEA,WAAAA,CACA,EAyDajJ,CAAA,CAAAs0B,EAAA,EACb,CAUAp7B,EAAA6nF,SAAiB,CANjB,SAAAzc,CAAA,EACA,IAAAtkE,EAAA,GAAA2yG,EAAA1+C,QAAA,EAAAqQ,EAAA,QACAyuC,EAAAC,EAAAhzG,EAAA,GAEA,MADA,GAAA+qG,EAAAr4C,cAAA,EAAAqgD,EAAAv7C,QAAA,GAAAx3D,EAAA/H,MAAA,4CAAAqsE,GACAyuC,EAAA9pG,MAAA,sCC7EAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA20E,SAAiB,QACjB,IAAAi9B,EAAkB9tG,EAAQ,OAC1B,SAAAo2G,EAAAj6G,CAAA,EACA,IAAA8P,EAAA,GACA,KAAA9P,GACA8P,EAAAg8E,OAAA,CAAA9rF,IAAAA,GACAA,IAAA,EAEA,OAAA8P,CACA,CA2BA,IAAAoqG,EAAA,kBAYAn6G,CAAAA,EAAA20E,SAAiB,CARjB,SAAArnC,CAAA,EACA,IAAAv9B,EAAA,KACA,QAAAw4B,KAAA6xE,SAhCAA,EAAA9sE,CAAA,EACA,GAAAzjC,MAAA8J,OAAA,CAAA25B,GAAA,CACA,IAAA+oD,EAAA,GAIA,GAHA/oD,EAAAp5B,OAAA,UAAAs3E,CAAA,EACA6K,EAAAA,EAAArrC,MAAA,CAAAovD,EAAA5uB,GACA,GACA6K,EAAAt3F,MAAA,KAEA,OADAs3F,EAAAtK,OAAA,KAAAsK,EAAAt3F,MAAA,EACAs3F,EAEA,IAAAt3F,EAAAm7G,EAAA7jB,EAAAt3F,MAAA,EAEA,OADAA,EAAAgtF,OAAA,KAAAhtF,EAAAA,MAAA,EACAA,EAAAisD,MAAA,CAAAqrC,EACA,CACA,IAAAvvF,EAAA+C,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,IAAAulG,EAAA72C,QAAA,EAAAztB,EAAA,WACA,GAAAxmC,IAAAA,EAAA/H,MAAA,EAAA+H,CAAA,SACA,OAAAA,EAEA,GAAAA,EAAA/H,MAAA,KAEA,OADA+H,EAAAilF,OAAA,KAAAjlF,EAAA/H,MAAA,EACA+H,EAEA,IAAA/H,EAAAm7G,EAAApzG,EAAA/H,MAAA,EAEA,OADAA,EAAAgtF,OAAA,KAAAhtF,EAAAA,MAAA,EACAA,EAAAisD,MAAA,CAAAlkD,EACA,EAOAwmC,GAEAv9B,GADAoqG,CAAA,CAAA5xE,GAAA,GACA4xE,CAAA,CAAA5xE,GAAAA,EAAA,CAEA,OAAAx4B,CACA,sCCjDAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAkoF,UAAkB,CAAGloF,EAAAmoF,WAAmB,CAAGnoF,EAAAgoF,UAAkB,CAAGhoF,EAAAioF,WAAmB,QAsBnF,IAAA4pB,EAAoB/tG,EAAQ,OAC5Bk1G,EAAyBl1G,EAAQ,OACjCo7D,EAAmBp7D,EAAQ,OAC3Bge,EAAA,CACA,MACA,OACA,OACA,OACA,QACA,SACA,QACA,CAOA,SAAAmmE,EAAAhoF,CAAA,CAAAo6G,CAAA,EACA,IAAA3a,EAAA,GACA,oBAAA2a,EAAA,CACA,IAAA//F,EAAAwH,EAAAoM,OAAA,CAAAmsF,GACA,GAAAxI,EAAAr4C,cAAA,EAAAl/C,GAAA,wBAAA+/F,GACA3a,EAAA,EAAAplF,CACA,MACA,MAAA+/F,GACA3a,CAAAA,EAAA,GAAAxgC,EAAAtC,SAAA,EAAAy9C,EAAA,SAEA,OAAArB,EAAAn0B,WAAA,CAAAizB,SAAA,CAAA73G,EAAAy/F,EAAA,CAAqEA,SAAAA,EAAA9yB,MAAA,MAAsB5iE,QAAA,EAC3F,CAOA,SAAAg+E,EAAA/nF,CAAA,CAAAo6G,CAAA,EACA,GAAAxI,EAAAr4C,cAAA,mBAAAv5D,EAAA,iCAAAA,GACA,IAAAy/F,EAAA,GACA,oBAAA2a,EAAA,CACA,IAAA//F,EAAAwH,EAAAoM,OAAA,CAAAmsF,GACA,GAAAxI,EAAAr4C,cAAA,EAAAl/C,GAAA,wBAAA+/F,GACA3a,EAAA,EAAAplF,CACA,MACA,MAAA+/F,GACA3a,CAAAA,EAAA,GAAAxgC,EAAAtC,SAAA,EAAAy9C,EAAA,SAEA,OAAArB,EAAAn0B,WAAA,CAAAgzB,UAAA,CAAA53G,EAAA,CAA4Dy/F,SAAAA,EAAA9yB,MAAA,MAAsB3sE,KAAA,CAjBlFD,EAAAioF,WAAmB,CAAAA,EAmBnBjoF,EAAAgoF,UAAkB,CAAAA,EAOlBhoF,EAAAmoF,WAAmB,CAHnB,SAAAmyB,CAAA,EACA,OAAAryB,EAAAqyB,EAAA,GACA,EASAt6G,EAAAkoF,UAAkB,CAHlB,SAAAqyB,CAAA,EACA,OAAAvyB,EAAAuyB,EAAA,GACA,sCCtFAz6G,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+nF,gBAAwB,CAAG/nF,EAAAy7D,YAAoB,CAAGz7D,EAAAs7D,WAAmB,CAAGt7D,EAAA8nF,cAAsB,QAS9F,IAAA8pB,EAAkB9tG,EAAQ,OAC1B+tG,EAAoB/tG,EAAQ,OAI5B,SAAA02G,EAAA3/C,CAAA,CAAAz/B,CAAA,CAAAv8B,CAAA,CAAAc,CAAA,CAAA86G,CAAA,EAEA,GAAA5/C,eAAAA,GAAAA,wBAAAA,EAAA,CACA,IAAA54D,EAAA,EACA,QAAAyO,EAAA0qB,EAAA,EACA,EADiCv8B,EAAAE,MAAA,EACjCF,CAAA,CAAA6R,EAAA,OADmDA,IAInDzO,IAEA,OAAAA,CACA,OAGA,YAAA44D,EACAh8D,EAAAE,MAAA,CAAAq8B,EAAA,EAGA,CACA,CAkCA,SAAAs/E,EAAAl/C,CAAA,CAAAm/C,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA36G,EAAA8nF,cAAA,CAAAl6E,KAAA,EAEA,IAAA/O,EAAA,GAAA+yG,EAAA72C,QAAA,EAAAS,EAAA,SACAzrD,EAAA,GACA9N,EAAA,EAEA,KAAAA,EAAApD,EAAAE,MAAA,GACA,IAAA8rB,EAAAhsB,CAAA,CAAAoD,IAAA,CAEA,GAAA4oB,GAAA,MACA9a,EAAAjL,IAAA,CAAA+lB,GACA,QACA,CAEA,IAAA+vF,EAAA,KACAC,EAAA,KAEA,IAAAhwF,IAAAA,CAAA,OACA+vF,EAAA,EACAC,EAAA,SAGA,IAAAhwF,IAAAA,CAAA,OACA+vF,EAAA,EACAC,EAAA,UAGA,IAAAhwF,IAAAA,CAAA,OACA+vF,EAAA,EACAC,EAAA,UAEA,CACA,CAAAhwF,IAAAA,CAAA,OACA5oB,GAAA04G,EAAA,sBAAA14G,EAAA,EAAApD,EAAAkR,GAGA9N,GAAA04G,EAAA,aAAA14G,EAAA,EAAApD,EAAAkR,GAEA,QACA,CAEA,GAAA9N,EAAA,EAAA24G,GAAA/7G,EAAAE,MAAA,EACAkD,GAAA04G,EAAA,UAAA14G,EAAA,EAAApD,EAAAkR,GACA,QACA,CAEA,IAAA/D,EAAA6e,EAAA,MAAA+vF,EAAA,KACA,QAAA51G,EAAA,EAAwBA,EAAA41G,EAAiB51G,IAAA,CACzC,IAAA81G,EAAAj8G,CAAA,CAAAoD,EAAA,CAEA,IAAA64G,IAAAA,CAAA,QACA74G,GAAA04G,EAAA,mBAAA14G,EAAApD,EAAAkR,GACA/D,EAAA,KACA,KACA,CAEAA,EAAA,KAAA8uG,GAAAA,EACA74G,GACA,CAEA,GAAA+J,OAAAA,GAIA,GAAAA,EAAA,SACA/J,GAAA04G,EAAA,eAAA14G,EAAA,EAAA24G,EAAA/7G,EAAAkR,EAAA/D,GACA,QACA,CAEA,GAAAA,GAAA,OAAAA,GAAA,OACA/J,GAAA04G,EAAA,kBAAA14G,EAAA,EAAA24G,EAAA/7G,EAAAkR,EAAA/D,GACA,QACA,CAEA,GAAAA,GAAA6uG,EAAA,CACA54G,GAAA04G,EAAA,WAAA14G,EAAA,EAAA24G,EAAA/7G,EAAAkR,EAAA/D,GACA,QACA,CACA+D,EAAAjL,IAAA,CAAAkH,GACA,CACA,OAAA+D,CACA,CAOA,SAAAurD,EAAA3vD,CAAA,CAAAinG,CAAA,EACA,GAAAf,EAAAr4C,cAAA,mBAAA7tD,EAAA,6BAAAA,GACA,MAAAinG,IACA,GAAAf,EAAA5sB,eAAA,EAAA2tB,GACAjnG,EAAAA,EAAAknG,SAAA,CAAAD,IAEA,IAAA7iG,EAAA,GACA,QAAA9N,EAAA,EAAoBA,EAAA0J,EAAA5M,MAAA,CAAgBkD,IAAA,CACpC,IAAA4oB,EAAAlf,EAAAT,UAAA,CAAAjJ,GACA,GAAA4oB,EAAA,IACA9a,EAAAjL,IAAA,CAAA+lB,QAEA,GAAAA,EAAA,KACA9a,EAAAjL,IAAA,WACAiL,EAAAjL,IAAA,IAAA+lB,EAAA,UAEA,IAAAA,MAAAA,CAAA,UACA5oB,IACA,IAAAmrB,EAAAzhB,EAAAT,UAAA,CAAAjJ,GACA,GAAA4vG,EAAAr4C,cAAA,EAAAv3D,EAAA0J,EAAA5M,MAAA,GAAAquB,MAAAA,CAAA,wCAAAzhB,GAEA,IAAAovG,EAAA,QAAAlwF,KAAAA,CAAA,OAAAuC,CAAAA,KAAAA,CAAA,EACArd,EAAAjL,IAAA,YACAiL,EAAAjL,IAAA,eACAiL,EAAAjL,IAAA,cACAiL,EAAAjL,IAAA,IAAAi2G,EAAA,IACA,MAEAhrG,EAAAjL,IAAA,YACAiL,EAAAjL,IAAA,cACAiL,EAAAjL,IAAA,IAAA+lB,EAAA,IAEA,CACA,WAAAnsB,WAAAqR,EACA,CAlIA/P,EAAA8nF,cAAsB,CAAAhoF,OAAA4gC,MAAA,EACtB9yB,MAnDA,SAAAitD,CAAA,CAAAz/B,CAAA,CAAAv8B,CAAA,CAAAc,CAAA,CAAA86G,CAAA,EACA,GAAA5I,EAAAr4C,cAAA,oCAA0Ep+B,EAAA,EAAS,EAAEy/B,EAAO,UAAAh8D,EAC5F,EAkDAm8G,OAAAR,EACA5oG,QA9BA,SAAAipD,CAAA,CAAAz/B,CAAA,CAAAv8B,CAAA,CAAAc,CAAA,CAAA86G,CAAA,QAEA,aAAA5/C,GACA,GAAAg3C,EAAAr4C,cAAA,mBAAAihD,EAAA,wDAAAA,GACA96G,EAAAmF,IAAA,CAAA21G,GACA,IAGA96G,EAAAmF,IAAA,QAEA01G,EAAA3/C,EAAAz/B,EAAAv8B,EAAAc,EAAA86G,GACA,CAoBA,GA+HAz6G,EAAAs7D,WAAmB,CAAAA,EAsBnBt7D,EAAAy7D,YAAoB,CAHpB,SAAA58D,CAAA,CAAA87G,CAAA,EACA,OAhBAM,EAgBAp8G,EAAA87G,GAhBAtgG,GAAA,IACA,SACAxG,OAAAC,YAAA,CAAAonG,GAGArnG,OAAAC,YAAA,GADAonG,GAAA,QACA,gBAAAA,KAAAA,CAAA,UACK9tD,IAAA,IAWL,EAUAptD,EAAA+nF,gBAAwB,CAHxB,SAAAp8E,CAAA,CAAAinG,CAAA,EACA,OAAA8H,EAAAp/C,EAAA3vD,EAAAinG,GACA,sCC/NA9yG,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4nF,MAAc,QAMd,IAAAgqB,EAAkB9tG,EAAQ,MAwB1B9D,CAAAA,EAAA4nF,MAAc,CAlBd,SAAAv/E,CAAA,EACA,IAAAxJ,EAAA,GAAA+yG,EAAA72C,QAAA,EAAA1yD,EAAA,cAGAxJ,CAAAA,CAAA,OAAAA,CAAA,OAIAA,CAAA,OAAAA,CAAA,QACA,IAAAoB,EAAA,GAAA2xG,EAAA52C,OAAA,EAAAn8D,GACA,OACAoB,EAAAwgE,SAAA,OACAxgE,EAAAwgE,SAAA,QACAxgE,EAAAwgE,SAAA,QACAxgE,EAAAwgE,SAAA,QACAxgE,EAAAwgE,SAAA,QACA,CAAArT,IAAA,KACA,sCC9BAttD,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0nF,UAAkB,QAClB,IAAAnwB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BykF,EAAmBzkF,EAAQ,MAY3B,OAAA4jF,UAAAtvB,EAAA2rB,cAAA,CAIA70E,OAAA,EACAisG,EAAA,aAQApqE,CAAA,CAAA2c,CAAA,EACA,MAAAA,GACA,GAAA66B,EAAA/uB,cAAA,EAAAzoB,GAAA,mBAAAA,EAAAsG,IAAA,oDACA,MAAA8jE,EAAA,CAAApqE,EACA,IAAA7hC,EAAA,GAAAo5E,EAAA5C,cAAA,OAAAy1B,UAAA,CAAA7iE,SAAA,EACA,GAAAiwC,EAAAlyB,gBAAA,QAAiDnnD,QAAAA,CAAA,EACjD,CAMA,IAAAisG,YAAA,CAAuB,aAAAA,EAAA,CAIvB,IAAApqE,YAAA,CAAuB,YAAAoqE,UAAA,CAAApqE,UAAA,CACvB,MAAA+e,YAAA,CAAyB,YAAA5gD,OAAA,CACzB4qE,QAAApsB,CAAA,EACA,WAAAg6B,EAAA,MAAAyzB,EAAA,CAAAztD,EACA,CACA,MAAAqpC,gBAAAp8B,CAAA,EAEA,IAAgB7yD,GAAAA,CAAA,CAAAgC,KAAAA,CAAA,EAAW,SAAAy+E,EAAA/N,iBAAA,GAC3B1yE,GAAA6yD,EAAA7yD,EAAA,IAAAyvD,EAAA0c,cAAA,EAAAtZ,EAAA7yD,EAAA,MAAA4lD,QAAA,EAAA1qD,KAAAA,EACA8G,KAAA6wD,EAAA7wD,IAAA,IAAAytD,EAAA0c,cAAA,EAAAtZ,EAAA7wD,IAAA,MAAA4jD,QAAA,EAAA1qD,KAAAA,CACA,EACA,OAAA8E,GACA6yD,CAAAA,EAAA7yD,EAAA,CAAAA,CAAA,EAEA,MAAAgC,GACA6wD,CAAAA,EAAA7wD,IAAA,CAAAA,CAAA,EAEA,MAAA6wD,EAAA7wD,IAAA,GACA,GAAAy+E,EAAA/uB,cAAA,KAAAjC,EAAAzH,UAAA,EAAA6K,EAAA7wD,IAAA,SAAAoF,OAAA,+CAAAyrD,EAAA7wD,IAAA,EACA,OAAA6wD,EAAA7wD,IAAA,EAGA,IAAAsxG,EAAA9yB,EAAA9C,WAAA,CAAA17E,IAAA,CAAA6wD,GAEA,OADAygD,EAAA/iE,SAAA,MAAA8iE,UAAA,CAAA9jE,IAAA,CAAA+jE,EAAAhL,YAAA,EACAgL,EAAAl6B,UAAA,CAEA,MAAA+V,YAAAv+C,CAAA,EACA,YAAA2iE,eAAA,CAAA3iE,EACA,CAMA2iE,gBAAA3iE,CAAA,EACA,YAAAyiE,UAAA,CAAA9jE,IAAA,IAAA8gB,EAAA9H,WAAA,EAAA3X,IAAAwoC,UAAA,CAEA,MAAAgW,cAAAjoF,CAAA,CAAA2qD,CAAA,CAAA35D,CAAA,EAEA,IAAAkoG,EAAA,MAAAhwC,EAAAisB,gBAAA,CAAAoI,YAAA,CAAAv9E,EAAA2qD,EAAA35D,EAAA,MAAArB,IAGA,GAAA2pF,EAAAtrB,MAAA,aAAAvP,QAAA,wEACAwP,UAAA,cACAsB,KAAA,CAAwB5/D,KAAAA,CAAA,CACxB,GACA,IAAAsQ,EAAA,WAAAw+C,QAAA,CAAA6mB,WAAA,CAAA31E,GAIA,MAHA,GAAA2pF,EAAAtrB,MAAA,EAAA/tD,MAAAA,EAAA,6CACAjP,MAAArB,CACA,GACAsQ,CACA,GACA,YAAAisG,UAAA,CAAA9jE,IAAA,CAAA8gB,EAAAisB,gBAAA,CAAAnlF,IAAA,CAAAkpG,EAAAl5F,MAAA,CAAA2qD,EAAAuuC,EAAAloG,KAAA,GAAAihF,UAAA,CAEA,CACAlhF,EAAA0nF,UAAkB,CAAAA,qCCtGlB5nF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAonF,qBAA6B,CAAGpnF,EAAAqnF,cAAsB,CAAGrnF,EAAAwnF,gBAAwB,CAAGxnF,EAAAynF,YAAoB,CAAGznF,EAAAsnF,WAAmB,QAM9H,IAAA/vB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3Bw3G,EAAqBx3G,EAAQ,OAC7By3G,EAAyBz3G,EAAQ,OACjC03G,EAAsB13G,EAAQ,OAC9B23G,EAA2B33G,EAAQ,MAInC9D,CAAAA,EAAAsnF,WAAmB,oBAEnB,IAAAo0B,EAAA,IAAAh9G,WAAA,gDAEAglD,EAAAjiD,OAAA,sEAEA,SAAAk6G,EAAA17G,CAAA,CAAAlB,CAAA,EACA,IAAAgR,EAAA,GACA,KAAA9P,GACA8P,EAAAupG,kBAAA,CAAAr5G,EAAA,IAAA8P,EACA9P,EAAAiH,KAAAiuG,KAAA,CAAAl1G,EAAA,IAEA,KAAA8P,EAAAhR,MAAA,CAAAA,EAAAA,GACAgR,EAAA,IAAAA,EAEA,WAAAA,CACA,CACA,SAAA6rG,EAAAx8C,CAAA,EACA,IAAAn/D,EAAA,GAAAqoF,EAAAvtB,QAAA,EAAAqE,GACAqiB,EAAA,GAAA6G,EAAAxd,SAAA,KAAAvT,EAAA3c,MAAA,KAAA2c,EAAA3c,MAAA,EAAA36C,IAAA,KACApB,EAAA,GAAAypF,EAAAt9B,MAAA,GAAA/qD,EAAAwhF,EAAA,EACA,SAAA6G,EAAAhD,YAAA,EAAAzmF,EACA,CACA,IAAAm9D,EAAA,GACA,SAAA6/C,EAAAvhG,CAAA,CAAAwhG,CAAA,CAAAxjE,CAAA,CAAAvH,CAAA,EACA,IAAAjqC,EAAA,IAAApI,WAAA,GACA4b,CAvBA,WAuBAA,GACA,GAAAguE,EAAArrB,MAAA,EAAAlsB,MAAAA,EAAA,gEACAmsB,UAAA,aACA,GAEAp2D,EAAAQ,GAAA,IAAAghF,EAAAvtB,QAAA,EAAAhqB,GAAA,IAIAjqC,EAAAQ,GAAA,IAAAghF,EAAAvtB,QAAA,EAAAziB,IAGA,QAAAr2C,EAAA,GAAqBA,GAAA,EAAQA,GAAA,EAC7B6E,CAAA,IAAA7E,CAAAA,GAAA,UAAAA,EAAA,IAEA,IAAAuwC,EAAA,GAAA81C,EAAAvtB,QAAA,KAAAxD,EAAAsmB,WAAA,WAAAi+B,EAAAh1G,IACA,OAAai1G,GAAAvpE,EAAA1iC,KAAA,OAAAksG,GAAAxpE,EAAA1iC,KAAA,KACb,CACA,SAAAmsG,EAAApgF,CAAA,CAAA82B,CAAA,EACA,IAAAsG,EAAAtG,EAAArxD,KAAA,MACA,GAAAgnF,EAAA9uB,cAAA,EAAAP,EAAAl6D,MAAA,yBAAA4zD,GACA,MAAAsG,CAAA,MACA,GAAAqvB,EAAA9uB,cAAA,EAAA39B,IAAAA,EAAArM,KAAA,wFAAgJqM,EAAArM,KAAA,CAAW,SAAAmjC,GAC3JsG,EAAAlzD,KAAA,IAEA,IAAAgK,EAAA8rB,EACA,QAAA55B,EAAA,EAAoBA,EAAAg3D,EAAAl6D,MAAA,CAAuBkD,IAAA,CAC3C,IAAAi6G,EAAAjjD,CAAA,CAAAh3D,EAAA,CACA,GAAAi6G,EAAAjkF,KAAA,eACA,IAAA3d,EAAAzI,SAAAqqG,EAAAz7C,SAAA,GAAAy7C,EAAAn9G,MAAA,KACA,GAAAupF,EAAA9uB,cAAA,EAAAl/C,EArDA,WAqDA,6BAA8FrY,EAAE,GAAAi6G,GAChGnsG,EAAAA,EAAAosG,WAAA,CAAAC,WAAA9hG,EACA,MACA,GAAA4hG,EAAAjkF,KAAA,cACA,IAAA3d,EAAAzI,SAAAqqG,GACA,GAAA5zB,EAAA9uB,cAAA,EAAAl/C,EA1DA,WA0DA,6BAA8FrY,EAAE,GAAAi6G,GAChGnsG,EAAAA,EAAAosG,WAAA,CAAA7hG,EACA,KAEA,GAAAguE,EAAA9uB,cAAA,sCAAoFv3D,EAAE,GAAAi6G,EAEtF,CACA,OAAAnsG,CACA,CASA,MAAA03E,UAAA8zB,EAAA7zB,UAAA,CAIApvC,SAAA,CAQA+jE,WAAA,CAIAC,iBAAA,CAOAC,QAAA,CAKAT,SAAA,CAQAnpD,IAAA,CAKAr4C,KAAA,CAKAkV,KAAA,aAIA6sC,CAAA,CAAA8+C,CAAA,CAAAmB,CAAA,CAAAR,CAAA,CAAAnpD,CAAA,CAAAr4C,CAAA,CAAAkV,CAAA,CAAA+sF,CAAA,CAAA7uD,CAAA,EACA,MAAAytD,EAAAztD,GACA,GAAA46B,EAAA3iB,aAAA,EAAAtJ,EAAAL,EAAA,gBACA,GAAAssB,EAAAjyB,gBAAA,QAAiD/d,UAAA6iE,EAAAr5B,mBAAA,GACjD,IAAAu6B,EAAA,GAAA/zB,EAAAxd,SAAA,KAAAvT,EAAA3Y,SAAA,KAAA2Y,EAAA3c,MAAA,OAAAtC,SAAA,QACA,GAAAgwC,EAAAjyB,gBAAA,QACAimD,kBAAAA,EAAAD,YAAAA,EACAP,UAAAA,EAAAnpD,KAAAA,EAAAr4C,MAAAA,EAAAkV,MAAAA,CACA,GACA,GAAA84D,EAAAjyB,gBAAA,QAAiDkmD,SAAAA,CAAA,EACjD,CACAziC,QAAApsB,CAAA,EACA,WAAA+5B,EAAAzrB,EAAA,KAAAm/C,UAAA,MAAAmB,iBAAA,MAAAR,SAAA,MAAAnpD,IAAA,MAAAr4C,KAAA,MAAAkV,KAAA,MAAA+sF,QAAA,CAAA7uD,EACA,CACA,CAAA08C,EAAA,GACA,IAAAA,EAAA,CAA0Bl7F,QAAA,KAAAA,OAAA,CAAA6hC,WAAA,KAAAA,UAAA,EAC1BpgC,EAAA,KAAA4rG,QAAA,CAQA,OAPA,KAAA5pD,IAAA,EAAAhiD,GAAAA,OAAAA,EAAA6rG,QAAA,CAAAC,MAAA,EAAA9rG,KAAAA,EAAAstC,QAAA,EACAmsD,CAAAA,EAAAmS,QAAA,EACA5pD,KAAA,KAAAA,IAAA,CACA8pD,OAAA,KACAC,QAAA/rG,EAAA+rG,OAAA,CACA,EAEAtS,CACA,CAQA,MAAA/1C,QAAApW,CAAA,CAAA0+D,CAAA,EACA,gBAAAlB,EAAA30B,mBAAA,QAAAsjB,EAAA,GAAAnsD,EAAA,CAA8F0+D,iBAAAA,CAAA,EAC9F,CAWAC,YAAA3+D,CAAA,EACA,SAAAw9D,EAAA50B,uBAAA,QAAAujB,EAAA,GAAAnsD,EACA,CAOA,IAAA4+D,aAAA,CAOA,MADA,GAAAv0B,EAAArrB,MAAA,OAAAztC,KAAA,+CAA8F0tC,UAAA,gBAC9F0+C,EAAA,GAAAtzB,EAAAt9B,MAAA,GACA,aAAA2wD,EAAA,KAAAnsF,KAAA,SAAA8sF,iBAAA,CACAX,EAAA,KAAArhG,KAAA,SAAAwhG,SAAA,CACA,GAAAxzB,EAAAt9B,MAAA,eAAAja,UAAA,GACA,EACA,CAKA+rE,SAAA,CAAgB,kBAAAnqD,IAAA,CAQhBoqD,QAAA,CACA,WAAAv1B,EAAAxrB,EAAA,KAAA9sD,OAAA,MAAAopC,SAAA,MAAAgkE,iBAAA,MAAAR,SAAA,MAAAnpD,IAAA,MAAAr4C,KAAA,MAAAkV,KAAA,MAAAk+B,QAAA,CACA,CAIAyuD,YAAAa,CAAA,EACA,IAAA1iG,EAAA,GAAAguE,EAAA1rB,SAAA,EAAAogD,EAAA,SACA,GAAA10B,EAAA9uB,cAAA,EAAAl/C,GAAA,mCAAAA,GAEA,IAAAq4C,EAAA,KAAAA,IAAA,CACAA,IACAA,GAAA,IAAAr4C,CAAAA,WAAAA,CAAA,EAzNA,WA0NAA,GACAq4C,CAAAA,GAAA,MAGA,IAAgBqpD,GAAAA,CAAA,CAAAD,GAAAA,CAAA,EAASF,EAAAvhG,EAAA,KAAAwhG,SAAA,MAAAxjE,SAAA,MAAAvH,UAAA,EAEzB,WAAA02C,EAAAzrB,EADA,IAAAzE,EAAA8mB,UAAA,IAAAiK,EAAA/oB,OAAA,MAAA+oB,EAAAvpB,QAAA,EAAAg9C,GAAAt6G,OAAA,KAAAsvC,UAAA,GAAA2S,EAAA,KACA,KAAA24D,WAAA,IAAA/zB,EAAAttB,OAAA,EAAAghD,GAAArpD,EAAAr4C,EAAA,KAAAkV,KAAA,QAAA+sF,QAAA,MAAA7uD,QAAA,CACA,CAIAuuD,WAAAtpD,CAAA,EACA,OAAAspD,EAAA,KAAAtpD,EACA,CACA,QAAAsqD,EAAA,CAAAC,CAAA,CAAAX,CAAA,EACA,GAAAj0B,EAAA9uB,cAAA,KAAA8uB,EAAAnD,WAAA,EAAA+3B,GAAA,oCACA,IAAApwE,EAAA,GAAAw7C,EAAAvtB,QAAA,EAAAmiD,EAAA,QACA,GAAA50B,EAAA9uB,cAAA,EAAA1sB,EAAA/tC,MAAA,MAAA+tC,EAAA/tC,MAAA,yCACA,IAAAyzC,EAAA,GAAA81C,EAAAvtB,QAAA,KAAAxD,EAAAsmB,WAAA,WAAA69B,EAAA5uE,IAEA,WAAA26C,EAAAzrB,EADA,IAAAzE,EAAA8mB,UAAA,IAAAiK,EAAAttB,OAAA,EAAAxoB,EAAA1iC,KAAA,SACA,gBAAAw4E,EAAAttB,OAAA,EAAAxoB,EAAA1iC,KAAA,cAAAysG,EAAA,KACA,CAQA,OAAAY,gBAAAN,CAAA,EACA,IAAAh+G,EAAA,GAAAypF,EAAAjrB,SAAA,KAAAirB,EAAA/C,YAAA,EAAAs3B,IACA,GAAAv0B,EAAA9uB,cAAA,EAAA36D,KAAAA,EAAAE,MAAA,EAAA68G,EAAA/8G,EAAAiR,KAAA,UAAA+sG,EAAA,qDACA,IAAArtF,EAAA3wB,CAAA,IACAy9G,EAAA,GAAAh0B,EAAAttB,OAAA,EAAAn8D,EAAAiR,KAAA,OACAwK,EAAAzI,SAAA,GAAAy2E,EAAAttB,OAAA,EAAAn8D,EAAAiR,KAAA,QAAA2wD,SAAA,QACAq7C,EAAA,GAAAxzB,EAAAttB,OAAA,EAAAn8D,EAAAiR,KAAA,SACAO,EAAAxR,EAAAiR,KAAA,QACA,UAAAw4E,EAAAttB,OAAA,EAAAn8D,EAAAiR,KAAA,QAEA,iBACA,kBACA,IAAAwoC,EAAA,GAAAgwC,EAAAttB,OAAA,EAAA3qD,GACA,WAAAm3E,EAAAxrB,EAAA,GAAA5D,EAAAstB,cAAA,EAAAptC,GAAAA,EAAAgkE,EAAAR,EAAA,KAAAxhG,EAAAkV,EAAA,KACA,CAEA,iBACA,kBACA,GAAAnf,IAAAA,CAAA,IACA,MAEA,WAAAo3E,EAAAzrB,EAAA,IAAAzE,EAAA8mB,UAAA,CAAAhuE,EAAAP,KAAA,KAAAwsG,EAAAR,EAAA,KAAAxhG,EAAAkV,EAAA,UACA,CACA,GAAA84D,EAAA9uB,cAAA,gEACA,CAIA,OAAA4jD,aAAAn/D,CAAA,CAAA0U,CAAA,CAAA6pD,CAAA,EACA,MAAAv+D,GACAA,CAAAA,EAAA,IAEA,MAAA0U,GACAA,CAAAA,EAAA3yD,EAAAsnF,WAAA,EAEA,MAAAk1B,GACAA,CAAAA,EAAAlB,EAAA30B,MAAA,CAAA61B,QAAA,IAEA,IAAAD,EAAAf,EAAA7zB,QAAA,CAAA01B,WAAA,IAAA9lD,EAAAlvD,WAAA,MAAA41C,EAAAu+D,GACA,OAAA/0B,EAAA,CAAAw1B,EAAA,CAAAV,EAAAe,WAAA,GAAAf,GAAAN,UAAA,CAAAtpD,EACA,CAIA,OAAA4qD,aAAAhB,CAAA,CAAA5pD,CAAA,EAIA,OAHAA,GACAA,CAAAA,EAAA3yD,EAAAsnF,WAAA,EAEAG,EAAA,CAAAw1B,EAAA,CAAAV,EAAAe,WAAA,GAAAf,GAAAN,UAAA,CAAAtpD,EACA,CAIA,OAAA6qD,WAAA9gF,CAAA,CAAAuhB,CAAA,CAAA0U,CAAA,CAAA6pD,CAAA,EACA,MAAAv+D,GACAA,CAAAA,EAAA,IAEA,MAAA0U,GACAA,CAAAA,EAAA3yD,EAAAsnF,WAAA,EAEA,MAAAk1B,GACAA,CAAAA,EAAAlB,EAAA30B,MAAA,CAAA61B,QAAA,IAEA,IAAAD,EAAAf,EAAA7zB,QAAA,CAAA61B,UAAA,CAAA9gF,EAAAuhB,EAAAu+D,GACA,OAAA/0B,EAAA,CAAAw1B,EAAA,CAAAV,EAAAe,WAAA,GAAAf,GAAAN,UAAA,CAAAtpD,EACA,CAIA,OAAAsqD,SAAAnwE,CAAA,EACA,OAAA26C,EAAA,CAAAw1B,EAAA,CAAAnwE,EAAA,KACA,CACA,CACA9sC,EAAAynF,YAAoB,CAAAA,CASpB,OAAAD,UAAArvB,EAAA0rB,UAAA,CAIAvrC,SAAA,CAQA+jE,WAAA,CAIAC,iBAAA,CAKAR,SAAA,CAQAnpD,IAAA,CAKAr4C,KAAA,CAKAkV,KAAA,aAIA6sC,CAAA,CAAAntD,CAAA,CAAAopC,CAAA,CAAAgkE,CAAA,CAAAR,CAAA,CAAAnpD,CAAA,CAAAr4C,CAAA,CAAAkV,CAAA,CAAAk+B,CAAA,EACA,MAAAx+C,EAAAw+C,GACA,GAAA46B,EAAA3iB,aAAA,EAAAtJ,EAAAL,EAAA,oBACA,GAAAssB,EAAAjyB,gBAAA,QAAiD/d,UAAAA,CAAA,GACjD,IAAA+jE,EAAA,GAAA/zB,EAAAxd,SAAA,KAAAvT,EAAA3Y,SAAA,KAAA2Y,EAAA3c,MAAA,EAAAtC,IAAA,KACA,GAAAgwC,EAAAjyB,gBAAA,QACA/d,UAAAA,EAAA+jE,YAAAA,EAAAC,kBAAAA,EAAAR,UAAAA,EAAAnpD,KAAAA,EAAAr4C,MAAAA,EAAAkV,MAAAA,CACA,EACA,CACAsqD,QAAApsB,CAAA,EACA,WAAA85B,EAAAxrB,EAAA,KAAA9sD,OAAA,MAAAopC,SAAA,MAAAgkE,iBAAA,MAAAR,SAAA,MAAAnpD,IAAA,MAAAr4C,KAAA,MAAAkV,KAAA,CAAAk+B,EACA,CAOA,IAAAmvD,aAAA,CAOA,MADA,GAAAv0B,EAAArrB,MAAA,OAAAztC,KAAA,+CAA8F0tC,UAAA,gBAC9F0+C,EAAA,GAAAtzB,EAAAt9B,MAAA,GACA,aACA2wD,EAAA,KAAAnsF,KAAA,IACA,KAAA8sF,iBAAA,CACAX,EAAA,KAAArhG,KAAA,IACA,KAAAwhG,SAAA,CACA,KAAAxjE,SAAA,CACA,EACA,CAKAwkE,SAAA,CAAgB,kBAAAnqD,IAAA,CAIhBwpD,YAAAa,CAAA,EACA,IAAA1iG,EAAA,GAAAguE,EAAA1rB,SAAA,EAAAogD,EAAA,SACA,GAAA10B,EAAA9uB,cAAA,EAAAl/C,GAAA,mCAAAA,GAEA,IAAAq4C,EAAA,KAAAA,IAAA,CACAA,IACAA,GAAA,IAAAr4C,CAAAA,WAAAA,CAAA,EApaA,WAqaAA,GACAq4C,CAAAA,GAAA,MAGA,IAAgBqpD,GAAAA,CAAA,CAAAD,GAAAA,CAAA,EAASF,EAAAvhG,EAAA,KAAAwhG,SAAA,MAAAxjE,SAAA,OACzBmlE,EAAAlmD,EAAA8mB,UAAA,CAAA8D,SAAA,CAAA45B,EAAA,KAAAzjE,SAAA,KAEA,WAAAkvC,EAAAxrB,EADA,GAAA5D,EAAAstB,cAAA,EAAA+3B,GACAA,EAAA,KAAApB,WAAA,IAAA/zB,EAAAttB,OAAA,EAAAghD,GAAArpD,EAAAr4C,EAAA,KAAAkV,KAAA,QAAAk+B,QAAA,CACA,CAIAuuD,WAAAtpD,CAAA,EACA,OAAAspD,EAAA,KAAAtpD,EACA,CACA,CACA3yD,EAAAwnF,gBAAwB,CAAAA,EA8BxBxnF,EAAAqnF,cAAsB,CALtB,SAAA21B,CAAA,EACA,IAAA1iG,EAAA,GAAAguE,EAAA1rB,SAAA,EAAAogD,EAAA,SAEA,MADA,GAAA10B,EAAA9uB,cAAA,EAAAl/C,GAAA,GAAAA,EAhdA,WAgdA,gCAAAA,GACA,aAAwBA,EAAM,QAiB9Bta,EAAAonF,qBAA6B,CAL7B,SAAA41B,CAAA,EACA,IAAA1iG,EAAA,GAAAguE,EAAA1rB,SAAA,EAAAogD,EAAA,SAEA,MADA,GAAA10B,EAAA9uB,cAAA,EAAAl/C,GAAA,GAAAA,EA/dA,WA+dA,gCAAAA,GACA,kBAA6BA,EAAM,uCCnenCxa,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAunF,MAAc,CAAGvnF,EAAA2nF,QAAgB,CAAG3nF,EAAA6mF,uBAA+B,CAAG7mF,EAAA8mF,mBAA2B,CAAG9mF,EAAA+mF,mBAA2B,CAAG/mF,EAAAgnF,uBAA+B,CAAGhnF,EAAAknF,cAAsB,CAAGlnF,EAAAinF,oBAA4B,CAAGjnF,EAAAmnF,eAAuB,CAAGnnF,EAAAwnF,gBAAwB,CAAGxnF,EAAAynF,YAAoB,CAAGznF,EAAAonF,qBAA6B,CAAGpnF,EAAAqnF,cAAsB,CAAGrnF,EAAAsnF,WAAmB,CAAGtnF,EAAA0nF,UAAkB,QACzY,IAAA6zB,EAAuBz3G,EAAQ,OAC/BhE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAoqG,EAAA7zB,UAAA,IACpF,IAAAg2B,EAAoB55G,EAAQ,MAC5BhE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusG,EAAAp2B,WAAA,IACrFxnF,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusG,EAAAr2B,cAAA,IACxFvnF,OAAAC,cAAA,CAAAC,EAAA,wBAAwD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusG,EAAAt2B,qBAAA,IAC/FtnF,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusG,EAAAj2B,YAAA,IACtF3nF,OAAAC,cAAA,CAAAC,EAAA,mBAAmD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAusG,EAAAl2B,gBAAA,IAC1F,IAAAm2B,EAA0B75G,EAAQ,OAClChE,OAAAC,cAAA,CAAAC,EAAA,kBAAkD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwsG,EAAAx2B,eAAA,IACzFrnF,OAAAC,cAAA,CAAAC,EAAA,uBAAuD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAwsG,EAAA12B,oBAAA,IAC9F,IAAAw0B,EAAyB33G,EAAQ,OACjChE,OAAAC,cAAA,CAAAC,EAAA,iBAAiD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsqG,EAAAv0B,cAAA,IACxFpnF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsqG,EAAAz0B,uBAAA,IACjGlnF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsqG,EAAA10B,mBAAA,IAC7FjnF,OAAAC,cAAA,CAAAC,EAAA,sBAAsD,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsqG,EAAA30B,mBAAA,IAC7FhnF,OAAAC,cAAA,CAAAC,EAAA,0BAA0D,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAsqG,EAAA50B,uBAAA,IACjG,IAAA20B,EAAoB13G,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAqqG,EAAA7zB,QAAA,IAClF,IAAAi2B,EAAkB95G,EAAQ,OAC1BhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAysG,EAAAr2B,MAAA,wCCrChFznF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAinF,oBAA4B,CAAGjnF,EAAAmnF,eAAuB,QACtD,IAAAjyB,EAAiBpxD,EAAQ,OACzByzD,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BE,EAAmBF,EAAQ,MAc3B9D,CAAAA,EAAAmnF,eAAuB,CAVvB,SAAA02B,CAAA,EACA,IAEA,GAAA/2G,KADAkJ,KAAA,CAAA6tG,GACAC,OAAA,CACA,QAEA,CACA,MAAAlwG,EAAA,EACA,QACA,EAkCA5N,EAAAinF,oBAA4B,CArB5B,SAAA42B,CAAA,CAAAhgE,CAAA,EACA,IAAA/2C,EAAAoJ,KAAAF,KAAA,CAAA6tG,GACA5/D,EAAA,GAAAj6C,EAAA+5G,WAAA,EAAAlgE,GAEA3uC,EAAA,GAAAqoD,EAAAzH,UAAA,KAAA9rD,EAAAg6G,OAAA,EAAAl3G,EAAA,oBAEAg3G,EAAA,GAAA95G,EAAAi6G,aAAA,KAAAj6G,EAAAg6G,OAAA,EAAAl3G,EAAA,oBACA,GAAAwhF,EAAA9uB,cAAA,EAAAskD,GAAA,EAAA/+G,MAAA,gCAAA8+G,GACA,IAAAxtG,EAAA,GAAAi4E,EAAAvtB,QAAA,KAAA5C,EAAAza,MAAA,EAAAO,EAAAA,EAAA,kBAAAnuC,KAAA,OACA8lD,EAAAkoD,EAAAhuG,KAAA,OACAouG,EAAAJ,EAAAhuG,KAAA,KAEAquG,EAAA,IAAAjpD,EAAAF,GAAA,CAAA3kD,EAAAulD,GACA9oB,EAAA,GAAAooB,EAAAR,UAAA,KAAA4zB,EAAAvtB,QAAA,EAAAojD,EAAA5pD,OAAA,CAAA2pD,KAEAE,EAAA,GACA,QAAAn8G,EAAA,EAAoBA,EAAA6qC,EAAA/tC,MAAA,CAAiBkD,IACrCm8G,GAAAvqG,OAAAC,YAAA,CAAAg5B,CAAA,CAAA7qC,EAAA,EAEA,OAAaiN,QAAAA,EAAA6hC,WAAA,GAAAqnB,EAAA/pD,EAAA,EAAA+vG,EAAA,CACb,sCC9CAt+G,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA8mF,mBAA2B,CAAG9mF,EAAA6mF,uBAA+B,CAAG7mF,EAAA+mF,mBAA2B,CAAG/mF,EAAAgnF,uBAA+B,CAAGhnF,EAAAknF,cAAsB,QACtJ,IAAAhyB,EAAiBpxD,EAAQ,OACzByzD,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bs0D,EAAmBt0D,EAAQ,OAC3BwkF,EAAmBxkF,EAAQ,OAC3BE,EAAmBF,EAAQ,OAC3BukF,EAAsBvkF,EAAQ,OAC9BwjF,EAAA,mBA2BA,SAAA+2B,EAAAv3G,CAAA,CAAAu2C,CAAA,EACA,IAAAhtC,EAAA,GAAAi4E,EAAAvtB,QAAA,EAAA1d,GACAmX,EAAA,GAAAxwD,EAAAg6G,OAAA,EAAAl3G,EAAA,2BACAw3G,EAAA,GAAAh2B,EAAAttB,OAAA,KAAA7C,EAAAyT,SAAA,KAAA0c,EAAAt9B,MAAA,GAAA36C,EAAAP,KAAA,QAAA0kD,EAAA,IAAAiM,SAAA,IACA,GAAA6nB,EAAA9uB,cAAA,EAAA8kD,IAAA,GAAAt6G,EAAAg6G,OAAA,EAAAl3G,EAAA,sBAAA6K,WAAA,mDACA,IAAAo/B,EAAAwjB,SAhBAztD,CAAA,CAAAuJ,CAAA,CAAAmkD,CAAA,EAEA,GAAA+pD,gBADA,GAAAv6G,EAAAg6G,OAAA,EAAAl3G,EAAA,wBACA,CACA,IAAA8uD,EAAA,GAAA5xD,EAAAg6G,OAAA,EAAAl3G,EAAA,gCACA03G,EAAA,IAAAtpD,EAAAJ,GAAA,CAAAzkD,EAAAulD,GACA,SAAA0yB,EAAAttB,OAAA,EAAAwjD,EAAAjqD,OAAA,CAAAC,GACA,CACA,GAAA8zB,EAAArrB,MAAA,mDACAC,UAAA,SACA,EACA,EAMAp2D,EAAAuJ,EAAAP,KAAA,OAAA0kD,GACAtlD,EAAA,GAAAkpD,EAAAstB,cAAA,EAAA30C,GACA,GAAAjqC,EAAAoI,OAAA,EACA,IAAAuyE,EAAA36E,EAAAoI,OAAA,CAAAyC,WAAA,GACA8vE,EAAAlb,UAAA,QACAkb,CAAAA,EAAA,KAAAA,CAAA,EAEA,GAAA6G,EAAA9uB,cAAA,KAAAjC,EAAAzH,UAAA,EAAA2xB,KAAAvyE,EAAA,iDAAApI,EAAAoI,OAAA,CACA,CACA,IAAAk7F,EAAA,CAAsBl7F,QAAAA,EAAA6hC,WAAAA,CAAA,EAGtB,GAAA1hC,QADA,GAAArL,EAAAg6G,OAAA,EAAAl3G,EAAA,2BACA,CACA,IAAA23G,EAAApuG,EAAAP,KAAA,QACA4uG,EAAA,GAAA16G,EAAAg6G,OAAA,EAAAl3G,EAAA,qCACA63G,EAAA,GAAA36G,EAAAg6G,OAAA,EAAAl3G,EAAA,kCACA83G,EAAA,IAAA1pD,EAAAJ,GAAA,CAAA2pD,EAAAE,EACAvU,CAAAA,EAAAmS,QAAA,EACA5pD,KAAA,GAAA3uD,EAAAg6G,OAAA,EAAAl3G,EAAA,yBAAAwgF,EACAm1B,OAAA,GAAAz4G,EAAAg6G,OAAA,EAAAl3G,EAAA,gCACA41G,QAAA,GAAAp0B,EAAAttB,OAAA,KAAAstB,EAAAvtB,QAAA,EAAA6jD,EAAArqD,OAAA,CAAAmqD,IACA,CACA,CACA,OAAAtU,CACA,CACA,SAAAyU,EAAA/3G,CAAA,EACA,IAAAg4G,EAAA,GAAA96G,EAAAg6G,OAAA,EAAAl3G,EAAA,qBACA,GAAAg4G,GAAA,iBAAAA,EAAA,CACA,GAAAA,WAAAA,EAAAntG,WAAA,IACA,IAAAusC,EAAA,GAAAl6C,EAAAg6G,OAAA,EAAAl3G,EAAA,+BACA48C,EAAA,GAAA1/C,EAAAg6G,OAAA,EAAAl3G,EAAA,2BACA2hC,EAAA,GAAAzkC,EAAAg6G,OAAA,EAAAl3G,EAAA,2BACAuK,EAAA,GAAArN,EAAAg6G,OAAA,EAAAl3G,EAAA,2BAEA,GAAAwhF,EAAA9uB,cAAA,EAAA9V,EAAA,IAAAA,EAAAA,EAAA,8BAAAA,GACA,GAAA4kC,EAAA9uB,cAAA,EAAA/wB,EAAA,GAAAp3B,EAAA,sBAAAytG,GACA,IAAA12G,EAAA,GAAApE,EAAAg6G,OAAA,EAAAl3G,EAAA,+BAEA,MADA,GAAAwhF,EAAA9uB,cAAA,EAAApxD,KAAAA,EAAA,gCAAAA,GACA,CAAqBxJ,KAAA,SAAAs/C,KAAAA,EAAAwF,EAAAA,EAAAjb,EAAAA,EAAAp3B,EAAAA,EAAAjJ,MAAA,GACrB,CACA,GAAA02G,WAAAA,EAAAntG,WAAA,IACA,IAAAusC,EAAA,GAAAl6C,EAAAg6G,OAAA,EAAAl3G,EAAA,+BACAi4G,EAAA,GAAA/6G,EAAAg6G,OAAA,EAAAl3G,EAAA,gCACAm3E,EAAA8gC,EAAAz9G,KAAA,MAAAqhB,GAAA,GACA,GAAA2lE,EAAA9uB,cAAA,EAAAykB,WAAAA,GAAAA,WAAAA,EAAA,4BAAA8gC,GACA,IAAAp/F,EAAA,GAAA3b,EAAAg6G,OAAA,EAAAl3G,EAAA,2BACAsB,EAAA,GAAApE,EAAAg6G,OAAA,EAAAl3G,EAAA,+BAEA,MADA,GAAAwhF,EAAA9uB,cAAA,EAAApxD,KAAAA,EAAA,gCAAAA,GACA,CAAqBxJ,KAAA,SAAAs/C,KAAAA,EAAAv+B,MAAAA,EAAAvX,MAAAA,EAAA61E,UAAAA,CAAA,CACrB,CACA,CACA,GAAAqK,EAAA9uB,cAAA,iDAAAslD,EACA,CA4BA,SAAAhK,EAAA5O,CAAA,EACA,WAAAx8C,QAAA,IAAsCilC,WAAA,KAAmBhlC,GAAA,EAAYu8C,EAAA,EACrE,CAYA,eAAAnf,EAAA82B,CAAA,CAAAhgE,CAAA,CAAAmiC,CAAA,EACA,IAAAl5E,EAAAoJ,KAAAF,KAAA,CAAA6tG,GACA5/D,EAAA,GAAAj6C,EAAA+5G,WAAA,EAAAlgE,GACAiQ,EAAA+wD,EAAA/3G,GACA,GAAAgnD,WAAAA,EAAAlvD,IAAA,EACAohF,IACAA,EAAA,GACA,MAAA80B,EAAA,IAEA,IAAgB52D,KAAAA,CAAA,CAAAv+B,MAAAA,CAAA,CAAAvX,MAAAA,CAAA,CAAA61E,UAAAA,CAAA,EAAgCnwB,EAChDz9C,EAAA,GAAA8nD,EAAAza,MAAA,EAAAO,EAAAC,EAAAv+B,EAAAvX,EAAA61E,GAKA,OAJA+B,IACAA,EAAA,GACA,MAAA80B,EAAA,IAEAuJ,EAAAv3G,EAAAuJ,EACA,CACA,GAAAi4E,EAAArrB,MAAA,EAAAnP,WAAAA,EAAAlvD,IAAA,sCAA6FkvD,OAAAA,CAAA,GAC7F,IAAY5P,KAAAA,CAAA,CAAAwF,EAAAA,CAAA,CAAAjb,EAAAA,CAAA,CAAAp3B,EAAAA,CAAA,CAAAjJ,MAAAA,CAAA,EAAuB0lD,EAEnC,OAAAuwD,EAAAv3G,EADA,SAAAqxD,EAAAjX,MAAA,EAAAjD,EAAAC,EAAAwF,EAAAjb,EAAAp3B,EAAAjJ,EAAA43E,GAEA,CAEA,SAAAg/B,EAAAj6E,CAAA,EAEA,IAAAmZ,EAAA,MAAAnZ,EAAAmZ,IAAA,IAAAoqC,EAAAvtB,QAAA,EAAAh2B,EAAAmZ,IAAA,oBAAAia,EAAA9vD,WAAA,MAEAq7C,EAAA,OAAAjb,EAAA,EAAAp3B,EAAA,EAeA,OAdA0zB,EAAAmc,MAAA,GACAnc,EAAAmc,MAAA,CAAAwC,CAAA,EACAA,CAAAA,EAAA3e,EAAAmc,MAAA,CAAAwC,CAAA,EAEA3e,EAAAmc,MAAA,CAAAzY,CAAA,EACAA,CAAAA,EAAA1D,EAAAmc,MAAA,CAAAzY,CAAA,EAEA1D,EAAAmc,MAAA,CAAA7vC,CAAA,EACAA,CAAAA,EAAA0zB,EAAAmc,MAAA,CAAA7vC,CAAA,GAGA,GAAAi3E,EAAA9uB,cAAA,mBAAA9V,GAAAA,EAAA,GAAAtlD,OAAAC,aAAA,CAAAqlD,IAAA,CAAAjiD,OAAAiiD,GAAAjiD,OAAAiiD,EAAA,MAAAjiD,OAAA,4CAAAiiD,GACA,GAAA4kC,EAAA9uB,cAAA,mBAAA/wB,GAAAA,EAAA,GAAArqC,OAAAC,aAAA,CAAAoqC,GAAA,yCAAAA,GACA,GAAA6/C,EAAA9uB,cAAA,mBAAAnoD,GAAAA,EAAA,GAAAjT,OAAAC,aAAA,CAAAgT,GAAA,yCAAAA,GACA,CAAazS,KAAA,SAAAwJ,MAAA,GAAA81C,KAAAA,EAAAwF,EAAAA,EAAAjb,EAAAA,EAAAp3B,EAAAA,CAAA,CACb,CACA,SAAA4tG,EAAA5uG,CAAA,CAAAyuG,CAAA,CAAA1U,CAAA,CAAArlE,CAAA,EACA,IAAAgM,EAAA,GAAAu3C,EAAAvtB,QAAA,EAAAqvC,EAAAr5D,UAAA,eAEA6kB,EAAA,MAAA7wB,EAAA6wB,EAAA,IAAA0yB,EAAAvtB,QAAA,EAAAh2B,EAAA6wB,EAAA,kBAAAuC,EAAA9vD,WAAA,MACA,GAAAigF,EAAA9uB,cAAA,EAAA5D,KAAAA,EAAA72D,MAAA,0CAAAgmC,EAAA6wB,EAAA,EAEA,IAAAspD,EAAA,MAAAn6E,EAAAo6E,IAAA,IAAA72B,EAAAvtB,QAAA,EAAAh2B,EAAAo6E,IAAA,oBAAAhnD,EAAA9vD,WAAA,MACA,GAAAigF,EAAA9uB,cAAA,EAAA0lD,KAAAA,EAAAngH,MAAA,8CAAAgmC,EAAA6wB,EAAA,EAIA,IAAAwpD,EAAA/uG,EAAAP,KAAA,OACAuvG,EAAAhvG,EAAAP,KAAA,QAEA0uG,EAAA,IAAAtpD,EAAAJ,GAAA,CAAAsqD,EAAAxpD,GACApB,EAAA,GAAA8zB,EAAAvtB,QAAA,EAAAyjD,EAAAnqD,OAAA,CAAAtjB,IAEAuuE,EAAA,GAAAnnD,EAAAyT,SAAA,KAAA0c,EAAAt9B,MAAA,GAAAq0D,EAAA7qD,EAAA,GAEA1tD,EAAA,CACAoI,QAAAk7F,EAAAl7F,OAAA,CAAAuxD,SAAA,IAAA9uD,WAAA,GACAtD,GAAA,GAAAi6E,EAAAV,MAAA,EAAAs3B,GACA7vG,QAAA,EACAkwG,OAAA,CACAhB,OAAA,cACAiB,aAAA,CACA5pD,GAAA,GAAA0yB,EAAAttB,OAAA,EAAApF,GAAA6K,SAAA,GACA,EACAjM,WAAA,GAAA8zB,EAAAttB,OAAA,EAAAxG,GAAAiM,SAAA,IACAq+C,IAAA,SACAW,UAAA,CACAvhE,KAAA,GAAAoqC,EAAAttB,OAAA,EAAA8jD,EAAA5gE,IAAA,EAAAuiB,SAAA,IACAtiE,EAAA2gH,EAAAp7D,CAAA,CACAg8D,MAAA,GACAruG,EAAAytG,EAAAztG,CAAA,CACAo3B,EAAAq2E,EAAAr2E,CAAA,EAEA62E,IAAAA,EAAA7+C,SAAA,GACA,CACA,EAEA,GAAA2pC,EAAAmS,QAAA,EACA,IAAAoD,EAAA,MAAA56E,EAAA46E,MAAA,CAAA56E,EAAA46E,MAAA,WAA6Et3B,EAAAh5E,OAAA,CAAsB,EACnGsjD,EAAAy3C,EAAAmS,QAAA,CAAA5pD,IAAA,EAAA20B,EACAm1B,EAAArS,EAAAmS,QAAA,CAAAE,MAAA,OACAgC,EAAApuG,EAAAP,KAAA,QACA4sG,EAAA,GAAAp0B,EAAAvtB,QAAA,EAAAqvC,EAAAmS,QAAA,CAAAG,OAAA,6BACAiC,EAAA,GAAAxmD,EAAA9vD,WAAA,MACAu2G,EAAA,IAAA1pD,EAAAJ,GAAA,CAAA2pD,EAAAE,GACAD,EAAA,GAAAp2B,EAAAvtB,QAAA,EAAA6jD,EAAAvqD,OAAA,CAAAqoD,IACAjxG,EAAA,IAAAD,KAOAo0G,EAAA,QANAn0G,CAAAA,EAAAo0G,cAAA,OACA,GAAA77G,EAAA23G,IAAA,EAAAlwG,EAAAq0G,WAAA,YACA,GAAA97G,EAAA23G,IAAA,EAAAlwG,EAAAs0G,UAAA,UACA,GAAA/7G,EAAA23G,IAAA,EAAAlwG,EAAAu0G,WAAA,UACA,GAAAh8G,EAAA23G,IAAA,EAAAlwG,EAAAw0G,aAAA,WACA,GAAAj8G,EAAA23G,IAAA,EAAAlwG,EAAAy0G,aAAA,MACA,QAAAp5G,EAAAoI,OAAA,CACApI,CAAA,cACA64G,OAAAA,EAAAC,aAAAA,EAAAjtD,KAAAA,EAAA8pD,OAAAA,EACA0D,gBAAA,GAAA73B,EAAAttB,OAAA,EAAA2jD,GAAAl+C,SAAA,IACAi+C,mBAAA,GAAAp2B,EAAAttB,OAAA,EAAA0jD,GAAAj+C,SAAA,IACApxD,QAAA,KACA,CACA,CACA,OAAAa,KAAAC,SAAA,CAAArJ,EACA,CA4BA,eAAAggF,EAAAsjB,CAAA,CAAAnsD,CAAA,CAAAlZ,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,IAEA,IAAAq7E,EAAA,GAAAp8G,EAAA+5G,WAAA,EAAA9/D,GACA6gE,EAAAE,EAAAj6E,GACA10B,EAAA,SAAA8nD,EAAAjX,MAAA,EAAAk/D,EAAAtB,EAAA5gE,IAAA,CAAA4gE,EAAAp7D,CAAA,CAAAo7D,EAAAr2E,CAAA,CAAAq2E,EAAAztG,CAAA,IAAA0zB,EAAA43E,gBAAA,EACA,OAAAsC,EAAA,GAAA32B,EAAAvtB,QAAA,EAAA1qD,GAAAyuG,EAAA1U,EAAArlE,EACA,CAjQA/kC,EAAAknF,cAAsB,CAXtB,SAAA22B,CAAA,EACA,IACA,IAAA/2G,EAAAoJ,KAAAF,KAAA,CAAA6tG,GACAxuG,EAAA,MAAAvI,EAAAuI,OAAA,CAAAwC,SAAA/K,EAAAuI,OAAA,IACA,GAAAA,IAAAA,EACA,QAEA,CACA,MAAAzB,EAAA,EACA,QACA,EAiGA5N,EAAAgnF,uBAA+B,CAd/B,SAAA62B,CAAA,CAAAhgE,CAAA,EACA,IAAA/2C,EAAAoJ,KAAAF,KAAA,CAAA6tG,GACA5/D,EAAA,GAAAj6C,EAAA+5G,WAAA,EAAAlgE,GACAiQ,EAAA+wD,EAAA/3G,GACA,GAAAgnD,WAAAA,EAAAlvD,IAAA,EACA,IAAgBs/C,KAAAA,CAAA,CAAAv+B,MAAAA,CAAA,CAAAvX,MAAAA,CAAA,CAAA61E,UAAAA,CAAA,EAAgCnwB,EAEhD,OAAAuwD,EAAAv3G,EADA,GAAAqxD,EAAAza,MAAA,EAAAO,EAAAC,EAAAv+B,EAAAvX,EAAA61E,GAEA,CACA,GAAAqK,EAAArrB,MAAA,EAAAnP,WAAAA,EAAAlvD,IAAA,sCAA6FkvD,OAAAA,CAAA,GAC7F,IAAY5P,KAAAA,CAAA,CAAAwF,EAAAA,CAAA,CAAAjb,EAAAA,CAAA,CAAAp3B,CAAA,CAAAjJ,MAAAA,CAAA,EAAuB0lD,EAEnC,OAAAuwD,EAAAv3G,EADA,GAAAqxD,EAAAmmB,UAAA,EAAArgC,EAAAC,EAAAwF,EAAAjb,EAAAp3B,EAAAjJ,GAEA,EAsCApI,EAAA+mF,mBAA2B,CAAAA,EA0G3B/mF,EAAA6mF,uBAA+B,CAT/B,SAAAujB,CAAA,CAAAnsD,CAAA,CAAAlZ,CAAA,EACA,MAAAA,GACAA,CAAAA,EAAA,IAEA,IAAAq7E,EAAA,GAAAp8G,EAAA+5G,WAAA,EAAA9/D,GACA6gE,EAAAE,EAAAj6E,GACA10B,EAAA,GAAA8nD,EAAAmmB,UAAA,EAAA8hC,EAAAtB,EAAA5gE,IAAA,CAAA4gE,EAAAp7D,CAAA,CAAAo7D,EAAAr2E,CAAA,CAAAq2E,EAAAztG,CAAA,KACA,OAAA4tG,EAAA,GAAA32B,EAAAvtB,QAAA,EAAA1qD,GAAAyuG,EAAA1U,EAAArlE,EACA,EAoBA/kC,EAAA8mF,mBAA2B,CAAAA,sCCpS3BhnF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2nF,QAAgB,QAChB,IAAApwB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3Bw3G,EAAqBx3G,EAAQ,OAE7B,SAAAu8G,EAAAv/E,CAAA,EACA,UAAAA,CAAA,OAAAA,EAAA,GACA,CAKA,SAAAw/E,EAAA/D,CAAA,CAAAC,CAAA,EACA,GAAArkD,EAAA8sB,eAAA,UACA,MAAAu3B,GACAA,CAAAA,EAAAlB,EAAA30B,MAAA,CAAA61B,QAAA,IAEA,IAAA+D,EAAA/D,EAAAl7G,KAAA,CAAAi7G,GACA,GAAApkD,EAAAqB,cAAA,IAAAz6D,MAAA,OAAAwhH,EAAAxhH,MAAA,MAAAwhH,EAAAxhH,MAAA,0DACA,IAAA29G,EAAA,IAAAh+G,WAAAwI,KAAA4oB,IAAA,IAAAywF,EAAAxhH,MAAA,KACAq8B,EAAA,EACA,QAAAn5B,EAAA,EAAoBA,EAAAs+G,EAAAxhH,MAAA,CAAkBkD,IAAA,CACtC,IAAAqY,EAAAkiG,EAAAgE,YAAA,CAAAD,CAAA,CAAAt+G,EAAA,CAAA4wG,SAAA,UACA,GAAA16C,EAAAqB,cAAA,EAAAl/C,GAAA,oCAAqFrY,EAAE,6BACvF,QAAAw+G,EAAA,EAA0BA,EAAA,GAAUA,IACpCnmG,EAAA,MAAAmmG,GACA/D,CAAAA,CAAA,CAAAthF,GAAA,SAAAA,EAAA,GAEAA,GAEA,CACA,IAAAslF,EAAA,GAAAH,EAAAxhH,MAAA,GAEA4hH,EAAAN,EADAE,EAAAxhH,MAAA,IAEA80E,EAAA,GAAA1b,EAAA4C,QAAA,KAAAxD,EAAA3c,MAAA,EAAA8hE,EAAA5sG,KAAA,GAAA4wG,EAAA,QAAAC,EAEA,MADA,GAAAxoD,EAAAqB,cAAA,EAAAqa,IAAA6oC,CAAAA,CAAA,CAAAA,EAAA39G,MAAA,IAAA4hH,CAAA,yDACA,GAAAxoD,EAAA6C,OAAA,EAAA0hD,EAAA5sG,KAAA,GAAA4wG,EAAA,GACA,CACA,SAAAE,EAAAlE,CAAA,CAAAF,CAAA,EACA,GAAArkD,EAAAqB,cAAA,IAAAz6D,MAAA,OAAA29G,EAAA39G,MAAA,MAAA29G,EAAA39G,MAAA,sDACA,MAAAy9G,GACAA,CAAAA,EAAAlB,EAAA30B,MAAA,CAAA61B,QAAA,IAEA,IAAAqE,EAAA,IACAC,EAAA,GACA,QAAA7+G,EAAA,EAAoBA,EAAAy6G,EAAA39G,MAAA,CAAoBkD,IAExC6+G,EAAA,GACAD,CAAA,CAAAA,EAAA9hH,MAAA,QACA8hH,CAAA,CAAAA,EAAA9hH,MAAA,KAAA29G,CAAA,CAAAz6G,EAAA,CACA6+G,GAAA,IAIAD,CAAA,CAAAA,EAAA9hH,MAAA,MAAA+hH,EACAD,CAAA,CAAAA,EAAA9hH,MAAA,KAAA29G,CAAA,CAAAz6G,EAAA,IAAA6+G,EAEAD,EAAA/7G,IAAA,CAAA43G,CAAA,CAAAz6G,EAAA,CA/CA,KA+CA,EAAA6+G,CA/CA,UAgDAA,GAAA,GAIA,IAAAC,EAAArE,EAAA39G,MAAA,GACA80E,EAAAhiE,SAAA,GAAA0lD,EAAA3c,MAAA,EAAA8hE,GAAAj8C,SAAA,UAAA4/C,EAAAU,GAIA,OAFAF,CAAA,CAAAA,EAAA9hH,MAAA,MAAAgiH,EACAF,CAAA,CAAAA,EAAA9hH,MAAA,KAAA80E,GAAA,EAAAktC,EACAvE,EAAApvD,IAAA,CAAAyzD,EAAAxmG,GAAA,IAAAmiG,EAAAwE,OAAA,CAAA1mG,IACA,CACA,IAAA0hD,EAAA,EAKA,OAAA2rB,EAMAjrD,MAAA,CAKAuhB,QAAA,CAIAu+D,QAAA,CAIAE,OAAA,aAIArgD,CAAA,CAAAqgD,CAAA,CAAAhgF,CAAA,CAAAuhB,CAAA,CAAAu+D,CAAA,EACA,MAAAv+D,GACAA,CAAAA,EAAA,IAEA,MAAAu+D,GACAA,CAAAA,EAAAlB,EAAA30B,MAAA,CAAA61B,QAAA,IAEA,GAAArkD,EAAAwN,aAAA,EAAAtJ,EAAAL,EAAA,YACA,GAAA7D,EAAA9B,gBAAA,QAAiD35B,OAAAA,EAAAuhB,SAAAA,EAAAu+D,SAAAA,EAAAE,QAAAA,CAAA,EACjD,CAIAY,aAAA,CACA,IAAAp/D,EAAA,GAAAia,EAAAmD,WAAA,kBAAArd,QAAA,SACA,SAAAsZ,EAAA7Z,MAAA,KAAAya,EAAAmD,WAAA,OAAA5+B,MAAA,SAAAwhB,EAAA,iBACA,CAOA,OAAAs/D,WAAA9gF,CAAA,CAAAuhB,CAAA,CAAAu+D,CAAA,EAEA,IAAAE,EAAA4D,EAAA5jF,EAAA8/E,GAEA,OADA9/E,EAAAkkF,EAAA,GAAAzoD,EAAA4C,QAAA,EAAA2hD,GAAAF,GACA,IAAA70B,EAAA3rB,EAAA0gD,EAAAhgF,EAAAuhB,EAAAu+D,EACA,CAOA,OAAAa,YAAA4D,CAAA,CAAAhjE,CAAA,CAAAu+D,CAAA,EACA,IAAAE,EAAA,GAAAvkD,EAAA4C,QAAA,EAAAkmD,EAAA,WACAvkF,EAAAkkF,EAAAlE,EAAAF,GACA,WAAA70B,EAAA3rB,EAAA,GAAA7D,EAAA6C,OAAA,EAAA0hD,GAAAhgF,EAAAuhB,EAAAu+D,EACA,CAIA,OAAA0E,gBAAAD,CAAA,CAAAzE,CAAA,EAEA,OAAAoE,EADA,GAAAzoD,EAAA4C,QAAA,EAAAkmD,EAAA,WACAzE,EACA,CAIA,OAAA2E,gBAAAzkF,CAAA,CAAA8/E,CAAA,EACA,OAAA8D,EAAA5jF,EAAA8/E,EACA,CAOA,OAAA4E,gBAAA1kF,CAAA,CAAA8/E,CAAA,EACA,IAEA,OADA8D,EAAA5jF,EAAA8/E,GACA,EACA,CACA,MAAA5uG,EAAA,EACA,QACA,CACA,CACA5N,EAAA2nF,QAAgB,CAAAA,sCCnKhB7nF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAg+G,OAAe,CAAGh+G,EAAA+9G,WAAmB,CAAG/9G,EAAA27G,IAAY,CAAG37G,EAAAi+G,aAAqB,QAC5E,IAAA1mD,EAAmBzzD,EAAQ,OAC3B,SAAAm6G,EAAAoD,CAAA,EAIA,MAHA,iBAAAA,GAAAA,EAAA96C,UAAA,QACA86C,CAAAA,EAAA,KAAAA,CAAA,EAEA,GAAA9pD,EAAA+F,YAAA,EAAA+jD,EACA,CACArhH,EAAAi+G,aAAqB,CAAAA,EAQrBj+G,EAAA27G,IAAY,CAPZ,SAAA17G,CAAA,CAAAlB,CAAA,EAEA,IADAkB,EAAA4T,OAAA5T,GACAA,EAAAlB,MAAA,CAAAA,GACAkB,EAAA,IAAAA,EAEA,OAAAA,CACA,EAQAD,EAAA+9G,WAAmB,CANnB,SAAA9/D,CAAA,QACA,iBAAAA,EACA,GAAAsZ,EAAA+D,WAAA,EAAArd,EAAA,QAEA,GAAAsZ,EAAA+F,YAAA,EAAArf,EACA,EAgEAj+C,EAAAg+G,OAAe,CA9Df,SAAA1wE,CAAA,CAAAg0E,CAAA,EACA,IAAArpF,EAAAqpF,EAAArpF,KAAA,uCACA,GAAAs/B,EAAAiC,cAAA,EAAAvhC,MAAAA,EAAA,sBAAAqpF,GACA,IAAA3uD,EAAA16B,CAAA,IACAtd,EAAAsd,CAAA,IACAspF,EAAAtpF,MAAAA,CAAA,IACAisC,EAAA52B,EACA,QAAAxK,KAAA6vB,EAAAhhD,WAAA,GAAArQ,KAAA,OAEA,GAAAuI,MAAA8J,OAAA,CAAAuwD,GAAA,CACA,IAAAphC,EAAA7K,KAAA,aACA,MAEAisC,EAAAA,CAAA,CAAAryD,SAAAixB,GAAA,MAEA,oBAAAohC,EAAA,CACA,IAAAqnB,EAAA,KACA,QAAAl7E,KAAA6zD,EACA,GAAA7zD,EAAAsB,WAAA,KAAAmxB,EAAA,CACAyoD,EAAArnB,CAAA,CAAA7zD,EAAA,CACA,KACA,CAEA6zD,EAAAqnB,CACA,MAEArnB,EAAA,KAEA,GAAAA,MAAAA,EACA,KAEA,CAEA,GADA,GAAA3M,EAAAiC,cAAA,GAAA+nD,GAAAr9C,MAAAA,EAAA,gCAAAvR,GACAh4C,GAAAupD,MAAAA,EAAA,CACA,GAAAvpD,QAAAA,EAAA,CACA,oBAAAupD,GAAAA,EAAAjsC,KAAA,eACA,OAAApmB,SAAAqyD,GAEA,GAAA9lE,OAAAC,aAAA,CAAA6lE,GACA,OAAAA,CAEA,CACA,GAAAvpD,WAAAA,GACA,iBAAAupD,GAAAA,EAAAjsC,KAAA,gBACA,OAAAirE,WAAAh/B,GAGA,GAAAvpD,SAAAA,GACA,iBAAAupD,EACA,OAAA+5C,EAAA/5C,GAGA,aAAAvpD,GAAA9Q,MAAA8J,OAAA,CAAAuwD,IAGAvpD,IAAA,OAAAupD,EAFA,OAAAA,EAKA,GAAA3M,EAAAiC,cAAA,6BAAsE7+C,EAAA,CAAM,SAAAg4C,EAC5E,CACA,OAAAuR,CACA,sCCzFApkE,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAunF,MAAc,QACd,IAAAhwB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3By3G,EAAyBz3G,EAAQ,OACjC45G,EAAsB55G,EAAQ,MAC9B65G,EAA4B75G,EAAQ,OACpC23G,EAA2B33G,EAAQ,OACnC03G,EAAsB13G,EAAQ,OAC9B,SAAAgxG,EAAA5O,CAAA,EACA,WAAAx8C,QAAA,IAAsCilC,WAAA,KAAmBhlC,GAAA,EAAYu8C,EAAA,EACrE,CAWA,MAAA3e,UAAAg0B,EAAA7zB,UAAA,CAKA/oF,YAAA0R,CAAA,CAAAq9C,CAAA,EACA,iBAAAr9C,GAAAA,EAAAk2D,UAAA,QACAl2D,CAAAA,EAAA,KAAAA,CAAA,EAGA,MADA,iBAAAA,EAAA,IAAAknD,EAAA8mB,UAAA,CAAAhuE,GAAAA,EACAq9C,EACA,CACAosB,QAAApsB,CAAA,EACA,WAAA65B,EAAA,KAAA4zB,UAAA,CAAAztD,EACA,CAQA,MAAA2G,QAAApW,CAAA,CAAA0+D,CAAA,EACA,IAAAvS,EAAA,CAA0Bl7F,QAAA,KAAAA,OAAA,CAAA6hC,WAAA,KAAAA,UAAA,EAC1B,gBAAA0qE,EAAA30B,mBAAA,EAAAsjB,EAAAnsD,EAAA,CAAsF0+D,iBAAAA,CAAA,EACtF,CAWAC,YAAA3+D,CAAA,EACA,IAAAmsD,EAAA,CAA0Bl7F,QAAA,KAAAA,OAAA,CAAA6hC,WAAA,KAAAA,UAAA,EAC1B,SAAA0qE,EAAA50B,uBAAA,EAAAujB,EAAAnsD,EACA,CACA,QAAAujE,EAAA,CAAApX,CAAA,EAEA,GADA,GAAAjyC,EAAAqB,cAAA,EAAA4wC,EAAA,6CACA,aAAAA,GAAAA,EAAAmS,QAAA,EAAAnS,OAAAA,EAAAmS,QAAA,CAAAE,MAAA,EACA,IAAAF,EAAAf,EAAA7zB,QAAA,CAAA01B,WAAA,CAAAjT,EAAAmS,QAAA,CAAAG,OAAA,EACA+E,EAAA/D,EAAAj2B,YAAA,CAAA81B,YAAA,CAAAhB,EAAAnS,EAAAmS,QAAA,CAAA5pD,IAAA,EACA,GAAA8uD,EAAAvyG,OAAA,GAAAk7F,EAAAl7F,OAAA,EAAAuyG,EAAA1wE,UAAA,GAAAq5D,EAAAr5D,UAAA,CACA,OAAA0wE,EAEA9zG,QAAAI,GAAA,oFACA,CACA,IAAA0zG,EAAA,IAAAl6B,EAAA6iB,EAAAr5D,UAAA,EAEA,MADA,GAAAonB,EAAAqB,cAAA,EAAAioD,EAAAvyG,OAAA,GAAAk7F,EAAAl7F,OAAA,sDACAuyG,CACA,CAQA,aAAAC,kBAAA7D,CAAA,CAAA5/D,CAAA,CAAA+hC,CAAA,EACA,IAAAoqB,EAAA,KAeA,MAdA,GAAAqR,EAAAv0B,cAAA,EAAA22B,GACAzT,EAAA,SAAAqR,EAAA10B,mBAAA,EAAA82B,EAAA5/D,EAAA+hC,GAEA,GAAA29B,EAAAx2B,eAAA,EAAA02B,KACA79B,IACAA,EAAA,GACA,MAAA80B,EAAA,IAEA1K,EAAA,GAAAuT,EAAA12B,oBAAA,EAAA42B,EAAA5/D,GACA+hC,IACAA,EAAA,GACA,MAAA80B,EAAA,KAGAvtB,EAAA,CAAAi6B,EAAA,CAAApX,EACA,CAQA,OAAAuX,sBAAA9D,CAAA,CAAA5/D,CAAA,EACA,IAAAmsD,EAAA,KAUA,MATA,GAAAqR,EAAAv0B,cAAA,EAAA22B,GACAzT,EAAA,GAAAqR,EAAAz0B,uBAAA,EAAA62B,EAAA5/D,GAEA,GAAA0/D,EAAAx2B,eAAA,EAAA02B,GACAzT,EAAA,GAAAuT,EAAA12B,oBAAA,EAAA42B,EAAA5/D,GAGA,GAAAka,EAAAqB,cAAA,kDAEA+tB,EAAA,CAAAi6B,EAAA,CAAApX,EACA,CAOA,OAAAgT,aAAA1vD,CAAA,EACA,IAAA+zD,EAAA/D,EAAAj2B,YAAA,CAAA21B,YAAA,UACA,EACAqE,EAAA3nC,OAAA,CAAApsB,GAEA+zD,CACA,CAIA,OAAAjE,WAAA9gF,CAAA,CAAAgxB,CAAA,EACA,IAAA+zD,EAAA/D,EAAAj2B,YAAA,CAAA+1B,UAAA,CAAA9gF,UACA,EACA+kF,EAAA3nC,OAAA,CAAApsB,GAEA+zD,CACA,CACA,CACAzhH,EAAAunF,MAAc,CAAAA,mCCjJdznF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4hH,UAAkB,QAgClB5hH,EAAA4hH,UAAkB,CA3BlB,SAAAh1C,CAAA,CAAA9lE,CAAA,EACA,IAAAkmE,EAAA,IAAAJ,CAAA,IACA78D,EAAA,GACAysD,EAAA,EAAA17B,EAAA,EAAA+gF,EAAA,EACA,QAAA5/G,EAAA,EAAoBA,EAAA6E,EAAA/H,MAAA,CAAiBkD,IAKrC,IAHAu6D,EAAA,KAAAslD,mEAAA5zF,OAAA,CAAApnB,CAAA,CAAA7E,EAAA,EACA6+B,GAAA,EAEAA,GAAA8rC,GAAA,CAEA,IAAA3sE,EAAAu8D,GAAA17B,EAAA8rC,EACApQ,GAAA,IAAA17B,EAAA8rC,CAAA,IACA9rC,GAAA8rC,EAGA3sE,IAAAA,EACA4hH,GAAA70C,GAGAj9D,EAAAjL,IAAA,CAAA7E,EAAA4hH,GACAA,EAAA,EAEA,CAEA,OAAA9xG,CACA,sCChCAjQ,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA+hH,SAAiB,CAAG/hH,EAAAsV,MAAc,QAClC,IAAAiiD,EAAmBzzD,EAAQ,OAC3Bk+G,EAAA,gCACAC,EAAA,YACA,SAAAC,EAAA3B,CAAA,CAAA4B,CAAA,EACA,IAAAC,EAAA,GACA,OAAA7B,EAAAt6E,MAAA,EAAAu2B,EAAA7yD,KACAA,IAAAw4G,EACAC,IAEAz4G,EAAAsuB,KAAA,CAAAgqF,GACAzlD,EAAA13D,IAAA,CAAA+O,OAAAC,YAAA,CAAAsuG,GAAAz4G,IAGAy4G,EAAA,GACA5lD,EAAA13D,IAAA,CAAA6E,IAEA6yD,GACK,GACL,CAIA,SAAAlnD,EAAAxO,CAAA,CAAA8wE,CAAA,EAEA,QAAA31E,EAAA+/G,EAAAjjH,MAAA,GAAsCkD,GAAA,EAAQA,IAC9C6E,EAAAA,EAAAxF,KAAA,CAAA0gH,CAAA,CAAA//G,EAAA,EAAAmrD,IAAA,CAAAwqB,EAAAnX,SAAA,GAAAx+D,EAAA,EAAAA,EAAA,IAGA,IAAAogH,EAAA,GACAC,EAAAx7G,EAAA8K,OAAA,+BAAA29C,EAAAp/B,EAAAoyF,EAAA54G,KACA,GAAA44G,EACA,QAAAtgH,EAAA4P,SAAA0wG,GAAyCtgH,GAAA,EAAQA,IACjDogH,EAAAv9G,IAAA,WAIAu9G,EAAAv9G,IAAA,CAAAqrB,EAAAxe,WAAA,IAEA,QACA,GAEA,GAAA2wG,EACA,0BAAsCpyG,KAAAC,SAAA,CAAAmyG,GAAyB,GAG/D,OAAAJ,EAAAA,EAAAG,EAAA,KAAmC,IACnC,CACAriH,EAAAsV,MAAc,CAAAA,EAQdtV,EAAA+hH,SAAiB,CAJjB,SAAAj7G,CAAA,EAEA,MADA,GAAAywD,EAAAiC,cAAA,EAAA1yD,MAAAA,CAAA,mCAAAA,GACAwO,EAAAxO,EAAA25D,SAAA,KAAAuhD,EAAAjjH,MAAA,EAAA+H,EAAA25D,SAAA,OAAAuhD,EAAAjjH,MAAA,EACA,sCCxDAe,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwiH,UAAkB,QAClB,IAAAjrD,EAAmBzzD,EAAQ,OAC3B2+G,EAAwB3+G,EAAQ,MAChC4+G,EAAwB5+G,EAAQ,MAyBhC9D,CAAAA,EAAAwiH,UAAkB,CArBlB,SAAA17G,CAAA,CAAA67G,CAAA,EACA,IAAApC,EAAA,GAAAmC,EAAAX,SAAA,EAAAj7G,GAAAsmD,IAAA,MAkBA,OAhBAu1D,EAAArhH,KAAA,OAAA4S,OAAA,KACA,IAAA+jB,EAAA2qF,EAAA3qF,KAAA,kCACA,GAAAs/B,EAAAiC,cAAA,EAAAvhC,OAAAA,EAAA,2CAAA0qF,GACA,IAAAE,EAAA,EACAC,EAAA,GAAAL,EAAAb,UAAA,EAAA/vG,SAAAomB,CAAA,KAAAA,CAAA,KACA8qF,EAAAlxG,SAAAomB,CAAA,KACA+qF,EAAA,YAAsC/qF,CAAA,IAAS,SAC/CsoF,EAAAA,EAAA3uG,OAAA,CAAAoxG,EAAA,CAAAzzD,EAAA2iD,KAEA,GADA,EAAA4Q,CAAA,CAAAD,EAAA,GAEA3Q,EAAAr+F,OAAAC,YAAA,CAAAo+F,EAAAhnG,UAAA,IAAA63G,GACAF,KAEA3Q,GAEA,GACAqO,EAAAj/G,KAAA,KACA,sCC5BAxB,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwmF,SAAiB,CAAGxmF,EAAAymF,YAAoB,CAAGzmF,EAAA0mF,WAAmB,CAAG1mF,EAAA2mF,MAAc,CAAG3mF,EAAA4mF,QAAgB,QAoBlG,IAAAq8B,EAAoBn/G,EAAQ,OAC5BhE,OAAAC,cAAA,CAAAC,EAAA,WAA2C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA8xG,EAAAr8B,QAAA,IAClF,IAAA00B,EAAmBx3G,EAAQ,OAC3BhE,OAAAC,cAAA,CAAAC,EAAA,SAAyC,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAmqG,EAAA30B,MAAA,IAChF,IAAAu8B,EAAwBp/G,EAAQ,MAChChE,OAAAC,cAAA,CAAAC,EAAA,cAA8C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAA+xG,EAAAx8B,WAAA,IACrF,IAAAy8B,EAAyBr/G,EAAQ,MACjChE,OAAAC,cAAA,CAAAC,EAAA,eAA+C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAgyG,EAAA18B,YAAA,IACtF,IAAA28B,EAAqBt/G,EAAQ,OAC7BhE,OAAAC,cAAA,CAAAC,EAAA,YAA4C,CAAEkR,WAAA,GAAAC,IAAA,WAAqC,OAAAiyG,EAAA58B,SAAA,wCC9BnF1mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA2mF,MAAc,QACd,IAAAu8B,EAA0Bp/G,EAAQ,MAGlC04G,EAAA,IAMA,OAAA71B,UAAAu8B,EAAAx8B,WAAA,CASA/nF,aAAA,CAAoB,WAjBpB,w3LACA,qEAgBoB,CAKpB,OAAA69G,UAAA,CAIA,OAHA,MAAAA,GACAA,CAAAA,EAAA,IAAA71B,CAAA,EAEA61B,CACA,CACA,CACAx8G,EAAA2mF,MAAc,CAAAA,qCC9Bd7mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA0mF,WAAmB,QACnB,IAAAnvB,EAAmBzzD,EAAQ,OAC3Bq0D,EAAmBr0D,EAAQ,OAC3B4+G,EAAwB5+G,EAAQ,OAChCm/G,EAAsBn/G,EAAQ,MAa9B,OAAA4iF,UAAAu8B,EAAAr8B,QAAA,CACA,CAAA9/E,CAAA,EACA+sE,EAAA,aAKA4oC,CAAA,CAAA31G,CAAA,CAAA+sE,CAAA,EACA,MAAA4oC,GACA,MAAA31G,CAAA,CAAAA,EACA,MAAA+sE,EAAA,CAAAA,EACA,MAAA0sC,EAAA,KACA,CAIA,IAAAn1C,OAAA,CAAkB,aAAAtkE,CAAA,CAIlBu8G,cAAA,CACA,SAAAX,EAAAX,SAAA,QAAAj7G,CAAA,CACA,CACA,CAAAy5G,EAAA,EACA+C,EAAA,GACA,eAAA/C,EAAA,EACA,IAAAA,EAAA,KAAA8C,YAAA,GAIA,GAAAxvC,CAFA,EAAAtc,EAAAlpD,EAAA,EAAAkyG,EAAAnzD,IAAA,eAEA,MAAAymB,EAAA,CACA,kCAAsD,KAAA4oC,MAAA,QAAa,EAGnE,OAAA8D,EAAA,CAAAA,CACA,CACA,aAAAA,EAAA,CAEAS,QAAA1mG,CAAA,EACA,IAAAimG,EAAA,MAAA+C,EAAA,GAEA,MADA,GAAAnrD,EAAAqB,cAAA,EAAAl/C,GAAA,GAAAA,EAAAimG,EAAAxhH,MAAA,wBAAkGub,EAAM,UAAAA,GACxGimG,CAAA,CAAAjmG,EAAA,CAEAkmG,aAAA72G,CAAA,EACA,aAAA25G,EAAA,GAAAp1F,OAAA,CAAAvkB,EACA,CACA,CACA3J,EAAA0mF,WAAmB,CAAAA,qCCnEnB5mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAymF,YAAoB,QACpB,IAAAy8B,EAA0Bp/G,EAAQ,MAClCy/G,EAAyBz/G,EAAQ,MAajC,OAAA2iF,UAAAy8B,EAAAx8B,WAAA,CACA,CAAAk8B,EAAA,aAKAnG,CAAA,CAAA31G,CAAA,CAAA87G,CAAA,CAAA/uC,CAAA,EACA,MAAA4oC,EAAA31G,EAAA+sE,GACA,MAAA+uC,EAAA,CAAAA,CACA,CAIA,IAAAY,SAAA,CAAoB,aAAAZ,EAAA,CAIpBS,cAAA,CACA,SAAAE,EAAAf,UAAA,OAAAp3C,KAAA,MAAAo4C,OAAA,CACA,CACA,CACAxjH,EAAAymF,YAAoB,CAAAA,sCCrCpB3mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAA4mF,QAAgB,QAChB,IAAArvB,EAAmBzzD,EAAQ,MAM3B,OAAA8iF,EACA61B,MAAA,aAWAA,CAAA,EACA,GAAAllD,EAAAlB,gBAAA,QAAiDomD,OAAAA,CAAA,EACjD,CAQAn7G,MAAAo7B,CAAA,EACA,OAAAA,EAAA/qB,WAAA,GAAArQ,KAAA,QACA,CAOA8rD,KAAAmzD,CAAA,EACA,OAAAA,EAAAnzD,IAAA,KACA,CACA,CACAptD,EAAA4mF,QAAgB,CAAAA,sCC3ChB9mF,OAAAC,cAAA,CAAAC,EAAA,aAA6C,CAAEC,MAAA,KAC/CD,EAAAwmF,SAAiB,QACjB,IAAA80B,EAAqBx3G,EAAQ,MAC7B9D,CAAAA,EAAAwmF,SAAiB,EACjBi9B,GAAAnI,EAAA30B,MAAA,CAAA61B,QAAA,EACA,wCCwTAkH,EAAAC,EAAAC,EAAAC,EA8KAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EApeA,IAAAC,EAAA,IAAAr0E,IAAA,oEA0FA,SAAAs0E,EAAAxiH,CAAA,MAJAomC,MACAliC,EAIA,OALAkiC,EAKAq8E,SAxFA/lH,CAAA,EACA,IAAAwH,EAAA,EACA,SAAAw+G,IAAkB,SAAAx+G,IAAA,IAAAxH,CAAA,CAAAwH,IAAA,CAGlB,IAAAy+G,EAAAD,IACA/sF,EAAA,EACAoO,EAAA,MACA,QAAAjkC,EAAA,EAAiBA,EAAA6iH,EAAkB7iH,IACnCikC,EAAAphC,IAAA,CAAAgzB,GAAA+sF,KAIA,IAAAE,EAAAF,IACAG,EAAA3+G,EACAA,GAAA0+G,EAEA,IAAAE,EAAA,EACAC,EAAA,EACA,SAAAC,IAOA,OANA,GAAAF,IAGAC,EAAA,KAAArmH,CAAA,CAAAwH,IAAA,CACA4+G,EAAA,GAEA,KAAAA,EAAA,CACA,CAIA,IAEA96E,EAAAi7E,WAAA,EAGAhnC,EAAA,EACA,QAAAn8E,EAAA,EAAiBA,EARjB,GAQwBA,IAAAm8E,EAAA,KAAA+mC,IAExB,IAAAE,EAAA,GACA7iH,EAAA,EACA8iH,EAXA,WAYA,QACA,IAAArlH,EAAAiH,KAAAuC,KAAA,GAAA20E,EAAA57E,EAAA,GAAAs1B,EAAA,GAAAwtF,GACAnyF,EAAA,EACAjgB,EAAA4xG,EACA,KAAA5xG,EAAAigB,EAAA,IACA,IAAA6xE,EAAA,EAAA9xF,IAAA,CACAjT,CAAAA,EAAAimC,CAAA,CAAA8+D,EAAA,CACA9xF,EAAA8xF,EAEA7xE,EAAA6xE,CAEA,CACA,GAAA7xE,GAAAA,EAAA,MACAkyF,EAAAvgH,IAAA,CAAAquB,GACA,IAAA10B,EAAA+D,EAAA0E,KAAAuC,KAAA,CAAA67G,EAAAp/E,CAAA,CAAA/S,EAAA,CAAA2E,GACAv5B,EAAAiE,EAAA0E,KAAAuC,KAAA,CAAA67G,EAAAp/E,CAAA,CAAA/S,EAAA,GAAA2E,GAAA,EACA,OAAAr5B,EAAAF,CAAAA,EA3BA6mH,UA2BA,MACAhnC,EAAA,KAAAj0C,EAAAg7E,IACA1mH,EAAA,KAAA0rC,EACA5rC,EAAA,KAAA4rC,EAAA,EAEA,KAAA1rC,EAAA,CAAAF,EA/BAgnH,WAgCAnnC,EAAA,WAAAA,EAAA,KAAAj0C,IAAA,EAAAg7E,IACA1mH,EAAA,KAlCA2mH,WAmCA7mH,EAAA,CAAAA,WAAAA,CAAA,gBAEAiE,EAAA/D,EACA6mH,EAAA,EAAA/mH,EAAAE,CACA,CACA,IAAA28B,EAAA0pF,EAAA,EACA,OAAAO,EAAAhrG,GAAA,CAAAzV,IACA,OAAAA,EAAAw2B,GACA,cAAAA,EAAA,SAAA4pF,IAAA,KAAAnmH,CAAA,CAAAmmH,IAAA,IAAAnmH,CAAA,CAAAmmH,IAAA,CACA,eAAA5pF,EAAA,OAAA4pF,IAAA,IAAAnmH,CAAA,CAAAmmH,IAAA,CACA,eAAA5pF,EAAAv8B,CAAA,CAAAmmH,IAAA,SACA,OAAApgH,EAAA,CACA,CACA,EACA,EAQA4gH,SAMArjH,CAAA,EACA,IAAAsjH,EAAA,GACA,wEAAAvxG,OAAA,EAAA2W,EAAA5oB,IAAAwjH,CAAA,CAAA56F,EAAA3f,UAAA,KAAAjJ,GACA,IAAA9D,EAAAgE,EAAApD,MAAA,CACA6P,EAAA,IAAAlQ,WAAA,EAAAP,GAAA,GACA,QAAA8D,EAAA,EAAAoE,EAAA,EAAAumE,EAAA,EAAA84C,EAAA,EAAgDzjH,EAAA9D,EAAO8D,IACvDyjH,EAAA,KAAAD,CAAA,CAAAtjH,EAAA+I,UAAA,CAAAjJ,GAAA,CACA2qE,CAAAA,GAAA,IACA,GACAh+D,CAAAA,CAAA,CAAAvI,IAAA,CAAAq/G,GAAA94C,CAAAA,GAAA,IAGA,OAAAh+D,CACA,EAnBAzM,IAJAkE,EAAA,EACA,IAAAkiC,CAAA,CAAAliC,IAAA,CAoCA,SAAAs/G,EAAA57D,CAAA,CAAA9sB,EAAA,GACA,IAAAruB,EAAA,GACA,QACA,IAAAhK,EAAAmlD,IACA5rD,EAAA4rD,IACA,IAAA5rD,EAAA,MACA8+B,GAAAr4B,EACA,QAAA3C,EAAA,EAAkBA,EAAA9D,EAAO8D,IACzB2M,EAAA9J,IAAA,CAAAm4B,EAAAh7B,GAEAg7B,GAAA9+B,EAAA,CACA,CACA,OAAAyQ,CACA,CAEA,SAAAg3G,EAAA77D,CAAA,EACA,OAAA87D,EAAA,KACA,IAAAt9E,EAAAo9E,EAAA57D,GACA,GAAAxhB,EAAAxpC,MAAA,QAAAwpC,CACA,EACA,CAGA,SAAAu9E,EAAA/7D,CAAA,EACA,IAAAn7C,EAAA,GACA,QACA,IAAAm3G,EAAAh8D,IACA,GAAAg8D,GAAAA,EAAA,MACAn3G,EAAA9J,IAAA,CAAAkhH,SAkCAD,CAAA,CAAAh8D,CAAA,EACA,IAAAk8D,EAAA,EAAAl8D,IACAm8D,EAAAn8D,IACAo8D,EAAAN,EAAA97D,GAEA,OAAAp5C,EADAw1G,EAAApnH,MAAA,GAAAgnH,EAAAh8D,GACAq8D,OAAA,EAAA79E,EAAAtmC,KACA,IAAA2C,EAAA,GAAAyhH,EAAA,CAAA99E,EACA,OAAA1+B,MAAAs8G,CAAA,CAAAlkH,EAAA,EAAAgE,IAAA,GAAAoU,GAAA,EAAAtQ,EAAA/E,KACA,IAAAshH,EAAAthH,EAAAkhH,EACA,OAAAthH,EAAAI,EAAAihH,EAAAI,EAAAhsG,GAAA,CAAAxV,GAAAA,EAAAyhH,GAAA,EAEA,EACA,EA9CAP,EAAAh8D,GACA,CACA,QACA,IAAAg8D,EAAAh8D,IAAA,EACA,GAAAg8D,EAAA,QACAn3G,EAAA9J,IAAA,CAgDA6L,EAFA,EAAAo5C,IACA,EA/CAg8D,EAAAh8D,GAgDA1vC,GAAA,CAAAkuB,GAAA,CAAAA,CAAA,IAAAA,EAAAz4B,KAAA,MA/CA,CACA,OAAAlB,EAAA23G,IAAA,EACA,CAIA,SAAAV,EAAA97D,CAAA,EACA,IAAAxhB,EAAA,GACA,QACA,IAAA3jC,EAAAmlD,EAAAxhB,EAAAxpC,MAAA,EACA,IAAA6F,EAAA,MACA2jC,EAAAzjC,IAAA,CAAAF,EACA,CACA,OAAA2jC,CACA,CAIA,SAAAi+E,EAAAroH,CAAA,CAAA4nH,CAAA,CAAAh8D,CAAA,EACA,IAAAp5C,EAAA9G,MAAA1L,GAAA8H,IAAA,GAAAoU,GAAA,SACA,QAAApY,EAAA,EAAiBA,EAAA8jH,EAAO9jH,IACxBwkH,CA9DA,SAAAtoH,CAAA,CAAA4rD,CAAA,EACA,IAAAxhB,EAAA1+B,MAAA1L,GACA,QAAA8D,EAAA,EAAA2C,EAAA,EAAwB3C,EAAA9D,EAAO8D,IAAAsmC,KAN/BtmC,CAM+BsmC,CAAAA,CAAA,CAAAtmC,EAAA,CAAA2C,GAL/B,GADA3C,EAM+B8nD,KAL/B,CAAA9nD,GAAA,EAAAA,GAAA,CAK+B,CAC/B,OAAAsmC,CACA,GA0DApqC,EAAA4rD,GAAA71C,OAAA,EAAAtP,EAAAI,IAAA2L,CAAA,CAAA3L,EAAA,CAAAF,IAAA,CAAAF,IAEA,OAAA+L,CACA,CAwDA,SAAA+1G,EAAAC,CAAA,EACA,QAAU,EAJVA,EAAA38G,QAAA,KAAA8H,WAAA,GAAA7H,QAAA,QAIY,CAAY,EAQxB,SAAA28G,EAAAzkH,CAAA,EACA,IAAA0kH,EAAA,GACA,QAAAxgH,EAAA,EAAAU,EAAA5E,EAAApD,MAAA,CAAmCsH,EAAAU,GAAW,CAC9C,IAAA4/G,EAAAxkH,EAAA2kH,WAAA,CAAAzgH,GACAA,GAAAsgH,EAAA,UACAE,EAAA/hH,IAAA,CAAA6hH,EACA,CACA,OAAAE,CACA,CAEA,SAAAE,EAAAF,CAAA,EAEA,IAAA9/G,EAAA8/G,EAAA9nH,MAAA,CACA,GAAAgI,EAFA,KAEA,OAAA8M,OAAA4Y,aAAA,IAAAo6F,GACA,IAAAz9F,EAAA,GACA,QAAAnnB,EAAA,EAAiBA,EAAA8E,GACjBqiB,EAAAtkB,IAAA,CAAA+O,OAAA4Y,aAAA,IAAAo6F,EAAA/2G,KAAA,CAAA7N,EAAAA,GALA,QAOA,OAAAmnB,EAAAgkC,IAAA,IACA,CAEA,SAAA45D,EAAAvoH,CAAA,CAAAF,CAAA,EACA,IAAAJ,EAAAM,EAAAM,MAAA,CACA8rB,EAAA1sB,EAAAI,EAAAQ,MAAA,CACA,QAAAkD,EAAA,EAAiB4oB,GAAAA,GAAA5oB,EAAA9D,EAAiB8D,IAAA4oB,EAAApsB,CAAA,CAAAwD,EAAA,CAAA1D,CAAA,CAAA0D,EAAA,CAClC,OAAA4oB,CACA,CA8BA,SAAAo8F,EAAAC,CAAA,EACA,gBACA,CACA,SAAAC,EAAAD,CAAA,EACA,OAAAA,SAAAA,CACA,CA2BA,SAAAE,EAAAT,CAAA,EACA,OAAAA,GA/CA,OA+CAA,EAtCAU,KAuCA,CAmBA,SAAAC,EAAAT,CAAA,EACAnD,GAAA6D,WA3CA,IAAA9+E,EAAAk8E,EAlCA,+xOAuCA,QAAAgC,EAAAE,EAAA,GAJAnD,EAAA,IAAArzE,IAAAu1E,EAAAn9E,GAAA29E,OAAA,EAAA79E,EAAAtmC,IAAAsmC,EAAAluB,GAAA,CAAAzV,GAAA,CAAAA,EAAA,YACA++G,EAAA,IAAA5hD,IAAA4jD,EAAAl9E,IACAm7E,EAAA,IAAAvzE,IACAwzE,EAAA,IAAAxzE,IACAy1E,EAAAr9E,IAAA,CACA,IAAAk7E,EAAAr3D,GAAA,CAAAq6D,IAAAE,GAAAA,EAAA9nH,MAAA,EACA,IAAAN,EAAAF,EAAA,CAAAsoH,EACA59C,EAAA46C,EAAA1yG,GAAA,CAAA1S,GACAwqE,IACAA,EAAA,IAAA54B,IACAwzE,EAAAv8G,GAAA,CAAA7I,EAAAwqE,IAEAA,EAAA3hE,GAAA,CAAA/I,EAAAooH,EACA,CACA/C,EAAAt8G,GAAA,CAAAq/G,EAAAE,EAAAjhF,OAAA,GACA,CAGA,IAyBA,IAAAh3B,EAAA,GACAwa,EAAA,GACAo+F,EAAA,GACA,SAAAhnH,EAAAmmH,CAAA,EACA,IAAAc,EAAA/D,EAAAvyG,GAAA,CAAAw1G,GACAc,IACAD,EAAA,GACAb,GAAAc,GAEA74G,EAAA9J,IAAA,CAAA6hH,EACA,CACA,QAAAA,KAAAE,EACA,QACA,GAAAF,EAAA,IACA/3G,EAAA9J,IAAA,CAAA6hH,QACK,GAAAS,EAAAT,GAAA,CACL,IAAAe,EAAAf,EArFA,MAsFAgB,EAAAD,EA/EAE,IA+EA,EACAC,EAAA,EAhFAD,IADA,GAiFA,EACAE,EAAAJ,EAlFA,GAmFAlnH,EAAAunH,KAAAJ,GACAnnH,EAAAwnH,KAAAH,GACAC,EAAA,GAAAtnH,EAAAynH,KAAAH,EACA,KAAK,CACL,IAAAI,EAAAtE,EAAAzyG,GAAA,CAAAw1G,GACAuB,EACA9+F,EAAAtkB,IAAA,IAAAojH,GAEA1nH,EAAAmmH,EAEA,CACA,IAAAv9F,EAAArqB,MAAA,OACA4nH,EAAAv9F,EAAAzG,GAAA,EACA,CAEA,GAAA6kG,GAAA54G,EAAA7P,MAAA,IACA,IAAAopH,EAAAlB,EAAAr4G,CAAA,KACA,QAAA3M,EAAA,EAAkBA,EAAA2M,EAAA7P,MAAA,CAAgBkD,IAAA,CAClC,IAAAwlH,EAAAR,EAAAr4G,CAAA,CAAA3M,EAAA,EACA,GAAAwlH,GAAAA,GAAAU,GAAAV,EAAA,CACAU,EAAAV,EACA,QACA,CACA,IAAAziH,EAAA/C,EAAA,EACA,QACA,IAAAyK,EAAAkC,CAAA,CAAA5J,EAAA,GAGA,GAFA4J,CAAA,CAAA5J,EAAA,GAAA4J,CAAA,CAAA5J,EAAA,CACA4J,CAAA,CAAA5J,EAAA,CAAA0H,EACA,CAAA1H,GAEAmjH,CADAA,EAAAlB,EAAAr4G,CAAA,GAAA5J,EAAA,IACAyiH,EAFA,KAGA,CACAU,EAAAlB,EAAAr4G,CAAA,CAAA3M,EAAA,CACA,CACA,CACA,OAAA2M,CACA,CA6CA,SAAAw5G,EAAAvB,CAAA,EACA,OAAAS,EAAAT,GAAAxsG,GAAA,CAAA8sG,EACA,CACA,SAAAkB,EAAAxB,CAAA,EACA,OAAAyB,SA/CA//E,CAAA,EACA,IAAA35B,EAAA,GACA+e,EAAA,GACA46F,EAAA,GACAJ,EAAA,EACA,QAAAjB,KAAA3+E,EAAA,CACA,IAAAk/E,EAAAR,EAAAC,GACAP,EAAAQ,EAAAD,GACA,GAAAqB,IAAAA,EACAd,GAAAA,EACAc,EAAA5B,EAEA/3G,EAAA9J,IAAA,CAAA6hH,QAEI,GAAAwB,EAAA,GAAAA,GAAAV,EACJA,GAAAA,GACA74G,EAAA9J,IAAA,CAAAyjH,KAAA56F,GACAA,EAAA5uB,MAAA,GACAwpH,EAAA5B,GAEAh5F,EAAA7oB,IAAA,CAAA6hH,GAEAwB,EAAAV,MACI,CACJ,IAAAe,EAAAC,SArGAhqH,CAAA,CAAAF,CAAA,EACA,GAAAE,GAlDA,MAkDAA,EAzCAspH,MAyCAxpH,GAjDA,MAiDAA,EAxCAypH,KAyCA,OAAAX,MAAA,CAAA5oH,EAnDA,IAmDA,EA7CAmpH,IA6CA,CAAArpH,EAlDA,IAkDA,EA9CA,GA+CG,GAAA6oH,EAAA3oH,IAAAF,EAlDH,MAkDGA,EAzCH0pH,MAyCG,CAAAxpH,EArDH,KAqDG,EA/CH,IA+CG,EACH,OAAAA,EAAAF,CAAAA,EAnDA,IAmDA,CACG,EACH,IAAAmqH,EAAA7E,EAAA1yG,GAAA,CAAA1S,UACA,GACAiqH,CAAAA,EAAAA,EAAAv3G,GAAA,CAAA5S,EAAA,EAEAmqH,EAGA,EACA,CACA,EAsFAH,EAAA5B,EACA6B,CAAAA,GAAA,EACAD,EAAAC,EACKL,GAAAA,GAAAV,GAAAA,GACL74G,EAAA9J,IAAA,CAAAyjH,GACAA,EAAA5B,IAEAh5F,EAAA7oB,IAAA,CAAA6hH,GACAwB,EAAAV,EAEA,CACA,CAIA,OAHAc,GAAA,GACA35G,EAAA9J,IAAA,CAAAyjH,KAAA56F,GAEA/e,CACA,EAOA04G,EAAAT,GACA,CASA,IAAA8B,EAAA/jH,GAAAiF,MAAAC,IAAA,CAAAlF,GAEA,SAAAgkH,EAAAx/E,CAAA,CAAAu9E,CAAA,EAEA,OAAAv9E,EAAA1G,CAAA,CAAA4pB,GAAA,CAAAq6D,IAAAv9E,EAAAT,CAAA,CAAA2jB,GAAA,CAAAq6D,EACA,CAEA,MAAAkC,UAAAh/G,MACA,IAAAi/G,UAAA,CAAkB,SAClB,CAIA,SAAA/6F,QApRAnf,EACAm6G,EAoRA,GAAAjF,EAAA,OAEA,IAAAr7E,EAAAk8E,EA1eA,gnmBA2eAqE,EAAA,IAAArD,EAAAl9E,GACAwgF,EAAA,QAAAlnD,IAAAinD,KACAE,EAAA,CAAA5hH,EAAAihC,IAAAA,EAAAr0B,OAAA,CAAAtP,GAAA0C,EAAA9G,GAAA,CAAAoE,IAEAk/G,EAAA,IAAAzzE,IAAAy1E,EAAAr9E,IACAs7E,EAAAkF,IAWAjF,EAAAgF,IACA/E,EAAA,IAAAliD,IAAAinD,IAAA3uG,GAAA,CAAApY,GAAA+hH,CAAA,CAAA/hH,EAAA,GACA+hH,EAAA,IAAAjiD,IAAAiiD,GAEAE,EAAA+E,IACA9E,EAAA8E,IAEA,IAAAE,EAAAvD,EAAAn9E,GACA2gF,EAAA3gF,IAEA4gF,EAAA,KAEA,IAAA/hH,EAAA,IAAAy6D,IAGA,OAFAinD,IAAA90G,OAAA,CAAAjS,GAAAinH,EAAA5hH,EAAA6hH,CAAA,CAAAlnH,EAAA,GACAinH,EAAA5hH,EAAA0hH,KACA1hH,CACA,EACA88G,EAAAyB,EAAA5jH,IAGA,IAAAyhD,EAAAmiE,EAAAp9E,GAAApuB,GAAA,CAAAzV,GAAAA,EAAA,IACA,GAAA8+C,EAAA3kD,MAAA,EACA,IAAA4F,EAAA1C,GAAAmnH,EAoBA,OAnBA1lE,CAAA,QACAA,EAAAqjE,EAAArjE,GACA/+C,GAAA++C,CAAAA,EAAA,cAA0BA,EAAE,IAiB5B,CAAWA,EAAAA,EAAAhhB,EAhBX2mF,IAgBW1gF,EAfX0gF,IAeWC,EAdX,CAAA7gF,IAcW9jC,EAAAA,CAAA,CACX,CACA,GAGA0/G,EAAA4E,IACA3E,EAAA,IAAAj0E,IACA,IAAAk5E,EAAAP,IAAAh+D,MAAA,CAAA29D,EAAAtE,IAAA5mG,IAAA,EAAAhf,EAAAF,IAAAE,EAAAF,GAYA,QAAW0lD,EAAAA,CAAA,CAAAqlE,EAAAA,CAAA,IAXXC,EAAAr1G,OAAA,EAAAyyG,EAAA1kH,KACA,IAAAw/B,EAAAgH,IACAs9E,EAAAwD,CAAA,CAAAtnH,EAAA,CAAAw/B,EAAA8nF,CAAA,CAAAtnH,EAAAw/B,EAAA,EAAyCwiB,EAAA,GAAAqlE,EAAA,IAAAj5E,GAAA,EACzC01E,EAAA9hE,CAAA,CAAAn/C,IAAA,CAAA6hH,GACAtC,EAAA/3D,GAAA,CAAAq6D,IACArC,EAAAh9G,GAAA,CAAAq/G,EAAAZ,EAEA,GAIiB,IAAAhkD,IAAAuiD,EAAArqD,MAAA,MAEjB,IAAAuvD,EAAA,GACA,QAAA7C,KAAA1iE,EAAA,CACA,IAAAwlE,EAAArF,EAAA3pF,MAAA,CAAA2O,GAAAw/E,EAAAx/E,EAAAu9E,IACAl3F,EAAA+5F,EAAAE,IAAA,GAAyBv2E,EAAAA,CAAA,CAAE,GAAAs2E,EAAAhyE,IAAA,CAAArO,GAAA+J,EAAAmZ,GAAA,CAAAljB,KAC3B3Z,IACAA,EAAA,CAAW0jB,EAAA,IAAA4uB,IAAA9d,EAAA,IACXulE,EAAA1kH,IAAA,CAAA2qB,IAEAA,EAAAw0B,CAAA,CAAAn/C,IAAA,CAAA6hH,GACAuC,EAAAz5F,EAAA0jB,CAAA,CAAAs2E,EACA,CAEA,IAAAE,EAAAH,EAAApD,OAAA,CAAAxhH,GAAA+jH,EAAA/jH,EAAAuuC,CAAA,GACA,QAAYA,EAAAA,CAAA,CAAA8Q,EAAAA,CAAA,IAAMulE,EAAA,CAClB,IAAAI,EAAA,IAAA7nD,IAAA4nD,EAAAlvF,MAAA,CAAA2O,GAAA,CAAA+J,EAAAmZ,GAAA,CAAAljB,KACA,QAAAu9E,KAAA1iE,EACAqlE,EAAAhiH,GAAA,CAAAq/G,EAAAiD,EAEA,CACA,CAIArF,EAAA,IAAAxiD,IACA,IAAA8nD,EAAA,IAAA9nD,IACA+nD,EAAAnD,GAAApC,EAAAj4D,GAAA,CAAAq6D,GAAAkD,EAAArpH,GAAA,CAAAmmH,GAAApC,EAAA/jH,GAAA,CAAAmmH,GACA,QAAAv9E,KAAAg7E,EAAA,CACA,QAAAuC,KAAAv9E,EAAA1G,CAAA,CAAAonF,EAAAnD,GACA,QAAAA,KAAAv9E,EAAAT,CAAA,CAAAmhF,EAAAnD,EACA,CAEA,QAAAA,KAAApC,EACAD,EAAAh4D,GAAA,CAAAq6D,IAAAkD,EAAAv9D,GAAA,CAAAq6D,IACArC,EAAAh9G,GAAA,CAAAq/G,EApIA,GA+IA,QAAAE,KANAqC,EAAA3E,EAAA6D,EAAA7D,IAIAC,EAAAuF,CAjZAn7G,EAAA,GACAm6G,EAAApD,EAgZAl9E,GA/YAxD,SAUAA,EAAA,CAAkB2D,EAAAA,CAAA,CAAAtjC,EAAAA,CAAA,CAAK,CAAAuhH,CAAA,CAAAmD,CAAA,EACvB,GAAAphF,CAAAA,CAAAA,EAAAA,CAAA,GAAAohF,IAAAnD,CAAA,CAAAA,EAAA9nH,MAAA,IAGA,QAAAqhD,KAFA,EAAAxX,GAAAohF,CAAAA,EAAAnD,CAAA,CAAAA,EAAA9nH,MAAA,KACA,EAAA6pC,GAAAh6B,EAAA9J,IAAA,CAAA+hH,GACAvhH,GACA,QAAAqhH,KAAAvmE,EAAAzX,CAAA,CACA1D,EAAAmb,EAAA,IAAAymE,EAAAF,EAAA,CAAAqD,EAGA,EAnBA10G,SAEAA,EAAAqzB,CAAA,EAMA,OAAUC,EALVmhB,IAKUzkD,EAJVugH,EAAA,KACA,IAAAgB,EAAAlB,EA0YAl9E,GA1YApuB,GAAA,CAAApY,GAAA8mH,CAAA,CAAA9mH,EAAA,EACA,GAAA4kH,EAAA9nH,MAAA,QAAAuW,EAAAuxG,EACA,GACUl+E,EAAAA,CAAA,CACV,EATA,QACA/5B,GA8YAyL,GAAA,CAAAkuB,GAAAsgF,EAAA/+G,IAAA,CAAAy+B,IAAA9qB,IAAA,CAAAupG,GACAvC,EAAA,IAAAp0E,IACAm0E,GAAA,CAOA,IAAAvnF,EAAA,CAAAwnF,EAAA,CACA,QAAAkC,KAAAE,EAAA,CACA,IAAA98D,EAAA9sB,EAAA5iB,GAAA,CAAAwhB,IACA,IAAA2vD,EAAA3vD,EAAA1qB,GAAA,CAAAw1G,GAQA,OAPAn7B,IAIAA,EAAA,IAAAn7C,IACAxU,EAAAv0B,GAAA,CAAAq/G,EAAAn7B,IAEAA,CACA,EACAm7B,CApKA,QAoKAA,EACA1pF,EAAAn4B,IAAA,IAAAilD,GAEA9sB,EAAA8sB,CAEA,CACA,QAAAnlD,KAAAq4B,EACAr4B,EAAAq/C,CAAA,CAAA4iE,CAEA,CACA,CAIA,SAAAoD,EAAAtD,CAAA,EACA,OAAAuD,EAAAvD,GAAA,MAAqCwD,EAAAC,EAAA,CAAAzD,EAAA,IAAkC,GAAAD,EAAAC,EACvE,CAMA,SAAAwD,EAAAhoH,CAAA,EACA,UAAYA,EAAE,SA0Cd,SAAAioH,EAAAvD,CAAA,CAAA7rG,EAAA/I,GAAA,CAAAo4G,EAAA3D,CAAA,EAGA,IAAAt9F,EAAA,GACAkhG,EAAAzD,CAAA,MAAAz9F,EAAAtkB,IAAA,MACA+hH,EAAA9nH,MAAA,CAAAic,IACAA,IAAA,EACA6rG,EAAA,IAAAA,EAAA/2G,KAAA,GAAAkL,GAAA,QAAA6rG,EAAA/2G,KAAA,EAAAkL,GAAA,EAEA,IAAAiiB,EAAA,EACA9+B,EAAA0oH,EAAA9nH,MAAA,CACA,QAAAkD,EAAA,EAAiBA,EAAA9D,EAAO8D,IAAA,CACxB,IAAA0kH,EAAAE,CAAA,CAAA5kH,EAAA,CACAioH,EAAAvD,KACAv9F,EAAAtkB,IAAA,CAAAiiH,EAAAF,EAAA/2G,KAAA,CAAAmtB,EAAAh7B,KACAmnB,EAAAtkB,IAAA,CAAAulH,EAAA1D,IACA1pF,EAAAh7B,EAAA,EAEA,CAEA,OADAmnB,EAAAtkB,IAAA,CAAAiiH,EAAAF,EAAA/2G,KAAA,CAAAmtB,EAAA9+B,KACAirB,EAAAgkC,IAAA,IACA,CAIA,SAAAk9D,EAAA3D,CAAA,EAEA,OADA54F,IACAi2F,EAAA13D,GAAA,CAAAq6D,EACA,CACA,SAAAuD,EAAAvD,CAAA,EAEA,OADA54F,IACAm2F,EAAA53D,GAAA,CAAAq6D,EACA,CAiEA,SAAArlH,EAAA1C,CAAA,CAAA2rH,CAAA,CAAAl/C,CAAA,EACA,IAAAzsE,EAAA,SACAmvB,IACA,IAAAqN,EAAA,EAGA,OAAAx8B,EAAA0C,KAAA,CA7UA,KA6UA+Y,GAAA,CAAAiwC,IACA,IAAA92B,EAAAozF,EAAAt8D,GACAkU,EAAA,CACAhrC,MAAAA,EACA4H,OAAAA,CACA,EACAA,GAAA5H,EAAAz0B,MAAA,GACA,IAEA,IAEA4b,EAFAsoD,EAAAzE,EAAAyE,MAAA,CAAAunD,EAAAh3F,EAAA+2F,EAAAl/C,GACAo/C,EAAAxnD,EAAAlkE,MAAA,CAEA,IAAA0rH,EAKA,2BAEA,IAAAC,EAAAlsD,EAAA7+D,MAAA,CAAAsjE,EAAAsjD,IAAA,GAGA,IAFAoE,SA7JA9D,CAAA,EAEA,QAAA5kH,EAAA4kH,EAAA+D,WAAA,CADA,IAC2C3oH,EAAA,GAC3C,GAAA4kH,KAAAA,CAAA,GAAA5kH,EAAA,CACA,+CAGA,EAsJAyoH,GAEA,CADAlsD,CAAAA,EAAAqsD,KAAA,CAAAJ,EAAA,GAAAxnD,CAAA,IAAA6lD,QAAA,GACA4B,EAAAI,KAAA,CAAAnE,GAAAA,EAAA,MAEAoE,SAtKAlE,CAAA,EACA,GAAAA,EAAA9nH,MAAA,KAAA8nH,IAAAA,CAAA,KAAAA,IAAAA,CAAA,IACA,yCAA+CE,EAAAF,EAAA/2G,KAAA,OAA8B,GAE7E,EAkKA46G,GAKA/vG,EAAA,YACK,CACL,IAAAlM,EAAAw0D,EAAAmjD,OAAA,CAAAxhH,GAAAA,EAAAkkH,QAAA,IAAAlkH,GACA,GAAA6J,EAAA1P,MAAA,CAEM,CAEN,GAAAilH,EAAA13D,GAAA,CAAAo+D,CAAA,WAAAM,EAAA,0BACA,QAAA/oH,EAAA,EAAqBA,EAAAwoH,EAAiBxoH,IAAA,CACtC,IAAA4kH,EAAA5jD,CAAA,CAAAhhE,EAAA,CACA,IAAA4kH,EAAAiC,QAAA,EAAA9E,EAAA13D,GAAA,CAAAu6D,CAAA,KAEA,MAAAmE,EAAA,4BAAyDjE,EAAA9jD,CAAA,CAAAhhE,EAAA,OAA2B,EAAImoH,EAAA,CAAAvD,CAAA,MAA4B,GAEpH,EACAoE,SA5KApE,CAAA,EACA,IAAAF,EAAAE,CAAA,IACA5pF,EAAAynF,EAAAvzG,GAAA,CAAAw1G,GACA,GAAA1pF,EAAA,MAAA+tF,EAAA,WAA4C/tF,EAAK,GACjD,IAAA9+B,EAAA0oH,EAAA9nH,MAAA,CACAg8B,EAAA,GACA,QAAA94B,EAAA,EAAiBA,EAAA9D,EAAO8D,IAAA,CACxB0kH,EAAAE,CAAA,CAAA5kH,EAAA,CACA,IAAAg2B,EAAAysF,EAAAvzG,GAAA,CAAAw1G,GACA,GAAA1uF,EAAA,CAEA,GAAA8C,GAAA94B,EAAA,MAAA+oH,EAAA,GAA2C/tF,EAAA,GAAM,EAAIhF,EAAM,GAC3D8C,EAAA94B,EAAA,EACAg7B,EAAAhF,CACA,CACA,CACA,GAAA8C,GAAA58B,EAAA,MAAA6sH,EAAA,YAAkD/tF,EAAK,EACvD,EA2JAytF,GACA,IAAA9qD,EAAA+oD,EAAA,IAAA5mD,IAAAtzD,IACA,CAAA26B,EAAA,CAAA8hF,SAgDAtrD,CAAA,EACA,IAAApO,EAAA4yD,EACA,QAAAuC,KAAA/mD,EAAA,CAGA,IAAA6pD,EAAAj4D,EAAA/2B,MAAA,CAAA2O,GAAAw/E,EAAAx/E,EAAAu9E,IACA,IAAA8C,EAAA1qH,MAAA,EACA,GAAAqlH,EAAA3sE,IAAA,CAAArO,GAAAw/E,EAAAx/E,EAAAu9E,IAWA,MAAAwE,EAAA35D,CAAA,IAAAm1D,EALA,OAAAyE,EAAAzE,EAOA,CAEA,GADAn1D,EAAAi4D,EACAA,GAAAA,EAAA1qH,MAAA,MACA,CAEA,OAAAyyD,CACA,EA1EAoO,GAGAyrD,CAyGA,SAAAjiF,CAAA,CAAAy9E,CAAA,EACA,QAAAF,KAAAE,EACA,IAAA+B,EAAAx/E,EAAAu9E,GAWA,MAAAwE,EAAA/hF,EAAAu9E,GAIA,GAAAv9E,EAAAkgF,CAAA,EACA,IAAAhC,EAAAc,EAAAvB,GACA,QAAA5kH,EAAA,EAAAsjC,EAAA+hF,EAAAvoH,MAAA,CAAyCkD,EAAAsjC,EAAOtjC,IAchD,GAAAgiH,EAAA33D,GAAA,CAAAg7D,CAAA,CAAArlH,EAAA,GACA,IAAA+C,EAAA/C,EAAA,EACA,QAAA0kH,EAAiB3hH,EAAAugC,GAAA0+E,EAAA33D,GAAA,CAAAq6D,EAAAW,CAAA,CAAAtiH,EAAA,EAAsCA,IAEvD,QAAA4L,EAAA3O,EAAqB2O,EAAA5L,EAAO4L,IAC5B,GAAA02G,CAAA,CAAA12G,EAAA,EAAA+1G,EACA,4CAAuDsD,EAAAtD,GAAc,GAMrE,GAAA3hH,EAAA/C,EAv+BA,EAy+BA,4CAAqDkoH,EAAAC,EAAA9C,EAAAx3G,KAAA,CAAA7N,EAAA,EAAA+C,SAAyDA,EAAA/C,MAAe,EAE7HA,EAAA+C,CACA,CAEA,CA+CA,GA5MAokC,EAAA36B,GACA68G,SAgBA5rE,CAAA,CAAAkgB,CAAA,MACA2rD,EACA,IAAAC,EAAA,GACA,QAAA7E,KAAA/mD,EAAA,CACA,IAAAq4C,EAAAqM,EAAAnzG,GAAA,CAAAw1G,GACA,GAAA1O,IAAAA,EAAA,OACA,GAAAA,EAAA,CACA,IAAA3wG,EAAA2wG,EAAAqR,CAAA,CAAAn4G,GAAA,CAAAw1G,GAEA,IAAA4E,CADAA,EAAAA,EAAAA,EAAA9wF,MAAA,CAAA2O,GAAA9hC,EAAAglD,GAAA,CAAAljB,IAAAu/E,EAAArhH,EAAA,EACAvI,MAAA,OACA,MACAysH,EAAA1mH,IAAA,CAAA6hH,EAEA,CACA,GAAA4E,EAIA,SAAAniF,KAAAmiF,EACA,GAAAC,EAAAV,KAAA,CAAAnE,GAAAiC,EAAAx/E,EAAAu9E,IACA,wCAAgDjnE,EAAAgE,CAAA,CAAQ,GAAGta,EAAAsa,CAAA,CAAI,EAE/D,CAEA,EAxCAta,EAAAw2B,GACAjlD,EAAAyuB,EAAAsa,CAAA,MAlBA/oC,EAAA,OAwBA,CACA6jD,EAAA7jD,IAAA,CAAAA,CACA,CAAI,MAAA8wG,EAAA,CACJjtD,EAAA5wD,KAAA,CAAA69G,CACA,CACA,OAAAjtD,CACA,EACA,CA2DA,SAAAktD,EAAApqH,CAAA,EACA,OAAAA,EAAA+Y,GAAA,GAAoBmZ,MAAAA,CAAA,CAAA5lB,MAAAA,CAAA,CAAAjO,OAAAA,CAAA,CAAqB,IACzC,GAAAiO,EAAA,CAEA,IAAAnB,EAAAmB,EAAA8qC,OAAA,OAEA,MAAAp3C,GAAAA,EAAAvC,MAAA,CAAA0N,EAAA,iBAA8D09G,EAAAC,EAAA52F,EAAA,KAAsC,IAAI/mB,EAAI,EAC5G,CACA,OAAAs6G,EAAApnH,EACA,GAAEytD,IAAA,CAjdF,IAkdA,CAEA,SAAAg+D,EAAAzE,CAAA,EAEA,sCAA2CsD,EAAAtD,GAAc,EACzD,CACA,SAAAwE,EAAA/hF,CAAA,CAAAu9E,CAAA,EACA,IAAAgF,EAAA1B,EAAAtD,GACAiF,EAAAxH,EAAAsF,IAAA,CAAAtgF,GAAAA,EAAA1G,CAAA,CAAA4pB,GAAA,CAAAq6D,IAIA,OAHAiF,GACAD,CAAAA,EAAA,GAAcC,EAAAloE,CAAA,EAAM,EAAEioE,EAAO,GAE7B,0BAAsCviF,EAAAsa,CAAA,IAAK,EAAIioE,EAAO,EACtD,CACA,SAAAX,EAAAa,CAAA,EACA,mCAAwCA,EAAM,EAC9C,CA+GA,SAAArB,EAAAh3F,CAAA,CAAA+2F,CAAA,CAAAl/C,CAAA,EACA,IAAAz8D,EAAA,GACAH,EAAA,GAEA,IADA+kB,EAAAA,EAAA1jB,KAAA,GAAA81B,OAAA,GACApS,EAAAz0B,MAAA,GACA,IAAA8rH,EAAAiB,EAAAt4F,GACA,GAAAq3F,EACAp8G,EAAA1P,MAAA,GACA6P,EAAA9J,IAAA,CAAAylH,EAAA97G,IACAA,EAAA,IAEAG,EAAA9J,IAAA,CAAAumE,EAAAw/C,QACI,CACJ,IAAAlE,EAAAnzF,EAAA7Q,GAAA,GACA,GAAA4hG,EAAAj4D,GAAA,CAAAq6D,GACAl4G,EAAA3J,IAAA,CAAA6hH,OACK,CACL,IAAAE,EAAA/C,EAAA3yG,GAAA,CAAAw1G,GACA,GAAAE,EACAp4G,EAAA3J,IAAA,IAAA+hH,QACM,IAAA9C,EAAAz3D,GAAA,CAAAq6D,GAON,MAAAyE,EAAAzE,EAEA,CACA,CACA,CAIA,OAHAl4G,EAAA1P,MAAA,EACA6P,EAAA9J,IAAA,CAAAylH,EAAA97G,IAEAG,CACA,CAEA,SAAAm9G,EAAAlF,CAAA,EACA,OAAAA,EAAApsF,MAAA,CAAAksF,GAAAA,OAAAA,EACA,CAOA,SAAAmF,EAAAjF,CAAA,CAAAmF,CAAA,EACA,IACAnB,EADAhvF,EAAA4oF,EAEAp+G,EAAAwgH,EAAA9nH,MAAA,CACA,KAEA,GADA88B,CAAAA,EAAAA,EAAA1qB,GAAA,CAAA01G,CAAA,GAAAxgH,EAAA,IADA,CAGA,IAAO49C,EAAAA,CAAA,EAAGpoB,EACVooB,IACA4mE,EAAA5mE,EACA+nE,GAAAA,EAAAlnH,IAAA,IAAA+hH,EAAA/2G,KAAA,CAAAzJ,GAAAu/B,OAAA,IACAihF,EAAA9nH,MAAA,CAAAsH,EAEA,CACA,OAAAwkH,CACA,CAKA,IAAAoB,EAAA,QACAC,GAAA,SACAC,GAAA,UAoFA,SAAAC,GAAAzxG,CAAA,EACA,OAAAA,GAAAsxG,GAAAtxG,GAAAuxG,EACA,CAEA,SAAAG,GAAAxF,CAAA,EACA,OAAAA,EAAApvE,IAAA,CAAAkvE,GAAAxC,EAAA73D,GAAA,CAAAq6D,GACA,CAEA,SAAA2F,GAAArpD,CAAA,EACA,QAAAhhE,EAAA,EAAiBA,EAAAghE,EAAAlkE,MAAA,CAAmBkD,IACpC,GAAAghE,CAAA,CAAAhhE,EAAA,CAAA0Y,IAAA,EAAAsxG,EAAA,CACA,IAAAjnH,EAAA/C,EAAA,EACA,KAAA+C,EAAAi+D,EAAAlkE,MAAA,EAAAkkE,CAAA,CAAAj+D,EAAA,CAAA2V,IAAA,EAAAsxG,GAAAjnH,IACAi+D,EAAA2G,MAAA,CAAA3nE,EAAA+C,EAAA/C,EAAA,CAA4B0Y,KAAAsxG,EAAApF,IAAA5jD,EAAAnzD,KAAA,CAAA7N,EAAA+C,GAAAohH,OAAA,CAAAxhH,GAAAA,EAAAiiH,GAAA,GAC5B,CAEA,OAAA5jD,CACA,CAEAjjE,EAAAusH,YAAoB,CApepB,SAAA3tH,CAAA,EACA,IAAA4tH,EAAAlrH,EAAA1C,EAAAypH,EAAAzjH,GAAAA,GACA,QAAW+V,KAAAA,CAAA,CAAAhb,OAAAA,CAAA,CAAAiO,MAAAA,CAAA,IAAqB4+G,EAAA,CAChC,GAAA5+G,EAAA,KAmBA,WAAA+M,GAAA8xG,SAUAlkF,CAAA,CAAA9pC,CAAA,CAAAF,CAAA,EACA,IAAA0+B,EAAA,EACA,QACA,IAAA8sB,EAAAxhB,EAAAra,OAAA,CAbA,IAaA+O,GACA,GAAA8sB,EAAA,OACAxhB,CAAAA,CAAA,CAAAwhB,EAAA,CAfA,IAgBA9sB,EAAA8sB,EAAA,CACA,CACA,EAlBApqD,EAAA,IAMA,CACA,OAAA+rH,EAAAc,EACA,EAucAxsH,EAAA0sH,SAAiB,CApfjB,WAEA,OADA3+F,IACAy2F,EAAAnqG,GAAA,CAAAzV,GAAAA,EAAAkL,KAAA,GACA,EAkfA9P,EAAAupF,aAAqB,CA1erB,SAAA3qF,CAAA,EACA,OAAA8sH,EAAApqH,EAAA1C,EAAAypH,EAAA0D,GACA,EAyeA/rH,EAAA2sH,sBAA8B,CAjf9B,SAAAC,CAAA,CAAAC,CAAA,EACA9+F,IACA,IAAAw8F,EAAAsC,EAAAzE,EAAAC,EACA,OAAAuE,EAAAtrH,KAAA,CAlRA,KAkRA+Y,GAAA,CAAAiwC,GAAAy8D,EAAAyD,EAAA5D,EAAAt8D,GAAAigE,EAAAwB,GAAAxF,IAAA,KAAAn5D,IAAA,CAlRA,IAmRA,EA8eAptD,EAAA8sH,SAAiB,CA9bjB,SAAAluH,CAAA,CAAAmuH,CAAA,EACA,OAAAzrH,EAAA1C,EAAAypH,EAAA0E,EAAAnoH,GAAAA,EAAAkL,KAAA,GAAAi8G,EACA,EA6bA/rH,EAAAgtH,YAAoB,CAtGpB,SAAAA,EAAApuH,CAAA,EACA2rH,GAAAA,EAAA,GACA,CAAE,EAAI,EACNx8F,IACA,IAAAyF,EAAAozF,EAAAhoH,GAAAgnC,OAAA,GACAomF,EAAA,GACA/oD,EAAA,GACA,KAAAzvC,EAAAz0B,MAAA,GACA,IAAA8rH,EAAAiB,EAAAt4F,EAAAw4F,GACA,GAAAnB,EACA5nD,EAAAn+D,IAAA,EACA6V,KAfA,QAgBAkwG,MAAAA,EAAA/6G,KAAA,GACA0jB,MAAAw4F,EACAnF,IAAAkF,EAAAlB,EACA,GACAmB,EAAA,OACI,CACJ,IAAArF,EAAAnzF,EAAA7Q,GAAA,GACA,GAAAgkG,IAAAA,EACA1jD,EAAAn+D,IAAA,EAAiB6V,KAtBjB,OAsBiBgsG,GAAAA,CAAA,QACZ,GAAApC,EAAAj4D,GAAA,CAAAq6D,GACL1jD,EAAAn+D,IAAA,EAAiB6V,KAAAsxG,EAAApF,IAAA,CAAAF,EAAA,QACZ,GAAA5C,EAAAz3D,GAAA,CAAAq6D,GACL1jD,EAAAn+D,IAAA,EAAiB6V,KAAAwxG,GAAAxF,GAAAA,CAAA,OACZ,CACL,IAAAE,EAAA/C,EAAA3yG,GAAA,CAAAw1G,GACAE,EACA5jD,EAAAn+D,IAAA,EAAkB6V,KAAAuxG,GAAAvF,GAAAA,EAAAE,IAAAA,EAAA/2G,KAAA,KAElBmzD,EAAAn+D,IAAA,EAAkB6V,KAnClB,aAmCkBgsG,GAAAA,CAAA,EAElB,CACA,CACA,CACA,GAAA4D,EACA,QAAAtoH,EAAA,EAAAkxB,EAAA,GAA8BlxB,EAAAghE,EAAAlkE,MAAA,CAAmBkD,IAAA,CACjD,IAAA6hE,EAAAb,CAAA,CAAAhhE,EAAA,CACA,GAAAmqH,GAAAtoD,EAAAnpD,IAAA,GACA,GAAA0xG,GAAAvoD,EAAA+iD,GAAA,GACA,IAAA3zG,EAAAjR,EAAA,EACA,QAAAoE,EAAA6M,EAAyB7M,EAAA48D,EAAAlkE,MAAA,CAAqBsH,IAAA,CAC9C,IAAWsU,KAAAA,CAAA,CAAAksG,IAAAA,CAAA,EAAW5jD,CAAA,CAAA58D,EAAA,CACtB,GAAA+lH,GAAAzxG,GAAA,CACA,IAAA0xG,GAAAxF,GAAA,MACA3zG,EAAA7M,EAAA,CACA,MAAQ,GAAAsU,IAAAwxG,GACR,KAEA,CACAh5F,EAAA,GAAAA,CAAAA,EAAAlxB,CAAAA,EACA,IAAA6N,EAAAmzD,EAAAnzD,KAAA,CAAAqjB,EAAAjgB,GACA+5G,EAAAn9G,EAAAs2G,OAAA,CAAAxhH,GAAAwnH,GAAAxnH,EAAA+V,IAAA,EAAA/V,EAAAiiH,GAAA,KACAA,EAAAwB,EAAA4E,GACAjG,EAAAH,EAAAoG,IACAhqD,EAAA2G,MAAA,CAAAz2C,EAAAjgB,EAAAigB,EAAA,CACAxY,KA3DA,MA4DA6Y,MAAAy5F,EACApG,IAAAA,EACAqG,QAAAZ,GAAAx8G,GACAmzD,OAAA+pD,EAAAjG,EAAAF,GAAA,CAAgD0D,GAAA,IAChD,GACAtoH,EAAAkxB,GAEAlxB,EAAAiR,EAAA,EAEAigB,EAAA,EACA,MACAA,EAAAlxB,OAEK6hE,EAAAnpD,IAAA,GAAAwxG,IACLh5F,CAAAA,EAAA,GAEA,CAEA,OAAAm5F,GAAArpD,EACA,EA2BAjjE,EAAAsqH,iBAAyB,CAAAA,EACzBtqH,EAAAqoH,GAAW,CAAAA,EACXroH,EAAAooH,GAAW,CAAAA,EACXpoH,EAAAoqH,iBAAyB,CAAAA,EACzBpqH,EAAAkqH,aAAqB,CAAAA,0C4DrRrBiD,iE3DhvBAvxD,E2DwUA72D,EAvDAwgC,EAEApnC,EAAAsqC,EAuDAlD,EAaAA,EAq5CAA,E3D7uDAq2B,yZA7NA,IAAAwxD,EAAA,CACAC,eAAA,EACA,EAGAC,EAAA,CAAA50E,EAAA3oC,EAAAsG,EAAA+2G,CAAA,GAKA,EACAtmH,KALAiJ,EAAAw9G,IAAA,GACA,CAAY5yG,KAAA,KAAA1a,MAAA8P,EAAA9P,KAAA,EACZ,CAAY0a,KAAA,MAAA1a,MAAA8P,EAAAnC,KAAA,EAIZ8qC,QAAAA,EACA/qB,MAJAtX,EAAAg3G,cAAA,SAAA1/F,KAAA,CAAA3qB,KAAAA,CAKA,GAkBA,SAAAsmD,EAAAC,CAAA,CAAAC,CAAA,CAAA9mB,CAAA,CAAA+mB,CAAA,EAEA,UAAA/mB,CAAAA,GAAAA,CAAAA,EAAAgnB,OAAA,YAAAC,CAAA,CAAAC,CAAA,EACA,SAAAC,EAAA5pD,CAAA,EAAoC,IAAM6pD,EAAAL,EAAAM,IAAA,CAAA9pD,GAAA,CAA+B,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACrF,SAAAykB,EAAA/pD,CAAA,EAAmC,IAAM6pD,EAAAL,EAAA,MAAAxpD,GAAA,CAAmC,MAAAslC,EAAA,CAAYqkB,EAAArkB,EAAA,EACxF,SAAAukB,EAAA/5C,CAAA,MAJA9P,CAIgC8P,CAAAA,EAAAk6C,IAAA,CAAAN,EAAA55C,EAAA9P,KAAA,EAAAiqD,CAJJjqD,CAA5BA,EAIgC8P,EAAA9P,KAAA,YAJJyiC,EAAAziC,EAAA,IAAAyiC,EAAA,SAAAinB,CAAA,EAA+DA,EAAA1pD,EAAA,EAAiB,EAI5EkqD,IAAA,CAAAN,EAAAG,EAAA,CAChCF,EAAA,CAAAL,EAAAA,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,KAAAO,IAAA,GACA,EACA,CAcA,SAAAuB,EAAA/iB,CAAA,EACA,uBAAA+iB,EAAA,MAAA/iB,CAAA,CAAAA,EAAA,UAAA+iB,EAAA/iB,EACA,CA4BA,MAAAilF,EACA7uH,YAAAqN,CAAA,EACA,KAAAyhH,QAAA,CAAAzhH,CACA,CACA,OAAA0hH,gBAAAr5C,CAAA,EAEA,WAAAm5C,EADAn5C,EAAAlqB,IAAA,QAAAwjE,EAAA1tH,IAEA,CACA,OAAA2tH,YAAAv5C,CAAA,CAAAw5C,CAAA,EAIA,WAAAL,EAHAn5C,EACAlqB,IAAA,QAAAwjE,EAAA1tH,IACA4tD,KAAA,QAAAxf,EAAAw/E,EAAAtoF,KAEA,CAEA,OAAAuoF,cAAA19F,CAAA,CAAAy9F,CAAA,EACA,UAAAjpF,IACA,IAAA4oF,EAAAlkE,EAAA,+BACA,IACA,WAAAqkE,EAAA,OAAAv9F,KAAAwU,EAAA,EACA,CACA,MAAAh3B,EAAA,CACA,WAAAygC,EAAAw/E,EAAAA,EAAAjgH,GAAAA,EACA,CACA,GAEA,CACA,OAAAmgH,QAAAC,CAAA,EACA,OAAAC,EAAAD,EACA,CACA,OAAAE,qBAAAF,CAAA,EACA,OAAAG,EAAAH,EACA,CACA3zG,IAAA0nB,CAAA,EACA,WAAAyrF,EAAA,KAAAC,QAAA,CAAAtjE,IAAA,IAAAb,EAAA,sCACA,EAAA8kE,KAAA,GACA,IAAA//E,EAAAriC,EAAA4B,KAAA,EAEA,IAAA+/G,EAAA,OAAA5rF,EAAA/1B,EAAA/L,KAAA,GACA,IACA,CACAouH,OAAAtsF,CAAA,EACA,WAAAyrF,EAAA,KAAAC,QAAA,CAAAtjE,IAAA,IAAAb,EAAA,sCACA,EAAAikE,IAAA,GACA,IAAAI,EAAA3hH,EAAA/L,KAAA,EAEA,IAAAouC,EAAA,OAAAtM,EAAA/1B,EAAA4B,KAAA,GACA,IACA,CAEA0gH,QAAAvsF,CAAA,EACA,WAAAyrF,EAAA,KAAAC,QAAA,CAAAtjE,IAAA,KACA,GAAAn+C,EAAAoiH,KAAA,GACA,WAAA//E,EAAAriC,EAAA4B,KAAA,EAEA,IAAA2gH,EAAAxsF,EAAA/1B,EAAA/L,KAAA,EACA,OAAAsuH,aAAAf,EAAAe,EAAAd,QAAA,CAAAc,CACA,GACA,CAEAC,OAAAzsF,CAAA,EACA,WAAAyrF,EAAA,KAAAC,QAAA,CAAAtjE,IAAA,IAAAb,EAAA,sCACA,EAAA8kE,KAAA,GACArsF,EAAA/1B,EAAA4B,KAAA,EAEA,IAAA+/G,EAAA3hH,EAAA/L,KAAA,CACA,IACA,CACAg4B,MAAA29E,CAAA,CAAA6Y,CAAA,EACA,YAAAhB,QAAA,CAAAtjE,IAAA,IAAAn+C,EAAAisB,KAAA,CAAA29E,EAAA6Y,GACA,CACAC,SAAA3pH,CAAA,EACA,YAAA0oH,QAAA,CAAAtjE,IAAA,IAAAn+C,EAAA0iH,QAAA,CAAA3pH,GACA,CAIA4pH,YAAA,CACA,OAAApjE,SAxGAhC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EACA,IAAAkB,OAAAa,aAAA,yDACA,IAAAvpD,EAAAmnC,EAAAqgB,EAAAnB,KAAA,CAAAiB,EAAAC,GAAA,IAAAhhB,EAAA,GACA,OAAAvmC,EAAA,GAAiByoD,EAAA,QAAAA,EAAA,SAAAA,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAa,aAAA,aAAuF,aAAcvpD,EACtH,SAAAyoD,EAAAvsD,CAAA,EAAuBirC,CAAA,CAAAjrC,EAAA,EAAA8D,CAAAA,CAAA,CAAA9D,EAAA,UAAAoqC,CAAA,EAAgC,WAAAmhB,QAAA,SAAAjrD,CAAA,CAAAF,CAAA,EAAqCiqC,EAAA1jC,IAAA,EAAA3G,EAAAoqC,EAAA9pC,EAAAF,EAAA,KAAAktD,EAAAttD,EAAAoqC,EAAA,EAA2C,GACvI,SAAAkjB,EAAAttD,CAAA,CAAAoqC,CAAA,EAA4B,QAC5BE,CAAuBA,EAAvBA,EADkCW,CAAA,CAAAjrC,EAAA,CAAAoqC,IACXtoC,KAAA,YAAAqrD,EAAA5B,QAAAC,OAAA,CAAAlhB,EAAAxoC,KAAA,CAAAsoC,CAAA,EAAA4hB,IAAA,CAAAuB,EAAA9B,GAAA+B,EAAAnjB,CAAA,OAAAC,EADW,CAAiB,MAAAlD,EAAA,CAAYomB,EAAAnjB,CAAA,OAAAjD,EAAA,EAE/D,SAAAmmB,EAAAzrD,CAAA,EAA8BwrD,EAAA,OAAAxrD,EAAA,CAC9B,SAAA2pD,EAAA3pD,CAAA,EAA6BwrD,EAAA,QAAAxrD,EAAA,CAC7B,SAAA0rD,EAAA5pB,CAAA,CAAAwG,CAAA,EAA4BxG,EAAAwG,GAAAC,EAAAziC,KAAA,GAAAg8B,EAAAhjC,MAAA,EAAA0sD,EAAAjjB,CAAA,OAAAA,CAAA,QAC5B,EA8FA,KAAA6f,UAAA,YACA,aAAAiD,EAAA,OAAAA,EAAA,OAAAM,SA7FAl7C,CAAA,EACA,IAAAzO,EAAAoP,EACA,OAAApP,EAAA,GAAiByoD,EAAA,QAAAA,EAAA,iBAAAnlB,CAAA,EAA6C,MAAAA,CAAA,GAAUmlB,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAC,QAAA,aAAsD,aAAc3oD,EAC5I,SAAAyoD,EAAAvsD,CAAA,CAAA4jC,CAAA,EAA0B9/B,CAAA,CAAA9D,EAAA,CAAAuS,CAAA,CAAAvS,EAAA,UAAAoqC,CAAA,EAA6B,OAAAl3B,EAAA,CAAAA,CAAAA,EAAA,CAAoBpR,MAAAqrD,EAAA56C,CAAA,CAAAvS,EAAA,CAAAoqC,IAAA0hB,KAAA9rD,WAAAA,CAAA,EAAgD4jC,EAAAA,EAAAwG,GAAAA,CAAA,EAAkBxG,CAAA,CAC7I,EAyFA8pB,SAvFAn7C,CAAA,EACA,IAAAi6C,OAAAa,aAAA,yDACA,IAAAvpD,EAAA0O,EAAAD,CAAA,CAAAi6C,OAAAa,aAAA,EACA,OAAA76C,EAAAA,EAAAtE,IAAA,CAAAqE,GAAAA,CAAAA,EAAAm6C,SArCAn6C,CAAA,EACA,IAAAvO,EAAA,mBAAAwoD,QAAAA,OAAAC,QAAA,CAAAj6C,EAAAxO,GAAAuO,CAAA,CAAAvO,EAAA,CAAAF,EAAA,EACA,GAAA0O,EAAA,OAAAA,EAAAtE,IAAA,CAAAqE,GACA,GAAAA,GAAA,iBAAAA,EAAA3R,MAAA,QACAgrD,KAAA,WAEA,OADAr5C,GAAAzO,GAAAyO,EAAA3R,MAAA,EAAA2R,CAAAA,EAAA,QACA,CAAqBzQ,MAAAyQ,GAAAA,CAAA,CAAAzO,IAAA,CAAAgoD,KAAA,CAAAv5C,CAAA,CACrB,CACA,CACA,iBAAAvO,EAAA,4DACA,EA2BAuO,GAAAzO,EAAA,GAA2GyoD,EAAA,QAAAA,EAAA,SAAAA,EAAA,UAAAzoD,CAAA,CAAA0oD,OAAAa,aAAA,aAAuF,aAAcvpD,CAAAA,EAChN,SAAAyoD,EAAAvsD,CAAA,EAAuB8D,CAAA,CAAA9D,EAAA,CAAAuS,CAAA,CAAAvS,EAAA,WAAAoqC,CAAA,EAA8B,WAAAmhB,QAAA,SAAAC,CAAA,CAAAC,CAAA,GAAgD+B,SACrGhC,CAAA,CAAAC,CAAA,CAAAnoB,CAAA,CAAA8G,CAAA,EAA6CmhB,QAAAC,OAAA,CAAAphB,GAAA4hB,IAAA,UAAA5hB,CAAA,EAAsCohB,EAAA,CAAU1pD,MAAAsoC,EAAA0hB,KAAAxoB,CAAA,EAAmB,EAAImoB,EAAA,EADfD,EAAAC,EAAArhB,CAAAA,EAAA73B,CAAA,CAAAvS,EAAA,CAAAoqC,EAAA,EAAA0hB,IAAA,CAAA1hB,EAAAtoC,KAAA,GAAwD,EAE7J,EAiFA,OAAAqrD,EAAA,KAAAmiE,QAAA,CAAAtjE,IAAA,IAAAn+C,EAAA2iH,UAAA,WACA,EACA,CAEAxkE,KAAAykE,CAAA,CAAAC,CAAA,EACA,YAAApB,QAAA,CAAAtjE,IAAA,CAAAykE,EAAAC,EACA,CACA,CAEA,IAAAC,EAAA,OAAAtB,EAAA9jE,QAAAC,OAAA,KAAAtb,EAAAo9E,IACA+B,CAAAA,EAAAI,WAAA,CACAJ,EAAAE,eAAA,CACAF,EAAAM,aAAA,CAKA,IAAAiB,EAAA,IACA,IAAA7oF,EAAA0vE,EAAA,IACA,QAAA7lG,KAAAi/G,EAAA,CACA,GAAAj/G,EAAAq+G,KAAA,IACAloF,EAAAulF,EAAA17G,EAAAnC,KAAA,EACA,KACA,CAEAs4B,EAAA7rB,GAAA,IAAA4T,EAAAnpB,IAAA,CAAAiL,EAAA9P,KAAA,EAEA,CACA,OAAAimC,CACA,EAMA+nF,EAAA,GAAAT,EAAAE,eAAA,CAAAhkE,QAAA6F,GAAA,CAAAy+D,IAAAM,OAAA,CAAAS,GAIAE,EAAA,IACA,IAAA/oF,EAAA0vE,EAAA,IACA,QAAA7lG,KAAAi/G,EACAj/G,EAAAq+G,KAAA,IAAAloF,EAAAkoF,KAAA,GACAloF,EAAAt4B,KAAA,CAAA9I,IAAA,CAAAiL,EAAAnC,KAAA,EAEAmC,EAAAq+G,KAAA,IAAAloF,EAAAqnF,IAAA,GACArnF,EAAAulF,EAAA,CAAA17G,EAAAnC,KAAA,GAEAmC,EAAAw9G,IAAA,IAAArnF,EAAAqnF,IAAA,IACArnF,EAAAjmC,KAAA,CAAA6E,IAAA,CAAAiL,EAAA9P,KAAA,EAIA,OAAAimC,CACA,EACAioF,EAAA,GAAAX,EAAAE,eAAA,CAAAhkE,QAAA6F,GAAA,CAAAy+D,IAAAM,OAAA,CAAAW,EAwBArzD,EApBAA,EA6BCA,GAAAA,CAAAA,EAAA,KATDkyD,aAAA,CAXA,SAAA19F,CAAA,CAAAy9F,CAAA,EACA,UAAAjpF,KACA,IACA,IAAA70B,EAAAqgB,KAAAwU,GACA,OAAAgxE,EAAA7lG,EACA,CACA,MAAAw1B,EAAA,CACA,OAAAkmF,EAAAoC,EAAAA,EAAAtoF,GAAAA,EACA,CACA,CACA,EAKAq2B,EAAAmyD,OAAA,CAHA,SAAAiB,CAAA,EACA,OAAAD,EAAAC,EACA,EAKApzD,EAAAsyD,oBAAA,CAHA,SAAAc,CAAA,EACA,OAAAC,EAAAD,EACA,EAGA,IAAApZ,EAAA,OAAA+X,EAAA1tH,GACAwrH,EAAA,OAAAp9E,EAAAo9E,EAQA,OAAAkC,EACAhvH,YAAAsB,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CACAstH,MAAA,CACA,QACA,CACAa,OAAA,CACA,YAAAb,IAAA,EACA,CACAlzG,IAAA0nB,CAAA,EACA,OAAA6zE,EAAA7zE,EAAA,KAAA9hC,KAAA,EACA,CAEAouH,OAAA5jH,CAAA,EACA,OAAAmrG,EAAA,KAAA31G,KAAA,CACA,CAEAquH,QAAAvsF,CAAA,EACA,OAAAA,EAAA,KAAA9hC,KAAA,CACA,CAEAuuH,OAAA/jH,CAAA,EACA,OAAAmrG,EAAA,KAAA31G,KAAA,CACA,CACAivH,aAAAntF,CAAA,EACA,OAAAA,EAAA,KAAA9hC,KAAA,CACA,CACAkvH,SAAAptF,CAAA,EACA,OAAAyrF,EAAAE,eAAA,CAAA3rF,EAAA,KAAA9hC,KAAA,EACA,CAEAyuH,SAAA/sC,CAAA,EACA,YAAA1hF,KAAA,CAGAg4B,MAAA29E,CAAA,CAAA6Y,CAAA,EACA,OAAA7Y,EAAA,KAAA31G,KAAA,CACA,CACA0uH,YAAA,CACA,IAAA1uH,EAAA,KAAAA,KAAA,CAEA,mBACA,OAAAA,CACA,GACA,CACAmvH,cAAArlH,CAAA,EACA,YAAA9J,KAAA,CAEAovH,iBAAAh5G,CAAA,EACA,MAAAi3G,EAAA,0CAAAj3G,EACA,CACA,CACA,MAAAg4B,EACA1vC,YAAAiP,CAAA,EACA,KAAAA,KAAA,CAAAA,CACA,CACA2/G,MAAA,CACA,QACA,CACAa,OAAA,CACA,YAAAb,IAAA,EACA,CAEAlzG,IAAA5P,CAAA,EACA,OAAAghH,EAAA,KAAA79G,KAAA,CACA,CACAygH,OAAAtsF,CAAA,EACA,OAAA0pF,EAAA1pF,EAAA,KAAAn0B,KAAA,EACA,CAEA0gH,QAAA7jH,CAAA,EACA,OAAAghH,EAAA,KAAA79G,KAAA,CACA,CAEA4gH,OAAAzsF,CAAA,EACA,OAAAA,EAAA,KAAAn0B,KAAA,CACA,CAEAshH,aAAAzkH,CAAA,EACA,OAAAqkH,EAAA,KAAAlhH,KAAA,CACA,CAEAuhH,SAAA1kH,CAAA,EACA,OAAAqkH,EAAA,KAAAlhH,KAAA,CACA,CACA8gH,SAAAnmF,CAAA,EACA,OAAAA,CACA,CACAtQ,MAAAq3F,CAAA,CAAA7D,CAAA,EACA,OAAAA,EAAA,KAAA79G,KAAA,CACA,CACA+gH,YAAA,CACA,IAAA/gH,EAAA,KAAAA,KAAA,CACA,mBAEA,MADA,MAAA69G,EAAA79G,GACA,mDACA,GACA,CACAwhH,cAAA/4G,CAAA,EACA,MAAAi3G,EAAA,wCAAAj3G,EACA,CACAg5G,iBAAAtlH,CAAA,EACA,YAAA6D,KAAA,CAEA,CACAguD,EAAAkyD,aAAA,wGC9UO,eAAAyB,EAAA5P,CAAA,EAAwCnvB,YAAAA,CAAA,CAAAG,SAAAA,CAAA,CAAA/xF,KAAAA,CAAA,CAAA4wH,yBAAAC,CAAA,CAAmF,EAClI,IAAAD,EAAAC,EACA,IAAAD,EAAA,CACA,IAAA7P,EAAA+P,KAAA,CACA,kFACAF,EAAmC,GAAAG,EAAAvqF,CAAA,EAAuB,CAC1DorD,YAAAA,EACAk/B,MAAA/P,EAAA+P,KAAA,CACAh5C,SAAA,sBACA,EACA,CACA,IAAAk5C,EAAA,OAAoC,GAAAC,EAAA1tH,CAAA,EAASw9G,EAASmQ,EAAA1qF,CAAY,kBAClEl2B,QAAAsgH,EACA1mD,IAAA,CACA,CACAtC,OAAA,EAA2B7rD,KAAA,SAAe,CAC1C/b,KAAA,eACA6oE,QAAA,EAA4B9sD,KAAA,WAAiB,CAAIA,KAAA,WAAiB,CAClE0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACAgX,aAAA,eACAiT,KAAA,CAAe,GAAAgP,EAAAm8E,EAAA,EAAM,GAAAC,EAAAC,CAAA,EAAarxH,IAAA,CAClC4xF,YAAAA,EACAG,SAAAA,CACA,GACA,OAAAi/B,CACA,2BCxDO,SAAAM,EAAAvQ,CAAA,EAA4Cx0C,OAAAA,CAAA,CAAQ,EAC3D,IAAAglD,EAAA,GAMA,MALA,aAAAxQ,EAAAyQ,SAAA,CAAAz1G,IAAA,EACAglG,EAAAyQ,SAAA,CAAAC,UAAA,KAAyCllD,OAAAmlD,CAAA,CAAA31B,SAAAtsF,CAAA,CAAA8uF,OAAAA,CAAA,CAAAizB,UAAAA,CAAA,CAAmD,IAC5F,YAAAjzB,GAAAhyB,IAAAmlD,GACAH,CAAAA,CAAA,CAAA9hH,EAAA,CAAA+hH,EAAA3gC,OAAA,CACA,GACA,GAAA0gC,CAAA,CAAA9hH,EAAA,EAAAsxG,EAAAlwB,OAAA,CCUO,eAAA8gC,EAAA5Q,CAAA,EACP,IAAAjf,EAAuBwvB,EAAwBvQ,EAAA,CAC/Cx0C,OAAA,oBACA,GACA98D,EAAA,MAAAsxG,EAAAlwB,OAAA,EACAtkB,OAAA,oBACA,GACA,OAAa98D,GAAAA,EAAAohF,QAAAiR,EAAAryF,GAAAsM,KAAA,QACb,0BC7BO,OAAA61G,UAA0CvyF,EAAAkV,CAAS,CAC1Dx0C,YAAAgc,CAAA,EACA,sBAA8BA,EAAK,sBACnC7a,OAAAC,cAAA,cACAmR,WAAA,GACAD,aAAA,GACAD,SAAA,GACA/Q,MAAA,6BACA,EACA,CACA,sECHA,IAAAwwH,EAAA,mCACO,SAAAC,GAAAC,CAAA,EACP,IAAY7nD,IAAAA,CAAA,CAAAqT,UAAAA,CAAA,CAAAv3C,KAAAA,CAAA,EAAuB+rF,EACnCC,EAAA9nD,CAAA,IACA,GAAAqT,EAAA,CACA,IAAAhsD,EAAqB,GAAA0gG,EAAAC,EAAA,EAAU,CAAGhoD,IAAAA,EAAAlqE,KAAAu9E,CAAA,GAClC,IAAAhsD,EACA,UAAsB4gG,EAAAC,EAAqB,CAAA70C,EAAA,CAAcs0C,SAAAA,CAAA,GACzDG,EAAAzgG,CACA,CACA,GAAAygG,UAAAA,EAAAj2G,IAAA,CACA,UAAkBo2G,EAAAC,EAAqB,CAAAhuH,KAAAA,EAAA,CAAcytH,SAAAA,CAAA,GACrD,IAAAQ,EAAuB,GAAAC,EAAAnsH,CAAA,EAAa6rH,GACpCv4E,EAAsB,GAAA84E,EAAAhzH,CAAA,EAAe8yH,GACrCvlD,EAAA,GACA,GAAA9mC,GAAA,WAAAgsF,EAAA,CACA,IAAAQ,EAAAR,EAAApqD,MAAA,EAAA/rC,OAAA,eAAAoyB,GAAAA,EAAA6Y,OAAA,EACA2rD,EAAAxnH,MAAA8J,OAAA,CAAAixB,GACAA,EACA9kC,OAAAm6D,MAAA,CAAAr1B,GAAA7lC,MAAA,GACAqyH,GAAA/2G,IAAA,GAAAuqB,CAAA,CAAAhgC,EAAAhG,IAAA,OACA,GACAyyH,EAAAtyH,MAAA,IACA2sE,CAAAA,EACA0lD,GAAA/2G,IAAA,CAAAwyC,EAAA5qD,IACA,MAAA0R,OAAA,CAAA09G,CAAA,CAAApvH,EAAA,EACAovH,CAAA,CAAApvH,EAAA,CAAAoY,GAAA,EAAAtQ,EAAA/E,IAAAssH,GAAA,CAAkEzkE,MAAAA,EAAA5sD,MAAAoxH,CAAA,CAAApvH,EAAA,CAAA+C,EAAA,IAClEqsH,CAAA,CAAApvH,EAAA,CAAAqvH,GAAA,CAAkDzkE,MAAAA,EAAA5sD,MAAAoxH,CAAA,CAAApvH,EAAA,GAAwB,OACzD,GAEjB,CACA,OAAAo2C,KAAAqzB,EAAA,CAEA,SAAA4lD,GAAA,CAAqBzkE,MAAAA,CAAA,CAAA5sD,MAAAA,CAAA,CAAe,EACpC,GAAA4sD,WAAAA,EAAAlyC,IAAA,EAAAkyC,UAAAA,EAAAlyC,IAAA,CACA,MAAe,GAAAixD,EAAAm6C,CAAA,EAAU,GAAA/+G,EAAAuqH,EAAA,EAAOtxH,IAChC,GAAA4sD,UAAAA,EAAAlyC,IAAA,EAAAkyC,EAAAlyC,IAAA,CAAAsd,KAAA,qBACA,UAAkBu4F,EAA2B3jE,EAAAlyC,IAAA,EAC7C,MAAW,GAAA62G,EAAAhjF,CAAA,EAAmB,CAAAqe,EAAA,EAAA5sD,EAAA,CAC9B,CCtBO,eAAAwxH,GAAA9R,CAAA,CAAAgR,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAA45D,IAAAA,CAAA,CAAAlkC,KAAAA,CAAA,CAAAu3C,UAAAA,CAAA,CAAAtB,UAAAA,CAAA,CAAAplE,OAAAA,CAAA,CAAAqlE,QAAAA,CAAA,EAA4D61C,EACxEjwB,EAAuBwvB,EAAwBvQ,EAAA,CAC/Cx0C,OAAA,eACA,GACAO,EAAAyQ,EACUu0C,GAAiB,CAC3B5nD,IAAAA,EACAlkC,KAAAA,EACAu3C,UAAAA,CACA,GACAn5E,KAAAA,EACAqL,EAAA,MAAAsxG,EAAAlwB,OAAA,EACAtkB,OAAA,gBACArd,OAAA,CACA,CACA5+C,QAAAA,EACA2rE,UAAA,iBAAAA,EAA2D,GAAAjnC,EAAA89E,EAAA,EAAW72C,GAAAA,EACtEC,QAAA,iBAAAA,EAAuD,GAAAlnC,EAAA89E,EAAA,EAAW52C,GAAAA,EAClEpP,OAAAA,CACA,EACA,GAEA,OACA5C,IAAAA,EACAlkC,KAAAA,EACAu3C,UAAAA,EACA9tE,GAAAA,EACAohF,QAAAiR,EAAAryF,GACAoH,OAAAk8G,CAAAA,CAAAl8G,EACAkF,KAAA,OACA,CACA,CC/BO,eAAAi3G,GAAAjS,CAAA,EAA2CzwG,QAAAA,CAAA,CAAA01B,KAAAA,CAAA,CAAA6yC,MAAAA,CAAA,CAAA7O,OAAAipD,CAAA,CAAAh3C,UAAAA,CAAA,CAAAplE,OAAAA,CAAA,CAAAqlE,QAAAA,CAAA,EAAqE,EAAI,EAC3H,IAAAlS,EAAAipD,GAAAp6C,CAAAA,EAAA,CAAAA,EAAA,CAAAz0E,KAAAA,CAAA,EACA09F,EAAuBwvB,EAAwBvQ,EAAA,CAC/Cx0C,OAAA,eACA,GACAO,EAAA,GACA9C,IAOA8C,EAAA,CANA9C,EAAAw9C,OAAA,IAAkDsK,GAAiB,CACnE5nD,IAAA,CAAA2O,EAAA,CACA0E,UAAA1E,EAAA74E,IAAA,CACAgmC,KAAAA,CACA,IAEA,CACA6yC,GACA/L,CAAAA,EAAAA,CAAA,MAEA,IAAAr9D,EAAA,MAAAsxG,EAAAlwB,OAAA,EACAtkB,OAAA,gBACArd,OAAA,CACA,CACA5+C,QAAAA,EACA2rE,UAAA,iBAAAA,EAA2D,GAAAjnC,EAAA89E,EAAA,EAAW72C,GAAAA,EACtEC,QAAA,iBAAAA,EAAuD,GAAAlnC,EAAA89E,EAAA,EAAW52C,GAAAA,EAClE,GAAApP,EAAA3sE,MAAA,EAAsC2sE,OAAAA,CAAA,EAAS,EAAI,EAEnD,GAEA,OACA5C,IAAAF,EACAhkC,KAAAA,EACAu3C,UAAA1E,EAAAA,EAAA74E,IAAA,CAAAoE,KAAAA,EACA63E,UAAAA,EACAxsE,GAAAA,EACAohF,QAAAiR,EAAAryF,GACAoH,OAAAk8G,CAAAA,CAAAl8G,EACAqlE,QAAAA,EACAngE,KAAA,OACA,CACA,CC3CO,eAAAm3G,GAAAnS,CAAA,EACP,IAAAjf,EAAuBwvB,EAAwBvQ,EAAA,CAC/Cx0C,OAAA,iCACA,GACA98D,EAAA,MAAAsxG,EAAAlwB,OAAA,EACAtkB,OAAA,iCACA,GACA,OAAa98D,GAAAA,EAAAohF,QAAAiR,EAAAryF,GAAAsM,KAAA,cACb,oDCEO,eAAAo3G,GAAApS,CAAA,CAAAgR,CAAA,EACP,IAAY7nD,IAAAA,CAAA,CAAA55D,QAAAA,CAAA,CAAA01B,KAAAA,CAAA,CAAAjT,aAAAA,CAAA,IAAA89D,EAAA,CAA+CkhC,EAC3D7pH,EAAiB,GAAAmkE,GAAAtmE,CAAA,EAAkB,CACnCmkE,IAAAA,EACAlkC,KAAAA,EACAjT,aAAAA,CACA,GACA,IAMA,OALA,MAA0B,GAAAk+F,EAAA1tH,CAAA,EAASw9G,EAASvpC,GAAAztC,CAAW,iBACvD7hC,KAAAA,EACAgB,GAAAoH,EACA,GAAAugF,CAAA,EAGA,CACA,MAAA7hF,EAAA,CACA,IAAAw8F,EAAA3a,EAAA2a,OAAA,CAA0C,GAAA4nB,GAAA/B,CAAA,EAAYxgC,EAAA2a,OAAA,EAAApnG,KAAAA,CACtD,MAAc,GAAAivH,GAAArpF,CAAA,EAAgBh7B,EAAA,CAC9Bk7D,IAAAA,EACA55D,QAAAA,EACA01B,KAAAA,EACA6rF,SAAA,qCACA9+F,aAAAA,EACA09D,OAAA+a,GAAAl7F,OACA,EACA,CACA,yCCtCO,eAAAgjH,GAAAvS,CAAA,EAIP,OAAAl+G,OAHA,MAAAk+G,EAAAlwB,OAAA,EACAtkB,OAAA,iBACA,GAEA,sCCAO,eAAAgnD,GAAAxS,CAAA,EAAkD9uB,UAAAA,CAAA,CAAAL,YAAAA,CAAA,CAAAG,SAAAA,EAAA,UAA+C,EAAI,MAE5GhxE,EADA,IAAAyyG,EAAA5hC,KAAAxtF,IAAAwtF,EAAuD,GAAA58C,EAAA89E,EAAA,EAAWlhC,GAAAxtF,KAAAA,EAclE,OAXA2c,EADAkxE,EACA,MAAA8uB,EAAAlwB,OAAA,EACAtkB,OAAA,qCACArd,OAAA,CAAA+iC,EAAA,EACS,CAAIwhC,OAAA,KAGb,MAAA1S,EAAAlwB,OAAA,EACAtkB,OAAA,uCACArd,OAAA,CAAAskE,GAAAzhC,EAAA,EACS,CAAI0hC,OAAAV,CAAAA,CAAAS,CAAA,GAEF,GAAAvhF,GAAAyhF,EAAA,EAAW3yG,EACtB,gBCjBO,eAAAs6D,GAAA0lC,CAAA,EAAiCzwG,QAAAA,CAAA,CAAAshF,YAAAA,CAAA,CAAAG,SAAAA,EAAA,SAA2C,EACnF,IAAAyhC,EAAA5hC,KAAAxtF,IAAAwtF,EAAuD,GAAA58C,EAAA89E,EAAA,EAAWlhC,GAAAxtF,KAAAA,EAClEkH,EAAA,MAAAy1G,EAAAlwB,OAAA,EACAtkB,OAAA,cACArd,OAAA,CAAA5+C,EAAAkjH,GAAAzhC,EAAA,EACK,CAAI0hC,OAAAV,CAAAA,CAAAS,CAAA,GACT,GAAAloH,OAAAA,EAEA,OAAAA,CACA,yCC3BA,IAAMqoH,GAAQ,gCACP,SAAAtmD,GAAA0kD,CAAA,EACP,IAAY7nD,IAAAA,CAAA,CAAAhiE,KAAAA,CAAA,CAAA2O,OAAA+8G,CAAA,CAAA9mD,OAAAA,CAAA,EAAsCilD,EAClDl7G,EAAA+8G,GAAA,GACA,CAAAn6E,EAAA,GAAAo6E,EAAA,CAAA/mD,EACA,IAAArzB,EACA,UAAkB04E,EAAA2B,EAAiC,EAAGjC,SAAQ8B,EAAA,GAC9D,IAAA3B,EAAA9nD,EAAA4gD,IAAA,IAAA9kH,UAAAA,EAAA+V,IAAA,EACA09B,IAAsB,GAAA84E,EAAAhzH,CAAA,EAAgB,GAAA+yH,EAAAnsH,CAAA,EAAaH,KACnD,IAAAgsH,CAAAA,GAAA,SAAAA,CAAA,GAAAA,UAAAA,EAAAj2G,IAAA,CACA,UAAkBo2G,EAAA4B,EAA8B,CAAAt6E,EAAA,CAAco4E,SAAQ8B,EAAA,GACtE,IAAY3zH,KAAAA,CAAA,CAAA4nE,OAAAA,CAAA,EAAeoqD,EAC3BgC,EAAApsD,GAAA/uB,KAAA,cAAA7yC,GAAAA,EAAAhG,IAAA,GACAgmC,EAAAguF,EAAA,MAEAxB,EAAA5qD,EAAA/rC,MAAA,gBAAA71B,GAAAA,EAAA8gE,OAAA,EACA,QAAAzjE,EAAA,EAAoBA,EAAAmvH,EAAAryH,MAAA,CAA0BkD,IAAA,CAC9C,IAAA4qD,EAAAukE,CAAA,CAAAnvH,EAAA,CACAmmE,EAAAqqD,CAAA,CAAAxwH,EAAA,CACA,IAAAmmE,EACA,UAAsB2oD,EAAA3tF,EAAuB,EAC7CwtF,QAAAA,EACA/jE,MAAAA,CACA,EACAjoB,CAAAA,CAAA,CAAAguF,EAAA3wH,EAAA4qD,EAAAjuD,IAAA,EAAAqD,EAAA,CAAA4wH,SA8CA,CAAuBhmE,MAAAA,CAAA,CAAA5sD,MAAAA,CAAA,CAAc,QACrC,WAAA4sD,EAAAlyC,IAAA,EACAkyC,UAAAA,EAAAlyC,IAAA,EACAkyC,UAAAA,EAAAlyC,IAAA,EACAkyC,EAAAlyC,IAAA,CAAAsd,KAAA,qBACAh4B,EAEA6yH,CADuB,GAAAC,GAAAtqF,CAAA,EAAmB,CAAAokB,EAAA,CAAA5sD,IAAA,GAC1C,KArDA,CAA8D4sD,MAAAA,EAAA5sD,MAAAmoE,CAAA,EAC9D,CAEA,IAAA4qD,EAAAxsD,EAAA/rC,MAAA,kBAAA71B,GAAAA,EAAA8gE,OAAA,GACA,GAAAstD,EAAAj0H,MAAA,IACA,GAAA+H,GAAAA,OAAAA,EACA,IACA,IAAAmsH,EAAoC,GAAAF,GAAAtqF,CAAA,EAAmBuqF,EAAAlsH,GACvD,GAAAmsH,GACA,GAAAL,EACAhuF,EAAA,IAAAA,KAAAquF,EAAA,MAEA,QAAAhxH,EAAA,EAAwCA,EAAA+wH,EAAAj0H,MAAA,CAA6BkD,IACrE2iC,CAAA,CAAAouF,CAAA,CAAA/wH,EAAA,CAAArD,IAAA,EAAAq0H,CAAA,CAAAhxH,EAAA,CAIA,CACA,MAAAwpH,EAAA,CACA,GAAAh2G,EAAA,CACA,GAAAg2G,aAAuCsF,EAAAmC,EAAgC,EACvEzH,aAAuC0H,GAAAC,EAAwB,CAC/D,UAAkCrC,EAAAsC,EAAqB,EACvDzC,QAAAA,EACA9pH,KAAAA,EACAgnD,OAAAklE,EACAnjG,KAAkC,GAAAA,GAAA4R,CAAA,EAAI36B,EACtC,EACA,OAAA2kH,CACA,CACA,MAEA,GAAAh2G,EACA,UAAsBs7G,EAAAsC,EAAqB,EAC3CzC,QAAAA,EACA9pH,KAAA,KACAgnD,OAAAklE,EACAnjG,KAAA,CACA,GAGA,OACAssD,UAAAv9E,EACAgmC,KAAA9kC,OAAAm6D,MAAA,CAAAr1B,GAAA7lC,MAAA,GAAA6lC,EAAA5hC,KAAAA,CACA,CACA,CChDO,SAAAswH,GAAA,CAA0BxqD,IAAAA,CAAA,CAAAqT,UAAAA,CAAA,CAAAG,KAAAA,CAAA,CAAA7mE,OAAAA,EAAA,GAAsC,EACvE,OAAA6mE,EACAjiE,GAAA,KACA,IACA,IAAAo9D,EAA0BxL,GAAc,CACxC,GAAAl+D,CAAA,CACA+6D,IAAAA,EACArzD,OAAAA,CACA,GACA,GAAA0mE,GAAA,CAAAA,EAAAn9E,QAAA,CAAAy4E,EAAA0E,SAAA,EACA,YACA,OAAqB,GAAA1E,CAAA,IAAA1pE,CAAA,CACrB,CACA,MAAA09G,EAAA,CACA,IAAAtvC,EACAy2C,EACA,GAAAnH,aAA+BsF,EAAA4B,EAA8B,CAC7D,YACA,GAAAlH,aAA+BsF,EAAAsC,EAAqB,EACpD5H,aAA+BsF,EAAA3tF,EAAuB,EAEtD,GAAA3tB,EACA,YACA0mE,EAAAsvC,EAAAmF,OAAA,CAAAhyH,IAAA,CACAg0H,EAAAnH,EAAAmF,OAAA,CAAApqD,MAAA,EAAA/uB,KAAA,cAAA7yC,GAAAA,EAAAhG,IAAA,EACA,CAEA,OAAqB,GAAAmP,CAAA,CAAA62B,KAAAguF,EAAA,MAAiCz2C,UAAAA,CAAA,CACtD,CACA,GACA1hD,MAAA,CAAAk3F,QACA,iBChCO,eAAA52C,GAAA4kC,CAAA,EAAiCzwG,QAAAA,CAAA,CAAA2hF,UAAAA,CAAA,CAAAhW,UAAAA,CAAA,CAAAC,QAAAA,CAAA,CAAArD,MAAAA,CAAA,CAAA7O,OAAAipD,CAAA,CAAAjtF,KAAAA,CAAA,CAAAnvB,OAAA+8G,CAAA,EAAyF,EAAI,EAErI,IAAA5pD,EAAAipD,GAAAp6C,CAAAA,EAAA,CAAAA,EAAA,CAAAz0E,KAAAA,CAAA,EACA0oE,EAAA,GACA9C,IAOA8C,EAAA,CANA9C,EAAAw9C,OAAA,IAAkDsK,GAAiB,CACnE5nD,IAAA,CAAA2O,EAAA,CACA0E,UAAA1E,EAAA74E,IAAA,CACAgmC,KAAAA,CACA,IAEA,CACA6yC,GACA/L,CAAAA,EAAAA,CAAA,MAsBA,IAAA6nD,EAAAj3C,CAnBAuU,EACA,MAAA8uB,EAAAlwB,OAAA,EACAtkB,OAAA,cACArd,OAAA,EAAuB5+C,QAAAA,EAAAw8D,OAAAA,EAAAmlB,UAAAA,CAAA,EAA4B,GAInD,MAAA8uB,EAAAlwB,OAAA,EACAtkB,OAAA,cACArd,OAAA,CACA,CACA5+C,QAAAA,EACAw8D,OAAAA,EACAmP,UAAA,iBAAAA,EAA+D,GAAAjnC,EAAA89E,EAAA,EAAW72C,GAAAA,EAC1EC,QAAA,iBAAAA,EAA2D,GAAAlnC,EAAA89E,EAAA,EAAW52C,GAAAA,CACtE,EACA,IAGAzgE,GAAA,IAA4C,GAAAm5G,GAAAC,CAAA,EAAS1lH,WACrD,EAEWulH,GAAc,CACzBxqD,IAAAF,EACA0T,KAAAi3C,EACA99G,OAxCA+8G,GAAA,EAyCA,GALAe,CAMA,CCxCO,eAAAG,GAAA/T,CAAA,CAAAgR,CAAA,EACP,IAAY7nD,IAAAA,CAAA,CAAA55D,QAAAA,CAAA,CAAA01B,KAAAA,CAAA,CAAAisD,UAAAA,CAAA,CAAA1U,UAAAA,CAAA,CAAAtB,UAAAA,CAAA,CAAAC,QAAAA,CAAA,CAAArlE,OAAAA,CAAA,EAAwEk7G,EACpFl5C,EAAA0E,EACU,GAAA00C,EAAAC,EAAA,EAAU,CAAGhoD,IAAAA,EAAAlqE,KAAAu9E,CAAA,GACvBn5E,KAAAA,EACA4lE,EAAA,EAEA5lE,KAAAA,EADA8lE,EAAAruC,MAAA,IAAA71B,UAAAA,EAAA+V,IAAA,EAEA,MAAW,GAAAk1G,EAAA1tH,CAAA,EAASw9G,EAAS5kC,GAAO,YACpC7rE,QAAAA,EACA01B,KAAAA,EACAisD,UAAAA,EACApZ,MAAAA,EACA7O,OAAAA,EACAiS,UAAAA,EACAC,QAAAA,EACArlE,OAAAA,CACA,EACA,CC9CO,MAAAk+G,WAAwC11F,EAAAkV,CAAS,CACxDx0C,YAAA,CAAkBuQ,QAAAA,CAAA,CAAS,EAC3B,8CAAsDA,EAAQ,KAC9D0kH,aAAA,CACA,eACA,8CAA8D1kH,EAAQ,IACtE,sDACA,2EACA,GAEApP,OAAAC,cAAA,cACAmR,WAAA,GACAD,aAAA,GACAD,SAAA,GACA/Q,MAAA,2BACA,EACA,CACA,CCiBO,eAAA4zH,GAAAlU,CAAA,CAAAgR,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAA4kH,QAAAA,CAAA,CAAAC,YAAAA,CAAA,EAAgCpD,EAC5C,IACA,IAAA/lC,EAAAhsF,EAAAyQ,EAAAC,EAAA66E,EAAAjsC,EAAA81E,EAAA,OAA6F,GAAAnE,EAAA1tH,CAAA,EAASw9G,EAASmQ,EAAA1qF,CAAY,kBAC3H0jC,IAAAA,GACA55D,QAAAA,EACAyiB,aAAA,eACAmiG,QAAAA,EACAC,YAAAA,CACA,GACA,OACA9kH,OAAA,CACArQ,KAAAA,EACAyQ,QAAAA,EACAC,QAAAlR,OAAAkR,GACA66E,kBAAAA,EACAjsC,KAAAA,CACA,EACA81E,WAAAA,EACAppC,OAAAA,CACA,CACA,CACA,MAAArlD,EAAA,CAEA,GAAA33B,mCAAAA,EAAAhP,IAAA,EACAgP,kCAAAA,EAAAqmH,KAAA,CAAAr1H,IAAA,CACA,UAAsB+0H,GAAyB,CAAGzkH,QAAAA,CAAA,EAElD,OALAq2B,CAMA,CACA,CACA,IAAAujC,GAAA,CACA,CACAtC,OAAA,GACA5nE,KAAA,eACA6oE,QAAA,CACA,CAAc7oE,KAAA,SAAA+b,KAAA,UACd,CAAc/b,KAAA,OAAA+b,KAAA,UACd,CAAc/b,KAAA,UAAA+b,KAAA,UACd,CAAc/b,KAAA,UAAA+b,KAAA,WACd,CAAc/b,KAAA,oBAAA+b,KAAA,WACd,CAAc/b,KAAA,OAAA+b,KAAA,WACd,CAAc/b,KAAA,aAAA+b,KAAA,aACd,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CExDO,eAAAu5G,GAAAvU,CAAA,EAAuCwU,WAAAA,CAAA,CAAA3jC,YAAAA,CAAA,CAAAG,SAAAA,EAAA,SAAAyjC,kBAAAA,CAAA,CAAkE,MD1BzGC,EC2BP,IAAAjC,EAAA5hC,EAAyC,GAAA58C,EAAA89E,EAAA,EAAWlhC,GAAAxtF,KAAAA,EASpD,MDnCA,CACA2uF,cAAA0iC,CAFOA,EC4BP,MAAA1U,EAAAlwB,OAAA,EACAtkB,OAAA,iBACArd,OAAA,CACY,GAAAla,EAAA89E,EAAA,EAAWyC,GACvB/B,GAAAzhC,EACAyjC,EACA,EACK,CAAI/B,OAAAV,CAAAA,CAAAS,CAAA,IDjCTzgC,aAAA,CAAAt3E,GAAA,IAAA5Y,OAAAxB,IACAq0H,aAAAD,EAAAC,YAAA,CACAC,YAAA9yH,OAAA4yH,EAAAE,WAAA,EACAC,OAAAH,EAAAG,MAAA,EAAAn6G,IAAA,GAAAm6G,EAAAn6G,GAAA,IAAA5Y,OAAAxB,IACA,CC+BA,CC+CO,eAAAw0H,GAAAC,CAAA,EAA2Cj6F,OAAAA,CAAA,CAAS,EAC3D,IAAAhlB,EAAA,WAAAglB,GAAAA,EAAAhlB,MAAA,CACA6mE,EAAA,MAAA7hD,EAAAg1D,OAAA,EACAtkB,OAAA,uBACArd,OAAA,CAAArzB,EAAApsB,EAAA,IAEA,oBAAAiuE,CAAA,IACA,OAAAA,EACA,IAAAi3C,EAAAj3C,EAAAjiE,GAAA,IAA4C,GAAAm5G,GAAAC,CAAA,EAAS1lH,UACrD,QAAA0sB,GAAAA,EAAAquC,GAAA,CAEWwqD,GAAc,CACzBxqD,IAAAruC,EAAAquC,GAAA,CACAwT,KAAAi3C,EACA99G,OAAAA,CACA,GALA89G,CAMA,CCvEO,eAAAoB,GAAAD,CAAA,EAAwCj6F,OAAAA,CAAA,CAAS,EACxD,IAAAhlB,EAAAglB,EAAAhlB,MAAA,KAKA89G,EAAAj3C,CAJA,MAAA7hD,EAAAg1D,OAAA,EACAtkB,OAAA,oBACArd,OAAA,CAAArzB,EAAApsB,EAAA,GACK,EACLgM,GAAA,IAA4C,GAAAm5G,GAAAC,CAAA,EAAS1lH,WACrD,EAAA+6D,GAAA,CAEWwqD,GAAc,CACzBxqD,IAAAruC,EAAAquC,GAAA,CACAwT,KAAAi3C,EACA99G,OAAAA,CACA,GALA89G,CAMA,gBEhBO,eAAAqB,GAAAjV,CAAA,EAAkCzwG,QAAAA,CAAA,CAAAshF,YAAAA,CAAA,CAAAG,SAAAkkC,CAAA,CAAA91B,YAAAA,CAAA,CAAyD,MDpB3FiR,ECsBP,IAAAoiB,EAAA5hC,KAAAxtF,IAAAwtF,EAAuD,GAAA58C,EAAA89E,EAAA,EAAWlhC,GAAAxtF,KAAAA,EAKlE,MD1BA,IADOgtG,ECuBP,MAAA2P,EAAAlwB,OAAA,EACAtkB,OAAA,eACArd,OAAA,CAAA5+C,EAAA6vF,EAAAqzB,GAJAyC,CAAAA,GAAA,UAIA,EDvBA,CACAr6B,QAAAwV,EAAAxV,OAAA,CAAA/4F,OAAAuuG,EAAAxV,OAAA,EAAAx3F,KAAAA,EACAwM,MAAAwgG,EAAAxgG,KAAA,CAA6B,GAAAqhC,GAAAyhF,EAAA,EAAWtiB,EAAAxgG,KAAA,EAAAxM,KAAAA,EACxC8xH,aAAA9kB,EAAA8kB,YAAA,CAVAA,EAWAA,YAAA,CAXAz6G,GAAA,MACA,GAAA21F,CAAA,CACA/vG,MAAAwB,OAAAuuG,EAAA/vG,KAAA,CACA,IASA+C,KAAAA,CACA,CCoBA,CCVO,eAAA+xH,GAAApV,CAAA,EAAsCzwG,QAAAA,CAAA,CAAAshF,YAAAA,CAAA,CAAAG,SAAAA,EAAA,SAAAqkC,KAAAA,CAAA,CAAiD,EAC9F,IAAA5C,EAAA5hC,KAAAxtF,IAAAwtF,EAAuD,GAAA58C,EAAA89E,EAAA,EAAWlhC,GAAAxtF,KAAAA,EAKlE,OAJA,MAAA28G,EAAAlwB,OAAA,EACAtkB,OAAA,mBACArd,OAAA,CAAA5+C,EAAA8lH,EAAA5C,GAAAzhC,EAAA,EAGA,iBCLO,eAAAskC,GAAAtV,CAAA,EAAqD1gH,KAAAA,CAAA,CAAAi2H,mBAAAA,CAAA,CAA0B,EACtF,IAAA1kC,EAAAv1B,EAAA,OAAAvR,QAAA6F,GAAA,EACQ,GAAAsgE,EAAA1tH,CAAA,EAASw9G,EAASpvB,GAAAl9C,CAAc,uBACxCp0C,EACc,GAAA4wH,EAAA1tH,CAAA,EAASw9G,EAAS9iC,GAAA96C,CAAc,oBAAsB9iC,KAAAA,CAAA,GACpE+D,KAAAA,EACA,EACAmyH,EAAAD,GAAA1kC,aAAAv1B,GAAAu1B,mBACA,EAEAA,EAAA2kC,EAAA,GADA,uDCZO,eAAAC,GAAAV,CAAA,EAA0Cj6F,OAAAA,CAAA,CAAQ,EACzD,OAAAA,EAAAg1D,OAAA,EACAtkB,OAAA,sBACArd,OAAA,CAAArzB,EAAApsB,EAAA,GAEA,iBG3BO,SAAAgiD,GAAA3X,CAAA,CAAA28E,CAAA,EACP,MAAW,GAAAzpD,EAAAm6C,CAAA,EAAUuP,SDCdC,CAAA,EACP,IAAA78E,EACA,iBAAA68E,EACmB,GAAA3hF,EAAA4hF,EAAA,EAAWD,GAC9B,iBAAAA,EAAAvpE,GAAA,CACAupE,EAAAvpE,GAAA,CACe,GAAApY,EAAA1wB,EAAA,EAAUqyG,EAAAvpE,GAAA,EAEzBl3C,EAAmB,GAAA8+B,EAAA4hF,EAAA,EAAW;EAA2B,GAAA3lG,GAAA4R,CAAA,EAAIiX,IAAU,EACvE,MAAW,GAAAsS,GAAAyqE,EAAA,EAAM,CAAA3gH,EAAA4jC,EAAA,CACjB,ECXsCA,GAAA28E,EACtC,oDCCA5zH,OAAA,GACA,IAAA4C,GAAA5C,OAAA,GACA6C,GAAA7C,OAAA,GACO,SAAAjD,GAAAC,CAAA,EACP,OAAAA,aAAAC,YACAD,MAAAA,GAAA,iBAAAA,GAAAA,eAAAA,EAAAE,WAAA,CAAAC,IAAA,CAEO,SAAA82H,GAAAvlG,CAAA,EACP,IAAA3xB,GAAA2xB,GACA,kCACA,CAEA,IAAAvmB,GAAAC,MAAAC,IAAA,EAA2C/K,OAAA,KAAa,CAAAgL,EAAA9H,IAAAA,EAAA+H,QAAA,KAAAC,QAAA,SAIjD,SAAApB,GAAAhK,CAAA,EACP62H,GAAA72H,GAEA,IAAAqL,EAAA,GACA,QAAAjI,EAAA,EAAoBA,EAAApD,EAAAE,MAAA,CAAkBkD,IACtCiI,GAAAN,EAAA,CAAA/K,CAAA,CAAAoD,EAAA,EAEA,OAAAiI,CACA,CAKO,SAAAiiC,GAAAjiC,CAAA,EACP,oBAAAA,EACA,+CAAAA,GAEA,OAAAzI,OAAAyI,KAAAA,EAAA,SAA0CA,EAAI,EAC9C,CAEA,IAAAC,GAAA,CAAiBC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,GAAAC,GAAA,KACjB,SAAAC,GAAAC,CAAA,SACA,GAAAR,GAAAC,EAAA,EAAAO,GAAAR,GAAAE,EAAA,CACAM,EAAAR,GAAAC,EAAA,CACAO,GAAAR,GAAAG,EAAA,EAAAK,GAAAR,GAAAI,EAAA,CACAI,EAAAR,CAAAA,GAAAG,EAAA,KACAK,GAAAR,GAAAK,EAAA,EAAAG,GAAAR,GAAAM,EAAA,CACAE,EAAAR,CAAAA,GAAAK,EAAA,WAEA,CAIO,SAAA5B,GAAAsB,CAAA,EACP,oBAAAA,EACA,+CAAAA,GACA,IAAAU,EAAAV,EAAAnL,MAAA,CACA8L,EAAAD,EAAA,EACA,GAAAA,EAAA,EACA,sEAAAA,GACA,IAAAE,EAAA,IAAApM,WAAAmM,GACA,QAAAE,EAAA,EAAAC,EAAA,EAA6BD,EAAAF,EAASE,IAAAC,GAAA,GACtC,IAAAC,EAAAP,GAAAR,EAAAgB,UAAA,CAAAF,IACAG,EAAAT,GAAAR,EAAAgB,UAAA,CAAAF,EAAA,IACA,GAAAC,KAAAjI,IAAAiI,GAAAE,KAAAnI,IAAAmI,EAEA,2DADAjB,CAAAA,CAAA,CAAAc,EAAA,CAAAd,CAAA,CAAAc,EAAA,IACA,cAAAA,EAEAF,CAAAA,CAAA,CAAAC,EAAA,CAAAE,GAAAA,EAAAE,CACA,CACA,OAAAL,CACA,CAEO,SAAS6qH,GAAe92H,CAAA,EAC/B,OAAAstC,GAAAtjC,GAAAhK,GACA,CACO,SAAS+2H,GAAe/2H,CAAA,EAE/B,OADA62H,GAAA72H,GACAstC,GAAAtjC,GAAAnK,WAAAoL,IAAA,CAAAjL,GAAA+mC,OAAA,IACA,CACO,SAASiwF,GAAe13H,CAAA,CAAA4I,CAAA,EAC/B,OAAA6B,GAAAzK,EAAA6L,QAAA,KAAAC,QAAA,CAAAlD,EAAAA,EAAA,KACA,CACO,SAAAqkC,GAAAjtC,CAAA,CAAA4I,CAAA,EACP,OAAW8uH,GAAe13H,EAAA4I,GAAA6+B,OAAA,EAC1B,CAcO,SAASkwF,GAAWrhH,CAAA,CAAAvK,CAAA,CAAAqiC,CAAA,MAC3BvgC,EACA,oBAAA9B,EACA,IACA8B,EAAApD,GAAAsB,EACA,CACA,MAAAq7B,EAAA,CACA,eAA+B9wB,EAAA,gCAAO,EAAiCvK,EAAI,YAAYq7B,EAAE,EACzF,MAEA,GAAA/mC,GAAA0L,GAGA8B,EAAAtN,WAAAoL,IAAA,CAAAI,QAGA,eAA2BuK,EAAA,iCAAO,GAElC,IAAA1N,EAAAiF,EAAAjN,MAAA,CACA,oBAAAwtC,GAAAxlC,IAAAwlC,EACA,eAA2B93B,EAAA,UAAO,EAAW83B,EAAA,YAAgB,EAAaxlC,EAAI,GAC9E,OAAAiF,CACA,CAIO,SAAS+pH,GAAW,GAAAjqH,CAAA,EAC3B,IAAAC,EAAA,EACA,QAAA9J,EAAA,EAAoBA,EAAA6J,EAAA/M,MAAA,CAAmBkD,IAAA,CACvC,IAAAxD,EAAAqN,CAAA,CAAA7J,EAAA,CACAyzH,GAAAj3H,GACAsN,GAAAtN,EAAAM,MAAA,CAEA,IAAAiN,EAAA,IAAAtN,WAAAqN,GACA,QAAA9J,EAAA,EAAAgK,EAAA,EAA6BhK,EAAA6J,EAAA/M,MAAA,CAAmBkD,IAAA,CAChD,IAAAxD,EAAAqN,CAAA,CAAA7J,EAAA,CACA+J,EAAA1E,GAAA,CAAA7I,EAAAwN,GACAA,GAAAxN,EAAAM,MAAA,CAEA,OAAAiN,CACA,CAEO,SAAAigC,GAAAxtC,CAAA,CAAAF,CAAA,EACP,GAAAE,EAAAM,MAAA,GAAAR,EAAAQ,MAAA,CACA,SACA,IAAA2M,EAAA,EACA,QAAAzJ,EAAA,EAAoBA,EAAAxD,EAAAM,MAAA,CAAckD,IAClCyJ,GAAAjN,CAAA,CAAAwD,EAAA,CAAA1D,CAAA,CAAA0D,EAAA,CACA,OAAAyJ,IAAAA,CACA,CAsCO,IAAAg/B,GAAA,IAAApmC,IAAA7C,OAAAtD,EAAA,IAAAkG,GAEPmoC,GAAA,OAAA9tC,WAAAoI,GACA2lC,GAAA,GAAA/tC,WAAAoL,IAAA,CAAAT,GAQO,SAAAyiC,GAAAL,CAAA,CAAAiB,CAAA,CAAAC,CAAA,EACP,oBAAAlB,GAAAA,EAAA,EACA,wCACA,oBAAAiB,GAAAA,EAAA,EACA,yCACA,sBAAAC,EACA,yCAEA,IAAApE,EAAAiE,GAAAf,GACA76B,EAAA47B,GAAAf,GACAxpC,EAAA,EACA2qC,EAAA,KACArE,EAAAtiC,IAAA,IACA2K,EAAA3K,IAAA,IACAhE,EAAA,CACA,EACA/C,EAAA,IAAAX,IAAAouC,EAAA/7B,EAAA23B,KAAAhqC,GACAsuC,EAAA,CAAAC,EAAAN,IAAA,IAEA57B,EAAA1R,EAAAutC,GAAA,KAAAK,GACAvE,EAAArpC,IACA,IAAA4tC,EAAA/tC,MAAA,GAEA6R,EAAA1R,EAAAutC,GAAA,KAAAK,GACAvE,EAAArpC,IACA,EACA6I,EAAA,KAEA,GAAA9F,KAAA,IACA,uCACA,IAAA8E,EAAA,EACAnH,EAAA,GACA,KAAAmH,EAAA2lC,GAAA,CAEA,IAAAK,EAAAxE,CADAA,EAAArpC,GAAA,EACA4Q,KAAA,GACAlQ,EAAAkF,IAAA,CAAAioC,GACAhmC,GAAAwhC,EAAAxpC,MAAA,CAEA,OAAeg3H,MAAWn2H,EAC1B,EAUA,MATA,CAAAktC,EAAAE,SAGAhhC,EACA,IAHA4gC,IACAC,EAAAC,GAEA,CAAA9gC,CAAAA,EAAAghC,EAAAjlC,IAAA,GACA8kC,IAEA,OADAD,IACA5gC,CACA,CAEA,CAEA,IAAAihC,GAAA,CACAC,OAAA,oBAAA/4B,EACAg5B,SAAA,sBAAAh5B,EACAi5B,QAAA,qBAAAj5B,EACAmJ,OAAA,oBAAAnJ,EACAk5B,mBAAA,oBAAAl5B,GAAA3V,GAAA2V,GACA9V,cAAA,GAAAD,OAAAC,aAAA,CAAA8V,GACArJ,MAAA,GAAAjB,MAAA8J,OAAA,CAAAQ,GACAuxB,MAAA,CAAAvxB,EAAAm5B,IAAAA,EAAArK,EAAA,CAAA0H,OAAA,CAAAx2B,GACAlV,KAAA,sBAAAkV,GAAA/V,OAAAC,aAAA,CAAA8V,EAAA/U,SAAA,CACA,EAEO,SAAA8jC,GAAAoK,CAAA,CAAAC,CAAA,CAAAC,EAAA,EAA8D,EACrE,IAAAC,EAAA,CAAAC,EAAA/yB,EAAAgzB,KACA,IAAAC,EAAAX,EAAA,CAAAtyB,EAAA,CACA,sBAAAizB,EACA,kCAAkDjzB,EAAK,uBACvD,IAAAxG,EAAAm5B,CAAA,CAAAI,EAAA,CACA,GAAAC,CAAAA,CAAAA,GAAAx5B,KAAAnR,IAAAmR,CAAA,GAEA,CAAAy5B,EAAAz5B,EAAAm5B,GACA,6BAA6Cz5B,OAAA65B,GAAkB,GAAGv5B,EAAA,EAAK,EAAG,OAAAA,EAAW,cAAcwG,EAAK,EAExG,EACA,QAAA+yB,EAAA/yB,EAAA,GAAA7a,OAAAyQ,OAAA,CAAAg9B,GACAE,EAAAC,EAAA/yB,EAAA,IACA,QAAA+yB,EAAA/yB,EAAA,GAAA7a,OAAAyQ,OAAA,CAAAi9B,GACAC,EAAAC,EAAA/yB,EAAA,IACA,OAAA2yB,CACA,iBEvRO,IAAA0oF,GAAA,iGGIP,IAAMC,GAAGx0H,OAAA,GAAcy0H,GAAGz0H,OAAA,GAAc00H,GAAG10H,OAAA,GAAAwmC,GAAAxmC,OAAA,GAE3CymC,GAAAzmC,OAAA,GAAA0mC,GAAA1mC,OAAA,GAAA2mC,GAAA3mC,OAAA,GAIO,SAAS20H,GAAG33H,CAAA,CAAAF,CAAA,EACnB,IAAAwR,EAAAtR,EAAAF,EACA,OAAAwR,GAAqBkmH,GAAGlmH,EAAAxR,EAAAwR,CACxB,CAuBO,SAAAg4B,GAAAnjC,CAAA,CAAAyjC,CAAA,CAAAC,CAAA,EACP,IAAAt8B,EAAApH,EACA,KAAAyjC,KAAqB4tF,IACrBjqH,GAAAA,EACAA,GAAAs8B,EAEA,OAAAt8B,CACA,CAEO,SAAA87B,GAAA5pC,CAAA,CAAAoqC,CAAA,EACP,GAAApqC,IAAmB+3H,IAAG3tF,GAAc2tF,GACpC,yDAAqE/3H,EAAA,KAAQ,EAAMoqC,EAAO,GAI1F,IAAA7pC,EAAY23H,GAAGl4H,EAAAoqC,GACf/pC,EAAA+pC,EAEA1jC,EAAYqxH,GAAGpxH,EAAMqxH,GAAG5qG,EAAM4qG,GAAG3tF,EAAM0tF,GACvC,KAAAx3H,IAAiBw3H,IAAG,CAEpB,IAAAztF,EAAAjqC,EAAAE,EACAgqC,EAAAlqC,EAAAE,EACAkS,EAAA/L,EAAA0mB,EAAAkd,EACArqC,EAAA0G,EAAA0jC,EAAAC,CAEAjqC,CAAAA,EAAAE,EAAAA,EAAAgqC,EAAA7jC,EAAA0mB,EAAAzmB,EAAA0jC,EAAAjd,EAAA3a,EAAA43B,EAAApqC,CACA,CAEA,GAAAuqC,IAAgBwtF,GAChB,sCACA,OAAWE,GAAGxxH,EAAA0jC,EACd,CA5DA7mC,OAAA,GAAAA,OAAA,IA0LA,IAAAgoC,GAAA,CACA,kDACA,oCACA,4BACA,CA0EO,SAAAlG,GAAAplC,CAAA,CAAAklC,CAAA,EAEP,IAAA2G,EAAA3G,KAAArgC,IAAAqgC,EAAAA,EAAAllC,EAAA6L,QAAA,IAAAjL,MAAA,CAEA,OAAaskC,WAAA2G,EAAA1G,YADbp8B,KAAA4oB,IAAA,CAAAka,EAAA,EACa,CACb,CAgGO,SAAA9C,GAAA+C,CAAA,EACP,oBAAAA,EACA,0CAEA,OAAA/iC,KAAA4oB,IAAA,CAAAoa,EADAlgC,QAAA,IAAAjL,MAAA,CACA,EACA,CAQO,SAAAkoC,GAAAgD,CAAA,EACP,IAAAlrC,EAAAmoC,GAAA+C,GACA,OAAAlrC,EAAAmI,KAAA4oB,IAAA,CAAA/wB,EAAA,EACA,4BClYO,OAAAq+C,WAAmBruC,GAAAsnH,EAAI,CAC9B13H,YAAAM,CAAA,CAAAo+C,CAAA,EACA,QACA,KAAA39C,QAAA,IACA,KAAAD,SAAA,IACQ,GAAA62H,GAAAC,EAAA,EAAUt3H,GAClB,IAAAoR,EAAoB,GAAAtB,GAAAwiH,EAAA,EAAOl0E,GAE3B,GADA,KAAAC,KAAA,CAAAr+C,EAAAE,MAAA,GACA,wBAAAm+C,KAAA,CAAAz2C,MAAA,CACA,kEACA,MAAAxH,QAAA,MAAAi+C,KAAA,CAAAj+C,QAAA,CACA,KAAAD,SAAA,MAAAk+C,KAAA,CAAAl+C,SAAA,CACA,IAAAC,EAAA,KAAAA,QAAA,CACA4M,EAAA,IAAAvN,WAAAW,GAEA4M,EAAA3E,GAAA,CAAA+I,EAAAtR,MAAA,CAAAM,EAAAJ,EAAAE,MAAA,GAAA0H,MAAA,CAAAwJ,GAAAzI,MAAA,GAAAyI,GACA,QAAApO,EAAA,EAAwBA,EAAAgK,EAAAlN,MAAA,CAAgBkD,IACxCgK,CAAA,CAAAhK,EAAA,KACA,KAAAq7C,KAAA,CAAAz2C,MAAA,CAAAoF,GAEA,KAAAsxC,KAAA,CAAAt+C,EAAAE,MAAA,GAEA,QAAA8C,EAAA,EAAwBA,EAAAgK,EAAAlN,MAAA,CAAgBkD,IACxCgK,CAAA,CAAAhK,EAAA,MACA,KAAAs7C,KAAA,CAAA12C,MAAA,CAAAoF,GACAA,EAAAhG,IAAA,GACA,CACAY,OAAAuiB,CAAA,EAGA,MAFQ,GAAAktG,GAAAE,EAAA,EAAY,MACpB,KAAAl5E,KAAA,CAAAz2C,MAAA,CAAAuiB,GACA,KAEA1hB,WAAA9H,CAAA,EACQ,GAAA02H,GAAAE,EAAA,EAAY,MACZ,GAAAF,GAAAG,EAAA,EAAW72H,EAAA,KAAAR,SAAA,EACnB,KAAAM,QAAA,IACA,KAAA49C,KAAA,CAAA51C,UAAA,CAAA9H,GACA,KAAA29C,KAAA,CAAA12C,MAAA,CAAAjH,GACA,KAAA29C,KAAA,CAAA71C,UAAA,CAAA9H,GACA,KAAA+H,OAAA,EACA,CACAC,QAAA,CACA,IAAAhI,EAAA,IAAAlB,WAAA,KAAA6+C,KAAA,CAAAn+C,SAAA,EAEA,OADA,KAAAsI,UAAA,CAAA9H,GACAA,CACA,CACAiI,WAAAC,CAAA,EAEAA,GAAAA,CAAAA,EAAAhI,OAAAX,MAAA,CAAAW,OAAA09C,cAAA,UAAiE,EACjE,IAAgBD,MAAAA,CAAA,CAAAD,MAAAA,CAAA,CAAA59C,SAAAA,CAAA,CAAAD,UAAAA,CAAA,CAAAJ,SAAAA,CAAA,CAAAD,UAAAA,CAAA,EAAyD,KAQzE,OANA0I,EAAApI,QAAA,CAAAA,EACAoI,EAAArI,SAAA,CAAAA,EACAqI,EAAAzI,QAAA,CAAAA,EACAyI,EAAA1I,SAAA,CAAAA,EACA0I,EAAAy1C,KAAA,CAAAA,EAAA11C,UAAA,CAAAC,EAAAy1C,KAAA,EACAz1C,EAAAw1C,KAAA,CAAAA,EAAAz1C,UAAA,CAAAC,EAAAw1C,KAAA,EACAx1C,CACA,CACAH,SAAA,CACA,KAAAlI,SAAA,IACA,KAAA89C,KAAA,CAAA51C,OAAA,GACA,KAAA21C,KAAA,CAAA31C,OAAA,EACA,CACA,CAOO,IAAA04B,GAAA,CAAAphC,EAAAoR,EAAAqoC,IAAA,IAAA0E,GAAAn+C,EAAAoR,GAAAxJ,MAAA,CAAA6xC,GAAA9wC,MAAA,EACPy4B,CAAAA,GAAAlhC,MAAA,EAAAF,EAAAoR,IAAA,IAAA+sC,GAAAn+C,EAAAoR,GCvEA,IAAMqmH,GAAGj1H,OAAA,GACHk1H,GAAGl1H,OAAA,GAoIF,SAAAk/B,GAAAoC,CAAA,EAYP,OF6DWG,GExEMH,EAAAE,EAAA,CFoEjBwG,GAAAxD,MAAA,EAAA5rB,EAAAlG,KACAkG,CAAA,CAAAlG,EAAA,YACAkG,GARA,CACAmpB,MAAA,SACA2G,KAAA,SACAC,MAAA,gBACAC,KAAA,eACA,IElEInH,GAAcH,EAAA,CAClB5kC,EAAA,SACAe,EAAA,SACAikC,GAAA,QACAC,GAAA,OACA,EAAK,CACLC,WAAA,gBACAC,YAAA,eACA,GAEAxjC,OAAA4gC,MAAA,EACA,GAAW6C,GAAOR,EAAA5kC,CAAA,CAAA4kC,EAAAM,UAAA,EAClB,GAAAN,CAAA,CACa1xB,EAAA0xB,EAAAE,EAAA,CAAAO,KAAA,EAEb,CCxHA,IAAQO,gBAAAoK,EAAA,CAAAvlC,WAAAwlC,EAAA,EAA0CwoF,EAC3C5oF,GAAA,CAEPK,IAAA,cAAAC,MACA3vC,YAAAgS,EAAA,IACA,MAAAA,EACA,CACA,EACA49B,UAAAznC,CAAA,EACA,IAAgBunC,IAAAG,CAAA,EAASR,GACzB,GAAAlnC,EAAA/H,MAAA,IAAA+H,IAAAA,CAAA,IACA,UAAA0nC,EAAA,iCACA,IAAAznC,EAAAD,CAAA,IACAkF,EAAAlF,EAAAS,QAAA,GAAAR,EAAA,GACA,IAAAA,GAAAiF,EAAAjN,MAAA,GAAAgI,EACA,UAAAynC,EAAA,2CAKA,GAAAxiC,IAAAA,CAAA,IACA,UAAAwiC,EAAA,uCACA,GAAAxiC,IAAAA,CAAA,MAAAA,CAAAA,IAAAA,CAAA,KACA,UAAAwiC,EAAA,uDACA,OAAiB/M,EAAA0M,GAAAniC,GAAApK,EAAAkF,EAAAS,QAAA,CAAAR,EAAA,GACjB,EACA0nC,MAAAvkC,CAAA,EAEA,IAAgBmkC,IAAAG,CAAA,EAASR,GACzBlnC,EAAA,iBAAAoD,EAAAkkC,GAAAlkC,GAAAA,EACQwrH,GAAS5uH,GACjB,IAAAlF,EAAAkF,EAAA/H,MAAA,CACA,GAAA6C,EAAA,GAAAkF,IAAAA,CAAA,IACA,UAAA0nC,EAAA,yBACA,GAAA1nC,CAAA,MAAAlF,EAAA,EACA,UAAA4sC,EAAA,uCACA,IAAgB/M,EAAAgH,CAAA,CAAA7mC,EAAA8sC,CAAA,EAAkBV,GAAAO,SAAA,CAAAznC,EAAAS,QAAA,KAClC,CAAgBk6B,EAAAt/B,CAAA,CAAAP,EAAA+sC,CAAA,EAAsBX,GAAAO,SAAA,CAAAG,GACtC,GAAAC,EAAA5vC,MAAA,CACA,UAAAyvC,EAAA,+CACA,OAAiB/F,EAAAA,EAAAtmC,EAAAA,CAAA,CACjB,EACAysC,WAAAC,CAAA,EAEA,IAAA/+B,EAAA,GAAA1R,EAAAA,OAAAyT,QAAA,CAAA1P,CAAA,aAAAA,EAAAA,EACAjD,EAAA,IACA,IAAAgL,EAAA8X,EAAAhY,QAAA,KACA,OAAAE,EAAAA,EAAAnL,MAAA,KAAwCmL,EAAI,EAAAA,CAC5C,EACA/H,EAAA2N,EAAA5Q,EAAA2vC,EAAA1sC,CAAA,GACAsmC,EAAA34B,EAAA5Q,EAAA2vC,EAAApG,CAAA,GACAqG,EAAA3sC,EAAApD,MAAA,GACAgwC,EAAAtG,EAAA1pC,MAAA,GACAguC,EAAA7tC,EAAA4vC,GACAE,EAAA9vC,EAAA6vC,GACA,WAAoB7vC,EAAA6vC,EAAAD,EAAA,GAAiB,IAAIE,EAAG,EAAEvG,EAAE,IAAIsE,EAAG,EAAE5qC,EAAE,EAE3D,EAGM00H,GAAGp1H,OAAA,GAAcq1H,GAAGr1H,OAAA,GAA+Bs1H,IAAdt1H,OAAA,GAAiBA,OAAA,IAAiBA,OAAA,GEtF7E,IAAA63C,GAAA73C,OAAA,sEACA83C,GAAA93C,OAAA,sEACMu1H,GAAGv1H,OAAA,GACHw1H,GAAGx1H,OAAA,GACT+3C,GAAA,CAAA/6C,EAAAF,IAAA,CAAAE,EAAAF,EAAsC04H,EAAA,EAAG14H,EA6BzC0kC,GAAWqE,SLyPJ9D,CAAA,CAAA+G,CAAA,CAAA5jC,EAAA,GAAA6jC,EAAA,EAAsD,EAC7D,GAAAhH,GAAiByyF,GACjB,6CAAyDzyF,EAAM,GAC/D,IAAYH,WAAAgH,CAAA,CAAA/G,YAAA8G,CAAA,EAAuC7G,GAAAC,EAAA+G,GACnD,GAAAH,EAAA,KACA,+DACA,IAAAK,EAAA7C,SAnKOlF,CAAA,EAKP,GAAAA,EAAAwF,KAAAD,GAAA,CAKA,IAAAc,EAAA,CAAArG,EAA4BwzF,EAAA,EAAGhuF,GAC/B,gBAAAjF,CAAA,CAAA9kC,CAAA,EACA,IAAAy9B,EAAAqH,EAAA+E,GAAA,CAAA7pC,EAAA4qC,GAEA,IAAA9F,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAEA,GAAA8G,EAAA0F,KAAAD,GAAA,CACA,IAAAhb,EAAA,CAAAuV,EAAAyF,EAAA,EAAAC,GACA,gBAAAnF,CAAA,CAAA9kC,CAAA,EACA,IAAAgN,EAAA83B,EAAAkD,GAAA,CAAAhoC,EAAiCg4H,IACjC5tF,EAAAtF,EAAA+E,GAAA,CAAA78B,EAAAgiB,GACAoc,EAAAtG,EAAAkD,GAAA,CAAAhoC,EAAAoqC,GACAtmC,EAAAghC,EAAAkD,GAAA,CAAAlD,EAAAkD,GAAA,CAAAoD,EAAwC4sF,IAAG5tF,GAC3C3M,EAAAqH,EAAAkD,GAAA,CAAAoD,EAAAtG,EAAAuG,GAAA,CAAAvnC,EAAAghC,EAAAkG,GAAA,GACA,IAAAlG,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAwBA,OAAAiM,SAhHOnF,CAAA,MAOPiG,EAAAC,EAAAC,EADA,IAAAC,EAAA,CAAApG,EAA2BwzF,EAAA,EAAOC,GAIlC,IAAAxtF,EAAAjG,EAAiBwzF,GAAGttF,EAAA,EAASD,EAAIwtF,KAAQF,GAAKttF,GAAKwtF,GAAGvtF,KAGtD,IAAAC,EAAastF,GAAKttF,EAAAnG,GAAAsF,SArEXhmB,CAAA,CAAAqmB,CAAA,CAAAC,CAAA,EACP,GAAAA,GAAkB2tF,IAAG5tF,EAAY4tF,GACjC,yCACA,GAAA3tF,IAAmB4tF,GACnB,OAAeD,GACf,IAAAjqH,EAAckqH,GACd,KAAA7tF,EAAmB4tF,IACnB5tF,EAAoB6tF,IACpBlqH,CAAAA,EAAA,EAAAgW,EAAAsmB,CAAA,EACAtmB,EAAA,EAAAA,EAAAsmB,EACAD,IAAkB6tF,GAElB,OAAAlqH,CACA,EAwDkB68B,EAAAC,EAAApG,KAAAA,EAAsCwzF,GAAKrtF,KAG7D,GAAAD,IAAAA,EAAA,CACA,IAAAG,EAAA,CAAArG,EAA4BwzF,EAAA,EAAGhuF,GAC/B,gBAAAjF,CAAA,CAAA9kC,CAAA,EACA,IAAAy9B,EAAAqH,EAAA+E,GAAA,CAAA7pC,EAAA4qC,GACA,IAAA9F,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAArN,GAAAz9B,GACA,uCACA,OAAAy9B,CACA,CACA,CAEA,IAAAsN,EAAA,CAAAP,EAAwButF,EAAA,EAAOC,GAC/B,gBAAAlzF,CAAA,CAAA9kC,CAAA,EAEA,GAAA8kC,EAAA+E,GAAA,CAAA7pC,EAAA2qC,KAAA7F,EAAAhC,GAAA,CAAAgC,EAAAkG,GAAA,EACA,uCACA,IAAAV,EAAAG,EAEAQ,EAAAnG,EAAA+E,GAAA,CAAA/E,EAAAkD,GAAA,CAAAlD,EAAAkG,GAAA,CAAAN,GAAAF,GACA/jC,EAAAq+B,EAAA+E,GAAA,CAAA7pC,EAAA+qC,GACA3qC,EAAA0kC,EAAA+E,GAAA,CAAA7pC,EAAAwqC,GACA,MAAA1F,EAAA+F,GAAA,CAAAzqC,EAAA0kC,EAAAkG,GAAA,IACA,GAAAlG,EAAA+F,GAAA,CAAAzqC,EAAA0kC,EAAAzB,IAAA,EACA,OAAAyB,EAAAzB,IAAA,CAEA,IAAA7wB,EAAA,EACA,QAAA04B,EAAApG,EAAAgG,GAAA,CAAA1qC,GACA,EADqCkqC,IACrCxF,EAAA+F,GAAA,CAAAK,EAAApG,EAAAkG,GAAA,EAD4Cx4B,IAG5C04B,EAAApG,EAAAgG,GAAA,CAAAI,GAGA,IAAAC,EAAArG,EAAA+E,GAAA,CAAAoB,EAAiC8sF,IAAGz0H,OAAAgnC,EAAA93B,EAAA,IACpCy4B,EAAAnG,EAAAgG,GAAA,CAAAK,GACA1kC,EAAAq+B,EAAAkD,GAAA,CAAAvhC,EAAA0kC,GACA/qC,EAAA0kC,EAAAkD,GAAA,CAAA5nC,EAAA6qC,GACAX,EAAA93B,CACA,CACA,OAAA/L,CACA,CACA,EAyDA89B,EACA,EA0GAc,GACAzB,EAAAjiC,OAAA4gC,MAAA,EACA8C,MAAAA,EACA6G,KAAAA,EACAD,MAAAA,EACAD,KAAcO,GAAOL,GACrB7I,KAAcy0F,GACd9sF,IAAa+sF,GACb/2H,OAAA,GAAyBi3H,GAAGp0G,EAAAwhB,GAC5BmH,QAAA,IACA,oBAAA3oB,EACA,2DAA+E,OAAAA,EAAW,GAC1F,OAAmBi0G,IAAGj0G,GAAAA,EAAAwhB,CACtB,EACAoG,IAAA,GAAA5nB,IAA8Bi0G,GAC9BrrF,MAAA,IAAA5oB,EAA+Bk0G,EAAA,IAASA,GACxCj1F,IAAA,GAAsBm1F,GAAG,CAAAp0G,EAAAwhB,GACzBwF,IAAA,CAAArR,EAAAC,IAAAD,IAAAC,EACAqR,IAAA,GAAsBmtF,GAAGp0G,EAAAA,EAAAwhB,GACzBhjC,IAAA,CAAAm3B,EAAAC,IAA2Bw+F,GAAGz+F,EAAAC,EAAA4L,GAC9BgG,IAAA,CAAA7R,EAAAC,IAA2Bw+F,GAAGz+F,EAAAC,EAAA4L,GAC9B2C,IAAA,CAAAxO,EAAAC,IAA2Bw+F,GAAGz+F,EAAAC,EAAA4L,GAC9BwE,IAAA,CAAAhmB,EAAAqmB,IAAAX,CArGO,SAAA3F,CAAA,CAAA/f,CAAA,CAAAqmB,CAAA,EAGP,GAAAA,EAAgB4tF,GAChB,kCACA,GAAA5tF,IAAkB4tF,GAClB,OAAAl0F,EAAAoH,GAAA,CACA,GAAAd,IAAkB6tF,GAClB,OAAAl0G,EACA,IAAA3Q,EAAA0wB,EAAAoH,GAAA,CACA1H,EAAAzf,EACA,KAAAqmB,EAAmB4tF,IACnB5tF,EAAoB6tF,IACpB7kH,CAAAA,EAAA0wB,EAAAoE,GAAA,CAAA90B,EAAAowB,EAAA,EACAA,EAAAM,EAAAkH,GAAA,CAAAxH,GACA4G,IAAkB6tF,GAElB,OAAA7kH,CACA,GAmFA0wB,EAAA/f,EAAAqmB,GACAjC,IAAA,CAAAzO,EAAAC,IAA2Bw+F,GAAGz+F,EAAAmQ,GAAAlQ,EAAA4L,GAAAA,GAE9BqH,KAAA,GAAA7oB,EAAAA,EACA8oB,KAAA,CAAAnT,EAAAC,IAAAD,EAAAC,EACAmT,KAAA,CAAApT,EAAAC,IAAAD,EAAAC,EACAoT,KAAA,CAAArT,EAAAC,IAAAD,EAAAC,EACAkS,IAAA,GAAAhC,GAAA9lB,EAAAwhB,GACAyH,KAAAT,EAAAS,IAAA,MAAAR,EAAA1I,EAAA5jC,EAAA,EACA+sC,YAAA,GAAAzD,CAvFO,SAAA1F,CAAA,CAAA2H,CAAA,EACP,IAAAh9B,EAAA,MAAAg9B,EAAA3qC,MAAA,EAEA4qC,EAAAD,EAAAzD,MAAA,EAAAC,EAAAlkB,EAAA/f,IACA,EAAA2nC,GAAA,CAAA5nB,GACAkkB,GACAx5B,CAAA,CAAAzK,EAAA,CAAAikC,EACAnE,EAAAoE,GAAA,CAAAD,EAAAlkB,IACK+f,EAAAoH,GAAA,EAELU,EAAA9H,EAAA+H,GAAA,CAAAH,GAQA,OANAD,EAAAK,WAAA,EAAA7D,EAAAlkB,EAAA/f,IACA,EAAA2nC,GAAA,CAAA5nB,GACAkkB,GACAx5B,CAAA,CAAAzK,EAAA,CAAA8/B,EAAAoE,GAAA,CAAAD,EAAAx5B,CAAA,CAAAzK,EAAA,EACA8/B,EAAAoE,GAAA,CAAAD,EAAAlkB,IACK6nB,GACLn9B,CACA,GAoEAq1B,EAAAlgC,GAGAspC,KAAA,CAAA1sC,EAAAF,EAAAssB,IAAAA,EAAAtsB,EAAAE,EACAuI,QAAA,GAAAL,EAAkCykC,GAAeppB,EAAAooB,GAAeyrF,GAAe7zG,EAAAooB,GAC/EkB,UAAA,IACA,GAAAzsC,EAAAE,MAAA,GAAAqrC,EACA,sCAA0DA,EAAM,QAAQvrC,EAAAE,MAAA,CAAa,GACrF,OAAA4H,EAA0BivH,GAAe/2H,GAAU82H,GAAe92H,EAClE,CACA,GACA,OAAAiB,OAAA4gC,MAAA,CAAAqB,EACA,EK1SgBuX,GAAAt2C,KAAAA,EAAAA,KAAAA,EAAA,CAAqCioC,KAxBrD,SAAApmC,CAAA,EAGA,IAAAojC,EAAAxmC,OAAA,GAAAi4C,EAAAj4C,OAAA,GAAAk4C,EAAAl4C,OAAA,IAAAm4C,EAAAn4C,OAAA,IAEAo4C,EAAAp4C,OAAA,IAAAq4C,EAAAr4C,OAAA,IAAAs4C,EAAAt4C,OAAA,IACAoqB,EAAA,EAAAhnB,EAAAA,EALAy0C,GAMAvtB,EAAA,EAAAF,EAAAhnB,EANAy0C,GAOAU,EAAA,GAAoBjuB,EAAAkc,EAPpBqR,IAOoBvtB,EAPpButB,GAQAW,EAAA,GAAoBD,EAAA/R,EARpBqR,IAQoBvtB,EARpButB,GASAY,EAAA,GAAqBD,EAAKg9E,GAT1B39E,IAS6BztB,EAT7BytB,GAUAa,EAAA,GAAqBD,EAAAP,EAVrBL,IAUqBY,EAVrBZ,GAWAc,EAAA,GAAqBD,EAAAP,EAXrBN,IAWqBa,EAXrBb,GAYAe,EAAA,GAAqBD,EAAAN,EAZrBR,IAYqBc,EAZrBd,GAaAgB,EAAA,GAAsBD,EAAAN,EAbtBT,IAasBe,EAbtBf,GAcAiB,EAAA,GAAsBD,EAAAR,EAdtBR,IAcsBc,EAdtBd,GAeAkB,EAAA,GAAsBD,EAAAtS,EAftBqR,IAesBvtB,EAftButB,GAgBArH,EAAA,GAAoBuI,EAAAX,EAhBpBP,IAgBoBa,EAhBpBb,GAiBAjQ,EAAA,GAAoB4I,EAAAyH,EAjBpBJ,IAiBoBztB,EAjBpBytB,GAkBA1d,EAAiBmM,GAAIsB,EAAK4tF,GAlB1B39E,IAmBA,IAAArW,GAAA+F,GAAA,CAAA/F,GAAAgG,GAAA,CAAArN,GAAA/2B,GACA,uCACA,OAAA+2B,CACA,CACqD,GAC9Csd,GAAkBjZ,SD9BlBM,CAAA,CAAAC,CAAA,EACP,IAAArhC,EAAA,GAA6BshC,CD0gBtB,SAAAF,CAAA,EACP,IAAA0O,EAAA6F,SAdA/R,CAAA,EACA,IAAA56B,EAAiBw4B,GAAaoC,GAU9B,OATIG,GAAiB/6B,EAAA,CACrBlJ,KAAA,OACAohC,KAAA,WACAh4B,YAAA,UACA,EAAK,CACL0sC,SAAA,WACAC,cAAA,WACAC,KAAA,SACA,GACAn1C,OAAA4gC,MAAA,EAA2BuU,KAAA,MAAA9sC,CAAA,EAC3B,EAEAo4B,GACA,CAAY0C,GAAAA,CAAA,CAAA9kC,EAAA+2C,CAAA,EAAqBjG,EACjCkG,EAAAlS,EAAAmH,KAAA,GACAgL,EAAA,EAAAnS,EAAAmH,KAAA,GAIA,SAAAiL,EAAA52C,CAAA,EACA,OAAe23H,GAAO33H,EAAAy2C,EACtB,CAIA,IAAYpB,gBAAAzN,CAAA,CAAA8J,uBAAAA,CAAA,CAAAL,oBAAAA,CAAA,CAAAG,mBAAAA,CAAA,EAA2FlC,SAtchG5lC,CAAA,EACP,IAAA8mC,EAAAC,SA1FAnM,CAAA,EACA,IAAA56B,EAAiBw4B,GAAaoC,GAC1BG,GAAiB/6B,EAAA,CACrB1J,EAAA,QACAF,EAAA,OACA,EAAK,CACL4wC,yBAAA,QACAC,eAAA,UACAC,cAAA,WACAzI,cAAA,WACA0I,mBAAA,UACAhE,UAAA,WACAtkC,QAAA,UACA,GACA,IAAYuoC,KAAAA,CAAA,CAAAtM,GAAAA,CAAA,CAAAxkC,EAAAA,CAAA,EAAc0J,EAC1B,GAAAonC,EAAA,CACA,IAAAtM,EAAA+F,GAAA,CAAAvqC,EAAAwkC,EAAAzB,IAAA,EACA,iFAEA,oBAAA+N,GACA,iBAAAA,EAAAC,IAAA,EACA,mBAAAD,EAAAE,WAAA,CACA,gFAEA,CACA,OAAA3vC,OAAA4gC,MAAA,EAA2B,GAAAv4B,CAAA,EAC3B,EAgEAA,GACA,CAAY86B,GAAAA,CAAA,EAAKgM,EACjBjoC,EAAAioC,EAAAjoC,OAAA,EACA,EAAA0oC,EAAAC,EAAAC,KACA,IAAAnxC,EAAAkxC,EAAAE,QAAA,GACA,OAAmBkmF,GAAcr3H,WAAAoL,IAAA,MAAAm5B,EAAAj8B,OAAA,CAAAvI,EAAAmG,CAAA,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAoG,CAAA,EACjC,GACAymC,EAAA2D,EAAA3D,SAAA,EACA,KAEA,IAAAze,EAAAhuB,EAAA0I,QAAA,IAIA,OAAqB3C,EAFrBq+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,GAAA07B,EAAAmH,KAAA,GAEqBvlC,EADrBo+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,CAAA07B,EAAAmH,KAAA,GAAAnH,EAAAmH,KAAA,EACqB,CACrB,GAKA,SAAA0F,EAAAlrC,CAAA,EACA,IAAgBnG,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAO0wC,EACvBc,EAAA9M,EAAAgG,GAAA,CAAArkC,GACAorC,EAAA/M,EAAAkD,GAAA,CAAA4J,EAAAnrC,GACA,OAAAq+B,EAAAziC,GAAA,CAAAyiC,EAAAziC,GAAA,CAAAwvC,EAAA/M,EAAAkD,GAAA,CAAAvhC,EAAAnG,IAAAF,EACA,CAKA,IAAA0kC,EAAA+F,GAAA,CAAA/F,EAAAgG,GAAA,CAAAgG,EAAA7L,EAAA,EAAA0M,EAAAb,EAAA9L,EAAA,GACA,2DAEA,SAAA8M,EAAAjuB,CAAA,EACA,uBAAAA,GAA0C60G,GAAG70G,GAAAA,EAAAitB,EAAA9wC,CAAA,CAE7C,SAAA+xC,EAAAluB,CAAA,EACA,IAAAiuB,EAAAjuB,GACA,0DACA,CAGA,SAAAmuB,EAAA9/B,CAAA,MAUA2R,EATA,IAAgBmtB,yBAAArwC,CAAA,CAAAwkC,YAAAA,CAAA,CAAA8L,eAAAA,CAAA,CAAAjxC,EAAAA,CAAA,EAAoE8wC,EACpF,GAAAnwC,GAAA,iBAAAuR,EAAA,CAIA,GAHgB7R,GAAU6R,IAC1BA,CAAAA,EAAsBxH,GAAawH,EAAA,EAEnC,iBAAAA,GAAA,CAAAvR,EAAAE,QAAA,CAAAqR,EAAAtR,MAAA,EACA,2BACAsR,EAAAA,EAAApG,QAAA,CAAAq5B,EAAAA,EAAA,IACA,CAEA,IACAthB,EACA,iBAAA3R,EACAA,EACsBslH,GAAmBG,GAAW,cAAAzlH,EAAAizB,GACpD,CACA,MAAA11B,EAAA,CACA,mCAAmD01B,EAAA,2BAAa,EAA4B,OAAAjzB,EAAW,EACvG,CAIA,OAHA++B,GACAptB,CAAAA,EAAkBo0G,GAAOp0G,EAAA7jB,EAAA,EACzB+xC,EAAAluB,GACAA,CACA,CACA,IAAAouB,EAAA,IAAAC,IACA,SAAAC,EAAAC,CAAA,EACA,IAAAA,CAAAA,aAAAlK,CAAA,EACA,uCACA,CAMA,MAAAA,EACA1nC,YAAA6xC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAIA,GAHA,KAAAF,EAAA,CAAAA,EACA,KAAAC,EAAA,CAAAA,EACA,KAAAC,EAAA,CAAAA,EACAF,MAAAA,GAAA,CAAAvN,EAAA0H,OAAA,CAAA6F,GACA,0BACA,GAAAC,MAAAA,GAAA,CAAAxN,EAAA0H,OAAA,CAAA8F,GACA,0BACA,GAAAC,MAAAA,GAAA,CAAAzN,EAAA0H,OAAA,CAAA+F,GACA,yBACA,CAGA,OAAAhK,WAAAr1B,CAAA,EACA,IAAoBzM,EAAAA,CAAA,CAAAC,EAAAA,CAAA,EAAOwM,GAAA,GAC3B,IAAAA,GAAA,CAAA4xB,EAAA0H,OAAA,CAAA/lC,IAAA,CAAAq+B,EAAA0H,OAAA,CAAA9lC,GACA,oCACA,GAAAwM,aAAAg1B,EACA,4CACA,IAAAuD,EAAA,GAAA3G,EAAA+F,GAAA,CAAA/mC,EAAAghC,EAAAzB,IAAA,SAEA,EAAA58B,IAAAglC,EAAA/kC,GACAwhC,EAAA7E,IAAA,CACA,IAAA6E,EAAAzhC,EAAAC,EAAAo+B,EAAAkG,GAAA,CACA,CACA,IAAAvkC,GAAA,CACA,YAAAirC,QAAA,GAAAjrC,CAAA,CAEA,IAAAC,GAAA,CACA,YAAAgrC,QAAA,GAAAhrC,CAAA,CAQA,OAAA8rC,WAAA/O,CAAA,EACA,IAAAgP,EAAA3N,EAAAiI,WAAA,CAAAtJ,EAAAvnB,GAAA,IAAAhJ,EAAAq/B,EAAA,GACA,OAAA9O,EAAAvnB,GAAA,EAAAhJ,EAAApP,IAAAoP,EAAAw+B,QAAA,CAAAe,CAAA,CAAA3uC,EAAA,GAAAoY,GAAA,CAAAgsB,EAAAK,UAAA,CACA,CAKA,OAAAmK,QAAA3mC,CAAA,EACA,IAAAw4B,EAAA2D,EAAAK,UAAA,CAAA4E,EAAiDwqF,GAAW,WAAA5rH,KAE5D,OADAw4B,EAAAmE,cAAA,GACAnE,CACA,CAEA,OAAAoO,eAAAC,CAAA,EACA,OAAA1K,EAAArE,IAAA,CAAAgP,QAAA,CAAAb,EAAAY,GACA,CAEAE,eAAA5P,CAAA,EACA,KAAAwB,YAAA,CAAAxB,EACA+O,EAAAc,MAAA,MACA,CAEArK,gBAAA,CACA,QAAA+C,GAAA,IAIA,GAAAqF,EAAAK,kBAAA,GAAArM,EAAA2G,GAAA,MAAA6G,EAAA,EACA,MACA,+BACA,CAEA,IAAoB7rC,EAAAA,CAAA,CAAAC,EAAAA,CAAA,EAAO,KAAAgrC,QAAA,GAE3B,IAAA5M,EAAA0H,OAAA,CAAA/lC,IAAA,CAAAq+B,EAAA0H,OAAA,CAAA9lC,GACA,wCACA,IAAAuT,EAAA6qB,EAAAgG,GAAA,CAAApkC,GACAyT,EAAAw3B,EAAAlrC,GACA,IAAAq+B,EAAA+F,GAAA,CAAA5wB,EAAAE,GACA,iDACA,SAAA+2B,aAAA,GACA,qDACA,CACA8B,UAAA,CACA,IAAoBtsC,EAAAA,CAAA,EAAI,KAAAgrC,QAAA,GACxB,GAAA5M,EAAA2H,KAAA,CACA,OAAA3H,EAAA2H,KAAA,CAAA/lC,EACA,2CACA,CAIAusC,OAAAb,CAAA,EACAD,EAAAC,GACA,IAAoBC,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7C,CAAoBf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,EAAyBnB,EAC7CoB,EAAA1O,EAAA+F,GAAA,CAAA/F,EAAAkD,GAAA,CAAAkL,EAAAK,GAAAzO,EAAAkD,GAAA,CAAAqL,EAAAD,IACAK,EAAA3O,EAAA+F,GAAA,CAAA/F,EAAAkD,GAAA,CAAAmL,EAAAI,GAAAzO,EAAAkD,GAAA,CAAAsL,EAAAF,IACA,OAAAI,GAAAC,CACA,CAIA1Q,QAAA,CACA,WAAAmF,EAAA,KAAAmK,EAAA,CAAAvN,EAAAhC,GAAA,MAAAwP,EAAA,OAAAC,EAAA,CACA,CAKAhP,QAAA,CACA,IAAoBjjC,EAAAA,CAAA,CAAAF,EAAAA,CAAA,EAAO0wC,EAC3BljB,EAAAkX,EAAAkD,GAAA,CAAA5nC,EAAiCw4H,IACjC,CAAoBvmF,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7CM,EAAA5O,EAAAzB,IAAA,CAAAsQ,EAAA7O,EAAAzB,IAAA,CAAAuQ,EAAA9O,EAAAzB,IAAA,CACAwQ,EAAA/O,EAAAkD,GAAA,CAAAkL,EAAAA,GACAY,EAAAhP,EAAAkD,GAAA,CAAAmL,EAAAA,GACAjI,EAAApG,EAAAkD,GAAA,CAAAoL,EAAAA,GACAW,EAAAjP,EAAAkD,GAAA,CAAAkL,EAAAC,GA4BA,OA3BAY,EAAAjP,EAAAziC,GAAA,CAAA0xC,EAAAA,GACAH,EAAA9O,EAAAkD,GAAA,CAAAkL,EAAAE,GACAQ,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GACAF,EAAA5O,EAAAkD,GAAA,CAAA1nC,EAAAszC,GACAD,EAAA7O,EAAAkD,GAAA,CAAApa,EAAAsd,GACAyI,EAAA7O,EAAAziC,GAAA,CAAAqxC,EAAAC,GACAD,EAAA5O,EAAAuG,GAAA,CAAAyI,EAAAH,GACAA,EAAA7O,EAAAziC,GAAA,CAAAyxC,EAAAH,GACAA,EAAA7O,EAAAkD,GAAA,CAAA0L,EAAAC,GACAD,EAAA5O,EAAAkD,GAAA,CAAA+L,EAAAL,GACAE,EAAA9O,EAAAkD,GAAA,CAAApa,EAAAgmB,GACA1I,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA6I,EAAAjP,EAAAuG,GAAA,CAAAwI,EAAA3I,GACA6I,EAAAjP,EAAAkD,GAAA,CAAA1nC,EAAAyzC,GACAA,EAAAjP,EAAAziC,GAAA,CAAA0xC,EAAAH,GACAA,EAAA9O,EAAAziC,GAAA,CAAAwxC,EAAAA,GACAA,EAAA/O,EAAAziC,GAAA,CAAAuxC,EAAAC,GACAA,EAAA/O,EAAAziC,GAAA,CAAAwxC,EAAA3I,GACA2I,EAAA/O,EAAAkD,GAAA,CAAA6L,EAAAE,GACAJ,EAAA7O,EAAAziC,GAAA,CAAAsxC,EAAAE,GACA3I,EAAApG,EAAAkD,GAAA,CAAAmL,EAAAC,GACAlI,EAAApG,EAAAziC,GAAA,CAAA6oC,EAAAA,GACA2I,EAAA/O,EAAAkD,GAAA,CAAAkD,EAAA6I,GACAL,EAAA5O,EAAAuG,GAAA,CAAAqI,EAAAG,GACAD,EAAA9O,EAAAkD,GAAA,CAAAkD,EAAA4I,GACAF,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GAEA,IAAA1L,EAAAwL,EAAAC,EADAC,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAA,GAEA,CAKAvxC,IAAA+vC,CAAA,EACAD,EAAAC,GACA,IAAoBC,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,CAAAZ,GAAAa,CAAA,EAAyB,KAC7C,CAAoBf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,CAAAf,GAAAgB,CAAA,EAAyBnB,EAC7CsB,EAAA5O,EAAAzB,IAAA,CAAAsQ,EAAA7O,EAAAzB,IAAA,CAAAuQ,EAAA9O,EAAAzB,IAAA,CACA/iC,EAAAwwC,EAAAxwC,CAAA,CACAstB,EAAAkX,EAAAkD,GAAA,CAAA8I,EAAA1wC,CAAA,CAAuCw4H,IACvC/kF,EAAA/O,EAAAkD,GAAA,CAAAkL,EAAAG,GACAS,EAAAhP,EAAAkD,GAAA,CAAAmL,EAAAG,GACApI,EAAApG,EAAAkD,GAAA,CAAAoL,EAAAG,GACAQ,EAAAjP,EAAAziC,GAAA,CAAA6wC,EAAAC,GACAa,EAAAlP,EAAAziC,GAAA,CAAAgxC,EAAAC,GACAS,EAAAjP,EAAAkD,GAAA,CAAA+L,EAAAC,GACAA,EAAAlP,EAAAziC,GAAA,CAAAwxC,EAAAC,GACAC,EAAAjP,EAAAuG,GAAA,CAAA0I,EAAAC,GACAA,EAAAlP,EAAAziC,GAAA,CAAA6wC,EAAAE,GACA,IAAAa,EAAAnP,EAAAziC,GAAA,CAAAgxC,EAAAE,GA+BA,OA9BAS,EAAAlP,EAAAkD,GAAA,CAAAgM,EAAAC,GACAA,EAAAnP,EAAAziC,GAAA,CAAAwxC,EAAA3I,GACA8I,EAAAlP,EAAAuG,GAAA,CAAA2I,EAAAC,GACAA,EAAAnP,EAAAziC,GAAA,CAAA8wC,EAAAC,GACAM,EAAA5O,EAAAziC,GAAA,CAAAixC,EAAAC,GACAU,EAAAnP,EAAAkD,GAAA,CAAAiM,EAAAP,GACAA,EAAA5O,EAAAziC,GAAA,CAAAyxC,EAAA5I,GACA+I,EAAAnP,EAAAuG,GAAA,CAAA4I,EAAAP,GACAE,EAAA9O,EAAAkD,GAAA,CAAA1nC,EAAA0zC,GACAN,EAAA5O,EAAAkD,GAAA,CAAApa,EAAAsd,GACA0I,EAAA9O,EAAAziC,GAAA,CAAAqxC,EAAAE,GACAF,EAAA5O,EAAAuG,GAAA,CAAAyI,EAAAF,GACAA,EAAA9O,EAAAziC,GAAA,CAAAyxC,EAAAF,GACAD,EAAA7O,EAAAkD,GAAA,CAAA0L,EAAAE,GACAE,EAAAhP,EAAAziC,GAAA,CAAAwxC,EAAAA,GACAC,EAAAhP,EAAAziC,GAAA,CAAAyxC,EAAAD,GACA3I,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA8I,EAAAlP,EAAAkD,GAAA,CAAApa,EAAAomB,GACAF,EAAAhP,EAAAziC,GAAA,CAAAyxC,EAAA5I,GACAA,EAAApG,EAAAuG,GAAA,CAAAwI,EAAA3I,GACAA,EAAApG,EAAAkD,GAAA,CAAA1nC,EAAA4qC,GACA8I,EAAAlP,EAAAziC,GAAA,CAAA2xC,EAAA9I,GACA2I,EAAA/O,EAAAkD,GAAA,CAAA8L,EAAAE,GACAL,EAAA7O,EAAAziC,GAAA,CAAAsxC,EAAAE,GACAA,EAAA/O,EAAAkD,GAAA,CAAAiM,EAAAD,GACAN,EAAA5O,EAAAkD,GAAA,CAAA+L,EAAAL,GACAA,EAAA5O,EAAAuG,GAAA,CAAAqI,EAAAG,GACAA,EAAA/O,EAAAkD,GAAA,CAAA+L,EAAAD,GACAF,EAAA9O,EAAAkD,GAAA,CAAAiM,EAAAL,GAEA,IAAA1L,EAAAwL,EAAAC,EADAC,EAAA9O,EAAAziC,GAAA,CAAAuxC,EAAAC,GAEA,CACAK,SAAA9B,CAAA,EACA,YAAA/vC,GAAA,CAAA+vC,EAAArP,MAAA,GACA,CACA0I,KAAA,CACA,YAAAwH,MAAA,CAAA/K,EAAA7E,IAAA,CACA,CACAZ,KAAAziC,CAAA,EACA,OAAAm0C,EAAA7P,UAAA,MAAA2N,EAAAjyC,EAAA,IACA,IAAAyyC,EAAA3N,EAAAiI,WAAA,CAAApI,EAAAzoB,GAAA,IAAAhJ,EAAAq/B,EAAA,GACA,OAAA5N,EAAAzoB,GAAA,EAAAhJ,EAAApP,IAAAoP,EAAAw+B,QAAA,CAAAe,CAAA,CAAA3uC,EAAA,GAAAoY,GAAA,CAAAgsB,EAAAK,UAAA,CACA,EACA,CAMA6L,eAAAp0C,CAAA,EACA,IAAAq0C,EAAAnM,EAAA7E,IAAA,CACA,GAAArjC,IAAsB04H,GACtB,OAAArkF,EAEA,GADAtC,EAAA/xC,GACAA,IAAsB24H,GACtB,YACA,IAAoBvnF,KAAAA,CAAA,EAAON,EAC3B,IAAAM,EACA,OAAA+C,EAAAhR,YAAA,MAAAnjC,GAEA,IAAkBs0C,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAA,CAAA9hC,GAAAA,CAAA,EAAuB0+B,EAAAE,WAAA,CAAAtxC,GACzCy0C,EAAAJ,EACAK,EAAAL,EACA/Q,EAAA,KACA,KAAAiR,EAAwBmkF,IAAGhmH,EAASgmH,IACpCnkF,EAAyBokF,IACzBlkF,CAAAA,EAAAA,EAAApyC,GAAA,CAAAihC,EAAA,EACA5wB,EAAyBimH,IACzBjkF,CAAAA,EAAAA,EAAAryC,GAAA,CAAAihC,EAAA,EACAA,EAAAA,EAAAC,MAAA,GACAgR,IAAuBokF,GACvBjmH,IAAuBimH,GAOvB,OALArkF,GACAG,CAAAA,EAAAA,EAAA1R,MAAA,IACAyR,GACAE,CAAAA,EAAAA,EAAA3R,MAAA,IACA2R,EAAA,IAAAxM,EAAApD,EAAAkD,GAAA,CAAA0M,EAAArC,EAAA,CAAAjB,EAAAC,IAAA,EAAAqD,EAAApC,EAAA,CAAAoC,EAAAnC,EAAA,EACAkC,EAAApyC,GAAA,CAAAqyC,EACA,CAUA7B,SAAA8B,CAAA,MAGAnD,EAAAoD,EAFA7C,EAAA4C,GAGA,IAAoBvD,KAAAA,CAAA,EAAON,EAC3B,GAAAM,EAAA,CACA,IAAwBkD,MAAAA,CAAA,CAAAC,GAAAA,CAAA,CAAAC,MAAAA,CAAA,CAAA9hC,GAAAA,CAAA,EAAuB0+B,EAAAE,WAAA,CAJ/CqD,GAKA,CAAsBzhC,EAAAuhC,CAAA,CAAA7Q,EAAAiR,CAAA,EAAiB,KAAApS,IAAA,CAAA8R,GACvC,CAAsBrhC,EAAAwhC,CAAA,CAAA9Q,EAAAkR,CAAA,EAAiB,KAAArS,IAAA,CAAA/vB,GACvC+hC,EAAAN,EAAAvR,eAAA,CAAA0R,EAAAG,GACAC,EAAAP,EAAAvR,eAAA,CAAA4R,EAAAE,GACAA,EAAA,IAAAxM,EAAApD,EAAAkD,GAAA,CAAA0M,EAAArC,EAAA,CAAAjB,EAAAC,IAAA,EAAAqD,EAAApC,EAAA,CAAAoC,EAAAnC,EAAA,EACAf,EAAAiD,EAAApyC,GAAA,CAAAqyC,GACAE,EAAAC,EAAAxyC,GAAA,CAAAyyC,EACA,KACA,CACA,IAAwB5hC,EAAAA,CAAA,CAAA0wB,EAAAA,CAAA,EAAO,KAAAnB,IAAA,CAd/BkS,GAeAnD,EAAAt+B,EACA0hC,EAAAhR,CACA,CAEA,OAAAsE,EAAAsK,UAAA,EAAAhB,EAAAoD,EAAA,KAQAG,qBAAAvK,CAAA,CAAAlqC,CAAA,CAAAF,CAAA,EACA,IAAA40C,EAAA9M,EAAArE,IAAA,CACAmE,EAAA,CAAAzD,EAAAjkC,IACAA,IAAwBo4H,IAAGp4H,IAAUq4H,IAAGp0F,EAAA0O,MAAA,CAAA+B,GAAAzQ,EAAAsO,QAAA,CAAAvyC,GAAAikC,EAAA6P,cAAA,CAAA9zC,GACxCsN,EAAAo6B,EAAA,KAAA1nC,GAAA+B,GAAA,CAAA2lC,EAAAwC,EAAApqC,IACA,OAAAwN,EAAA69B,GAAA,GAAA5mC,KAAAA,EAAA+I,CACA,CAIA8jC,SAAAuD,CAAA,EACA,IAAoB5C,GAAA5rC,CAAA,CAAA6rC,GAAA5rC,CAAA,CAAA6rC,GAAA2C,CAAA,EAAsB,KAC1CzJ,EAAA,KAAAA,GAAA,EAGA,OAAAwJ,GACAA,CAAAA,EAAAxJ,EAAA3G,EAAAkG,GAAA,CAAAlG,EAAA6G,GAAA,CAAAuJ,EAAA,EACA,IAAAC,EAAArQ,EAAAkD,GAAA,CAAAvhC,EAAAwuC,GACAG,EAAAtQ,EAAAkD,GAAA,CAAAthC,EAAAuuC,GACAI,EAAAvQ,EAAAkD,GAAA,CAAAkN,EAAAD,GACA,GAAAxJ,EACA,OAAyBhlC,EAAAq+B,EAAAzB,IAAA,CAAA38B,EAAAo+B,EAAAzB,IAAA,EACzB,IAAAyB,EAAA+F,GAAA,CAAAwK,EAAAvQ,EAAAkG,GAAA,EACA,gCACA,OAAqBvkC,EAAA0uC,EAAAzuC,EAAA0uC,CAAA,CACrB,CACAlE,eAAA,CACA,IAAoBnwC,EAAAu0C,CAAA,CAAApE,cAAAA,CAAA,EAA6BJ,EACjD,GAAAwE,IAA6BqjF,GAC7B,SACA,GAAAznF,EACA,OAAAA,EAAAhJ,EAAA,KACA,4EACA,CACAO,eAAA,CACA,IAAoB1nC,EAAAu0C,CAAA,CAAA7M,cAAAA,CAAA,EAA6BqI,SACjD,IAA6B6nF,GAC7B,KACAlwF,EACAA,EAAAP,EAAA,MACA,KAAAkM,cAAA,CAAAtD,EAAA/vC,CAAA,CACA,CACAw0C,WAAAC,EAAA,IAEA,OADA,KAAA9M,cAAA,GACA7/B,EAAAq/B,EAAA,KAAAsN,EACA,CACAC,MAAAD,EAAA,IACA,OAAmB9qC,GAAa,KAAA6qC,UAAA,CAAAC,GAChC,CACA,CACAtN,EAAArE,IAAA,KAAAqE,EAAA4I,EAAA9L,EAAA,CAAA8L,EAAA7L,EAAA,CAAAH,EAAAkG,GAAA,EACA9C,EAAA7E,IAAA,KAAA6E,EAAApD,EAAAzB,IAAA,CAAAyB,EAAAkG,GAAA,CAAAlG,EAAAzB,IAAA,EACA,IAAAqS,EAAA5E,EAAA5L,UAAA,CACAiP,EAAiB1R,SD/eV/V,CAAA,CAAAiW,CAAA,EACP,IAAAC,EAAA,CAAAC,EAAA7Q,KACA,IAAA8Q,EAAA9Q,EAAA+Q,MAAA,GACA,OAAAF,EAAAC,EAAA9Q,CACA,EACAhoB,EAAA,GAGA,EAAiBg5B,QAFjBj6B,KAAA4oB,IAAA,CAAAgR,EAAAM,GAAA,EAEiBC,WADjB,GAAAD,CAAAA,EAAA,EACiB,GAEjB,OACAL,gBAAAA,EAEAO,aAAAC,CAAA,CAAApjC,CAAA,EACA,IAAAkT,EAAAwZ,EAAA2W,IAAA,CACAC,EAAAF,EACA,KAAApjC,EAAuBu4H,IACvBv4H,EAAwBw4H,IACxBtlH,CAAAA,EAAAA,EAAA7Q,GAAA,CAAAihC,EAAA,EACAA,EAAAA,EAAAC,MAAA,GACAvjC,IAAsBw4H,GAEtB,OAAAtlH,CACA,EAWAswB,iBAAAJ,CAAA,CAAAH,CAAA,EACA,IAAoBD,QAAAA,CAAA,CAAAE,WAAAA,CAAA,EAAsBl5B,EAAAi5B,GAC1CQ,EAAA,GACAvwB,EAAAkwB,EACAtD,EAAA5sB,EACA,QAAAwwB,EAAA,EAAiCA,EAAAV,EAAkBU,IAAA,CACnD5D,EAAA5sB,EACAuwB,EAAA98B,IAAA,CAAAm5B,GAEA,QAAAh8B,EAAA,EAAgCA,EAAAo/B,EAAgBp/B,IAChDg8B,EAAAA,EAAAz9B,GAAA,CAAA6Q,GACAuwB,EAAA98B,IAAA,CAAAm5B,GAEA5sB,EAAA4sB,EAAAyD,MAAA,EACA,CACA,OAAAE,CACA,EAQAhB,KAAAQ,CAAA,CAAAU,CAAA,CAAA3jC,CAAA,EAGA,IAAoBgjC,QAAAA,CAAA,CAAAE,WAAAA,CAAA,EAAsBl5B,EAAAi5B,GAC1C/vB,EAAAwZ,EAAA2W,IAAA,CACAO,EAAAlX,EAAAmX,IAAA,CACAC,EAAAxgC,OAAA,GAAA2/B,EAAA,GACAc,EAAA,GAAAd,EACAe,EAAA1gC,OAAA2/B,GACA,QAAAS,EAAA,EAAiCA,EAAAV,EAAkBU,IAAA,CACnD,IAAAzG,EAAAyG,EAAAR,EAEAe,EAAAhkC,OAAAD,EAAA8jC,GAEA9jC,IAAAgkC,EAGAC,EAAAf,IACAe,GAAAF,EACA/jC,GAAyBw4H,IAUzB,IAAAt0F,EAAAjH,EAAAl0B,KAAAo7B,GAAA,CAAAF,GAAA,EACAG,EAAAV,EAAA,KACAW,EAAAJ,EAAA,CACAA,CAAA,IAAAA,EAEAL,EAAAA,EAAAvhC,GAAA,CAAAugC,EAAAwB,EAAAT,CAAA,CANA1G,EAMA,GAGA/pB,EAAAA,EAAA7Q,GAAA,CAAAugC,EAAAyB,EAAAV,CAAA,CAAAO,EAAA,EAEA,CAMA,OAAqBhxB,EAAAA,EAAA0wB,EAAAA,CAAA,CACrB,EACAU,WAAAC,CAAA,CAAAC,CAAA,CAAAxkC,CAAA,CAAAykC,CAAA,EAEA,IAAAxB,EAAAsB,EAAAG,YAAA,IAEAC,EAAAH,EAAAxxB,GAAA,CAAAuxB,GAOA,OANAI,IACAA,EAAA,KAAAnB,gBAAA,CAAAe,EAAAtB,GACA,IAAAA,GACAuB,EAAAr7B,GAAA,CAAAo7B,EAAAE,EAAAE,KAGA,KAAAlC,IAAA,CAAAQ,EAAA0B,EAAA3kC,EACA,CACA,CACA,ECwXqBkoC,EAAA4I,EAAAM,IAAA,CAAAroC,KAAA4oB,IAAA,CAAA+jB,EAAA,GAAAA,GAErB,OACA5E,MAAAA,EACA6E,gBAAAzN,EACA8J,uBAAAA,EACAL,oBAAAA,EACAG,mBAAAA,CACA,CACA,EA4BuG,CACvG,GAAAhB,CAAA,CACAjoC,QAAA0oC,CAAA,CAAAC,CAAA,CAAAgE,CAAA,EACA,IAAAl1C,EAAAkxC,EAAAE,QAAA,GACAjrC,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAmG,CAAA,EACAkX,EAAwBi6G,UACxB,EACAj6G,EAAApd,WAAAoL,IAAA,EAAA6lC,EAAAwB,QAAA,SAAAvsC,GAGAkX,EAAApd,WAAAoL,IAAA,MAAAlF,EAAAq+B,EAAAj8B,OAAA,CAAAvI,EAAAoG,CAAA,EAEA,EACAymC,UAAAzsC,CAAA,EACA,IAAAkI,EAAAlI,EAAAE,MAAA,CACAw2C,EAAA12C,CAAA,IACAguB,EAAAhuB,EAAA0I,QAAA,IAEA,GAAAR,IAAAouC,GAAAI,CAAAA,IAAAA,GAAAA,IAAAA,CAAA,OAKA1wC,EAJA,IAAAD,EAA0B+wH,GAAkB9oG,GAC5C,IA5BegqG,CAAAA,GA4BfjyH,GA5BkBod,EAAAihB,EAAAO,KAAA,EA6BlB,qCACA,IAAAqR,EAAA/E,EAAAlrC,GAEA,IACAC,EAAAo+B,EAAAgI,IAAA,CAAA4J,EACA,CACA,MAAAqiF,EAAA,CAEA,oCADAA,CAAAA,aAAA5oF,MAAA,KAAA4oF,EAAAx+E,OAAA,KAEA,CAMA,MAHAnD,CAAAA,EAAAA,CAAA,MAFA,EAAA1wC,EAAoCiyH,EAAA,IAASA,EAAA,GAI7CjyH,CAAAA,EAAAo+B,EAAAhC,GAAA,CAAAp8B,EAAA,EACA,CAAyBD,EAAAA,EAAAC,EAAAA,CAAA,CACzB,CACA,GAAAkC,IAAAquC,GAAAG,IAAAA,EAGA,OAAyB3wC,EAFzBq+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,GAAA07B,EAAAmH,KAAA,GAEyBvlC,EADzBo+B,EAAAqI,SAAA,CAAAze,EAAAtlB,QAAA,CAAA07B,EAAAmH,KAAA,GAAAnH,EAAAmH,KAAA,EACyB,CAGzB,gCAAmDrjC,EAAA,uBAAK,EAAwBouC,EAAA,qBAAe,EAAsBC,EAAA,mBAAiB,EAEtI,CACA,GACAI,EAAA,GAAmC3sC,GAAcgtH,GAAkB7zG,EAAAitB,EAAA3L,WAAA,GASnEmS,EAAA,CAAAl3C,EAAAuL,EAAAhC,IAAoC6tH,GAAkBp3H,EAAAuR,KAAA,CAAAhG,EAAAhC,GAItD,OAAA4tC,EACA/2C,YAAA8pC,CAAA,CAAAtmC,CAAA,CAAAwzC,CAAA,EACA,KAAAlN,CAAA,CAAAA,EACA,KAAAtmC,CAAA,CAAAA,EACA,KAAAwzC,QAAA,CAAAA,EACA,KAAA9O,cAAA,EACA,CAEA,OAAA+O,YAAA1rC,CAAA,EACA,IAAAtI,EAAAqtC,EAAA3L,WAAA,CAEA,WAAAoS,EAAAD,EADAvrC,EAAkB4rH,GAAW,mBAAA5rH,EAAAtI,EAAAA,GAC7B,EAAAA,GAAA6zC,EAAAvrC,EAAAtI,EAAA,EAAAA,GACA,CAGA,OAAAi0C,QAAA3rC,CAAA,EACA,IAAoBu+B,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,EAAO6rC,GAAAS,KAAA,CAAYqnF,GAAW,MAAA5rH,IAClD,WAAAwrC,EAAAjN,EAAAtmC,EACA,CACA0kC,gBAAA,CAEA,IAAAoJ,EAAA,KAAAxH,CAAA,EACA,yCACA,IAAAwH,EAAA,KAAA9tC,CAAA,EACA,wCACA,CACA2zC,eAAAH,CAAA,EACA,WAAAD,EAAA,KAAAjN,CAAA,MAAAtmC,CAAA,CAAAwzC,EACA,CACAI,iBAAAC,CAAA,EACA,IAAoBvN,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,CAAAwzC,SAAAlmB,CAAA,EAAsB,KAC1CvwB,EAAA81C,EAAoC8gF,GAAW,UAAA9/E,IAC/C,GAAAvmB,MAAAA,GAAA,WAAAzwB,QAAA,CAAAywB,GACA,mCACA,IAAAwmB,EAAAxmB,IAAAA,GAAAA,IAAAA,EAAAgZ,EAAAwG,EAAA9wC,CAAA,CAAAsqC,EACA,GAAAwN,GAAAhT,EAAAO,KAAA,CACA,0CACA,IAAA1uB,EAAA,CAAA2a,EAAAA,CAAA,eACA9qB,EAAA0hC,EAAAwK,OAAA,CAAA/7B,EAAA0gC,EAAAS,IACAC,EAtGepO,GAsGfmO,EAtGyBf,GAuGzBvO,EAAA0O,EAAA,CAAAn2C,EAAAg3C,GACAC,EAAAd,EAAAlzC,EAAA+zC,GACAvN,EAAAtC,EAAArE,IAAA,CAAAkR,oBAAA,CAAAvuC,EAAAgiC,EAAAwP,GACA,IAAAxN,EACA,iCAEA,OADAA,EAAA9B,cAAA,GACA8B,CACA,CAEAyN,UAAA,CACA,OA5DAl4C,IA4DA,CAAAiE,CAAA,CA7DA+yC,GAAoC4hF,EA8DpC,CACAzgF,YAAA,CACA,YAAAD,QAAA,OAAAV,EAAA,KAAAjN,CAAA,CAAA4M,EAAA,MAAAlzC,CAAA,OAAAwzC,QAAA,OAGAW,eAAA,CACA,OAAmB1tC,GAAa,KAAA2tC,QAAA,GAChC,CACAA,UAAA,CACA,OAAAvI,GAAAY,UAAA,EAAoCnG,EAAA,KAAAA,CAAA,CAAAtmC,EAAA,KAAAA,CAAA,EACpC,CAEAq0C,mBAAA,CACA,OAAmB5tC,GAAa,KAAA6tC,YAAA,GAChC,CACAA,cAAA,CACA,OAAAjB,EAAA,KAAA/M,CAAA,EAAA+M,EAAA,KAAArzC,CAAA,CACA,CACA,CA8CA,SAAAu0C,EAAAvmB,CAAA,EACA,IAAA9mB,EAAoB7K,GAAU2xB,GAC9BxkB,EAAA,iBAAAwkB,EACAppB,EAAA,CAAAsC,GAAAsC,CAAA,GAAAwkB,EAAApxB,MAAA,QACA,EACAgI,IAAAouC,GAAApuC,IAAAquC,EACAzpC,EACA5E,IAAA,EAAAouC,GAAApuC,IAAA,EAAAquC,EACAjlB,aAAAkW,CAGA,CAuBA,IAAA0O,EAAA9F,EAAA8F,QAAA,EACA,SAAAl2C,CAAA,EAGA,IAAAmjB,EAAwB2zG,GAAkB92H,GAC1C83C,EAAA93C,EAAAA,EAAAE,MAAA,CAAAkwC,EAAA5L,UAAA,CACA,OAAAsT,EAAA,EAAA30B,GAAAvgB,OAAAk1C,GAAA30B,CACA,EACAgzB,EAAA/F,EAAA+F,aAAA,EACA,SAAAn2C,CAAA,EACA,OAAAw2C,EAAAN,EAAAl2C,GACA,EAEA+3C,EAAuBlM,GAAUuE,EAAA5L,UAAA,EAIjC,SAAAwT,EAAA70B,CAAA,EACA,oBAAAA,EACA,+BACA,IAAc60G,CAAAA,IAAG70G,GAAAA,EAAA40B,CAAA,EACjB,mCAAmD3H,EAAA5L,UAAA,CAAiB,GAEpE,OAAewyF,GAAkB7zG,EAAAitB,EAAA3L,WAAA,CACjC,CAyDA,IAAAwT,EAAA,CAA6B7B,KAAAhG,EAAAgG,IAAA,CAAA8B,QAAA,IAC7BC,EAAA,CAA6B/B,KAAAhG,EAAAgG,IAAA,CAAA8B,QAAA,WAqB7B1Q,EAAArE,IAAA,CAAAiP,cAAA,IAkEA,CACAhC,MAAAA,EACAgI,aAnNA,SAAAlG,CAAA,CAAA4C,EAAA,IACA,OAAAtN,EAAAyK,cAAA,CAAAC,GAAA2C,UAAA,CAAAC,EACA,EAkNAuD,gBAxLA,SAAAC,CAAA,CAAAC,CAAA,CAAAzD,EAAA,IACA,GAAA+C,EAAAS,GACA,6CACA,IAAAT,EAAAU,GACA,6CAEA,OAAA74C,EADAsyC,OAAA,CAAAuG,GACApG,QAAA,CAAAb,EAAAgH,IAAAzD,UAAA,CAAAC,EACA,EAkLA0D,KA7EA,SAAArB,CAAA,CAAAsB,CAAA,CAAAnvC,EAAA2uC,CAAA,EACA,IAAgBhK,KAAAA,CAAA,CAAAyK,MAAAA,CAAA,EAAcC,SAnE9BxB,CAAA,CAAAjF,CAAA,CAAA5oC,EAAA2uC,CAAA,EACA,6BAAAW,IAAA,IAAA7mC,KAAAzI,GACA,mDACA,IAAgBlJ,KAAAA,CAAA,CAAAoJ,YAAAA,CAAA,EAAoB4mC,EACpC,CAAcgG,KAAAA,CAAA,CAAA8B,QAAAA,CAAA,CAAAW,aAAAC,CAAA,EAAmCxvC,CACjD,OAAA8sC,GACAA,CAAAA,EAAA,IACAe,EAAkB8/E,GAAW,UAAA9/E,GAC7Be,GACAf,CAAAA,EAAsB8/E,GAAW,oBAAA72H,EAAA+2C,GAAA,EAIjC,IAAA4B,EAAA5C,EAAAgB,GACAvU,EAAA0O,EAAAY,GACA8G,EAAA,CAAAhB,EAAApV,GAAAoV,EAAAe,GAAA,CAEA,GAAAD,MAAAA,GAAAA,CAAA,IAAAA,EAAA,CAEA,IAAApS,EAAAoS,CAAA,IAAAA,EAAAtvC,EAAA46B,EAAAmH,KAAA,EAAAuN,EACAE,EAAA/yC,IAAA,CAA0BgxH,GAAW,eAAAvwF,GACrC,CA4BA,OAAiBuH,KA3BIipF,MAAcl+E,GA2BlBN,MAxBjB,SAAAO,CAAA,EAEA,IAAAlnC,EAAAmkC,EAAA+C,GACA,IAAA7H,EAAAr/B,GACA,OACA,IAAAmnC,EAhRejQ,GAgRfl3B,EAhRyBskC,GAiRzB1M,EAAAnC,EAAArE,IAAA,CAAAgP,QAAA,CAAApgC,GAAAi/B,QAAA,GACApH,EAAA4M,EAAA7M,EAAA5jC,CAAA,EACA,GAAA6jC,IAAsBouF,GACtB,OAIA,IAAA10H,EAAAkzC,EAAA0C,EAAA1C,EAAA1kC,EAAA83B,EAAAhH,IACA,GAAAt/B,IAAsB00H,GACtB,OACA,IAAAlhF,EAAA,CAAAnN,EAAA5jC,CAAA,GAAA6jC,EAAA,KAAArqC,OAAAoqC,EAAA3jC,CAAA,CAA8DiyH,IAC9D9+E,EAAA71C,EACA,GAAA8yC,GAxOA/2C,EADAg3C,GAAoC4hF,GA0OpC9+E,EAtOAC,EAJA/C,GAAoC4hF,GAIpCzhF,EAAA,CAsOAlzC,GAAAA,EACAwzC,GAAA,EAEA,WAAAD,EAAAjN,EAAAuP,EAAArC,EACA,CACiB,CACjB,EAiB8BK,EAAAsB,EAAAnvC,GAG9B,OAAA+vC,GADsCC,EAAAl5C,IAAA,CAAAG,SAAA,CAAA+4C,EAAA7U,WAAA,CAAA6U,EAAA9X,IAAA,EACtCyM,EAAAyK,EACA,EAyEAa,OAxDA,SAAAC,CAAA,CAAArC,CAAA,CAAAsC,CAAA,CAAAnwC,EAAA6uC,CAAA,MAQAtU,EADA6V,EAHA,GAFAvC,EAAkB8/E,GAAW,UAAA9/E,GAC7BsC,EAAoBw9E,GAAW,YAAAx9E,GAC/B,WAAAnwC,EACA,kDACA,IAAgB8sC,KAAAA,CAAA,CAAA8B,QAAAA,CAAA,EAAgB5uC,EAGhC,IACA,oBATAkwC,GAS0C75C,GAT1C65C,GAYA,IACAE,EAAA7C,EAAAG,OAAA,CAbAwC,EAcA,CACA,MAAAI,EAAA,CACA,IAAAA,CAAAA,aAAAzK,GAAAK,GAAA,EACA,MAAAoK,EACAF,EAAA7C,EAAAE,WAAA,CAlBAyC,EAmBA,MAEA,oBArBAA,GAqBA,iBAAAG,EAAA/P,CAAA,mBAAA+P,EAAAr2C,CAAA,EACA,IAAwBsmC,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,EAtBxBk2C,EAuBAE,EAAA,IAAA7C,EAAAjN,EAAAtmC,EACA,MAEA,qBAEAugC,EAAA2D,EAAAwK,OAAA,CAAAyH,EACA,CACA,MAAA1qC,EAAA,CACA,GAAAA,UAAAA,EAAA8qC,OAAA,CACA,8EACA,QACA,CACA,GAAAzD,GAAAsD,EAAAnC,QAAA,GACA,SACAW,GACAf,CAAAA,EAAA/G,EAAAhwC,IAAA,CAAA+2C,EAAA,EACA,IAAgBvN,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,EAAOo2C,EACvBr5C,EAAA81C,EAAAgB,GACA2C,EApXe7Q,GAoXf3lC,EApXyB+yC,GAqXzBvO,EAAA0O,EAAAn2C,EAAAy5C,GACAxC,EAAAd,EAAA5M,EAAAkQ,GACAh0C,EAAA0hC,EAAArE,IAAA,CAAAkR,oBAAA,CAAAxQ,EAAAiE,EAAAwP,IAAAtG,iBACA,EAAAlrC,GAGA4jC,EADA5jC,EAAAC,CAAA,IACA6jC,CACA,EAOAqL,gBAAAzN,EACAqP,UAAAA,EACA3mC,MAhQA,CACA6pC,kBAAA7H,CAAA,EACA,IAEA,OADAZ,EAAAY,GACA,EACA,CACA,MAAAnjC,EAAA,CACA,QACA,CACA,EACAuiC,uBAAAA,EAKA0I,iBAAA,KACA,IAAA95C,EAA2BkoC,GAAoBgI,EAAA9wC,CAAA,EAC/C,OAAmB6oC,SHtSZ32B,CAAA,CAAA45B,CAAA,CAAAtjC,EAAA,IACP,IAAAI,EAAAsJ,EAAAtR,MAAA,CACA6sC,EAAA1E,GAAA+C,GACA0B,EAAA1E,GAAAgD,GAEA,GAAAljC,EAAA,IAAAA,EAAA4kC,GAAA5kC,EAAA,KACA,wBAAoC4kC,EAAO,4BAA4B5kC,EAAI,GAG3E,IAAA8kC,EAAoBuqF,GAFpBzvH,EAAuBgvH,GAAetlH,GAAQulH,GAAevlH,GAEtC45B,EAAmBisF,IAAOA,GACjD,OAAAvvH,EAAkBykC,GAAeS,EAAAD,GAAsBiqF,GAAehqF,EAAAD,EACtE,EG2RqCqD,EAAA5mC,WAAA,CAAAtJ,GAAAkwC,EAAA9wC,CAAA,CACrC,EASA26C,WAAAA,CAAAzX,EAAA,EAAAsO,EAAAtJ,EAAArE,IAAA,IACA2N,EAAAsB,cAAA,CAAA5P,GACAsO,EAAAqB,QAAA,CAAAvvC,OAAA,IACAkuC,EAEA,CAiOA,CACA,GC75BwC,CAAG,GAAApP,CAAA,CAN3CthC,KAM2CA,EAL3CohC,KAAA,CAAAhwB,EAAA,GAAAiwB,IAAgCD,GAKWphC,EALPoR,EAAY,GAAAtB,GAAAooH,EAAA,KAAW72F,IAC3Dj4B,YAAmB0G,GAAAqoH,EAAA,GAKnB,OAAAt3H,OAAA4gC,MAAA,EAA2B,GAAAvhC,EAAAqhC,EAAA,CAAArhC,OAAAA,CAAA,EAC3B,EC2BoC,CACpCV,EAAAgD,OAAA,GACAlD,EAAAkD,OAAA,GACAwhC,GAAAA,GACA9kC,EAAAo7C,GAEApW,GAAA1hC,OAAA,iFACA2hC,GAAA3hC,OAAA,iFACAvC,EAAAuC,OAAA,GACAwzC,KAAA,GAOA1F,KAAA,CACAC,KAAA/tC,OAAA,sEACAguC,YAAA,IAEA,IAAAgL,EAAAh5C,OAAA,sCACA8pB,EAAA,CAAwByrG,GAAGv1H,OAAA,sCAC3Bi5C,EAAAj5C,OAAA,uCAEAk5C,EAAAl5C,OAAA,uCACA0rB,EAAAqsB,GAAA3tB,EAAAjb,EANA2oC,IAOAnsB,EAAAosB,GAAA,CAAAjuB,EAAA3a,EAPA2oC,IAQA7G,EAAqB0jF,GAAGxlH,EAAAuc,EAAAstB,EAAArtB,EAAAstB,EARxBnB,IASA1oC,EAAqBulH,GAAG,CAAAjpG,EAAA5B,EAAA6B,EALxBqtB,EAJAlB,IAUA9G,EAAAC,EAAAiI,EACAhI,EAAA9hC,EAAA8pC,EAKA,GAJAlI,GACAC,CAAAA,EAAAv0C,GAAAu0C,CAAA,EACAC,GACA9hC,CAAAA,EAAA1S,GAAA0S,CAAA,EACA6hC,EAAAiI,GAAA9pC,EAAA8pC,EACA,mDAAA/pC,GAEA,OAAqB6hC,MAAAA,EAAAC,GAAAA,EAAAC,MAAAA,EAAA9hC,GAAAA,CAAA,CACrB,CACA,CACA,EAAGwmH,GAAAC,CAAM,EE/DF,eAAAC,GAAA5X,CAAA,CAAAgR,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAA4kH,QAAAA,CAAA,CAAAC,YAAAA,CAAA,CAAA90H,KAAAA,CAAA,CAAAo5C,UAAAA,CAAA,IAAAm/E,EAAA,CAA0D7G,EACtE8G,EACA,CAAY,EAAAprG,GAAAkc,CAAA,EAAK8P,GACjBA,EACA,iBAAAA,GAAA,MAAAA,GAAA,MAAAA,EACmBq/E,SDVZ,CAA8BjvF,EAAAA,CAAA,CAAAtmC,EAAAA,CAAA,CAAAomC,EAAAA,CAAA,CAAAw4C,QAAAA,CAAA,CAAkB,EACvD,IAAA42C,EAAA,MACA,GAAA52C,IAAAA,GAAAA,IAAAA,EACA,OAAAA,EACA,GAAAx4C,GAAAA,CAAAA,EAAA,IAAAA,GAAAA,EAAA,IAAAA,GAAAA,GAAA,KACA,OAAAA,EAAA,WACA,8CACA,KACA,WAAgB,IAAI2Q,GAASxD,SAAA,CAAW,GAAA7E,GAAA+mF,EAAA,EAAWnvF,GAAK,GAAAoI,GAAA+mF,EAAA,EAAWz1H,IAAAs0C,YAAA,GAAoB,EAAEkhF,IAAAA,EAAA,UAA6B,GCEjFt/E,GACtB,GAAAzE,EAAA1wB,EAAA,EAAUm1B,GAEzBw/E,EAAA,gBAGA,GAAA9D,EAGA,CT/BW,EAAAjkH,GAAAgoH,EAAA,ES+BmBL,ET/BX,OAAqBzB,ISiCxC,MAA+B,GAAAnG,EAAA1tH,CAAA,EAASw9G,EAAS1lC,GAAO,YAAe/qE,QAAAA,CAAA,GADvEuoH,EAOeM,SR9BRpH,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAApI,KAAAA,CAAA,CAAAuxC,UAAAA,CAAA,EAA2Bs4E,EACvC,MAAW,GAAA3lE,GAAAqoE,EAAA,EAAS,CACZ,GAAA7B,EAAAhjF,CAAA,EAAmB,EAAI7zB,KAAA,WAAiB,CAAIA,KAAA,SAAe,CAAIA,KAAA,SAAe,EAAAzL,EAAApI,EAAAuxC,EAAA,EAC9E29E,GACR,CACA,EQwBwC,CACxC9mH,QAAA4kH,EACAhtH,KAAAitH,EACA17E,UAAAo/E,CACA,GAdAA,CAeA,IACA,IACA,IAAgB3wH,KAAAA,CAAA,EAAO,MAAQ,GAAA+oH,EAAA1tH,CAAA,EAASw9G,EAAStzG,EAAA1H,CAAI,UACrDmC,KAAkB,GAAAkxH,GAAAjS,CAAA,EAAgB,CAClCj9C,IAAqBmvD,GAAAC,EAA8B,CACnDtzF,KAAA,CAAA11B,EAAAjQ,EAAA44H,EAAA,CACAj8C,SAA0Bu8C,GAAAC,EAAmC,GAE7D,GAAAZ,CAAA,GAEA,OAAea,SXvDRC,CAAA,CAAAC,CAAA,EACP,IAAA95H,EAAc,GAAA4tB,GAAAkc,CAAA,EAAK+vF,GAAO,GAAAtxH,EAAAuqH,EAAA,EAAO+G,GAAAA,EAEjC,OAAWrsF,GAAUxtC,EADP,GAAA4tB,GAAAkc,CAAA,EWqDa,OXrDD,GAAAvhC,EAAAuqH,EAAA,EWqDC,aXnD3B,EWmD2BzqH,GAAA,YAC3B,CACA,MAAA8G,EAAA,CACA,GAAAA,aAA6B8oE,GAAA8hD,EAAkB,CAI/C,QAEA,OAAA5qH,CACA,CACA,CCxDO,eAAAuhD,GAAAwwD,CAAA,EAAuCzwG,QAAAA,CAAA,CAAAwpC,QAAAA,CAAA,CAAAo7E,QAAAA,CAAA,CAAAC,YAAAA,CAAA,CAAA17E,UAAAA,CAAA,IAAAogF,EAAmE,EAEjH,OAAWlB,GAAU5X,EAAA,CACrBzwG,QAAAA,EACA4kH,QAAAA,EACAC,YAAAA,EACA90H,KALiBoxD,GAAW3X,GAM5BL,UAAAA,EACA,GAAAogF,CAAA,EAEA,CH+DSh3H,OAAA,GAmBTy3C,GAAApF,eAAA,6BItGO,IAAA4kF,GAAA,uCAGAC,GAAA,iIEmCA,SAAA1sC,GAAA,CAAsBnlF,KAAAA,CAAA,CAAAgkF,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,CAA2B,EACxD,IAAAg/D,EAAA5sC,SAOAA,EAAA,CAAsBllF,KAAAA,CAAA,CAAAgkF,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,CAA2B,EACjD,IAAAi/D,EAAA,EAA4Bl+G,KAAA,WAAiB,CAC7Cm+G,EAAA,CAAAC,SAaA,CAAoBjuC,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,CAAqB,EACzC,IAAAo/D,EAA4B,GAAAplF,EAAAm8E,EAAA,EAAKplC,SAG1B,CAAsBG,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,CAAqB,EAClD,IAAA7pD,EAAA,GACAkpH,EAAAC,SAUAA,EAAA,CAAgCpuC,YAAAquC,CAAA,CAAAv/D,MAAAA,CAAA,CAAmC,CAAA6qC,EAAA,IAAA1iC,GAAA,EACnE,IAAA9pC,EAAAkhG,EAAAlhG,KAAA,UACA6yD,EAAA7yD,GAAA,IACA,GAAAwsE,EAAAn4C,GAAA,CAAAw+B,IAAAlxB,KAAA52D,IAAA42D,CAAA,CAAAkxB,EAAA,CACA,OAAA2Z,EAGA,QAAA/+D,KADA++D,EAAAjkG,GAAA,CAAAsqF,GACAlxB,CAAA,CAAAkxB,EAAA,EACAouC,EAAA,CAA+BpuC,YAAAplD,EAAA/qB,IAAA,CAAAi/C,MAAAA,CAAA,EAAgC6qC,GAE/D,OAAAA,CACA,EArBA,CAAgD3Z,YAAAA,EAAAlxB,MAAAA,CAAA,GAGhD,QAAAj/C,KAFAs+G,EAAA/nF,MAAA,CAAA45C,GACA,CAAAA,KAAAjhF,MAAAC,IAAA,CAAAmvH,GAAAx7G,IAAA,KAEA1N,GAAA,GAAqB4K,EAAK,GAAGi/C,CAAA,CAAAj/C,EAAA,CAC7BN,GAAA,GAAoBzb,KAAAA,CAAA,CAAA+b,KAAA5V,CAAA,CAAe,MAAQA,EAAA,CAAG,EAAEnG,EAAK,GACrDwuD,IAAA,MAAuB,GAEvB,OAAAr9C,CACA,EAdiC,CAAc+6E,YAAAA,EAAAlxB,MAAAA,CAAA,IAC/C,MAAW,GAAAgS,EAAAm6C,CAAA,EAASiT,EACpB,EAhBA,CAAsCluC,YAAAA,EAAAlxB,MAAAA,CAAA,GAAoB,CAC1D,QAAAl0B,KAAAk0B,CAAA,CAAAkxB,EAAA,EACA,IAAAnwE,EAAA1a,EAAA,CAAAm5H,SAuCAA,EAAA,CAAuBx/D,MAAAA,CAAA,CAAAh7D,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,CAAA1a,MAAAA,CAAA,CAA2B,EAClD,GAAA25D,KAAA52D,IAAA42D,CAAA,CAAAj/C,EAAA,CACA,OACA,CAAcA,KAAA,WACF,GAAAixD,EAAAm6C,CAAA,EAAS/5B,EAAA,CAAcllF,KAAA7G,EAAA6qF,YAAAnwE,EAAAi/C,MAAAA,CAAA,IACnC,CAEA,GAAAj/C,UAAAA,EAAA,CACA,IAAA0+G,EAAAp5H,EAAAlB,MAAA,UAEA,OADAkB,EAAA,KAAqBo5H,EAAAp5H,EAAA6P,KAAA,IAAyB,EAC9C,EAAkB6K,KAAA,WAAmB,GAAAixD,EAAAm6C,CAAA,EAAS9lH,GAAA,CAE9C,GAAA0a,WAAAA,EACA,QAAkBA,KAAA,WAAmB,GAAAixD,EAAAm6C,CAAA,EAAU,GAAAnyE,EAAAm8E,EAAA,EAAK9vH,IAAA,CACpD,GAAA0a,EAAAiwG,WAAA,QAAAjwG,EAAA5b,MAAA,IACA,IAAAu6H,EAAA3+G,EAAA7K,KAAA,GAAA6K,EAAAiwG,WAAA,OACA2O,EAAAt5H,EAAAoa,GAAA,IAAA++G,EAAA,CACAx6H,KAAAA,EACA+b,KAAA2+G,EACA1/D,MAAAA,EACA35D,MAAAkwB,CACA,IACA,OACA,CAAcxV,KAAA,WACF,GAAAixD,EAAAm6C,CAAA,EAAU,GAAAyL,EAAAhjF,CAAA,EAAmB+qF,EAAAl/G,GAAA,GAAAtV,EAAA,GAAAA,GAAAw0H,EAAAl/G,GAAA,IAAAkuB,EAAA,GAAAA,KACzC,CAEA,QAAc5tB,KAAAA,CAAA,EAAM1a,EAAA,EAlEpB,CACA25D,MAAAA,EACAh7D,KAAA8mC,EAAA9mC,IAAA,CACA+b,KAAA+qB,EAAA/qB,IAAA,CACA1a,MAAA6G,CAAA,CAAA4+B,EAAA9mC,IAAA,IAEAi6H,EAAA/zH,IAAA,CAAA6V,GACAm+G,EAAAh0H,IAAA,CAAA7E,EACA,CACA,MAAW,GAAAuxH,EAAAhjF,CAAA,EAAmBqqF,EAAAC,EAC9B,EArBA,CACAhyH,KAAAA,EACAgkF,YAAAA,EACAlxB,MAAAA,CACA,GACA,MAAW,GAAAgS,EAAAm6C,CAAA,EAAS6S,EACpB,CCrCO,eAAAz0C,GAAAw7B,CAAA,CAAAgR,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAA4kH,QAAAA,CAAA,CAAAC,YAAAA,CAAA,CAAA17E,UAAAA,CAAA,CAAAK,QAAAA,CAAA,CAAAoyC,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,CAAA3qD,OAAAA,CAAA,IAAAwpH,EAAA,CAAgG9H,EAE5G,OAAW4G,GAAU5X,EAAA,CACrBzwG,QAAAA,EACA4kH,QAAAA,EACAC,YAAAA,EACA90H,KALiBu6H,SDPV7I,CAAA,EACP,IAAY1hH,OAAAA,EAAA,EAAW,CAAAypC,QAAAA,CAAA,CAAAoyC,YAAAA,CAAA,EAA0B6lC,EACjD/2D,EAAA,CACA2yB,aAAsBktC,SDgEf,CAAmCxqH,OAAAA,CAAA,CAAS,EACnD,OACA,iBAAAA,GAAArQ,MAAA,CAA8CA,KAAA,OAAA+b,KAAA,UAC9C1L,GAAAI,SAAA,CAA6BzQ,KAAA,UAAA+b,KAAA,UAC7B,iBAAA1L,GAAAK,SAAA,CACA1Q,KAAA,UACA+b,KAAA,SACA,EACA1L,GAAAk7E,mBAAA,CACAvrF,KAAA,oBACA+b,KAAA,SACA,EACA1L,GAAAivC,MAAA,CAA0Bt/C,KAAA,OAAA+b,KAAA,WAC1B,CAAA8f,MAAA,CAAAk3F,QACA,EC9E6C,CAAG1iH,OAAAA,CAAA,GAChD,GAAA0hH,EAAA/2D,KAAA,GAII8/D,SDmBG/I,CAAA,EACP,IAAY1hH,OAAAA,CAAA,CAAAypC,QAAAA,CAAA,CAAAoyC,YAAAA,CAAA,CAAAlxB,MAAAA,CAAA,EAAsC+2D,EAClDgJ,EAAA,CAAAC,EAAA9yH,KACA,QAAA+lD,KAAA+sE,EAAA,CACA,IAAoBh7H,KAAAA,CAAA,CAAA+b,KAAAA,CAAA,EAAakyC,EACjC5sD,EAAA6G,CAAA,CAAAlI,EAAA,CACAi7H,EAAAl/G,EAAAsd,KAAA,CAA4C0gG,IAC5C,GAAAkB,GACA,kBAAA55H,GAAA,iBAAAA,CAAA,GACA,IAAAmhF,EAAAnjD,EAAA67F,EAAA,CAAAD,EAGgB,GAAAjmF,EAAA89E,EAAA,EAAWzxH,EAAA,CAC3B6gE,OAAA7iC,QAAAA,EACApO,KAAAzxB,OAAAyT,QAAA,CAAAioH,GAAA,CACA,EACA,CACA,GAAAn/G,YAAAA,GAAA,iBAAA1a,GAAA,CAAoE,GAAAi0E,GAAAu/C,CAAA,EAASxzH,GAC7E,UAA0BiP,GAAA3Q,CAAmB,EAAG2Q,QAAAjP,CAAA,GAChD,IAAA85H,EAAAp/G,EAAAsd,KAAA,CAA0CygG,IAC1C,GAAAqB,EAAA,CACA,IAAA34C,EAAA04C,EAAA,CAAAC,EACA,GAAAD,GAA6B,GAAAjqG,GAAA4R,CAAA,EAAIxhC,KAAA7B,OAAAyT,QAAA,CAAAioH,GACjC,UAA8B/I,EAAAiJ,EAAsB,EACpDC,aAAA77H,OAAAyT,QAAA,CAAAioH,GACAI,UAAmC,GAAArqG,GAAA4R,CAAA,EAAIxhC,EACvC,EACA,CACA,IAAA25H,EAAAhgE,CAAA,CAAAj/C,EAAA,CACAi/G,GACAD,EAAAC,EAAA35H,EACA,CACA,CAEA25D,CAAAA,EAAA2yB,YAAA,EAAAt9E,GACA0qH,EAAA//D,EAAA2yB,YAAA,CAAAt9E,GAEA,iBAAA67E,GACA6uC,EAAA//D,CAAA,CAAAkxB,EAAA,CAAApyC,EACA,EC1DqB,CACrBzpC,OAAAA,EACAypC,QAAAA,EACAoyC,YAAAA,EACAlxB,MAAAA,CACA,GACA,IAAAugE,EAAA,WAYA,OAXAlrH,GACAkrH,EAAAr1H,IAAA,CAAmBs1H,SAYO,CAAGnrH,OAAAA,CAAA,CAAA2qD,MAAAA,CAAA,CAAgB,EAC7C,OAAAqyB,GAAA,CACAnlF,KAAAmI,EACA67E,YAAA,eACAlxB,MAAAA,CACA,EACA,EAlB6B,CAC7B3qD,OAAAA,EACA2qD,MAAAA,CACA,IACA,iBAAAkxB,GACAqvC,EAAAr1H,IAAA,CAAAmnF,GAAA,CACAnlF,KAAA4xC,EACAoyC,YAAAA,EACAlxB,MAAAA,CACA,IACW,GAAAgS,EAAAm6C,CAAA,EAAU,GAAA/6D,GAAAyqE,EAAA,EAAM0E,GAC3B,ECpB8B,CAAGzhF,QAAAA,EAAAoyC,YAAAA,EAAAlxB,MAAAA,EAAA3qD,OAAAA,CAAA,GAMjCopC,UAAAA,EACA,GAAAogF,CAAA,EAEA,wFKIA,IAAA4B,GAAA,2MAEAC,GAAA,wREbO,eAAAC,GAAA5a,CAAA,CAAAgR,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAAD,OAAAA,CAAA,CAAAypC,QAAAA,CAAA,CAAAlpC,MAAAA,CAAA,CAAAhB,OAAAA,CAAA,CAAA6pC,UAAAA,CAAA,CAAAmW,KAAAA,EAAA,IAAAhjD,IAAA,IAAAitH,EAAA,CAAwF9H,EACpG5+G,EAAmByoH,SFVZ9hF,CAAA,EACP,IAAYlqC,OAAAA,CAAA,CAAAW,UAAAA,CAAA,IAAA2F,EAAA,CAA+B4jC,EAAAzgB,KAAA,CAAAoiG,KAC3C7oE,QAAA,GACA,CAAYliD,QAAAA,CAAA,CAAAI,eAAAA,CAAA,CAAAD,SAAAA,CAAA,CAAAE,UAAAA,CAAA,CAAAC,UAAAA,CAAA,IAAAzJ,EAAA,CAAqEuyC,EAAAzgB,KAAA,CAAAqiG,KAAA9oE,QAAA,GACjF3hD,EAAA6oC,EAAAp3C,KAAA,mBAAAA,MAAA,QAAAwO,MAAA,GACA,OACA,GAAAgF,CAAA,CACA,GAAA3O,CAAA,CACA,GAAAmJ,EAAA,CAAwBA,QAAAlR,OAAAkR,EAAA,EAA2B,EAAI,CACvD,GAAAI,EAAA,CAA+BA,eAAA,IAAAlE,KAAAkE,EAAA,EAA2C,EAAI,CAC9E,GAAAD,EAAA,CAAyBA,SAAA,IAAAjE,KAAAiE,EAAA,EAA+B,EAAI,CAC5D,GAAAE,EAAA,CAA0BA,UAAA,IAAAnE,KAAAmE,EAAA,EAAiC,EAAI,CAC/D,GAAAC,EAAA,CAA0BA,UAAAA,CAAA,EAAY,EAAI,CAC1C,GAAAC,EAAA,CAA0BA,UAAAA,CAAA,EAAY,EAAI,CAC1C,GAAArB,EAAA,CAAuBA,OAAAA,CAAA,EAAS,EAAI,CACpC,GAAAW,EAAA,CAA0BA,UAAAA,CAAA,EAAY,EAAI,CAE1C,EEPmCupC,GACnC,IAAA3mC,EAAA7C,OAAA,EAUA,CARoBurH,SDdb9J,CAAA,EACP,IAAYzhH,QAAAA,CAAA,CAAAD,OAAAA,CAAA,CAAAypC,QAAAA,CAAA,CAAAlpC,MAAAA,CAAA,CAAAhB,OAAAA,CAAA,CAAAggD,KAAAA,EAAA,IAAAhjD,IAAA,EAA8DmlH,EAC1E,GAAA1hH,GAAAypC,EAAAzpC,MAAA,GAAAA,GAEAO,GAAAkpC,EAAAlpC,KAAA,GAAAA,GAEAhB,GAAAkqC,EAAAlqC,MAAA,GAAAA,GAEAkqC,EAAAhpC,cAAA,EAAA8+C,GAAA9V,EAAAhpC,cAAA,EAEAgpC,EAAA/oC,SAAA,EAAA6+C,EAAA9V,EAAA/oC,SAAA,CAPA,SASA,IACA,IAAA+oC,EAAAxpC,OAAA,EAEAA,GAAA,CAAwB,GAAAwrH,GAAAlsF,CAAA,EAAckK,EAAAxpC,OAAA,CAAAA,GADtC,QAGA,CACA,MACA,QACA,CACA,QACA,ECRuC,CACvCA,QAAAA,EACAD,OAAAA,EACAypC,QAAA3mC,EACAvC,MAAAA,EACAhB,OAAAA,EACAggD,KAAAA,CACA,GARA,SAWA,IAAAvvD,EAAiBoxD,GAAW3X,GAC5B,OAAW6+E,GAAU5X,EAAA,CACrBzwG,QAAA6C,EAAA7C,OAAA,CACAjQ,KAAAA,EACAo5C,UAAAA,EACA,GAAAogF,CAAA,EAEA,6BCYO,SAAAkC,GAAAhb,CAAA,EACP,OACAtzG,KAAA,GAAwB,GAAAA,EAAA1H,CAAA,EAAIg7G,EAAA/6E,GAC5B2rF,kBAAA,IAAiCA,EAAiB5Q,GAClD8R,0BAAA,GAA6CA,GAAyB9R,EAAA/6E,GACtEgtF,kBAAA,GAAqCA,GAAiBjS,EAAA/6E,GACtDktF,+BAAA,IAA8CA,GAA8BnS,GAC5EoS,oBAAA,GAAuCA,GAAmBpS,EAAA/6E,GAC1DwxC,YAAA,GAA+B,GAAAA,GAAAztC,CAAA,EAAWg3E,EAAA/6E,GAC1CyuD,WAAA,GAA8B,GAAAA,GAAAlxF,CAAA,EAAUw9G,EAAA/6E,GACxCstF,eAAA,IAA8BA,GAAcvS,GAC5C/iC,SAAA,GAA4B,GAAAA,GAAAj0C,CAAA,EAAQg3E,EAAA/6E,GACpC2rD,eAAA,GAAkC,GAAAA,GAAAl9C,CAAA,EAAcssE,EAAA/6E,GAChDutF,yBAAA,GAA4CA,GAAwBxS,EAAA/6E,GACpEg2F,YAAA,GAA+B3gD,GAAO0lC,EAAA/6E,GACtCk8C,WAAA,IAA0B,GAAAA,GAAA17C,CAAA,EAAUu6E,GACpC1lC,QAAA,GAA2BA,GAAO0lC,EAAA/6E,GAClC8uF,kBAAA,GAAqCA,GAAiB/T,EAAA/6E,GACtDivF,gBAAA,GAAmCA,GAAelU,EAAA/6E,GAClD4vD,cAAA,GAAiC,GAAAA,EAAAqmC,CAAA,EAAalb,EAAA/6E,GAC9Ck2F,aAAA,GAAgC,GAAAA,EAAAryF,CAAA,EAAYk3E,EAAA/6E,GAC5Cm2F,WAAA,GAA8B,GAAAA,EAAAhV,CAAA,EAAUpG,EAAA/6E,GACxC2qF,eAAA,GAAkCA,EAAc5P,EAAA/6E,GAChDo2F,WAAA,GAA8B,GAAAA,EAAA5xF,CAAA,EAAUu2E,EAAA/6E,GACxCsvF,cAAA,GAAiCA,GAAavU,EAAA/6E,GAC9Cq2F,mBAAA,GAAsC,GAAAA,GAAAC,CAAA,EAAkBvb,EAAA/6E,GACxD6vF,iBAAA,GAAoCA,GAAgB9U,EAAA/6E,GACpD+vF,cAAA,GAAiCA,GAAahV,EAAA/6E,GAC9Cu2F,YAAA,IAA2B,GAAAA,GAAAzqH,CAAA,EAAWivG,GACtC5kC,QAAA,GAA2BA,GAAO4kC,EAAA/6E,GAClCgwF,SAAA,GAA4BA,GAAQjV,EAAA/6E,GACpCw2F,6BAAA,GAAgD,GAAAA,GAAArxH,CAAA,EAA4B41G,EAAA/6E,GAC5EmwF,aAAA,GAAgCA,GAAYpV,EAAA/6E,GAC5Ci4C,eAAA,GAAkC,GAAAA,GAAA96C,CAAA,EAAc49E,EAAA/6E,GAChDqwF,4BAAA,GAA+CA,GAA2BtV,EAAA/6E,GAC1E0uD,oBAAA,GAAuC,GAAAA,GAAA+nC,CAAA,EAAmB1b,EAAA/6E,GAC1Dk4C,sBAAA,GAAyC,GAAAA,GAAAr+E,CAAA,EAAqBkhH,EAAA/6E,GAC9D02F,UAAA,GAA6B,GAAAA,GAAAviF,CAAA,EAAS4mE,EAAA/6E,GACtC22F,0BAAA,GAA6C,GAAAA,GAAA1yF,CAAA,EAAyB82E,EAAA/6E,GACtEkrF,aAAA,GAAgC,GAAAA,EAAA1qF,CAAA,EAAYu6E,EAAA/6E,GAC5C42F,mBAAA,GAAsC,GAAAA,GAAAnqH,CAAA,EAAkBsuG,EAAA/6E,GACxD62F,iBAAA,GAAoC,GAAAA,GAAAh9H,CAAA,EAAgBkhH,EAAA/6E,GACpDuqB,cAAA,GAAiCA,GAAawwD,EAAA/6E,GAC9C21F,kBAAA,GAAqCA,GAAiB5a,EAAA/6E,GACtDu/C,gBAAA,GAAmCA,GAAew7B,EAAA/6E,GAClDwwF,gBAAA,GAAmCA,GAAezV,EAAA/6E,GAClD82F,0BAAA,GAA6C,GAAAA,GAAAn2F,CAAA,EAAyBo6E,EAAA/6E,GACtE+2F,YAAA,GAA+BA,CPjExB,SAAAhc,CAAA,EAA+BhvB,SAAAA,EAAA,SAAAirC,WAAAA,EAAA,GAAAC,YAAAA,EAAA,GAAAC,QAAAA,CAAA,CAAAnhB,QAAAA,CAAA,CAAA7mB,oBAAAioC,CAAA,CAAA/tB,KAAAguB,CAAA,CAAAjuC,gBAAAA,EAAA4xB,EAAA5xB,eAAA,CAAmL,MAYzNkuC,EAwDAC,EACAC,EApEA,IAAAC,EACA,SAAAJ,EACAA,EACA,cAAArc,EAAAyQ,SAAA,CAAAz1G,IAAA,EAEAglG,CAAAA,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACAglG,cAAAA,EAAAyQ,SAAA,CAAAiM,UAAA,IAAAhmH,MAAA,CAAAsE,IAAA,EAIAm5E,EAAAioC,GAAA,GA8FA,OAAAK,EAAAE,CA5FA,KACA,IAAAC,EAA2B,GAAAC,GAAA95F,CAAA,EAAS,CACpC,cACAi9E,EAAA8c,GAAA,CACA9rC,EACAirC,EACAC,EACA/nC,EACA/F,EACA,EACA,MAAe,GAAA2uC,GAAAC,EAAA,EAAOJ,EAAA,CAAeT,QAAAA,EAAAnhB,QAAAA,CAAA,EAAkB,GAAY,GAAA3M,GAAA4uB,CAAA,EAAI,UACvE,IACA,IAAA9mE,EAAA,MAAoC,GAAA+5D,EAAA1tH,CAAA,EAASw9G,EAAS/iC,GAAAj0C,CAAQ,cAC9DgoD,SAAAA,EACAmD,oBAAAA,CACA,GACA,GAAAh+B,EAAA53D,MAAA,EAAA+9H,GAAA/9H,OAAA,CAGA,GAAA43D,EAAA53D,MAAA,GAAA+9H,EAAA/9H,MAAA,CACA,OAGA,GAAA43D,EAAA53D,MAAA,CAAA+9H,EAAA/9H,MAAA,IAAA09H,EACA,QAAA35H,EAAAg6H,GAAA/9H,OAAA,GAA6D+D,EAAA6zD,EAAA53D,MAAA,CAAkB+D,IAAA,CAC/E,IAAA6zD,EAAA,MAAiD,GAAA+5D,EAAA1tH,CAAA,EAASw9G,EAAS/iC,GAAAj0C,CAAQ,cAC3E6nD,YAAAvuF,EACA6xF,oBAAAA,CACA,GACA7b,EAAA6jD,OAAA,CAAAhmE,EAAAmmE,GACAA,EAAAnmE,CACA,CAEA,CAGA,EAAAmmE,GAAA/9H,QAEAyyF,YAAAA,GAAA,CAAA76B,GAAA53D,QAGA43D,EAAA53D,MAAA,EAAA43D,EAAA53D,MAAA,CAAA+9H,EAAA/9H,MAAA,IACA+5E,EAAA6jD,OAAA,CAAAhmE,EAAAmmE,GACAA,EAAAnmE,EAEA,CACA,MAAA21D,EAAA,CACAxzC,EAAA0iC,OAAA,GAAA8Q,EACA,CACA,EAAS,CACToQ,YAAAA,EACAttB,SAAAxgB,CACA,GACA,MAEAmuC,EAAA,GACAC,EAAA,IAAAD,EAAA,GACA,WACA,IACA,IAAA9L,EAAA,MACA,GAAAzQ,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACA,IAAAy1G,EAAAzQ,EAAAyQ,SAAA,CAAAiM,UAAA,CAAA3S,IAAA,IAAA0G,cAAAA,EAAA/5G,MAAA,CAAAsE,IAAA,SACA,EAEAy1G,EAAAnwH,KAAA,CADA0/G,EAAAyQ,SAAA,CAGA,OAAAzQ,EAAAyQ,SAAA,CACA,IACA,CAAwB+L,YAAAU,CAAA,EAA4B,MAAAzM,EAAA0M,SAAA,EACpDhvE,OAAA,aACAivE,OAAAj2H,CAAA,EACA,IAAAo1H,EACA,OAEA,IAAApmE,EAAA8P,CADA+5C,EAAA+P,KAAA,EAAAsN,YAAAlnE,OAAA8P,QAAkFq3D,GAAAp0F,CAAW,EAC7F/hC,EAAAiJ,MAAA,EACA+rH,EAAAhmE,EAAAmmE,GACAA,EAAAnmE,CACA,EACA6kD,QAAA/sG,CAAA,EACA+sG,IAAA/sG,EACA,CACA,GACAuuH,EAAAU,EACAX,GACAC,GACA,CACA,MAAA1Q,EAAA,CACA9Q,IAAA8Q,EACA,CACA,KACA,IAAA0Q,IAGA,GOzC0Cxc,EAAA/6E,GAC1Cs4F,iBAAA,GAAoC,GAAAA,GAAA10F,CAAA,EAAgBm3E,EAAA/6E,GACpDu4F,mBAAA,GAAsCA,CNtD/B,SAAAxd,CAAA,CAAAgR,CAAA,EACP,IAAY7nD,IAAAA,CAAA,CAAA55D,QAAAA,CAAA,CAAA01B,KAAAA,CAAA,CAAAikE,MAAAA,EAAA,GAAA1sB,UAAAA,CAAA,CAAAtB,UAAAA,CAAA,CAAA8/B,QAAAA,CAAA,CAAAyiB,OAAAA,CAAA,CAAApvB,KAAAguB,CAAA,CAAAjuC,gBAAAA,EAAA4xB,EAAA5xB,eAAA,CAAAt4E,OAAA+8G,CAAA,EAAmJ7B,EA8L/J,MAAAyL,CA5LA,SAAAJ,EACAA,EACA,iBAAAnhD,GAEA,cAAA8kC,EAAAyQ,SAAA,CAAAz1G,IAAA,EAEAglG,CAAAA,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACAglG,cAAAA,EAAAyQ,SAAA,CAAAiM,UAAA,IAAAhmH,MAAA,CAAAsE,IAAA,CANA,EA2LA0iH,CAjLA,KACA,IAAA5nH,EAAA+8G,GAAA,GACA+J,EAA2B,GAAAC,GAAA95F,CAAA,EAAS,CACpC,qBACAxzB,EACA01B,EACAikE,EACA8W,EAAA8c,GAAA,CACAtgD,EACA4R,EACAt4E,EACAolE,EACA,EACA,MAAe,GAAA6hD,GAAAC,EAAA,EAAOJ,EAAA,CAAea,OAAAA,EAAAziB,QAAAA,CAAA,EAAiB,QACtD2iB,EAGA7iG,CAFAz3B,MAAAA,IAAA63E,GACAyiD,CAAAA,EAAAziD,EAAA,IAEA,IAAA0iD,EAAA,GACAC,EAA4B,GAAAxvB,GAAA4uB,CAAA,EAAI,UAChC,IAAAW,EAAA,CACA,IACA9iG,EAAA,MAAwC,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAAS8R,GAAyB,8BACnF3oD,IAAAA,EACA55D,QAAAA,EACA01B,KAAAA,EACAu3C,UAAAA,EACA1mE,OAAAA,EACAolE,UAAAA,CACA,EACA,CACA,OACA0iD,EAAA,GACA,MACA,CACA,IACA,IAAAjhD,EACA,GAAA7hD,EACA6hD,EAAA,MAAqC,GAAAuzC,EAAA1tH,CAAA,EAASw9G,EAAS8U,GAAgB,qBAAwBh6F,OAAAA,CAAA,OAE/F,CAIA,IAAA+1D,EAAA,MAAkD,GAAAq/B,EAAA1tH,CAAA,EAASw9G,EAASpvB,GAAAl9C,CAAc,uBAKlFipC,EADAghD,GAAAA,EAAA9sC,EACA,MAAyC,GAAAq/B,EAAA1tH,CAAA,EAASw9G,EAAS+T,GAAiB,sBAC5E5qD,IAAAA,EACA55D,QAAAA,EACA01B,KAAAA,EACAu3C,UAAAA,EACAtB,UAAAyiD,EAAA,GACAxiD,QAAA0V,EACA/6E,OAAAA,CACA,GAGA,GAEA6nH,EAAA9sC,CACA,CACA,GAAAlU,IAAAA,EAAAv9E,MAAA,CACA,OACA,GAAA8pG,EACA5wB,EAAAmlD,MAAA,CAAA9gD,QAEA,QAAAvuE,KAAAuuE,EACArE,EAAAmlD,MAAA,EAAArvH,EAAA,CACA,CACA,MAAA09G,EAAA,CAGAhxF,GAAAgxF,aAAiDgS,GAAAC,EAAoB,EACrEH,CAAAA,EAAA,IACAtlD,EAAA0iC,OAAA,GAAA8Q,EACA,CACA,EAAa,CACboQ,YAAA,GACAttB,SAAAxgB,CACA,GACA,iBACAtzD,GACA,MAA0B,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAASyV,GAAe,oBAAuB36F,OAAAA,CAAA,GAClF+iG,GACA,CACA,EACA,KAwFAG,CAvFA,KAEA,IAAApB,EAA2B,GAAAC,GAAA95F,CAAA,EAAS,CACpC,qBACAxzB,EACA01B,EACAikE,EACA8W,EAAA8c,GAAA,CACAtgD,EACA4R,EARAykC,GAAA,GAUA,EACA0J,EAAA,GACAC,EAAA,IAAAD,EAAA,GACA,MAAe,GAAAQ,GAAAC,EAAA,EAAOJ,EAAA,CAAea,OAAAA,EAAAziB,QAAAA,CAAA,EAAiB,IAEtD,WACA,IACA,IAAAyV,EAAA,MACA,GAAAzQ,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACA,IAAAy1G,EAAAzQ,EAAAyQ,SAAA,CAAAiM,UAAA,CAAA3S,IAAA,IAAA0G,cAAAA,EAAA/5G,MAAA,CAAAsE,IAAA,SACA,EAEAy1G,EAAAnwH,KAAA,CADA0/G,EAAAyQ,SAAA,CAGA,OAAAzQ,EAAAyQ,SAAA,CACA,IACA1kD,EAAAyQ,EAC0Bu0C,GAAiB,CAC3C5nD,IAAAA,EACAqT,UAAAA,EACAv3C,KAAAA,CACA,GACA,GACA,CAA4Bu3F,YAAAU,CAAA,EAA4B,MAAAzM,EAAA0M,SAAA,EACxDhvE,OAAA,SAA2C5+C,QAAAA,EAAAw8D,OAAAA,CAAA,EAAiB,CAC5DqxD,OAAAj2H,CAAA,EACA,IAAAo1H,EACA,OACA,IAAAnuH,EAAAjH,EAAAiJ,MAAA,CACA,IACA,IAAwCosE,UAAAA,CAAA,CAAAv3C,KAAAA,CAAA,EAAoBqnC,GAAc,CAC1EnD,IAAAA,EACAhiE,KAAAiH,EAAAjH,IAAA,CACA4kE,OAAA39D,EAAA29D,MAAA,CACAj2D,OAAA+8G,CACA,GACAoL,EAAkD,GAAApK,GAAAC,CAAA,EAAS1lH,EAAA,CAC3D62B,KAAAA,EACAu3C,UAAAA,CACA,GACAlE,EAAAmlD,MAAA,EAAAQ,EAAA,CACA,CACA,MAAAnS,EAAA,KACAtvC,EACAy2C,EACA,GAAAnH,aAAmDsF,EAAAsC,EAAqB,EACxE5H,aAAmDsF,EAAA3tF,EAAuB,EAE1E,GAAAovF,EACA,OACAr2C,EAAAsvC,EAAAmF,OAAA,CAAAhyH,IAAA,CACAg0H,EAAAnH,EAAAmF,OAAA,CAAApqD,MAAA,EAAA/uB,KAAA,cAAA7yC,GAAAA,EAAAhG,IAAA,EACA,CAEA,IAAAg/H,EAAkD,GAAApK,GAAAC,CAAA,EAAS1lH,EAAA,CAC3D62B,KAAAguF,EAAA,MACAz2C,UAAAA,CACA,GACAlE,EAAAmlD,MAAA,EAAAQ,EAAA,CACA,CACA,EACAjjB,QAAA/sG,CAAA,EACAqqE,EAAA0iC,OAAA,GAAA/sG,EACA,CACA,GACAuuH,EAAAU,EACAX,GACAC,GACA,CACA,MAAA1Q,EAAA,CACA9Q,IAAA8Q,EACA,CACA,KACA,IAAA0Q,KAEA,IAEA,GM1IwDxc,EAAA/6E,GACxDi5F,WAAA,GAA8BA,CLrDvB,SAAAle,CAAA,EAA8BzwG,QAAAA,CAAA,CAAA01B,KAAAA,CAAA,CAAAikE,MAAAA,EAAA,GAAApxB,MAAAA,CAAA,CAAA7O,OAAAA,CAAA,CAAAiS,UAAAA,CAAA,CAAA8/B,QAAAA,CAAA,CAAAyiB,OAAAA,CAAA,CAAApvB,KAAAguB,CAAA,CAAAjuC,gBAAAA,EAAA4xB,EAAA5xB,eAAA,CAAAt4E,OAAA+8G,CAAA,CAAiJ,MAsGtL0J,EACAC,EAtGA,IAAAC,EACA,SAAAJ,EACAA,EACA,iBAAAnhD,GAEA,cAAA8kC,EAAAyQ,SAAA,CAAAz1G,IAAA,EAEAglG,CAAAA,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACAglG,cAAAA,EAAAyQ,SAAA,CAAAiM,UAAA,IAAAhmH,MAAA,CAAAsE,IAAA,EAIAlF,EAAA+8G,GAAA,GAoKA,OAAA4J,EAAA0B,CAnKA,KACA,IAAAvB,EAA2B,GAAAC,GAAA95F,CAAA,EAAS,CACpC,aACAxzB,EACA01B,EACAikE,EACA8W,EAAA8c,GAAA,CACAhlD,EACAsW,EACAlT,EACA,EACA,MAAe,GAAA6hD,GAAAC,EAAA,EAAOJ,EAAA,CAAea,OAAAA,EAAAziB,QAAAA,CAAA,EAAiB,QACtD2iB,EAGA7iG,CAFAz3B,MAAAA,IAAA63E,GACAyiD,CAAAA,EAAAziD,EAAA,IAEA,IAAA0iD,EAAA,GACAC,EAA4B,GAAAxvB,GAAA4uB,CAAA,EAAI,UAChC,IAAAW,EAAA,CACA,IACA9iG,EAAA,MAAwC,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAASiS,GAAiB,sBAC3E1iH,QAAAA,EACA01B,KAAAA,EACA6yC,MAAAA,EACA7O,OAAAA,EACAnzD,OAAAA,EACAolE,UAAAA,CACA,EACA,CACA,OACA0iD,EAAA,GACA,MACA,CACA,IACA,IAAAjhD,EACA,GAAA7hD,EACA6hD,EAAA,MAAqC,GAAAuzC,EAAA1tH,CAAA,EAASw9G,EAAS8U,GAAgB,qBAAwBh6F,OAAAA,CAAA,OAE/F,CAIA,IAAA+1D,EAAA,MAAkD,GAAAq/B,EAAA1tH,CAAA,EAASw9G,EAASpvB,GAAAl9C,CAAc,uBAKlFipC,EADAghD,GAAAA,IAAA9sC,EACA,MAAyC,GAAAq/B,EAAA1tH,CAAA,EAASw9G,EAAS5kC,GAAO,YAClE7rE,QAAAA,EACA01B,KAAAA,EACA6yC,MAAAA,EACA7O,OAAAA,EACAiS,UAAAyiD,EAAA,GACAxiD,QAAA0V,CACA,GAGA,GAEA8sC,EAAA9sC,CACA,CACA,GAAAlU,IAAAA,EAAAv9E,MAAA,CACA,OACA,GAAA8pG,EACA5wB,EAAAmlD,MAAA,CAAA9gD,QAEA,QAAAvuE,KAAAuuE,EACArE,EAAAmlD,MAAA,EAAArvH,EAAA,CACA,CACA,MAAA09G,EAAA,CAGAhxF,GAAAgxF,aAAiDgS,GAAAC,EAAoB,EACrEH,CAAAA,EAAA,IACAtlD,EAAA0iC,OAAA,GAAA8Q,EACA,CACA,EAAa,CACboQ,YAAA,GACAttB,SAAAxgB,CACA,GACA,iBACAtzD,GACA,MAA0B,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAASyV,GAAe,oBAAuB36F,OAAAA,CAAA,GAClF+iG,GACA,CACA,EACA,MAEAtB,EAAA,GACAC,EAAA,IAAAD,EAAA,GACA,WACA,IACA,IAAA9L,EAAA,MACA,GAAAzQ,aAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EACA,IAAAy1G,EAAAzQ,EAAAyQ,SAAA,CAAAiM,UAAA,CAAA3S,IAAA,IAAA0G,cAAAA,EAAA/5G,MAAA,CAAAsE,IAAA,SACA,EAEAy1G,EAAAnwH,KAAA,CADA0/G,EAAAyQ,SAAA,CAGA,OAAAzQ,EAAAyQ,SAAA,CACA,IACAyB,EAAAjpD,GAAA6O,CAAAA,EAAA,CAAAA,EAAA,CAAAz0E,KAAAA,CAAA,EACA0oE,EAAA,GACAmmD,IAOAnmD,EAAA,CANAmmD,EAAAzL,OAAA,IAA+DsK,GAAiB,CAChF5nD,IAAA,CAAA2O,EAAA,CACA0E,UAAA1E,EAAA74E,IAAA,CACAgmC,KAAAA,CACA,IAEA,CACA6yC,GACA/L,CAAAA,EAAAA,CAAA,MAEA,IAAwBywD,YAAAU,CAAA,EAA4B,MAAAzM,EAAA0M,SAAA,EACpDhvE,OAAA,SAAuC5+C,QAAAA,EAAAw8D,OAAAA,CAAA,EAAiB,CACxDqxD,OAAAj2H,CAAA,EACA,IAAAo1H,EACA,OACA,IAAAnuH,EAAAjH,EAAAiJ,MAAA,CACA,IACA,IAAoCosE,UAAAA,CAAA,CAAAv3C,KAAAA,CAAA,EAAoBqnC,GAAc,CACtEnD,IAAA+oD,GAAA,GACA/qH,KAAAiH,EAAAjH,IAAA,CACA4kE,OAAA39D,EAAA29D,MAAA,CACAj2D,OAAAA,CACA,GACAmoH,EAA8C,GAAApK,GAAAC,CAAA,EAAS1lH,EAAA,CAAQ62B,KAAAA,EAAAu3C,UAAAA,CAAA,GAC/DihD,EAAA,CAAAQ,EAAA,CACA,CACA,MAAAnS,EAAA,KACAtvC,EACAy2C,EACA,GAAAnH,aAA+CsF,EAAAsC,EAAqB,EACpE5H,aAA+CsF,EAAA3tF,EAAuB,EAEtE,GAAAovF,EACA,OACAr2C,EAAAsvC,EAAAmF,OAAA,CAAAhyH,IAAA,CACAg0H,EAAAnH,EAAAmF,OAAA,CAAApqD,MAAA,EAAA/uB,KAAA,cAAA7yC,GAAAA,EAAAhG,IAAA,EACA,CAEA,IAAAg/H,EAA8C,GAAApK,GAAAC,CAAA,EAAS1lH,EAAA,CACvD62B,KAAAguF,EAAA,MACAz2C,UAAAA,CACA,GACAihD,EAAA,CAAAQ,EAAA,CACA,CACA,EACAjjB,QAAA/sG,CAAA,EACA+sG,IAAA/sG,EACA,CACA,GACAuuH,EAAAU,EACAX,GACAC,GACA,CACA,MAAA1Q,EAAA,CACA9Q,IAAA8Q,EACA,CACA,KACA,IAAA0Q,IAGA,GK7HwCxc,EAAA/6E,GACxCm5F,yBAAA,GAA4CA,CJhErC,SAAApe,CAAA,EAA4C9W,MAAAA,EAAA,GAAA8R,QAAAA,CAAA,CAAAqjB,eAAAA,CAAA,CAAAhwB,KAAAguB,CAAA,CAAAjuC,gBAAAA,EAAA4xB,EAAA5xB,eAAA,CAA+F,MA+ClJmuC,EACAC,EAyBA,MAAAC,CAxEA,SAAAJ,EAAAA,EAAArc,cAAAA,EAAAyQ,SAAA,CAAAz1G,IAAA,EAyEAsjH,CAxEA,KACA,IAAA1B,EAA2B,GAAAC,GAAA95F,CAAA,EAAS,CACpC,2BACAi9E,EAAA8c,GAAA,CACA5zB,EACA9a,EACA,EACA,MAAe,GAAA2uC,GAAAC,EAAA,EAAOJ,EAAA,CAAeyB,eAAAA,EAAArjB,QAAAA,CAAA,EAAyB,QAC9DlgF,EACA,IAAA+iG,EAA4B,GAAAxvB,GAAA4uB,CAAA,EAAI,UAChC,IACA,IAAAniG,EACA,IACAA,EAAA,MAA2C,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAASmS,GAA8B,sCAC3F,MACA,CACA,MAAArG,EAAA,CAEA,MADA+R,IACA/R,CACA,CAEA,IAAAyS,EAAA,MAAyC,GAAArO,EAAA1tH,CAAA,EAASw9G,EAAS8U,GAAgB,qBAAwBh6F,OAAAA,CAAA,GACnG,GAAAyjG,IAAAA,EAAAn/H,MAAA,CACA,OACA,GAAA8pG,EACA5wB,EAAA+lD,cAAA,CAAAE,QAEA,QAAAj/H,KAAAi/H,EACAjmD,EAAA+lD,cAAA,EAAA/+H,EAAA,CACA,CACA,MAAAwsH,EAAA,CACAxzC,EAAA0iC,OAAA,GAAA8Q,EACA,CACA,EAAa,CACboQ,YAAA,GACAttB,SAAAxgB,CACA,GACA,iBACAtzD,GACA,MAA0B,GAAAo1F,EAAA1tH,CAAA,EAASw9G,EAASyV,GAAe,oBAAuB36F,OAAAA,CAAA,GAClF+iG,GACA,CACA,EACA,MAEAtB,EAAA,GACAC,EAAA,IAAAD,EAAA,GACA,WACA,IACA,IAAwBC,YAAAU,CAAA,EAA4B,MAAAld,EAAAyQ,SAAA,CAAA0M,SAAA,EACpDhvE,OAAA,2BACAivE,OAAAj2H,CAAA,EACA,IAAAo1H,EACA,OACA,IAAAjhE,EAAAn0D,EAAAiJ,MAAA,CACAiuH,EAAA,CAAA/iE,EAAA,CACA,EACA0/C,QAAA/sG,CAAA,EACA+sG,IAAA/sG,EACA,CACA,GACAuuH,EAAAU,EACAX,GACAC,GACA,CACA,MAAA1Q,EAAA,CACA9Q,IAAA8Q,EACA,CACA,KACA,IAAA0Q,IAKA,GIZoExc,EAAA/6E,EACpE,CACA,6BEtGAu5F,GAAAr+H,OAAAC,cAAA,CACAq+H,GAAA,CAAA7/G,EAAAlO,EAAApQ,IAAAoQ,KAAAkO,EAAA4/G,GAAA5/G,EAAAlO,EAAA,CAA8Ea,WAAA,GAAAD,aAAA,GAAAD,SAAA,GAAA/Q,MAAAA,CAAA,GAA6Dse,CAAA,CAAAlO,EAAA,CAAApQ,EAC3Io+H,GAAA,CAAA9/G,EAAAlO,EAAApQ,KACAm+H,GAAA7/G,EAAA,iBAAAlO,EAAAA,EAAA,GAAAA,EAAApQ,GACAA,GAOAq+H,GAAA,cAAAhwF,MAKA3vC,YAAA4/H,CAAA,CAAAC,CAAA,EACA,IAAAC,CAQAA,EANAA,EADA,iBAAAD,EACA,CAAwB9lF,QAAA8lF,CAAA,EAClBA,aAAAlwF,MACN,CAAwB2lF,MAAAuK,EAAA9lF,QAAA8lF,EAAA9lF,OAAA,EAExB8lF,GAEA9lF,OAAA,EACA+lF,CAAAA,EAAA/lF,OAAA,CAAA+lF,EAAAxK,KAAA,EAAAv7E,SAAA,IAEA,MAAA+lF,EAAA/lF,OAAA,EAAmCu7E,MAAAwK,EAAAxK,KAAA,GACnCoK,GAAA,gBAEAA,GAAA,uBACA,KAAAz/H,IAAA,mBACA,KAAA2/H,OAAA,CAAAA,CACA,CACA,EACAG,GAAA,GACA,EAAAtQ,KAAA,GACA,CAAaxgH,MAAAmC,EAAAnC,KAAA,CAAA0yD,QAAA,IAEb,CAAa,GAAAvwD,EAAA9P,KAAA,CAAAqgE,QAAA,IAMbq+D,GAAA,CACApwB,SAAA,IACA9xB,QAAA,IACAmiD,YAAA,IACAvO,WAAA,KACA,CACA,EACAl/G,GAAA,MAAAwuG,EAAAkf,EAAA12H,IACSqlH,EAAWI,WAAA,CACpBl0B,MAAAolC,GAAAnf,EAAAkf,GAAA,CACA9qB,QAAAgrB,GAAA52H,EACA,GACA,GACA,IAAAm2H,GAAA,UAAA/4F,IAEA+oF,OAAA,IACWd,EAAWI,WAAA,CAAAjzB,EAAAkjB,IAAA,MACtB,IAAAygB,GAAA,UAAA/4F,IACK+oF,OAAA,IACQ1Y,EAAE,CAAGjb,SAAAA,EAAA7zF,KAAAA,CAAA,KAIlBu7F,GAAA,MAAAsd,EAAAkf,EAAAhhB,EAAA11G,IACSqlH,EAAWI,WAAA,CACpBl0B,MAAAolC,GAAAnf,EAAAkf,GAAA,CACA1zD,OAAA,OACA9gB,KAAAn6C,KAAAC,SAAA,CAAA0tG,GACA9J,QAAAgrB,GAAA52H,EACA,GACA,GACA,IAAAm2H,GAAA,UAAA/4F,IAEA+oF,OAAA,IACWd,EAAWI,WAAA,CAAAjzB,EAAAkjB,IAAA,MACtB,IAAAygB,GAAA,UAAA/4F,IACK+oF,OAAA,IACQ1Y,EAAE,CAAGjb,SAAAA,EAAA7zF,KAAAA,CAAA,KAIdk4H,GAAI,MAAArf,EAAAkf,EAAAI,EAAA92H,KACR,IAAUs0E,QAAAA,CAAA,CAAA8xB,SAAAA,CAAA,CAAAqwB,YAAAA,CAAA,CAAAvO,WAAAA,CAAA,EAA6C,CACvD,GAAAsO,EAAA,CACA,GAAAM,CAAA,EAEAC,EAAA1zH,KAAAC,GAAA,GAAAgxE,EACA,KAAAjxE,KAAAC,GAAA,GAAAyzH,GAAA,CACA,IAAAlzH,EAAA,MAAAmF,GAAAwuG,EAAAkf,EAAA12H,GACA,IAAA6D,EAAAuhH,IAAA,GAQA,OAAa9B,EAAGz/G,EAAA4B,KAAA,CARhB,EACA,IAAc+sF,SAAAA,CAAA,EAAW3uF,EAAA/L,KAAA,CACzB,GAAA06F,EAAAwC,MAAA,GAAAyhC,EACA,OAAehpB,EAAE5pG,EAAA/L,KAAA,EAEjBowH,EAAArkH,EAAA/L,KAAA,EACA,UAAAypD,QAAA,GAAAilC,WAAAhlC,EAAA4kD,GACA,CAGA,CACA,OAASkd,EAAG,IAAA6S,GAAA,yCAA+D7hD,EAAQ,KACnF,EACAqiD,GAAA,CAAAnf,EAAAkf,IACA,GAAYlf,EAAAtpG,MAAA,CAAA8oH,KAAA,CAAoB,GAAGxf,EAAAtpG,MAAA,CAAAhH,OAAA,CAAsB,GAAGwvH,EAAM,EAElEE,GAAA,IACA,IAAAhrB,EAAA,CACA,GAAA5rG,GAAA4rG,OAAA,EAKA,OAHA5rG,GAAAi3H,WACArrB,CAAAA,EAAA,wBAAyC5rG,EAAAi3H,SAAA,CAAe,GAExD,CAAW,GAAArrB,CAAA,mCACX,EAIAsrB,GAAA,MAAA1f,EAAA,CAAqC,GAAAlwB,EAAY,GAEjDivC,GADA,MAAAr8B,GAAAsd,EAFA,UAEAlwB,IAMI6vC,GAAM,MAAA3f,EAAA,CAAoB4f,aAAAA,CAAA,CAAc,GAI5Cb,GAHA,MAAAvtH,GAAAwuG,EAFA,iBAEA,CACAyf,UAAAG,CACA,IAaAC,GAAA,iBAIAC,GAAA,qCACAzyG,GAAA,GACS4uC,EAAMkyD,aAAA,CAEf,QAAc4R,EAAAjzE,WAAW,CAAAqB,GAEzB,OAAAwwE,GAAA,iCAAA/4F,MACA+oF,OAAA,CAAAqR,IAAArR,OAAA,CAAAsR,IAAAtR,OAAA,CAAAuR,IAEAC,GAAA,IACA,IAAAC,EAAAC,GAAAtnF,UACA,EAAA01E,KAAA,GACW3C,EAAIsU,EAAAnyH,KAAA,EACNgoG,EAAG,CAAGmqB,IAAAA,EAAA9/H,KAAA,EACf,EACA+/H,GAAA,IACA,IAAAC,EAAA,CAAAvnF,EAAA7oC,SAAA,MAAA65G,IAAA,IACA+V,GAAA79G,IAAA,CAAAs+G,IAEA,IAAAD,EACA,OAAWxU,EAAI,IAAA6S,GAAA,8DAEf,IAAAyB,EAAAluH,SAAAouH,EAAAhoG,KAAA,CAAAwnG,KAAA,gBACA,MAAAM,GACWtU,EAAI,IAAA6S,GAAA,iDAEN1oB,EAAGmqB,EACZ,EACAJ,GAAA,GAEA,EADAxwH,SAAA,GAAAqwH,IAAA9mF,sBAAAA,EAAAvpC,SAAA,CAISymG,EAAGl9D,GAFD+yE,EAAI,IAAA6S,GAAA,uDAA6EkB,GAAU,KAItGI,GAAA,GACA,KAAAlnF,EAAAppC,OAAA,CACWm8G,EAAI,IAAA6S,GAAA,yDAEN1oB,EAAGl9D,GAEZmnF,GAAA,IACA,IAAAM,EAAA,CAAAznF,EAAA7oC,SAAA,MAAA4qB,MAAA,IACAglG,GAAA79G,IAAA,CAAAq+G,WAEA,IAAAE,EAAAphI,MAAA,CACW0sH,EAAI,IAAA6S,GAAA,8DACX6B,EAAAphI,MAAA,GACO0sH,EAAI,IAAA6S,GAAA,qEAEJ1oB,EAAGl9D,EAEd,EAGA0nF,GAAA,GAAA12E,QAAAE,MAAA,yDACAxR,GAAA,MAAA5oC,EAAAP,EAAAypC,EAAAL,EAAAtT,EAAA,CACAs7F,OAAAD,EACA,CAAC,IACD,IAAUC,OAAAA,CAAA,CAAA3yE,SAAAA,CAAA,EAAmB3oB,EAC7Bu7F,EAAAtzG,GAAA0rB,GAAA41E,OAAA,IAAAiS,GAAAC,EAAAhxH,IAAA8+G,OAAA,IAAAmS,GAAAD,EAAAvxH,IACA,GAAAqxH,EAAAlS,KAAA,GACA,OAAW3C,EAAI6U,EAAA1yH,KAAA,EACf,IAAA8xH,EAAA,OAAsBgB,GAAiBJ,EAAArgI,KAAA,CAAAo4C,EAAAqV,EAAA,EAAA4gE,OAAA,CAAAqS,IACvC,GAAAjB,EAAAtR,KAAA,GACA,OAAW3C,EAAIiU,EAAA9xH,KAAA,EACf,IAAA8xH,EAAAz/H,KAAA,CAAAgQ,OAAA,CAEA,OAAWw7G,EAAI,IAAA6S,GAAA,eADfoB,EAAAz/H,KAAA,CAAA2N,KAAA,EAAA+M,MAAA,kCAGA,IAAAolH,EAAA,MAAAa,GAAAlB,EAAAz/H,KAAA,CAAAogI,GACA,GAAAN,EAAA3R,KAAA,GACA,OAAW3C,EAAIsU,EAAAnyH,KAAA,EACf,IAAAmyH,EAAA9/H,KAAA,CAAAgQ,OAAA,CAEA,OAAWw7G,EAAI,IAAA6S,GAAA,eADfoB,EAAAz/H,KAAA,CAAA2N,KAAA,EAAA+M,MAAA,iCAGA,IAAU/M,MAAAA,CAAA,IAAA+sF,EAAA,CAAqBolC,EAAA9/H,KAAA,CAC/B,OAAS21G,EAAGjb,EACZ,EACA4lC,GAAA,CAAA7nF,EAAAlpC,IACA,EAAAA,KAAA,GAAAA,EACWi8G,EAAI,IAAA6S,GAAA,iCAEJ1oB,EAAGl9D,GAGd+nF,GAAA,CAAA/nF,EAAAzpC,IACA,EAAAA,MAAA,GAAAA,EACWw8G,EAAI,IAAA6S,GAAA,kCAEJ1oB,EAAGl9D,GAGVgoF,GAAiB,MAAAhoF,EAAAL,EAAAqV,IACZ8/D,EAAYI,WAAA,CAAAl1E,EAAAN,MAAA,EAA8BC,UAAAA,CAAA,EAAW,CAAIqV,SAAAA,EAAAE,mBAAA,KAAoC,GACtG,IAAA0wE,GAAA,eAAA/4F,IAGAq7F,GAAA,MAAAjmC,EAAAkmC,KACA,IAAArqC,EAAAmE,EAAA7zF,IAAA,CAAAoI,OAAA,CACA,OAASs+G,EAAYI,WAAA,CAAAiT,EAAArqC,GAAA,GACrB,IAAA8nC,GAAA,cAAA/4F,IACG+oF,OAAA,KACHyR,IAAAt+H,OAAAk5F,EAAAolC,GAAA,IACAplC,EAAA1qF,OAAA,IACA0qF,EAAA/sF,KAAA,KAA2B8xH,EAAAjxE,SAAS,CACpC,4BAAoC+nC,EAAA,kBAAQ,EAAmBmE,EAAAolC,GAAA,CAAa,GAC5EplC,EAAAolC,GAAA,CAAA/1H,QAAA,GACA+1H,EAAA/1H,QAAA,KAGW4rG,EAAGjb,IAEd,EACAgmC,GAAA,GACAb,GAAAnlC,EAAA7zF,IAAA,EAAAwnH,OAAA,IACW1Y,EAAG,CAAG,GAAA/lG,CAAA,IAAA8qF,CAAA,IAKjBmmC,GAAA,MAAAnhB,EAAA,CAA2CnwG,MAAAA,CAAA,CAAAP,OAAAA,CAAA,CAAAypC,QAAAA,CAAA,CAAAL,UAAAA,CAAA,CAAmC,CAAAqV,IAK9EgxE,GAJA,MAAAtmF,GAAA5oC,EAAAP,EAAAypC,EAAAL,EAAA,CACAgoF,OAAA1gB,EAAAze,QAAA,CAAAm/B,MAAA,CACA3yE,SAAAA,CACA,IAMAqzE,GAAA,KACA,EACAC,GAAA,MAAArhB,EAAA/6E,IAWA85F,GAVA,MAAuBM,GACvBrf,EALA,iBAOA,CACAljC,QAAA73C,GAAA63C,SAAA,IACA8xB,SAAA3pE,GAAA2pE,UAAA,IACA8hB,WAAAzrF,GAAAyrF,YAAA0Q,EACA,EACA,CAAM3B,UAAAx6F,EAAA26F,YAAA,IA4EN0B,GAAA,CACA9B,MAAA,8BACA9vH,QAAA,IACA,EACI6xH,GAAY,EAAMhgC,SAAAA,CAAA,IAAA7qF,EAAqB,GAC3C,EACAA,OAAA,CAAc,GAAA4qH,EAAA,IAAA5qH,CAAA,EACd6qF,SAAAA,CACA,GAIAigC,GAAA,CAAA9qH,EAAAq3C,KACA,IAAAiyD,EAAiBuhB,GAAY7qH,GAC7B,OACA,GAAAspG,CAAA,CACA0f,cAAA,GAAAA,GAAA1f,EAAA/6E,GACAu4D,OAAA,GAAsBmiC,GAAM3f,EAAA/6E,GAC5Bo8F,YAAA,GAAAA,GAAArhB,EAAA/6E,GACAk8F,oBAAA,GAAAA,GAAAnhB,EAAA/6E,EAAA8oB,EACA,CACA,EAkBA0zE,GAAA,CACA,CACA56D,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,YACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,gBACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,aACA1sD,KAAA,aACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,kBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,gBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,QACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,UACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,eACA+b,KAAA,SACA,EACA,CACA/b,KAAA,sBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,qBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,mBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,eACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,eACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,oBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,mBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,SACAziI,KAAA,MACA+b,KAAA,QACA,EACA,CACA/b,KAAA,gBACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,eACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,MACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA/b,KAAA,aACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,wBACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,GACA5nE,KAAA,sBACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,YACA+b,KAAA,SACA,EACA,CACA/b,KAAA,kBACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA/b,KAAA,WACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,gBACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,2BACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,gBACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,uBACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA/b,KAAA,SACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA/b,KAAA,UACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,WACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,SACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA/b,KAAA,eACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,eACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,eACA+b,KAAA,SACA,EACA,CACA/b,KAAA,eACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,cACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,cACA+b,KAAA,SACA,EACA,CACA/b,KAAA,cACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA+qD,QAAA,GACA27D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA/b,KAAA,WACA+b,KAAA,OACA,EACA,CACAqsD,UAAA,GACAR,OAAA,CACA,CACAd,QAAA,GACA27D,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA/b,KAAA,WACA+b,KAAA,OACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,mCACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,wCACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,oBACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,UACA6oE,QAAA,CACA,CACA45D,aAAA,SACAziI,KAAA,GACA+b,KAAA,QACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,kBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,cACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACAvN,WAAA,CACA,CACAooE,aAAA,SACAziI,KAAA,MACA+b,KAAA,QACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,wCACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA/b,KAAA,kBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACAvN,WAAA,CACA,CACAooE,aAAA,SACAziI,KAAA,MACA+b,KAAA,QACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,uDACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,qCACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,WACAziI,KAAA,MACA+b,KAAA,UACA,EACA,CACA/b,KAAA,eACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,wBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,QACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,MACA+b,KAAA,OACA,EACA,CACA/b,KAAA,2BACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA/b,KAAA,YACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,oBACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,eACA6oE,QAAA,CACA,CACA45D,aAAA,SACAziI,KAAA,SACA+b,KAAA,QACA,EACA,CACA0mH,aAAA,SACAziI,KAAA,OACA+b,KAAA,QACA,EACA,CACA0mH,aAAA,SACAziI,KAAA,UACA+b,KAAA,QACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,UACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,oBACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,YACAziI,KAAA,aACA+b,KAAA,WACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,kBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,gBACA6oE,QAAA,CACA,CACA45D,aAAA,OACAziI,KAAA,GACA+b,KAAA,MACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,cACA6oE,QAAA,CACA,CACA45D,aAAA,SACAziI,KAAA,GACA+b,KAAA,QACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,YACA6oE,QAAA,CACA,CACA45D,aAAA,OACAziI,KAAA,aACA+b,KAAA,MACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA/b,KAAA,kBACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,YACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,YACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,QACA+b,KAAA,SACA,EACA,CACA/b,KAAA,OACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,aACA6oE,QAAA,CACA,CACA45D,aAAA,OACAziI,KAAA,GACA+b,KAAA,MACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,UACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,aACA6oE,QAAA,CACA,CACA45D,aAAA,SACAziI,KAAA,GACA+b,KAAA,QACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,WACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,OACA6oE,QAAA,CACA,CACA45D,aAAA,SACAziI,KAAA,GACA+b,KAAA,QACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,QACA+b,KAAA,SACA,EACA,CACA/b,KAAA,SACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,QACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,QACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,SACA6oE,QAAA,CACA,CACA45D,aAAA,OACAziI,KAAA,GACA+b,KAAA,MACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,eACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,MACA+b,KAAA,OACA,EACA,CACA/b,KAAA,UACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,mBACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,cACA+b,KAAA,OACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,QACA+b,KAAA,OACA,EACA,CACA/b,KAAA,aACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA/b,KAAA,aACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,WACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,iBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,oBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,eACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA/b,KAAA,eACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,YACA+b,KAAA,SACA,EACA,CACA/b,KAAA,cACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,MACA+b,KAAA,OACA,EACA,CACA/b,KAAA,WACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,MACA+b,KAAA,OACA,EACA,CACA/b,KAAA,4BACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,eACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,UACA+b,KAAA,OACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,QACA+b,KAAA,OACA,EACA,CACA/b,KAAA,+BACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,OACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,KACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,eACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,UACA+b,KAAA,OACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,aACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,QACA+b,KAAA,OACA,EACA,CACA/b,KAAA,cACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,WACA+b,KAAA,SACA,EACA,CACA/b,KAAA,oBACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,UACA6oE,QAAA,GACAJ,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,GACA5nE,KAAA,WACA6oE,QAAA,CACA,CACA45D,aAAA,UACAziI,KAAA,GACA+b,KAAA,SACA,EACA,CACA0sD,gBAAA,aACA1sD,KAAA,UACA,EACA,CACA6rD,OAAA,CACA,CACA66D,aAAA,UACAziI,KAAA,iBACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,MACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,UACAziI,KAAA,SACA+b,KAAA,SACA,EACA,CACA0mH,aAAA,QACAziI,KAAA,MACA+b,KAAA,OACA,EACA,CACA/b,KAAA,qBACA6oE,QAAA,CACA,CACA45D,aAAA,OACAziI,KAAA,UACA+b,KAAA,MACA,EACA,CACA0sD,gBAAA,OACA1sD,KAAA,UACA,EACA,CAIA2mH,GAAA,IACA,IAAAC,EAAuBC,SD7mDhB7Q,CAAA,EACP,IAAYtgH,IAAAA,EAAA,SAAAzR,KAAAA,EAAA,iBAAyC+xH,EAOrD,MAAAhR,CANmB,EAAA8hB,EAAAl8F,CAAA,EAAY,CAC/B,GAAAorF,CAAA,CACAtgH,IAAAA,EACAzR,KAAAA,EACA+b,KAAA,cACA,GACA+mH,MAAA,CAAyB/G,GACzB,EComDyC,CACzCjL,MAAWiS,GAAAp5F,CAAQ,CACnB6nF,UAAe,GAAAwR,GAAAngG,CAAA,EAAImD,GAAAi9F,OACnB,GASA,OACAxB,OATA,MAAAyB,GACAP,EAAAzR,YAAA,EACA5gH,QAVA,6CAWA45D,IAAAs4D,GACAzvG,aAAA,OACAiT,KAAA,CAAAk9F,EAAA,EAKA,CACA,qCC3oDA,IAGMC,GAAA,CACN5C,MAAA,8BACA9vH,QAAA,KAFM,GAHN,WAAAwyB,QAAAA,MAAAA,QAAAA,OAAAmzE,QAAA,EACA/lG,OAAA4yB,OAAAmzE,QAAA,CAAAgtB,IAAA,CACAC,QAAApgG,OAAAmzE,QAAA,CAAAxlB,IAAA,EACE,EAGF,EACC0yC,GAAO,GAAAC,GAAAC,aAAA,EAAE,CACVC,gBAAA,GACAhsH,OAAA0rH,GACAO,QAAA,GACAC,cAAA,GACAC,SAAA,KACA,EACAC,UAAA,KACA,CACA,GACA,SAAAC,GAAA,CACArsH,OAAAtR,CAAA,CACA8V,SAAA0qB,CAAA,CACC,EACD,IAAApnC,EAAAsqC,EAAA,CAAiB,GAAA05F,GAAAQ,QAAA,IAAC,CAAAjyH,EAAAzO,EAAA,CAAa,GAAAkgI,GAAAQ,QAAA,EAAC,KAAAlkI,EAAAosB,EAAA,CAAe,GAAAs3G,GAAAQ,QAAA,EAAC,IAAG,CAAAxgI,EAAA4/B,EAAA,CAAY,GAAAogG,GAAAQ,QAAA,EAAC,IAAG/gI,EAAA,CACnE,GAAAmgI,EAAA,CACA,GAAAh9H,CAAA,EACG,CAAIo6H,MAAAv2F,CAAA,CAAAi5F,OAAA3iI,CAAA,CAAAmQ,QAAAk5B,CAAA,CAAAmlB,SAAAr8C,CAAA,EAA+CzP,EACpD,GAAAugI,GAAAS,SAAA,EAAC,KAMHn6F,EALgD04F,GAAE,CAClDhC,MAAAv2F,EACAs4D,SAFAhiG,EAAkBoiI,GAAE,CAAGO,OAAA3iI,CAAA,GAAeoiI,KAGtCjyH,QAAAk5B,CACA,EAAKl3B,GAEL,EAAG,CAAAu3B,EAAA1pC,EAAAqpC,EAAAl3B,EAAA,EACH,IAAAia,EAAY,GAAA62G,GAAAU,WAAA,EAAC,IACb,IAAYnqF,QAAAqtE,CAAA,CAAA1tE,UAAA1nC,CAAA,CAAAovH,IAAAt+F,CAAA,CAAA8yE,SAAA1vG,CAAA,CAAAi+H,IAAAx9H,CAAA,CAAAy9H,YAAAxkI,CAAA,CAAAykI,OAAA1Z,CAAA,CAAAwY,QAAA/oF,CAAA,CAAAkqF,cAAAv/E,CAAA,EAAiHta,CAC7HnnC,CAAAA,EAAA,IAAA4oB,EAAA,CAAek1G,IAAAt+F,EAAA8yE,SAAA1vG,EAAAi+H,IAAAx9H,EAAAy9H,YAAAxkI,EAAAykI,OAAA1Z,EAAAwY,QAAA/oF,EAAAkqF,cAAAv/E,CAAA,GAAsF3hB,EAAA,CAAO2W,QAAAqtE,EAAA1tE,UAAA1nC,CAAA,EAC5G,EAAG,IAGH,MAAyB,GAAAuyH,GAAAC,GAAA,EACzBjB,GAAAkB,QAAA,CACA,CACAnjI,MAAA,CACAojI,UAAAllI,EACAkkI,gBAAA3xH,EACA4xH,QAAA7jI,EACA8jI,cAAApgI,EACAkU,OAAAzU,EACA4gI,SAAAl3G,EACAm3G,UAbG,KACHxgI,EAAA,IAAA4oB,EAAA,IAAekX,EAAA,GACf,CAYA,EACAlnB,SAAA0qB,CACA,EAEA,CACA,SAAAiD,KACA,MAAS,GAAA25F,GAAAmB,UAAA,EAAEpB,GACX,CACA,SAAA/qB,KACA,IAAUksB,UAAAt+H,CAAA,EAAeyjC,KACzB,OAAAzjC,CACA,CAoGA,IAAAw+H,GAAA,CACA9mD,QAAA,IACA8xB,SAAA,IACA,EAsCAi1B,GAAA,CACA/mD,QAAA,IACA8xB,SAAA,IACA,EAgEA,SAAAk1B,GAAA,CACAp+B,OAAAtgG,CAAA,CACAkB,KAAAs/B,CAAA,CACC,EAED,MAAyB,GAAA29F,GAAAQ,IAAA,EACzB,MACA,CACAC,MAAA,6BACA/2D,MALA7nE,IAAAA,EAMAsgG,OAAAtgG,EACAkB,KAAA,OACA4U,SAAA,CACwB,GAAAqoH,GAAAC,GAAA,EAAC,SAAYtoH,SAAA,mBACb,GAAAqoH,GAAAQ,IAAA,EAAC,KAAQz9H,KAAA29H,EAAA,CAAAr+F,EAAA,CAAAs+F,SAAA,UAAAhpH,SAAA,CACP,GAAAqoH,GAAAC,GAAA,EAAC,QAAW1hG,EAAA,uaACZ,GAAAyhG,GAAAC,GAAA,EAAC,QAAW1hG,EAAA,soFACtC,GACwB,GAAAyhG,GAAAC,GAAA,EAAC,QAAWtoH,SAA0B,GAAAqoH,GAAAC,GAAA,EAAC,YAAe90H,GAAA,IAAAwM,SAAmC,GAAAqoH,GAAAC,GAAA,EAAC,QAAWl9H,KAAA29H,EAAA,CAAAr+F,EAAA,CAAA9D,EAAA,iBAAiC,EAAG,GACjK,EAGA,CACA,IAAAmiG,GAAA,CACAE,OAAA,UACAC,MAAA,SACA,EACA,IAAAC,GAAA,YACA,SAAAC,GAAA,CAAc53E,KAAAtnD,EAAA,UAAA8V,SAAA0qB,CAAA,CAAAwtE,UAAA50G,CAAA,IAAAsqC,EAAsD,EACpE,MAAyB,GAAAy6F,GAAAC,GAAA,EAAC,UAAaxoH,KAAA,SAAAo4F,UAAAmxB,EAAA,CAAAn/H,EAAA,EAAA5G,EAAA,GAAAsqC,CAAA,CAAA5tB,SAAA0qB,CAAA,EACvC,CACA,IAAA2+F,GAAA,CACAC,QALA,YAMAC,UAAAJ,GACAK,SAPA,YAQAz3F,MARA,WASA,EACA,SAAA03F,GAAA,CACAh6E,MAAAvlD,CAAA,CACAw/H,QAAAh/F,CAAA,CACC,EACD,MAAyB,GAAA29F,GAAAQ,IAAA,EAACO,GAAA,CAAO53E,KAAA,UAAAk4E,QAAAh/F,EAAA1qB,SAAA,CACb,GAAAqoH,GAAAC,GAAA,EAACM,GAAA,CAAOp+B,OAAA,GAAAp/F,KAAA,UACR,GAAAi9H,GAAAC,GAAA,EAAC,QAAW/vH,MAAA,CAASoxH,WAAA,GAAe3pH,SAAA9V,CAAA,GACxD,EACA,CAYA,SAAA0/H,GAAA,CAAcC,QAAA3/H,CAAA,CAAY,EAC1B,MAAyB,GAAAm+H,GAAAC,GAAA,EAAC,OAAUpwB,UAFpC,YAEoCl4F,SAAyC,GAAAqoH,GAAAQ,IAAA,EAC7E,SACA,CACA/oH,KAAA,SACAo4F,UAAAixB,GACA5wH,MAAA,CACAuxH,UAAA,iCACA,EACAJ,QAAAx/H,EACA8V,SAAA,CACwB,GAAAqoH,GAAAQ,IAAA,EACxB,MACA,CACA92D,MAAA,KACAy4B,OAAA,KACAu/B,QAAA,YACA3+H,KAAA,OACA09H,MAAA,6BACA5wB,UApBA,YAqBAl4F,SAAA,CAC8B,GAAAqoH,GAAAC,GAAA,EAAC,SAAYtoH,SAAA,aACb,GAAAqoH,GAAAC,GAAA,EAC9B,OACA,CACA1hG,EAAA,0YACAojG,OAAA,QACAC,YAAA,MACAC,cAAA,QACAC,eAAA,OACA,GAEA,GAGA,WACA,EAEA,EACA,CACA,SAAAC,GAAA,CACAC,SAAAngI,CAAA,CACA2/H,QAAAn/F,CAAA,CACA4/F,YAAAhnI,CAAA,CACC,MAvDDonC,EAwDA,IAAAkD,EAAA/3B,EAAA,CAAiB,GAAAyxH,GAAAQ,QAAA,EAAC,IAAA1gI,EAAU,GAAAkgI,GAAAiD,MAAA,EAAE,MAxD9B7/F,EAyDA,IAAA70B,EAAA,IAxDE,GAAAyxH,GAAAS,SAAA,EAAC,KACH,SAAAzkI,EAAAsqC,CAAA,EACA1jC,EAAAqwG,OAAA,GAAArwG,EAAAqwG,OAAA,CAAAiwB,QAAA,CAAA58F,EAAAmgB,MAAA,GAAArjB,GACA,CACA,OAAA+/F,SAAAC,gBAAA,aAAApnI,GAAA,KACAmnI,SAAAE,mBAAA,aAAArnI,EACA,CACA,EAAG,CAiDH8D,EAjDGsjC,EAAA,EAkDH,IAAA9mC,EAAA,CAAAsG,MAAAA,EAAA,OAAAA,EAAAwvG,QAAA,OAAqDxvG,MAAAA,EAAA,OAAAA,EAAAg7H,GAAA,CAA2B,EAAAl1G,EAAA,CAAA9lB,MAAAA,EAAA,OAAAA,EAAAi+H,MAAA,qCAChF,MAAyB,GAAAE,GAAAC,GAAA,EACzB,MACA,CACApwB,UAAA,sCACA0yB,IAAAxjI,EACA4Y,SAAgC,GAAAqoH,GAAAQ,IAAA,EAChC,MACA,CACAtwH,MAAA,CACA4b,QAAA,OACA02G,cAAA,SACAC,WAAA,UACA,EACA9qH,SAAA,CAC4B,GAAAqoH,GAAAQ,IAAA,EAC5B,SACA,CACA/oH,KAAA,SACAo4F,UAAAixB,GACAO,QAAA,IAAA7zH,EAAA,CAAA+3B,GACA5tB,SAAA,CACkC,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAtE7C,YAsE6C5gG,IAAA0Y,EAAAhP,IAAA,WACX,GAAAqnH,GAAAC,GAAA,EAAC,QAAWpwB,UAvE9C,YAuE8Cl4F,SAAApc,CAAA,GAC9C,CAAAN,GAAwC,GAAA+kI,GAAAQ,IAAA,EACxC,MACA,CACA92D,MAAA,KACAy4B,OAAA,KACAu/B,QAAA,YACA3+H,KAAA,OACA09H,MAAA,6BACA9oH,SAAA,CACwC,GAAAqoH,GAAAC,GAAA,EAAC,SAAYtoH,SAAA,aACb,GAAAqoH,GAAAC,GAAA,EAAC,KAAQyC,QAAA,MAAA/qH,SAA0C,GAAAqoH,GAAAC,GAAA,EAC3F,OACA,CACA0C,SAAA,UACAC,SAAA,UACArkG,EAAA,muBACAx7B,KAAA,OACA,EACA,GACA,GAGA,GAGA9D,GAjDgF,CAAAhE,GAiD/C,GAAA+kI,GAAAC,GAAA,EAACsB,GAAA,CAAOC,QAAAn/F,CAAA,GACzC,EAGA,EAEA,CACA,IAAAuf,GAAA,WACA,MAAAA,CAAAA,GAAAhlD,OAAAwM,MAAA,WAAAi5B,CAAA,EACA,QAAApnC,EAAAsqC,EAAA,EAAA/3B,EAAA23C,UAAAtpD,MAAA,CAA6C0pC,EAAA/3B,EAAO+3B,IAEpD,QAAAxmC,KADA9D,EAAAkqD,SAAA,CAAA5f,EAAA,CAEA3oC,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAlO,EAAA8D,IAAAsjC,CAAAA,CAAA,CAAAtjC,EAAA,CAAA9D,CAAA,CAAA8D,EAAA,EAEA,OAAAsjC,CACA,GAAG+iB,MAAA,KAAAD,UACH,EACA,SAAA09E,GAAAhhI,CAAA,CAAAwgC,CAAA,EACA,IAAApnC,EAAA,GACA,QAAAsqC,KAAA1jC,EACAjF,OAAAwR,SAAA,CAAAC,cAAA,CAAAlF,IAAA,CAAAtH,EAAA0jC,IAAAlD,EAAAA,EAAArX,OAAA,CAAAua,IAAAtqC,CAAAA,CAAA,CAAAsqC,EAAA,CAAA1jC,CAAA,CAAA0jC,EAAA,EACA,GAAA1jC,MAAAA,GAAA,mBAAAjF,OAAA0oD,qBAAA,CACA,QAAA93C,EAAA,EAAA+3B,EAAA3oC,OAAA0oD,qBAAA,CAAAzjD,GAAyD2L,EAAA+3B,EAAA1pC,MAAA,CAAc2R,IACvE60B,EAAAA,EAAArX,OAAA,CAAAua,CAAA,CAAA/3B,EAAA,GAAA5Q,OAAAwR,SAAA,CAAAm3C,oBAAA,CAAAp8C,IAAA,CAAAtH,EAAA0jC,CAAA,CAAA/3B,EAAA,GAAAvS,CAAAA,CAAA,CAAAsqC,CAAA,CAAA/3B,EAAA,EAAA3L,CAAA,CAAA0jC,CAAA,CAAA/3B,EAAA,GACA,OAAAvS,CACA,CAOA,IAAA6nI,GAAA,4BAAA95G,GAAA,0BA+FA+5G,GAAA,SAAAlhI,CAAA,EACA,IAAAwgC,EAAAxgC,EAAAmhI,OAAA,CAAA/nI,EAAA4nI,GAAAhhI,EAAA,aACA,IAAAwgC,EACA,kFACA,IAAAkD,EAAAlD,EAAA4gG,IAAA,GACA,IAAA19F,EACA,wCACA,OAAS05F,GAAAiE,aAAe,CAAA39F,EAAAqc,GAAA,GAAQ3mD,GAChC,CACA8nI,CAAAA,GAAAI,eAAA,IAIA,IAAAC,IAjBAvhI,KAAA,IAAAA,GAAAA,CAAAA,EAAA,IAEAwgC,CAzDAA,KAAA,IAAAA,GAAAA,CAAAA,EAJA,SAAAxgC,CAAA,EACA,OAAAA,CACA,CAEA,EACA5G,EAAA,GAAAsqC,EAAA,GAuDAlD,EAvDA,CACA4gG,KAAA,WACA,GAAA19F,EACA,gHACA,OAAAtqC,EAAAY,MAAA,CAAAZ,CAAA,CAAAA,EAAAY,MAAA,IAmDA,IAlDA,EACAwnI,UAAA,SAAAtkI,CAAA,EACA,IAAAxD,EAAA8mC,EAAAtjC,EAAAwmC,GACA,OAAAtqC,EAAA2G,IAAA,CAAArG,GAAA,WACAN,EAAAA,EAAAs8B,MAAA,UAAA5P,CAAA,EACA,OAAAA,IAAApsB,CACA,EACA,CACA,EACA+nI,iBAAA,SAAAvkI,CAAA,EACA,IAAAwmC,EAAA,GAAmBtqC,EAAAY,MAAA,EAAU,CAC7B,IAAAN,EAAAN,CACAA,CAAAA,EAAA,GAAAM,EAAAyV,OAAA,CAAAjS,EACA,CACA9D,EAAA,CACA2G,KAAA,SAAA+lB,CAAA,EACA,OAAA5oB,EAAA4oB,EACA,EACA4P,OAAA,WACA,OAAAt8B,CACA,CACA,CACA,EACAsoI,aAAA,SAAAxkI,CAAA,EACAwmC,EAAA,GACA,IAAAhqC,EAAA,GACA,GAAAN,EAAAY,MAAA,EACA,IAAA8rB,EAAA1sB,CACAA,CAAAA,EAAA,GAAA0sB,EAAA3W,OAAA,CAAAjS,GAAAxD,EAAAN,CACA,CACA,IAAAgE,EAAA,WACA,IAAAP,EAAAnD,CACAA,CAAAA,EAAA,GAAAmD,EAAAsS,OAAA,CAAAjS,EACA,EAAO8/B,EAAA,WACP,OAAA2nB,QAAAC,OAAA,GAAAQ,IAAA,CAAAhoD,EACA,CACA4/B,CAAAA,IAAA5jC,EAAA,CACA2G,KAAA,SAAAlD,CAAA,EACAnD,EAAAqG,IAAA,CAAAlD,GAAAmgC,GACA,EACAtH,OAAA,SAAA74B,CAAA,EACA,OAAAnD,EAAAA,EAAAg8B,MAAA,CAAA74B,GAAAzD,CACA,CACA,CACA,CACA,GAMA4mC,OAAA,CAAA+f,GAAA,CAAyB4hF,MAAA,GAAAC,IAAA,IAAoB5hI,GAAAwgC,GAe7CqhG,GAAA,WACA,EAAC34F,GAAOk0F,GAAA0E,UAAY,UAAA9hI,CAAA,CAAAwgC,CAAA,EACpB,IArFAxgC,EArBAwgC,EACApnC,EAyGAA,EAAUgkI,GAAAiD,MAAQ,OAAA38F,EAAY05F,GAAAQ,QAAU,EACxCmE,gBAAAF,GACAG,eAAAH,GACAI,mBAAAJ,EACA,GAAGl2H,EAAA+3B,CAAA,IAAAxmC,EAAAwmC,CAAA,IAAAhqC,EAAAsG,EAAAkiI,YAAA,CAAAp8G,EAAA9lB,EAAA8V,QAAA,CAAA1Y,EAAA4C,EAAAguG,SAAA,CAAAhxE,EAAAh9B,EAAAmiI,eAAA,CAAAtlI,EAAAmD,EAAAoiI,OAAA,CAAAv+F,EAAA7jC,EAAAqiI,MAAA,CAAAloI,EAAA6F,EAAAmhI,OAAA,CAAA39F,EAAAxjC,EAAAsiI,WAAA,CAAAh2H,EAAAtM,EAAAuiI,KAAA,CAAAh8G,EAAAvmB,EAAAwiI,cAAA,CAAA/4F,EAAAzpC,EAAAyiI,EAAA,CAAAzhB,EAAAhhH,EAAA0iI,OAAA,CAAA92H,EAAAo1H,GAAAhhI,EAAA,8IAAAF,GAzFHE,EAyFG,CAAA5G,EAAAonC,EAAA,CA9GHA,EAsBA,SAAApnC,CAAA,EACA,OAAA4G,EAAAmP,OAAA,UAAAu0B,CAAA,EACA,MA1BA,mBA0BAA,EA1BA1jC,EA0BA5G,GA1BA4G,GAAAA,CAAAA,EAAAqwG,OAAA,CA0BAj3G,CA1BAonC,EA0BAkD,CACA,EACA,EAPAtqC,CAlBAA,EAAU,GAAAgkI,GAAAQ,QAAA,EAAC,WACX,OAEA1iI,MAkBA,KAhBAyuB,SAAA6W,EAEAmiG,OAAA,CACA,IAAAtyB,SAAA,CACA,OAAAj3G,EAAA8B,KAAA,EAEA,IAAAm1G,QAAA3sE,EAAA,CACA,IAAA/3B,EAAAvS,EAAA8B,KAAA,CACAyQ,IAAA+3B,GAAAtqC,CAAAA,EAAA8B,KAAA,CAAAwoC,EAAAtqC,EAAAuwB,QAAA,CAAA+Z,EAAA/3B,EAAA,CACA,CACA,CACA,CACA,EAAG,KACHge,QAAA,CAAA6W,EAAApnC,EAAAupI,MAAA,EA2FGpiI,EAAAw/C,GAAAA,GAAA,GAAicn0C,GAAAD,GACpc,OAASyxH,GAAAiE,aAAe,CACpBjE,GAAAtgE,QAAU,CACd,KACAjgE,GAASugI,GAAAiE,aAAe,CAJrBlnI,EAIqB,CAAMgnI,QAAAI,GAAAY,gBAAAnlG,EAAAqlG,OAAAx+F,EAAAy+F,YAAA9+F,EAAA++F,MAAAj2H,EAAAs2H,aAAA1lI,EAAAslI,eAAA,EAAAj8G,EAAAs8G,QAAAzpI,EAAAspI,QAAA1hB,CAAA,GAC9BtnH,EAAQ0jI,GAAA0F,YAAc,CAAC1F,GAAA2F,QAAU,CAAAC,IAAA,CAAAl9G,GAAAi6B,GAAAA,GAAA,GAAgBx/C,GAAA,CAAQmgI,IAAA5gI,CAAA,IAAas9H,GAAAiE,aAAe,CALlF53F,KAAA,IAAAA,EAAA,MAAAA,EAKkFsW,GAAA,GAAQx/C,EAAA,CAAOytG,UAAA5wG,EAAAsjI,IAAA5gI,CAAA,GAAsBgmB,GAE1H,EACAojB,CAAAA,GAAA+5F,YAAA,EACAb,QAAA,GACAD,gBAAA,GACAI,MAAA,EACA,EACAr5F,GAAAg6F,UAAA,EACAC,UAAAh8G,GACAi8G,UAAAnC,EACA,EAoBA,IAAAoC,GAAA,WACA,IAAArjI,EAAA,EAAAwgC,EAAA,KACA,OACA/kC,IAAA,SAAArC,CAAA,MAVA4G,EAGAA,CAQAA,CAAA,GAAAA,GAAAwgC,CAAAA,EAAAnV,WAlBA,IAAAk1G,SACA,YACA,IAAAvgI,EAAAugI,SAAAc,aAAA,SACArhI,CAAAA,EAAA4V,IAAA,YACA,IAAA4qB,EAPWzhC,EAAAukI,EAAiB,CAQ5B,OAAA9iG,GAAAxgC,EAAAujI,YAAA,SAAA/iG,GAAAxgC,CACA,GAYA,GAAAwjI,CAAAA,CAXAxjI,EAWAwgC,GAVAijG,UAAA,CAAAzjI,EAAAyjI,UAAA,CAAAC,OAAA,CAUAtqI,EAVA4G,EAAA2jI,WAAA,CAAApD,SAAAqD,cAAA,CAUAxqI,IARA4G,EAQAwgC,EANAA,CADA+/F,SAAA/vF,IAAA,EAAA+vF,SAAAsD,oBAAA,aACAF,WAAA,CAAA3jI,EAMA,EAAAA,GACA,EACA8jI,OAAA,WACA,EAAA9jI,IAAAwgC,GAAAA,CAAAA,EAAAujG,UAAA,EAAAvjG,EAAAujG,UAAA,CAAAC,WAAA,CAAAxjG,GAAAA,EAAA,KACA,CACA,CACA,EAACyjG,GAAA,WACD,IAAAjkI,EAAAqjI,KACA,gBAAA7iG,CAAA,CAAApnC,CAAA,EACIgkI,GAAAS,SAAW,YACf,OAAA79H,EAAAvE,GAAA,CAAA+kC,GAAA,WACAxgC,EAAA8jI,MAAA,EACA,CACA,EAAK,CAAAtjG,GAAApnC,EAAA,CACL,CACA,EAAC8qI,GAAA,WACD,IAAAlkI,EAAAikI,KAIA,OAJA,SAAA7qI,CAAA,EAEA,OAAA4G,EADA5G,EAAA+qI,MAAA,CAAA/qI,EAAAu/D,OAAA,EACA,IACA,CAEA,EAACyrE,GAAA,CACD/wH,KAAA,EACA8Z,IAAA,EACA5Z,MAAA,EACA8wH,IAAA,CACA,EAACC,GAAA,SAAAtkI,CAAA,EACD,OAAA8M,SAAA9M,GAAA,SACA,EAACukI,GAAA,SAAAvkI,CAAA,EACD,IAAAwgC,EAAA1D,OAAA0nG,gBAAA,CAAAjE,SAAAj7E,IAAA,EAAAlsD,EAAAonC,CAAA,CAAAxgC,YAAAA,EAAA,4BAAA0jC,EAAAlD,CAAA,CAAAxgC,YAAAA,EAAA,0BAAA2L,EAAA60B,CAAA,CAAAxgC,YAAAA,EAAA,8BACA,OAAAskI,GAAAlrI,GAAAkrI,GAAA5gG,GAAA4gG,GAAA34H,GAAA,EACC84H,GAAA,SAAAzkI,CAAA,EACD,GAAAA,KAAA,IAAAA,GAAAA,CAAAA,EAAA,iBAAA88B,OAAA,IACA,OAAAsnG,GACA,IAAA5jG,EAAA+jG,GAAAvkI,GAAA5G,EAAAmnI,SAAAmE,eAAA,CAAAC,WAAA,CAAAjhG,EAAA5G,OAAA8nG,UAAA,CACA,OACAvxH,KAAAmtB,CAAA,IACArT,IAAAqT,CAAA,IACAjtB,MAAAitB,CAAA,IACA6jG,IAAAliI,KAAA8T,GAAA,GAAAytB,EAAAtqC,EAAAonC,CAAA,IAAAA,CAAA,IACA,CACA,EAACqkG,GAAAX,KAAAY,GAAA,SAAA9kI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,EACD,IAAA/3B,EAAA3L,EAAAqT,IAAA,CAAAnW,EAAA8C,EAAAmtB,GAAA,CAAAzzB,EAAAsG,EAAAuT,KAAA,CAAAuS,EAAA9lB,EAAAqkI,GAAA,CACA,OAAAjrI,KAAA,IAAAA,GAAAA,CAAAA,EAAA;GACA,EAAA6sD,MAAA,CAtMA,0BAsMA;oBACA,GAAAA,MAAA,CAAAviB,EAAA;kBACA,GAAAuiB,MAAA,CAAAngC,EAAA,OAAAmgC,MAAA,CAAAviB,EAAA;;;qBAGA,GAAAuiB,MAAA,CAAAviB,EAAA;;IAEA,GAAAuiB,MAAA,EACAzlB,GAAA,sBAAAylB,MAAA,CAAAviB,EAAA,KACAtqC,WAAAA,GAAA;kBACA,EAAA6sD,MAAA,CAAAt6C,EAAA;iBACA,GAAAs6C,MAAA,CAAA/oD,EAAA;mBACA,GAAA+oD,MAAA,CAAAvsD,EAAA;;;kBAGA,GAAAusD,MAAA,CAAAngC,EAAA,OAAAmgC,MAAA,CAAAviB,EAAA;IACA,GACAtqC,YAAAA,GAAA,kBAAA6sD,MAAA,CAAAngC,EAAA,OAAAmgC,MAAA,CAAAviB,EAAA,KACA,CAAAhO,MAAA,CAAAk3F,SAAAvkE,IAAA;;;GAGA,GAAApC,MAAA,CAAAg7E,GAAA;WACA,GAAAh7E,MAAA,CAAAngC,EAAA,OAAAmgC,MAAA,CAAAviB,EAAA;;;GAGA,GAAAuiB,MAAA,CAAA9+B,GAAA;kBACA,GAAA8+B,MAAA,CAAAngC,EAAA,OAAAmgC,MAAA,CAAAviB,EAAA;;;GAGA,GAAAuiB,MAAA,CAAAg7E,GAAA,MAAAh7E,MAAA,CAAAg7E,GAAA;aACA,GAAAh7E,MAAA,CAAAviB,EAAA;;;GAGA,GAAAuiB,MAAA,CAAA9+B,GAAA,MAAA8+B,MAAA,CAAA9+B,GAAA;oBACA,GAAA8+B,MAAA,CAAAviB,EAAA;;;;IAIA,GAAAuiB,MAAA,CA5OA,iCA4OA,MAAAA,MAAA,CAAAngC,EAAA;;AAEA,EACA,EAACi/G,GAAA,SAAA/kI,CAAA,EACD,IAAAwgC,EAAAxgC,EAAAglI,UAAA,CAAA5rI,EAAA4G,EAAAilI,WAAA,CAAAvhG,EAAA1jC,EAAA0iI,OAAA,CAAA/2H,EAAA+3B,KAAA,IAAAA,EAAA,SAAAA,EAAAxmC,EAA+FkgI,GAAA8H,OAAS,YACxG,OAAAT,GAAA94H,EACA,EAAG,CAAAA,EAAA,EACH,OAASyxH,GAAAiE,aAAe,CAAAwD,GAAA,CAAOV,OAAAW,GAAA5nI,EAAA,CAAAsjC,EAAA70B,EAAAvS,EAAA,kBAC/B,EAAC+rI,GAAA,GACD,cAAAroG,OACA,IACA,IAAAsoG,GAAArqI,OAAAC,cAAA,IAAqC,WACrCoR,IAAA,WACA,OAAA+4H,GAAA,KACA,CACA,EACAroG,CAAAA,OAAA0jG,gBAAA,QAAA4E,GAAAA,IAAAtoG,OAAA2jG,mBAAA,QAAA2E,GAAAA,GACA,CAAI,MACJD,GAAA,EACA,CACA,IAAAtlI,GAAAslI,EAAAA,IAAA,CAAeE,QAAA,IAEdC,GAAA,SAAAtlI,CAAA,CAAAwgC,CAAA,EACD,IAAApnC,EAAA0jC,OAAA0nG,gBAAA,CAAAxkI,GACA,MAEA5G,WAAAA,CAAA,CAAAonC,EAAA,EACA,CAAApnC,CAAAA,EAAAmsI,SAAA,GAAAnsI,EAAAosI,SAAA,eANAxlI,EAAAylI,OAAA,EAMArsI,YAAAA,CAAA,CAAAonC,EAAA,CAEA,EAICklG,GAAA,SAAA1lI,CAAA,CAAAwgC,CAAA,EACD,IAAApnC,EAAAonC,EAAAmlG,aAAA,CAAAjiG,EAAAlD,EACA,GAGA,GAFA,WAAAolG,YAAAliG,aAAAkiG,YAAAliG,CAAAA,EAAAA,EAAAu5F,IAAA,EACA4I,GAAA7lI,EAAA0jC,GACA,CACA,IAAAxmC,EAAA4oI,GAAA9lI,EAAA0jC,GACA,GAAAhqC,CADA,IAAAwD,CAAA,IAEA,QACA,CACAwmC,EAAAA,EAAAqgG,UAAA,OACIrgG,GAAAA,IAAAtqC,EAAAksD,IAAA,EACJ,QACA,EAcCugF,GAAA,SAAA7lI,CAAA,CAAAwgC,CAAA,EACD,MAAAxgC,MAAAA,EA/BAslI,GA+BA9kG,EA/BA,aAEA8kG,GA6BA9kG,EA7BA,YA8BA,EAACslG,GAAA,SAAA9lI,CAAA,CAAAwgC,CAAA,EACD,MAAAxgC,MAAAA,EAfA,CADAA,EAAA+lI,SAAA,CAAA/lI,EAAAgmI,YAAA,CAAAhmI,EAAAimI,YAAA,CAKA,CAGA,CADAjmI,EAAAkmI,UAAA,CAAAlmI,EAAAmmI,WAAA,CAAAnmI,EAAA2kI,WAAA,CAKA,EAOCyB,GAAA,SAAApmI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,CAAA/3B,CAAA,EACD,IAHC60B,EAGDtjC,GAHCsjC,EAGD1D,OAAA0nG,gBAAA,CAAAhkG,GAAA6lG,SAAA,CAFArmI,MAEAA,GAFAwgC,QAAAA,EAAA,MAEA9mC,EAAAwD,EAAAwmC,EAAA5d,EAAA1sB,EAAAyqD,MAAA,CAAAzmD,EAAAojC,EAAA8/F,QAAA,CAAAx6G,GAAAkX,EAAA,GAAAngC,EAAAnD,EAAA,EAAAmqC,EAAA,EAAA1pC,EAAA,EACA,GACA,IAAAqpC,EAAAsiG,GAAA9lI,EAAA8lB,GAAAxZ,EAAAk3B,CAAA,IAAAa,EAAA9d,CAAA,IAAAid,CAAA,IAAAtmC,EAAAoP,CACA,CAAAA,CAAAA,GAAA+3B,CAAAA,GAAAwhG,GAAA7lI,EAAA8lB,IAAA+d,CAAAA,GAAAQ,EAAAlqC,GAAAmS,CAAAA,EAAAwZ,aAAA8/G,WAAA9/G,EAAAA,EAAAm3G,IAAA,CAAAn3G,EAAAA,EAAAi+G,UAAA,OAGA,CAAA3mI,GAAA0oB,IAAAy6G,SAAAj7E,IAAA,EACAloD,GAAAojC,CAAAA,EAAA8/F,QAAA,CAAAx6G,IAAA0a,IAAA1a,CAAAA,EACA,CACA,OAAAjpB,GAAA8O,CAAAA,GAAAxJ,EAAAA,KAAAo7B,GAAA,CAAAsG,IAAA,CAAAl4B,GAAAjS,EAAAmqC,CAAAA,GAAA,CAAAhnC,GAAA8O,CAAAA,GAAAxJ,EAAAA,KAAAo7B,GAAA,CAAApjC,IAAA,CAAAwR,GAAA,CAAAjS,EAAAS,CAAAA,CAAA,GAAA6iC,CAAAA,EAAA,IAAAA,CACA,EAACspG,GAAA,SAAAtmI,CAAA,EACD,yBAAAA,EAAA,CAAAA,EAAAumI,cAAA,IAAAC,OAAA,CAAAxmI,EAAAumI,cAAA,IAAAE,OAAA,SACCC,GAAA,SAAA1mI,CAAA,EACD,OAAAA,EAAA2mI,MAAA,CAAA3mI,EAAA4mI,MAAA,GACCC,GAAA,SAAA7mI,CAAA,EACD,OAAAA,GAAA,YAAAA,EAAAA,EAAAqwG,OAAA,CAAArwG,CACA,EAOC8mI,GAAA,EAAAhR,GAAA,GAwFD,IAAAiR,IArTAvmG,EA8NA,SAAAxgC,CAAA,EACA,IAAAwgC,EAAU48F,GAAAiD,MAAQ,KAAAjnI,EAAUgkI,GAAAiD,MAAQ,QAAA38F,EAAc05F,GAAAiD,MAAQ,GAAA10H,EAAQyxH,GAAAQ,QAAU,CAAAkJ,KAAA,IAAA5pI,EAAekgI,GAAAQ,QAAU,CAAAsG,GAAA,IAAAxqI,EAAa0jI,GAAAiD,MAAQ,CAAArgI,EACxHo9H,CAAAA,GAAAS,SAAW,YACbnkI,EAAA22G,OAAA,CAAArwG,CACA,EAAG,CAAAA,EAAA,EAAQo9H,GAAAS,SAAW,YACtB,GAAA79H,EAAAuiI,KAAA,EACAhC,SAAAj7E,IAAA,CAAA0hF,SAAA,CAAAvrI,GAAA,wBAAAwqD,MAAA,CAAAt6C,IACA,IAAA4a,EAAA0gH,CApVA,SAAAjnI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,GAAAA,GAAAkqD,GAAAA,UAAAtpD,MAAA,CACA,QAAAkD,EAAAwmC,EAAA,EAAA/3B,EAAA60B,EAAAxmC,MAAA,CAAqC0pC,EAAA/3B,EAAO+3B,IAC5C,CAAAxmC,GAAAwmC,KAAAlD,GAAAtjC,CAAAA,GAAAA,CAAAA,EAAA4H,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,CAAAk5B,EAAA,EAAAkD,EAAA,EAAAxmC,CAAA,CAAAwmC,EAAA,CAAAlD,CAAA,CAAAkD,EAAA,EACA,OAAA1jC,EAAAimD,MAAA,CAAA/oD,GAAA4H,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,CAAAk5B,GACA,GA+UA,CAAAxgC,EAAA6iI,OAAA,CAAAxyB,OAAA,GAAArwG,EAAAqiI,MAAA,MAAA/sH,GAAA,CAAAuxH,IAAA,IAAAnxG,MAAA,CAAAk3F,SACA,OAAArmG,EAAApX,OAAA,UAAAs6B,CAAA,EACA,OAAAA,EAAAu9F,SAAA,CAAAvrI,GAAA,wBAAAwqD,MAAA,CAAAt6C,GACA,GAAO,WACP40H,SAAAj7E,IAAA,CAAA0hF,SAAA,CAAAlD,MAAA,wBAAA79E,MAAA,CAAAt6C,IAAA4a,EAAApX,OAAA,UAAAs6B,CAAA,EACA,OAAAA,EAAAu9F,SAAA,CAAAlD,MAAA,wBAAA79E,MAAA,CAAAt6C,GACA,EACA,CACA,CACA,EAAG,CAAA3L,EAAAuiI,KAAA,CAAAviI,EAAA6iI,OAAA,CAAAxyB,OAAA,CAAArwG,EAAAqiI,MAAA,GACH,IAAAv8G,EAAUs3G,GAAAU,WAAa,UAAAv3G,CAAA,CAAAkjB,CAAA,EACvB,eAAAljB,GAAAA,IAAAA,EAAA2gH,OAAA,CAAAltI,MAAA,CACA,OAAAN,EAAA22G,OAAA,CAAAmyB,cAAA,CACA,IAAA1iI,EAAAukC,EAAAiiG,GAAA//G,GAAAy6F,EAAA5nH,EAAAi3G,OAAA,CAAAzkG,EAAA,WAAA2a,EAAAA,EAAAogH,MAAA,CAAA3lB,CAAA,IAAA38E,CAAA,IAAA3H,EAAA,WAAAnW,EAAAA,EAAAqgH,MAAA,CAAA5lB,CAAA,IAAA38E,CAAA,IAAA9jC,EAAAgmB,EAAAs9B,MAAA,CAAArqD,EAAA2I,KAAAo7B,GAAA,CAAA3xB,GAAAzJ,KAAAo7B,GAAA,CAAAb,GAAA,QACA,eAAAnW,GAAA/sB,MAAAA,GAAA+G,UAAAA,EAAAqV,IAAA,CACA,SACA,IAAA2uG,EAAAmhB,GAAAlsI,EAAA+G,GACA,IAAAgkH,EACA,SACA,GAAAA,EAAAzkH,EAAAtG,EAAAsG,CAAAA,EAAAtG,MAAAA,EAAA,QAAA+qH,EAAAmhB,GAAAlsI,EAAA+G,EAAA,GAAAgkH,EACA,SACA,IAAA7gF,EAAA2sE,OAAA,qBAAA9pF,GAAA3a,CAAAA,GAAA8wB,CAAAA,GAAAgH,CAAAA,EAAA2sE,OAAA,CAAAvwG,CAAAA,EAAA,CAAAA,EACA,SACA,IAAAk0C,EAAAtQ,EAAA2sE,OAAA,EAAAvwG,EACA,OAAAsmI,GAAApyF,EAAAvK,EAAAljB,EAAAytB,MAAAA,EAAApoC,EAAA8wB,EAAA,GACA,EAAG,IAAAt/B,EAAWggI,GAAAU,WAAa,UAAAv3G,CAAA,EAE3B,MAAAuvG,GAAA97H,MAAA,EAAA87H,EAAA,CAAAA,GAAA97H,MAAA,MAAAkD,CAAAA,EAAA,CACA,IAAAmnC,EAAA,WAFA9d,EAEAmgH,GAFAngH,GAEA+/G,GAFA//G,GAEAy6F,EAAAxgF,EAAA6vE,OAAA,CAAA36E,MAAA,UAAA51B,CAAA,MA3CCE,EA4CD,OAAAF,EAAAjG,IAAA,GAAA4vC,EAAA7zB,IAAA,EAAA9V,CAAAA,EAAA+jD,MAAA,GAAApa,EAAAoa,MAAA,EAAApa,EAAAoa,MAAA,GAAA/jD,EAAAqnI,YAAA,GA3CAnnI,CADCA,EA4CDF,EAAA8xC,KAAA,CA3CA,MAAApR,CAAA,KAAAxgC,CAAA,MAAAwgC,CAAA,KA4CO,IACP,GAAAwgF,GAAAA,EAAAomB,MAAA,EACA39F,EAAA49F,UAAA,EAAA59F,EAAA69F,cAAA,GACA,MACA,CACA,IAAAtmB,EAAA,CACA,IAAAp1G,EAAA,CAAAlS,EAAA22G,OAAA,CAAAgyB,MAAA,MAAA/sH,GAAA,CAAAuxH,IAAAnxG,MAAA,CAAAk3F,SAAAl3F,MAAA,UAAA51B,CAAA,EACA,OAAAA,EAAAwgI,QAAA,CAAA72F,EAAAoa,MAAA,CACA,EACAnnB,CADS9wB,CAAAA,EAAA5R,MAAA,GAAA8rB,EAZTS,EAYS3a,CAAA,MAAAlS,EAAA22G,OAAA,CAAAiyB,WAAA,GACT74F,EAAA49F,UAAA,EAAA59F,EAAA69F,cAAA,EACA,CACA,CACA,EAAG,IAAAtqG,EAAWogG,GAAAU,WAAa,UAAAv3G,CAAA,CAAAkjB,CAAA,CAAApF,CAAA,CAAA28E,CAAA,EAC3B,IAAAp1G,EAAA,CAAc/R,KAAA0sB,EAAAqrB,MAAAnI,EAAAoa,OAAAxf,EAAA+iG,OAAApmB,EAAAmmB,aAAAI,SAgCdvnI,CAAA,EACA,QAAAwgC,EAAA,KAAqBxgC,OAAAA,GACrBA,aAAA4lI,YAAAplG,CAAAA,EAAAxgC,EAAAi9H,IAAA,CAAAj9H,EAAAA,EAAAi9H,IAAA,EAAAj9H,EAAAA,EAAA+jI,UAAA,CACA,OAAAvjG,CACA,EApCc6D,EAAA,CACd7D,CAAAA,EAAA6vE,OAAA,CAAAtwG,IAAA,CAAA6L,GAAAg+E,WAAA,WACAppD,EAAA6vE,OAAA,CAAA7vE,EAAA6vE,OAAA,CAAA36E,MAAA,UAAAgH,CAAA,EACA,OAAAA,IAAA9wB,CACA,EACA,EAAK,EACL,EAAG,IAAA/O,EAAWugI,GAAAU,WAAa,UAAAv3G,CAAA,EAC3BntB,EAAAi3G,OAAA,CAAAi2B,GAAA//G,GAAAmd,EAAA2sE,OAAA,OACA,EAAG,IAAAxsE,EAAWu5F,GAAAU,WAAa,UAAAv3G,CAAA,EAC3ByW,EAAAzW,EAAA3Q,IAAA,CAAA8wH,GAAAngH,GAAAA,EAAAs9B,MAAA,CAAA/9B,EAAAS,EAAAvmB,EAAA6iI,OAAA,CAAAxyB,OAAA,EACA,EAAG,IAAAl2G,EAAWijI,GAAAU,WAAa,UAAAv3G,CAAA,EAC3ByW,EAAAzW,EAAA3Q,IAAA,CAAA0wH,GAAA//G,GAAAA,EAAAs9B,MAAA,CAAA/9B,EAAAS,EAAAvmB,EAAA6iI,OAAA,CAAAxyB,OAAA,EACA,EAAG,IACD+sB,GAAAS,SAAW,YACb,OAAA/H,GAAA/1H,IAAA,CAAA7C,GAAA8C,EAAA4iI,YAAA,EACAb,gBAAAl+F,EACAm+F,eAAAn+F,EACAo+F,mBAAA9nI,CACA,GAAKomI,SAAAC,gBAAA,SAAApjI,EAAAyC,IAAA0gI,SAAAC,gBAAA,aAAApjI,EAAAyC,IAAA0gI,SAAAC,gBAAA,cAAA3jI,EAAAgD,IAAA,WACLi2H,GAAAA,GAAApgG,MAAA,UAAAnP,CAAA,EACA,OAAAA,IAAArpB,CACA,GAAOqjI,SAAAE,mBAAA,SAAArjI,EAAAyC,IAAA0gI,SAAAE,mBAAA,aAAArjI,EAAAyC,IAAA0gI,SAAAE,mBAAA,cAAA5jI,EAAAgD,GACP,CACA,EAAG,IACH,IAAA2jC,EAAAxjC,EAAAmiI,eAAA,CAAA71H,EAAAtM,EAAAuiI,KAAA,CACA,OAASnF,GAAAiE,aAAe,CACpBjE,GAAAtgE,QAAU,CACd,KACAxwD,EAAQ8wH,GAAAiE,aAAe,CAAAnkI,EAAA,CAAMinI,OAnF7B;uBACA,EAAAl+E,MAAA,CAkF6Bt6C,EAlF7B;uBACA,GAAAs6C,MAAA,CAiF6Bt6C,EAjF7B;AACA,EAgF6B,GAAe,KAC5C63B,EAAQ45F,GAAAiE,aAAe,CAAA0D,GAAA,CAAOrC,QAAA1iI,EAAA0iI,OAAA,GAAoB,KAElD,EA9SA1iI,GAAAwhI,SAAA,CAAAhhG,GAAA0gG,IAqTA,IAAAsG,GAASpK,GAAA0E,UAAY,UAAA9hI,CAAA,CAAAwgC,CAAA,EACrB,OAAS48F,GAAAiE,aAAe,CAAAn4F,GAAA6W,GAAA,GAAS//C,EAAA,CAAO0gI,IAAAlgG,EAAA2gG,QAAA4F,EAAA,GACxC,EACAS,CAAAA,GAAAtE,UAAA,CAAAh6F,GAAAg6F,UAAA,CAGA,IAAAuE,GAAA,CAAAznI,EAAAwgC,KACA,IAAApnC,EAAA4G,EAAA0nI,gBAAA,kCACAtuI,CAAA,IAAAA,EAAAY,MAAA,EAAAZ,CAAA,CAAAonC,QAAAA,EAAApnC,EAAAY,MAAA,MAAA2tI,KAAA,EACA,EACA,SAAAC,GAAA5nI,CAAA,EACA,IAAAwgC,EAAY,GAAA48F,GAAAiD,MAAA,EAAE,MACd,MAAS,GAAAjD,GAAAS,SAAA,EAAC,KACV,IAAAzkI,EAAAmnI,SAAAsH,aAAA,CACA,WACA,IAAAnkG,CACA,OAAAA,CAAAA,EAAAtqC,EAAAuuI,KAAA,GAAAjkG,EAAAp8B,IAAA,CAAAlO,EACA,CACA,EAAG,IAAO,GAAAgkI,GAAAS,SAAA,EAAC,KACX,GAAAr9F,EAAA6vE,OAAA,EACA,IAAAj3G,EAAAonC,EAAA6vE,OAAA,CAAAy3B,aAAA,qBACA1uI,CAAAA,EAAAA,EAAAuuI,KAAA,GAAAnnG,EAAA6vE,OAAA,CAAAs3B,KAAA,EACA,CACA,EAAG,IAAuB,GAAAxJ,GAAAQ,IAAA,EAAER,GAAArhE,QAAC,EAAIhnD,SAAA,CACb,GAAAqoH,GAAAC,GAAA,EACpB,MACA,CACA2J,QAAiB,GAAA3K,GAAAU,WAAA,EAAC,IAAAt9F,EAAA6vE,OAAA,EAAAo3B,GAAAjnG,EAAA6vE,OAAA,YAClB23B,SAAA,CACA,GAEoB,GAAA7J,GAAAC,GAAA,EAAC,OAAUsC,IAAAlgG,EAAAnyB,MAAA,CAAiB45H,QAAA,QAAiBD,SAAA,MAAAhoI,CAAA,GAC7C,GAAAm+H,GAAAC,GAAA,EACpB,MACA,CACA2J,QAAiB,GAAA3K,GAAAU,WAAA,EAAC,IAAAt9F,EAAA6vE,OAAA,EAAAo3B,GAAAjnG,EAAA6vE,OAAA,cAClB23B,SAAA,CACA,GAEA,EACA,CAaA,SAAAE,KACA,MAAAC,IAZA,OAAAC,WAAA,WAAAvrH,IAAA,CAAAurH,UAAAC,SAAA,GAGA,WAAAD,WAAA,cAAAvrH,IAAA,CAAAurH,UAAAC,SAAA,GAGA,WAAAD,WAAA,QAAAvrH,IAAA,CAAAurH,UAAAC,SAAA,GAAAD,aAAAA,UAAAE,QAAA,EAAAF,UAAAG,cAAA,GAOA,CACA,IAAAC,GAAA,GAAAxoI,EAAAyoI,eAAA,GACA,SAAAC,GAAA,CAAc5yH,SAAA9V,CAAA,CAAA2oI,QAAAnoG,CAAA,CAAAooG,KAAAxvI,CAAA,CAAAyvI,QAAAnlG,CAAA,CAA8C,EAC1D,GAAA05F,GAAAS,SAAA,EAAC,KACH,IAAA/3G,EAAA,GAAA1sB,GAAAgE,WAAAA,EAAAkO,GAAA,EAAAk1B,IACA,OAAA+/F,SAAAC,gBAAA,WAAA16G,GAAA,IAAAy6G,SAAAE,mBAAA,WAAA36G,EACA,EAAG,CAAA1sB,EAAAonC,EAAA,EACH,IAAA70B,EAAAzO,EAAA,CAAiB,GAAAkgI,GAAAQ,QAAA,EAAC,IAChB,GAAAR,GAAAS,SAAA,EAAC,KACH3gI,EACAsnI,WAAAA,iBAAA1nG,OAAAyjG,QAAA,CAAAj7E,IAAA,EAAAwjF,QAAA,CAEA,EAAG,IACH,IAAApvI,EAAY,GAAA0jI,GAAAU,WAAA,EAAC,IAAAt9F,IAAA,CAAAA,EAAA,EACb,MAAyB,GAAA29F,GAAAC,GAAA,EAAED,GAAArhE,QAAC,EAAIhnD,SAAA1c,EAAc,GAAA2vI,GAAAC,YAAA,EAC1B,GAAA7K,GAAAC,GAAA,EAlEpBoJ,GAkEqB,CAAOpF,QAAAz2H,EAAAmK,SAAsC,GAAAqoH,GAAAC,GAAA,EAClE,MACA,CACA/vH,MAAA,CACAuyH,WAAAsH,KAAA,oBACAx5C,SAAA,OACA,EACA,kBAAAhrD,EACA,gBACAsqE,UA1EA,UA2EAwxB,QAAA9lI,EACAuvI,KAAA,SACAnzH,SAAkC,GAAAqoH,GAAAC,GAAA,EAClCwJ,GACA,CACA55B,UAhFA,UAiFAwxB,QAAAgJ,GACAS,KAAA,WACAnzH,SAAA9V,CACA,EAEA,EACA,GACAugI,SAAAj7E,IAAA,EACA,MACA,CACA,IAAA4jF,GAAA,YAAAC,GAAA,YAAAvlG,GAAA,GAECwlG,GAAA,GAAStlG,GAAA,GAEV,IAAAulG,GAAA,CACA,EAEA,GACA,GACA,GACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,CACAvlG,GAAAwlG,aAAA,UAAA9oG,CAAA,EACA,IAAAA,EACA,qDACA,GAAAA,EAAA,GAAAA,EAAA,GACA,yDACA,OAAAA,EAAAA,EAAA,EACA,EACAsD,GAAAylG,uBAAA,UAAA/oG,CAAA,EACA,OAAA6oG,EAAA,CAAA7oG,EAAA,EAEAsD,GAAA0lG,WAAA,UAAAxpI,CAAA,EACA,IAAAwgC,EAAA,EACA,KAASxgC,IAAAA,GACTwgC,IAAAxgC,KAAA,EACA,OAAAwgC,CACA,EACAsD,GAAA2lG,iBAAA,UAAAjpG,CAAA,EACA,sBAAAA,EACA,qDACA4nF,EAAA5nF,CACA,EACAsD,GAAA4lG,kBAAA,YACA,iBAAAthB,CACA,EACAtkF,GAAA6lG,MAAA,UAAAnpG,CAAA,EACA,OAAA4nF,EAAA5nF,EACA,EACA,IAAAopG,GAAA,GAmCA,SAAAhtI,KACA,KAAA2H,MAAA,SAAAvK,MAAA,EACA,CAmBA,SAAAo0C,GAAApuC,CAAA,EACA,IAAAA,GAAAA,EAAA,EACA,gEACA,MAAA8qB,IAAA,CAAA9qB,EAAA,KAAA+B,IAAA,KAAApI,WAAAqG,EAAAA,GAAA,KAAA6pI,WAAA,KAAAlwI,WAAAqG,EAAAA,EACA,CA1DAA,GAAAqgC,CAAA,EAAUq7E,IAAA,GAAQ17G,GAAAukH,CAAA,EAAU7I,IAAA,GAAQ17G,GAAA4jC,CAAA,EAAU83E,IAAA,GAAQ17G,GAAAq/B,CAAA,EAAUq8E,IAAA,GAqBhE17G,GAAA4lC,OAAA,UAAAlC,CAAA,EACA,OAAAA,GAAA,WAAAA,EAAAg4E,GAAA,EAAAh4E,EAAAg4E,GAAA,KAAAh4E,EAAAg4E,GAAA,EACA,EAAG17G,GAAA+E,IAAA,UAAA2+B,CAAA,CAAA/3B,CAAA,EACH,GAAA3L,GAAA4lC,OAAA,CAAAlC,GACA,OAAAA,EACA,IACA,OAAAlD,SA1BApnC,CAAA,EACA,oBAAAA,EACA,qCACA,OAAAA,EAAAwT,WAAA,IACA,QACA,UACA,OAAA5M,GAAAqgC,CAAA,KACA,IACA,aACA,OAAArgC,GAAAukH,CAAA,KACA,IACA,eACA,OAAAvkH,GAAA4jC,CAAA,KACA,IACA,WACA,OAAA5jC,GAAAq/B,CAAA,SAEA,iCAAAjmC,EACA,CACA,EAOAsqC,EACA,CAAM,MACN,OAAA/3B,CACA,CACA,EAKA/O,GAAA2P,SAAA,EACAH,IAAA,SAAApM,CAAA,EAEA,YAAAuE,MAAA,CADApC,KAAAuC,KAAA,CAAA1E,EAAA,GACA,KAAAA,EAAA,OACA,EACA8pI,IAAA,SAAA9pI,CAAA,CAAAwgC,CAAA,EACA,QAAApnC,EAAA,EAAoBA,EAAAonC,EAAOpnC,IAC3B,KAAA2wI,MAAA,EAAA/pI,IAAAwgC,EAAApnC,EAAA,QACA,EACA4wI,gBAAA,WACA,YAAAhwI,MAAA,EAEA+vI,OAAA,SAAA/pI,CAAA,EACA,IAAAwgC,EAAAr+B,KAAAuC,KAAA,MAAA1K,MAAA,GACA,MAAAuK,MAAA,CAAAvK,MAAA,EAAAwmC,GAAA,KAAAj8B,MAAA,CAAAxE,IAAA,IAAAC,GAAA,MAAAuE,MAAA,CAAAi8B,EAAA,aAAAxmC,MAAA,SAAAA,MAAA,EACA,CACA,EAOAo0C,GAAA7hC,SAAA,CAAAhK,GAAA,UAAAvC,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,EACA,IAAA/3B,EAAA3L,EAAA,KAAA8qB,IAAA,CAAA0V,CACA,MAAAz+B,IAAA,CAAA4J,EAAA,CAAAvS,EAAAsqC,GAAA,MAAAmmG,WAAA,CAAAl+H,EAAA,IACA,EACAyiC,GAAA7hC,SAAA,CAAAH,GAAA,UAAApM,CAAA,CAAAwgC,CAAA,EACA,YAAAz+B,IAAA,CAAA/B,EAAA,KAAA8qB,IAAA,CAAA0V,EAAA,EAEA4N,GAAA7hC,SAAA,CAAA09H,GAAA,UAAAjqI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,KAAA2I,IAAA,CAAA/B,EAAA,KAAA8qB,IAAA,CAAA0V,EAAA,EAAApnC,CACA,EACAg1C,GAAA7hC,SAAA,CAAA29H,UAAA,UAAAlqI,CAAA,CAAAwgC,CAAA,EACA,YAAAqpG,WAAA,CAAA7pI,EAAA,KAAA8qB,IAAA,CAAA0V,EAAA,EAEA,IAAA2pG,GAAA,IACA,SAAAnqI,CAAA,EACA,IAAAwgC,EAAAsD,GAAAwlG,aAAA,CACAtpI,EAAAoqI,eAAA,UAAA1mG,CAAA,EACA,GAAAA,IAAAA,EACA,SACA,IAAA/3B,EAAAxJ,KAAAuC,KAAA,CAAAg/B,EAAA,KAAAxmC,EAAAsjC,EAAAkD,GAAAhqC,EAAAwD,MAAAA,EAAA,GAAAiF,EAAAA,KAAA4oB,IAAA,EAAA7tB,EAAA,OAAAyO,EAAA,IAAAma,EAAA,CAAA5oB,EAAA,GACA,QAAAE,EAAA,EAAoBA,EAAAuO,EAAA,EAAWvO,IAC/B0oB,CAAA,CAAA1oB,EAAA,CAAA0oB,CAAA,CAAA1oB,EAAA,GAAA1D,EACA,OAAAosB,EAAA/lB,IAAA,IAAA+lB,EAAA+a,OAAA,EACA,EAAG7gC,EAAAqqI,YAAA,UAAA3mG,CAAA,EACH,IAAA/3B,EAAA,GAAAzO,EAAA8C,EAAAoqI,eAAA,CAAA1mG,GAAAhqC,EAAAwD,EAAAlD,MAAA,CACA,QAAA8rB,EAAA,EAAoBA,EAAApsB,EAAOosB,IAC3B,QAAA1oB,EAAA,EAAsBA,EAAA1D,EAAO0D,IAC7B0oB,IAAAA,GAAA1oB,IAAAA,GACA0oB,IAAAA,GAAA1oB,IAAA1D,EAAA,GACAosB,IAAApsB,EAAA,GAAA0D,IAAAA,GAAAuO,EAAA5L,IAAA,EAAA7C,CAAA,CAAA4oB,EAAA,CAAA5oB,CAAA,CAAAE,EAAA,GACA,OAAAuO,CACA,CACA,EAACw+H,IACD,IAAIG,GAAE,GACN,IAAAC,GAAAzmG,GAAAwlG,aAAA,CACAgB,GAAED,YAAA,UAAA7pG,CAAA,EACF,IAAApnC,EAAAmxI,GAAA/pG,GACA,OAEA,MAEA,CAAApnC,EAPA,EAOA,GAEA,GAAAA,EATA,EASA,CACA,EAEA,IAAAoxI,GAAA,IACA,SAAAxqI,CAAA,EACAA,EAAAyqI,QAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,CACA,EACA,IAAAzqG,EAAA,CACA0qG,GAAA,EACAC,GAAA,EACAC,GAAA,GACAC,GAAA,EACA,CACArrI,CAAAA,EAAA4lC,OAAA,UAAAj6B,CAAA,EACA,OAAAA,MAAAA,GAAAA,KAAAA,GAAA,CAAAsB,MAAAtB,IAAAA,GAAA,GAAAA,GAAA,CACA,EAAG3L,EAAA+E,IAAA,UAAA4G,CAAA,EACH,OAAA3L,EAAA4lC,OAAA,CAAAj6B,GAAAmB,SAAAnB,EAAA,UACA,EAAG3L,EAAAsrI,YAAA,UAAA3/H,CAAA,EACH,IAAAzO,EAAAyO,EAAAmf,IAAA,CACApxB,EAAA,EAAAosB,EAAA,EAAA1oB,EAAA,EAAA4/B,EAAA,KAAAngC,EAAA,KACA,QAAAgnC,EAAA,EAAoBA,EAAA3mC,EAAO2mC,IAAA,CAC3B/d,EAAA1oB,EAAA,EAAA4/B,EAAAngC,EAAA,KACA,QAAA1C,EAAA,EAAsBA,EAAA+C,EAAO/C,IAAA,CAC7B,IAAAqpC,EAAA73B,EAAAS,GAAA,CAAAy3B,EAAA1pC,EACAqpC,CAAAA,IAAAxG,EAAAlX,IAAAA,CAAAA,GAAA,GAAApsB,CAAAA,GAAA8mC,EAAA0qG,EAAA,CAAAplH,CAAAA,EAAA,IAAAkX,EAAAwG,EAAA1d,EAAA,GAAA0d,CAAAA,EAAA73B,EAAAS,GAAA,CAAAjS,EAAA0pC,EAAA,IAAAhnC,EAAAO,IAAAA,CAAAA,GAAA,GAAA1D,CAAAA,GAAA8mC,EAAA0qG,EAAA,CAAA9tI,CAAAA,EAAA,IAAAP,EAAA2mC,EAAApmC,EAAA,EACA,CACA0oB,GAAA,GAAApsB,CAAAA,GAAA8mC,EAAA0qG,EAAA,CAAAplH,CAAAA,EAAA,IAAA1oB,GAAA,GAAA1D,CAAAA,GAAA8mC,EAAA0qG,EAAA,CAAA9tI,CAAAA,EAAA,GACA,CACA,OAAA1D,CACA,EAAGsG,EAAAurI,YAAA,UAAA5/H,CAAA,EACH,IAAAzO,EAAAyO,EAAAmf,IAAA,CACApxB,EAAA,EACA,QAAAosB,EAAA,EAAoBA,EAAA5oB,EAAA,EAAW4oB,IAC/B,QAAA1oB,EAAA,EAAsBA,EAAAF,EAAA,EAAWE,IAAA,CACjC,IAAA4/B,EAAArxB,EAAAS,GAAA,CAAA0Z,EAAA1oB,GAAAuO,EAAAS,GAAA,CAAA0Z,EAAA1oB,EAAA,GAAAuO,EAAAS,GAAA,CAAA0Z,EAAA,EAAA1oB,GAAAuO,EAAAS,GAAA,CAAA0Z,EAAA,EAAA1oB,EAAA,EACA,CAAA4/B,CAAAA,IAAAA,GAAAA,IAAAA,CAAA,GAAAtjC,GACA,CACA,OAAAA,EAAA8mC,EAAA2qG,EAAA,EACGnrI,EAAAwrI,YAAA,UAAA7/H,CAAA,EACH,IAAAzO,EAAAyO,EAAAmf,IAAA,CACApxB,EAAA,EAAAosB,EAAA,EAAA1oB,EAAA,EACA,QAAA4/B,EAAA,EAAoBA,EAAA9/B,EAAO8/B,IAAA,CAC3BlX,EAAA1oB,EAAA,EACA,QAAAP,EAAA,EAAsBA,EAAAK,EAAOL,IAC7BipB,EAAAA,GAAA,OAAAna,EAAAS,GAAA,CAAA4wB,EAAAngC,GAAAA,GAAA,IAAAipB,CAAAA,OAAAA,GAAAA,KAAAA,CAAA,GAAApsB,IAAA0D,EAAAA,GAAA,OAAAuO,EAAAS,GAAA,CAAAvP,EAAAmgC,GAAAngC,GAAA,IAAAO,CAAAA,OAAAA,GAAAA,KAAAA,CAAA,GAAA1D,GACA,CACA,OAAAA,EAAA8mC,EAAA4qG,EAAA,EACGprI,EAAAyrI,YAAA,UAAA9/H,CAAA,EACH,IAAAzO,EAAA,EACAxD,EAAAiS,EAAA5J,IAAA,CAAA/H,MAAA,CACA,QAAAoD,EAAA,EAAoBA,EAAA1D,EAAO0D,IAC3BF,GAAAyO,EAAA5J,IAAA,CAAA3E,EAAA,CACA,OAAA+E,KAAAo7B,GAAA,CAAAp7B,KAAA4oB,IAAA,CAAA7tB,IAAAA,EAAAxD,EAAA,OAAA8mC,EAAA6qG,EAAA,EAwBArrI,EAAA0rI,SAAA,UAAA//H,CAAA,CAAAzO,CAAA,EACA,IAAAxD,EAAAwD,EAAA4tB,IAAA,CACA,QAAAhF,EAAA,EAAoBA,EAAApsB,EAAOosB,IAC3B,QAAA1oB,EAAA,EAAsBA,EAAA1D,EAAO0D,IAC7BF,EAAAgtI,UAAA,CAAA9sI,EAAA0oB,IAAA5oB,EAAA+sI,GAAA,CAAA7sI,EAAA0oB,EAAA1sB,SA1BAsqC,CAAA,CAAA/3B,CAAA,CAAAzO,CAAA,EACA,OAAAwmC,GACA,KAAA1jC,EAAAyqI,QAAA,CAAAC,UAAA,CACA,OAAA/+H,EAAAzO,CAAAA,EAAA,IACA,MAAA8C,EAAAyqI,QAAA,CAAAE,UAAA,CACA,OAAAh/H,EAAA,IACA,MAAA3L,EAAAyqI,QAAA,CAAAG,UAAA,CACA,OAAA1tI,EAAA,IACA,MAAA8C,EAAAyqI,QAAA,CAAAI,UAAA,CACA,OAAAl/H,EAAAzO,CAAAA,EAAA,IACA,MAAA8C,EAAAyqI,QAAA,CAAAK,UAAA,CACA,OAAA3oI,KAAAuC,KAAA,CAAAiH,EAAA,GAAAxJ,KAAAuC,KAAA,CAAAxH,EAAA,QACA,MAAA8C,EAAAyqI,QAAA,CAAAM,UAAA,CACA,OAAAp/H,EAAAzO,EAAA,EAAAyO,EAAAzO,EAAA,IACA,MAAA8C,EAAAyqI,QAAA,CAAAO,UAAA,CACA,OAAAr/H,EAAAzO,EAAA,EAAAyO,EAAAzO,EAAA,OACA,MAAA8C,EAAAyqI,QAAA,CAAAQ,UAAA,CACA,OAAAt/H,EAAAzO,EAAA,GAAAyO,EAAAzO,CAAAA,EAAA,OACA,SACA,+BAAAwmC,EACA,CACA,EAKA/3B,EAAAvO,EAAA0oB,GACA,EAAG9lB,EAAA2rI,WAAA,UAAAhgI,CAAA,CAAAzO,CAAA,EACH,IAAAxD,EAAAqB,OAAA6xD,IAAA,CAAA5sD,EAAAyqI,QAAA,EAAAzwI,MAAA,CACA8rB,EAAA,EAAA1oB,EAAA,IACA,QAAA4/B,EAAA,EAAoBA,EAAAtjC,EAAOsjC,IAAA,CAC3B9/B,EAAA8/B,GAAAh9B,EAAA0rI,SAAA,CAAA1uG,EAAArxB,GACA,IAAA9O,EAAAmD,EAAAsrI,YAAA,CAAA3/H,GAAA3L,EAAAurI,YAAA,CAAA5/H,GAAA3L,EAAAwrI,YAAA,CAAA7/H,GAAA3L,EAAAyrI,YAAA,CAAA9/H,EACA3L,CAAAA,EAAA0rI,SAAA,CAAA1uG,EAAArxB,GAAA9O,EAAAO,GAAAA,CAAAA,EAAAP,EAAAipB,EAAAkX,CAAAA,CACA,CACA,OAAAlX,CACA,CACA,EAAC0kH,IACD,IAAAtpC,GAAA,GACA,IAAA0qC,GAAA,CAEA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,EACA,GACA,GACA,EACA,EACA,GACA,GACA,EACA,EACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,EACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,CAAAC,GAAA,CAEA,EACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,IACA,GACA,GACA,IACA,IACA,GACA,GACA,IACA,IACA,GACA,IACA,IACA,IACA,GACA,IACA,IACA,IACA,GACA,IACA,IACA,IACA,GACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,KACA,IACA,IACA,IACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,IACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,IACA,KACA,KACA,KACA,CACA3qC,GAAA4qC,cAAA,UAAAtrG,CAAA,CAAApnC,CAAA,EACA,OAAAA,GACA,KAAA8lD,GAAA7e,CAAA,CACA,OAAAurG,EAAA,EAAAprG,EAAA,aACA0e,GAAAqlE,CAAA,CACA,OAAAqnB,EAAA,EAAAprG,EAAA,aACA0e,GAAAtb,CAAA,CACA,OAAAgoG,EAAA,EAAAprG,EAAA,aACA0e,GAAA7f,CAAA,CACA,OAAAusG,EAAA,EAAAprG,EAAA,gBAEA,MACA,CACA,EACA0gE,GAAA6qC,sBAAA,UAAAvrG,CAAA,CAAApnC,CAAA,EACA,OAAAA,GACA,KAAA8lD,GAAA7e,CAAA,CACA,OAAAwrG,EAAA,EAAArrG,EAAA,aACA0e,GAAAqlE,CAAA,CACA,OAAAsnB,EAAA,EAAArrG,EAAA,aACA0e,GAAAtb,CAAA,CACA,OAAAioG,EAAA,EAAArrG,EAAA,aACA0e,GAAA7f,CAAA,CACA,OAAAwsG,EAAA,EAAArrG,EAAA,gBAEA,MACA,CACA,EACA,IAAAwrG,GAAA,GAAWC,GAAA,GACX,IAAA5vG,GAAA,IAAA1iC,WAAA,KAAAuyI,GAAA,IAAAvyI,WAAA,KA+CA,SAAAwyI,GAAAnsI,CAAA,EACA,KAAAosI,OAAA,aAAAC,MAAA,CAAArsI,EAAA,KAAAqsI,MAAA,OAAAC,UAAA,MAAAD,MAAA,CACA,EAhDA,WACA,IAAA7rG,EAAA,EACA,QAAApnC,EAAA,EAAkBA,EAAA,IAASA,IAC3BijC,EAAA,CAAAjjC,EAAA,CAAAonC,EAAA0rG,EAAA,CAAA1rG,EAAA,CAAApnC,EAAAonC,IAAAA,CAAAA,IAAA,IAAAA,CAAAA,GAAA,KACA,QAAApnC,EAAA,IAAoBA,EAAA,IAASA,IAC7BijC,EAAA,CAAAjjC,EAAA,CAAAijC,EAAA,CAAAjjC,EAAA,QAEA6yI,GAAAjjI,GAAA,UAAAw3B,CAAA,EACA,GAAAA,EAAA,EACA,mBAAAA,EAAA,KACA,OAAA0rG,EAAA,CAAA1rG,EAAA,EAEAyrG,GAAAM,GAAA,UAAA/rG,CAAA,EACA,OAAAnE,EAAA,CAAAmE,EAAA,EAEAyrG,GAAA7qG,GAAA,UAAAZ,CAAA,CAAApnC,CAAA,EACA,OAAAonC,IAAAA,GAAApnC,IAAAA,EAAA,EAAAijC,EAAA,CAAA6vG,EAAA,CAAA1rG,EAAA,CAAA0rG,EAAA,CAAA9yI,EAAA,GAIA4G,GAAAohC,GAAA,UAAAsC,CAAA,CAAA/3B,CAAA,EACA,IAAAzO,EAAA,IAAAvD,WAAA+pC,EAAA1pC,MAAA,CAAA2R,EAAA3R,MAAA,IACA,QAAAN,EAAA,EAAoBA,EAAAgqC,EAAA1pC,MAAA,CAAcN,IAClC,QAAAosB,EAAA,EAAsBA,EAAAna,EAAA3R,MAAA,CAAc8rB,IACpC5oB,CAAA,CAAAxD,EAAAosB,EAAA,EAAA0a,GAAAY,GAAA,CAAAsC,CAAA,CAAAhqC,EAAA,CAAAiS,CAAA,CAAAma,EAAA,EACA,OAAA5oB,CACA,EAAG8C,GAAA+H,GAAA,UAAA27B,CAAA,CAAA/3B,CAAA,EACH,IAAAzO,EAAA,IAAAvD,WAAA+pC,GACA,KAAWxmC,EAAAlD,MAAA,CAAA2R,EAAA3R,MAAA,KAA0B,CACrC,IAAAN,EAAAwD,CAAA,IACA,QAAAE,EAAA,EAAsBA,EAAAuO,EAAA3R,MAAA,CAAcoD,IACpCF,CAAA,CAAAE,EAAA,EAAAojC,GAAAY,GAAA,CAAAz1B,CAAA,CAAAvO,EAAA,CAAA1D,GACA,IAAAosB,EAAA,EACA,KAAaA,EAAA5oB,EAAAlD,MAAA,EAAAkD,IAAAA,CAAA,CAAA4oB,EAAA,EACbA,IACA5oB,EAAAA,EAAA6N,KAAA,CAAA+a,EACA,CACA,OAAA5oB,CACA,EAAG8C,GAAAwsI,oBAAA,UAAA9oG,CAAA,EACH,IAAA/3B,EAAA,IAAAhS,WAAA,KACA,QAAAuD,EAAA,EAAoBA,EAAAwmC,EAAOxmC,IAC3ByO,EAAA3L,GAAAohC,GAAA,CAAAz1B,EAAA,IAAAhS,WAAA,GAAA6mC,GAAA+rG,GAAA,CAAArvI,GAAA,GACA,OAAAyO,CACA,EAMAwgI,GAAA5/H,SAAA,CAAA+/H,UAAA,UAAA9rG,CAAA,EACA,KAAA6rG,MAAA,CAAA7rG,EAAA,KAAA4rG,OAAA,CAAkCK,GAAED,oBAAA,MAAAH,MAAA,CACpC,EACAF,GAAA5/H,SAAA,CAAAzF,MAAA,UAAA05B,CAAA,EACA,SAAA4rG,OAAA,CACA,uCACA,IAAAhzI,EAAA,IAAAO,WAAA6mC,EAAAxmC,MAAA,MAAAqyI,MAAA,EACAjzI,EAAAmJ,GAAA,CAAAi+B,GACA,IAAAkD,EAAY+oG,GAAE1kI,GAAA,CAAA3O,EAAA,KAAAgzI,OAAA,EAAAzgI,EAAA,KAAA0gI,MAAA,CAAA3oG,EAAA1pC,MAAA,CACd,GAAA2R,EAAA,GACA,IAAAzO,EAAA,IAAAvD,WAAA,KAAA0yI,MAAA,EACA,OAAAnvI,EAAAqF,GAAA,CAAAmhC,EAAA/3B,GAAAzO,CACA,CACA,OAAAwmC,CACA,EACA,IAAAgpG,GAAA,GAAoBrtG,GAAA,GAAQstG,GAAA,EAC5BA,CAAAA,GAAA/mG,OAAA,UAAApF,CAAA,EACA,OAAAvzB,MAAAuzB,IAAAA,GAAA,GAAAA,GAAA,EACA,EACA,IAAAkuF,GAAA,GACA,IAAAke,GAAA,SACAra,GAAA,mNAEAsa,GAAA,6BADAta,CAAAA,GAAAA,GAAA1lH,OAAA,cACA;IACA,EACA6hH,GAAAoe,KAAA,QAAAva,GAAA,KACA7D,GAAAqe,UAAA,qCACAre,GAAAse,IAAA,QAAAH,GAAA,KACAne,GAAAue,OAAA,QAAAL,GAAA,KACAle,GAAAwe,YAAA,QATA,oBASA,KACA,IAAAjxF,GAAA,WAAAs2E,GAAA,KAAA72E,GAAA,WAAAkxF,GAAA,KAAAO,GAAA,gCACAze,CAAAA,GAAA0e,SAAA,UAAA5sG,CAAA,EACA,OAAAyb,GAAAp/B,IAAA,CAAA2jB,EACA,EACAkuF,GAAA2e,WAAA,UAAA7sG,CAAA,EACA,OAAAkb,GAAA7+B,IAAA,CAAA2jB,EACA,EACAkuF,GAAA4e,gBAAA,UAAA9sG,CAAA,EACA,OAAA2sG,GAAAtwH,IAAA,CAAA2jB,EACA,EAGAxgC,GAAAitI,OAAA,EACA3jI,GAAA,UACAoyG,IAAA,EACA6xB,OAAA,YACGvtI,GAAAktI,YAAA,EACH5jI,GAAA,eACAoyG,IAAA,EACA6xB,OAAA,WACGvtI,GAAAgtI,IAAA,EACH1jI,GAAA,OACAoyG,IAAA,EACA6xB,OAAA,WACGvtI,GAAA8sI,KAAA,EACHxjI,GAAA,QACAoyG,IAAA,EACA6xB,OAAA,WACGvtI,GAAAwtI,KAAA,EACH9xB,IAAA,EACA,EAAG17G,GAAAytI,qBAAA,UAAAvwI,CAAA,CAAAxD,CAAA,EACH,IAAAwD,EAAAqwI,MAAA,CACA,6BAAArwI,GACA,IAAAsjC,GAAAoF,OAAA,CAAAlsC,GACA,gCAAAA,GACA,OAAAA,GAAA,GAAAA,EAAA,GAAAwD,EAAAqwI,MAAA,IAAA7zI,EAAA,GAAAwD,EAAAqwI,MAAA,IAAArwI,EAAAqwI,MAAA,KACGvtI,GAAA0tI,kBAAA,UAAAxwI,CAAA,EACH,OAAA9D,GAAAi0I,WAAA,CAAAnwI,GAAA8C,GAAAitI,OAAA,CAAA7zI,GAAAk0I,gBAAA,CAAApwI,GAAA8C,GAAAktI,YAAA,CAAA9zI,GAAAg0I,SAAA,CAAAlwI,GAAA8C,GAAA8sI,KAAA,CAAA9sI,GAAAgtI,IAAA,EACGhtI,GAAAiF,QAAA,UAAA/H,CAAA,EACH,GAAAA,GAAAA,EAAAoM,EAAA,CACA,OAAApM,EAAAoM,EAAA,OACA,qBACA,EAAGtJ,GAAA4lC,OAAA,UAAA1oC,CAAA,EACH,OAAAA,GAAAA,EAAAw+G,GAAA,EAAAx+G,EAAAqwI,MAAA,EAkBAvtI,GAAA+E,IAAA,UAAA7H,CAAA,CAAAxD,CAAA,EACA,GAAAsG,GAAA4lC,OAAA,CAAA1oC,GACA,OAAAA,EACA,IACA,OAAAwmC,SApBA/3B,CAAA,EACA,oBAAAA,EACA,qCACA,OAAAA,EAAAiB,WAAA,IACA,cACA,OAAA5M,GAAAitI,OAAA,KACA,eACA,OAAAjtI,GAAAktI,YAAA,KACA,QACA,OAAAltI,GAAA8sI,KAAA,KACA,OACA,OAAA9sI,GAAAgtI,IAAA,SAEA,6BAAArhI,EACA,CACA,EAKAzO,EACA,CAAM,MACN,OAAAxD,CACA,CACA,EAEA,SAAAsG,CAAA,EACA,IAAA8lB,EAAA0a,GAAAgpG,WAAA,OAMA,SAAAxsG,EAAA7iC,CAAA,CAAAqpC,CAAA,EACA,OAAA73B,GAAA8hI,qBAAA,CAAAtzI,EAAAqpC,GAAA,CACA,CAaAxjC,EAAA+E,IAAA,UAAAy+B,CAAA,CAAAl3B,CAAA,EACA,OAAApP,GAAA0oC,OAAA,CAAApC,GAAA12B,SAAA02B,EAAA,IAAAl3B,CACA,EAAGtM,EAAA2tI,WAAA,UAAAnqG,CAAA,CAAAl3B,CAAA,CAAAia,CAAA,EACH,IAAArpB,GAAA0oC,OAAA,CAAApC,GACA,sCACA,QAAAjd,EAAA,KAAAA,CAAAA,EAAA5a,GAAAqhI,IAAA,EACA,IAAAhsB,EAAA,CAAAv3E,GAAA8/F,uBAAA,CAAA/lG,GAAApqC,GAAA2yI,sBAAA,CAAAvoG,EAAAl3B,EAAA+3B,EAAA,EACA,GAAA9d,IAAA5a,GAAA6hI,KAAA,CACA,OAAAxsB,EACA,IAAAp1G,EAAAo1G,EAAAhkF,EAAAzW,EAAAid,GACA,OAAAjd,GACA,KAAA5a,GAAAshI,OAAA,CACA,OAAA9qI,KAAAuC,KAAA,CAAAkH,EAAA,KACA,MAAAD,GAAAuhI,YAAA,CACA,OAAA/qI,KAAAuC,KAAA,CAAAkH,EAAA,KACA,MAAAD,GAAAmhI,KAAA,CACA,OAAA3qI,KAAAuC,KAAA,CAAAkH,EAAA,GACA,MAAAD,GAAAqhI,IAAA,CACA,QACA,OAAA7qI,KAAAuC,KAAA,CAAAkH,EAAA,EACA,CACA,EAAG5L,EAAA4tI,qBAAA,UAAApqG,CAAA,CAAAl3B,CAAA,MACHia,EACA,IAAAkjB,EAAA/F,GAAA3+B,IAAA,CAAAuH,EAAAo3B,GAAA6gF,CAAA,EACA,GAAAz/G,MAAA8J,OAAA,CAAA40B,GAAA,CACA,GAAAA,EAAAxpC,MAAA,GACA,OAAA6pC,SA/BA1pC,CAAA,CAAAqpC,CAAA,EACA,QAAAl3B,EAAA,EAAoBA,GAAA,GAASA,IAC7B,GAAAzP,SATA1C,CAAA,CAAAqpC,CAAA,EACA,IAAAl3B,EAAA,EACA,OAAAnS,EAAAgV,OAAA,UAAAoX,CAAA,EACA,IAAAkjB,EAAAzM,EAAAzW,EAAA6D,IAAA,CAAAoZ,GACAl3B,GAAAm9B,EAAAljB,EAAAsnH,aAAA,EACA,GAAKvhI,CACL,EAGAnS,EAAAmS,IAAAtM,EAAA2tI,WAAA,CAAArhI,EAAAk3B,EAAA73B,GAAA6hI,KAAA,EACA,OAAAlhI,CACA,EA2BAk3B,EAAAiG,GACA,GAAAjG,IAAAA,EAAAxpC,MAAA,CACA,SACAusB,EAAAid,CAAA,SAEAjd,EAAAid,EACA,OAAApmC,SApDAjD,CAAA,CAAAqpC,CAAA,CAAAl3B,CAAA,EACA,QAAAia,EAAA,EAAoBA,GAAA,GAASA,IAC7B,GAAAid,GAAAxjC,EAAA2tI,WAAA,CAAApnH,EAAAja,EAAAnS,GACA,OAAAosB,CACA,EAgDAA,EAAA6D,IAAA,CAAA7D,EAAAuD,SAAA,GAAA2f,EACA,EAAGzpC,EAAA8tI,cAAA,UAAAtqG,CAAA,EACH,IAAAtmC,GAAA0oC,OAAA,CAAApC,IAAAA,EAAA,EACA,uCACA,IAAAl3B,EAAAk3B,GAAA,GACA,KAAWhD,GAAAgpG,WAAA,CAAAl9H,GAAAwZ,GAAA,GACXxZ,GAAA5S,MAAA8mC,GAAAgpG,WAAA,CAAAl9H,GAAAwZ,EACA,OAAA0d,GAAA,GAAAl3B,CACA,CACA,EAACogI,IACD,IAAAqB,GAAA,GACA,IAAAC,GAAAC,GAAAzE,WAAA,MACAuE,CAAAA,GAAAD,cAAA,UAAAttG,CAAA,CAAApnC,CAAA,EACA,IAAAsqC,EAAAlD,EAAAk7E,GAAA,IAAAtiH,EACAuS,EAAA+3B,GAAA,GACA,KAASuqG,GAAAzE,WAAA,CAAA79H,GAAAqiI,IAAA,GACTriI,GAAAuiI,MAAAD,GAAAzE,WAAA,CAAA79H,GAAAqiI,GACA,OAAAtqG,GAAA,GAAA/3B,CAAAA,EANA,KAOA,EACA,IAAAwiI,GAAA,GAEA,SAAA7/F,GAAAtuC,CAAA,EACA,KAAAoqB,IAAA,CAAAgkH,GAAAnB,OAAA,MAAAlrI,IAAA,CAAA/B,EAAAiF,QAAA,EACA,CACAqpC,GAAAu/F,aAAA,UAAArtG,CAAA,EACA,UAAAr+B,KAAAuC,KAAA,CAAA87B,EAAA,GAAAA,CAAAA,EAAA,EAAAA,EAAA,QACA,EACA8N,GAAA/hC,SAAA,CAAAud,SAAA,YACA,YAAA/nB,IAAA,CAAA/H,MAAA,EAEAs0C,GAAA/hC,SAAA,CAAAshI,aAAA,YACA,OAAAv/F,GAAAu/F,aAAA,MAAA9rI,IAAA,CAAA/H,MAAA,CACA,EACAs0C,GAAA/hC,SAAA,CAAA8hI,KAAA,UAAA7tG,CAAA,MACApnC,EAAAuS,EACA,IAAAvS,EAAA,EAAcA,EAAA,QAAA2I,IAAA,CAAA/H,MAAA,CAA2BZ,GAAA,EACzCsqC,EAAA52B,SAAA,KAAA/K,IAAA,CAAAusI,MAAA,CAAAl1I,EAAA,OAAAonC,EAAAspG,GAAA,CAAAn+H,EAAA,IACA,IAAAzO,EAAA,KAAA6E,IAAA,CAAA/H,MAAA,CAAAZ,CACA8D,CAAAA,EAAA,GAAAwmC,CAAAA,EAAA52B,SAAA,KAAA/K,IAAA,CAAAusI,MAAA,CAAAl1I,GAAA,IAAAonC,EAAAspG,GAAA,CAAAn+H,EAAAzO,EAAAA,EAAA,GACA,EAEA,IAAAqxI,GAAA,CACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,CACA,SAAAjY,GAAAt2H,CAAA,EACA,KAAAoqB,IAAA,CAAA+wB,GAAA+xF,YAAA,MAAAnrI,IAAA,CAAA/B,CACA,CACAs2H,GAAAuX,aAAA,UAAArtG,CAAA,EACA,UAAAr+B,KAAAuC,KAAA,CAAA87B,EAAA,QACA,EACA81F,GAAA/pH,SAAA,CAAAud,SAAA,YACA,YAAA/nB,IAAA,CAAA/H,MAAA,EAEAs8H,GAAA/pH,SAAA,CAAAshI,aAAA,YACA,OAAAvX,GAAAuX,aAAA,MAAA9rI,IAAA,CAAA/H,MAAA,CACA,EACAs8H,GAAA/pH,SAAA,CAAA8hI,KAAA,UAAA7tG,CAAA,EACA,IAAApnC,EACA,IAAAA,EAAA,EAAcA,EAAA,QAAA2I,IAAA,CAAA/H,MAAA,CAA2BZ,GAAA,GACzC,IAAAsqC,EAAA6qG,GAAAA,GAAAplH,OAAA,MAAApnB,IAAA,CAAA3I,EAAA,CACAsqC,CAAAA,GAAA6qG,GAAAplH,OAAA,MAAApnB,IAAA,CAAA3I,EAAA,IAAAonC,EAAAspG,GAAA,CAAApmG,EAAA,GACA,CACA,KAAA3hC,IAAA,CAAA/H,MAAA,IAAAwmC,EAAAspG,GAAA,CAAAyE,GAAAplH,OAAA,MAAApnB,IAAA,CAAA3I,EAAA,IACA,EA4BA,IAAAo1I,GA3BA,SAAAhuG,CAAA,EACA,QAAApnC,EAAA,GAAAsqC,EAAAlD,EAAAxmC,MAAA,CAAA2R,EAAA,EAAwCA,EAAA+3B,EAAO/3B,IAAA,CAC/C,IAAAzO,EAAAsjC,EAAAr6B,UAAA,CAAAwF,GACA,GAAAzO,GAAA,OAAAA,GAAA,OAAAwmC,EAAA/3B,EAAA,GACA,IAAAjS,EAAA8mC,EAAAr6B,UAAA,CAAAwF,EAAA,EACAjS,CAAAA,GAAA,OAAAA,GAAA,OAAAwD,CAAAA,EAAA,CAAAA,EAAA,YAAAxD,EAAA,YAAAiS,GAAA,EACA,CACA,GAAAzO,EAAA,KACA9D,EAAA2G,IAAA,CAAA7C,GACA,QACA,CACA,GAAAA,EAAA,MACA9D,EAAA2G,IAAA,CAAA7C,GAAA,OAAA9D,EAAA2G,IAAA,CAAA7C,GAAAA,EAAA,KACA,QACA,CACA,GAAAA,EAAA,OAAAA,GAAA,OAAAA,EAAA,OACA9D,EAAA2G,IAAA,CAAA7C,GAAA,QAAA9D,EAAA2G,IAAA,CAAA7C,GAAA,UAAA9D,EAAA2G,IAAA,CAAA7C,GAAAA,EAAA,KACA,QACA,CACA,GAAAA,GAAA,OAAAA,GAAA,SACA9D,EAAA2G,IAAA,CAAA7C,GAAA,QAAA9D,EAAA2G,IAAA,CAAA7C,GAAA,WAAA9D,EAAA2G,IAAA,CAAA7C,GAAA,UAAA9D,EAAA2G,IAAA,CAAA7C,GAAAA,EAAA,KACA,QACA,CACA9D,EAAA2G,IAAA,aACA,CACA,WAAApG,WAAAP,GAAAmL,MAAA,EAGA,SAAAkqI,GAAAzuI,CAAA,EACA,KAAAoqB,IAAA,CAAAskH,GAAA1B,IAAA,kBAAAhtI,GAAAA,CAAAA,EAAAwuI,GAAAxuI,EAAA,OAAA+B,IAAA,KAAApI,WAAAqG,EACA,CAgBA,SAAA63H,GAAA73H,CAAA,EACA,KAAAoqB,IAAA,CAAAoxB,GAAAsxF,KAAA,MAAA/qI,IAAA,CAAA/B,CACA,CAjBAyuI,GAAAZ,aAAA,UAAArtG,CAAA,EACA,OAAAA,EAAAA,CACA,EACAiuG,GAAAliI,SAAA,CAAAud,SAAA,YACA,YAAA/nB,IAAA,CAAA/H,MAAA,EAEAy0I,GAAAliI,SAAA,CAAAshI,aAAA,YACA,OAAAY,GAAAZ,aAAA,MAAA9rI,IAAA,CAAA/H,MAAA,CACA,EACAy0I,GAAAliI,SAAA,CAAA8hI,KAAA,UAAAruI,CAAA,EACA,QAAAwgC,EAAA,EAAApnC,EAAA,KAAA2I,IAAA,CAAA/H,MAAA,CAAwCwmC,EAAApnC,EAAOonC,IAC/CxgC,EAAA8pI,GAAA,MAAA/nI,IAAA,CAAAy+B,EAAA,GACA,EAMAq3F,GAAAgW,aAAA,UAAArtG,CAAA,EACA,OAAAA,GAAAA,CACA,EACAq3F,GAAAtrH,SAAA,CAAAud,SAAA,YACA,YAAA/nB,IAAA,CAAA/H,MAAA,EAEA69H,GAAAtrH,SAAA,CAAAshI,aAAA,YACA,OAAAhW,GAAAgW,aAAA,MAAA9rI,IAAA,CAAA/H,MAAA,CACA,EACA69H,GAAAtrH,SAAA,CAAA8hI,KAAA,UAAAruI,CAAA,EACA,IAAAwgC,EACA,IAAAA,EAAA,EAAcA,EAAA,KAAAz+B,IAAA,CAAA/H,MAAA,CAAsBwmC,IAAA,CACpC,IAAApnC,EAAAu1I,GAAAhF,MAAA,MAAA5nI,IAAA,CAAAy+B,EAAA,EACA,GAAApnC,GAAA,OAAAA,GAAA,MACAA,GAAA,WACA,GAAAA,GAAA,OAAAA,GAAA,MACAA,GAAA,WAEA,YACA,gCAAA2I,IAAA,CAAAy+B,EAAA;+BACA,EAEApnC,CAAAA,EAAA,CAAAA,IAAA,WAAAA,CAAAA,IAAAA,CAAA,EAAA4G,EAAA8pI,GAAA,CAAA1wI,EAAA,GACA,CACA,EACA,IAAAw1I,GAAA,CAAmB3zI,QAAA,IAEnBulC,EAAA,CACAquG,6BAAA,SAAAz1I,CAAA,CAAAsqC,CAAA,CAAA/3B,CAAA,EACA,IAIAvO,EAAA4/B,EAAAngC,EAAAgnC,EAAA1pC,EAAAmS,EAAAia,EAJArpB,EAAA,GAAgBxD,EAAA,EAChBA,CAAAA,CAAA,CAAAgqC,EAAA,GACA,IAAA5d,EAAA0a,EAAAsuG,aAAA,CAAAC,IAAA,GAEA,IADAjpH,EAAA/lB,IAAA,CAAA2jC,EAAA,GAC0C,CAAA5d,EAAAtS,KAAA,IAE1C,IAAA3W,KADAmgC,EAAA5/B,CAAAA,EAAA0oB,EAAAlI,GAAA,IAAA1iB,KAAA,CAAA2oC,EAAAzmC,EAAA4xI,IAAA,CAAA70I,EAAAf,CAAA,CAAA4jC,EAAA,KAEA7iC,EAAAqS,cAAA,CAAA3P,IAAA2mC,CAAAA,EAAAK,EAAA1pC,CAAA,CAAA0C,EAAA,CAAA0pB,EAAA7sB,CAAA,CAAAmD,EAAA,EAAA4sC,OAAA/vC,CAAA,CAAAmD,EAAA,MAAA0pB,EAAAja,CAAAA,GAAA5S,CAAAA,CAAA,CAAAmD,EAAA,CAAAyP,EAAAwZ,EAAA/lB,IAAA,CAAAlD,EAAAyP,GAAApP,CAAA,CAAAL,EAAA,CAAAmgC,CAAAA,CAAA,EAEA,cAAArxB,GAAA,OAAAjS,CAAA,CAAAiS,EAAA,KAEA,YADA,+BAAA+3B,EAAA,OAAA/3B,EAAA,KAAA08C,IAAA,MAGA,OAAAnrD,CACA,EACA+xI,4CAAA,SAAA71I,CAAA,CAAAsqC,CAAA,EACA,QAAA/3B,EAAA,GAAAzO,EAAAwmC,EAA8BxmC,GAC9ByO,EAAA5L,IAAA,CAAA7C,GAAA9D,CAAA,CAAA8D,EAAA,CAAAA,EAAA9D,CAAA,CAAA8D,EAAA,CACA,OAAAyO,EAAAk1B,OAAA,GAAAl1B,CACA,EACAujI,UAAA,SAAA91I,CAAA,CAAAsqC,CAAA,CAAA/3B,CAAA,EACA,IAAAzO,EAAAsjC,EAAAquG,4BAAA,CAAAz1I,EAAAsqC,EAAA/3B,GACA,OAAA60B,EAAAyuG,2CAAA,CACA/xI,EACAyO,EAEA,EAIAmjI,cAAA,CACAC,KAAA,SAAA31I,CAAA,EACA,IAAuC8D,EAAvCwmC,EAAAlD,EAAAsuG,aAAA,CAAAnjI,EAAA,GAEA,IAAAzO,KADA9D,EAAAA,GAAA,GACAsqC,EACAA,EAAAl3B,cAAA,CAAAtP,IAAAyO,CAAAA,CAAA,CAAAzO,EAAA,CAAAwmC,CAAA,CAAAxmC,EAAA,EACA,OAAAyO,EAAAwjI,KAAA,IAAAxjI,EAAAyjI,MAAA,CAAAh2I,EAAAg2I,MAAA,EAAA1rG,EAAA2rG,cAAA,CAAA1jI,CACA,EACA0jI,eAAA,SAAAj2I,CAAA,CAAAsqC,CAAA,EACA,OAAAtqC,EAAA41I,IAAA,CAAAtrG,EAAAsrG,IAAA,EAMAjvI,KAAA,SAAA3G,CAAA,CAAAsqC,CAAA,EAEA,KAAAyrG,KAAA,CAAApvI,IAAA,CADA,CAAkB7E,MAAA9B,EAAA41I,KAAAtrG,CAAA,GAClB,KAAAyrG,KAAA,CAAAz2H,IAAA,MAAA02H,MAAA,CACA,EAIAxxH,IAAA,WACA,YAAAuxH,KAAA,CAAAnuI,KAAA,EACA,EACAwS,MAAA,WACA,gBAAA27H,KAAA,CAAAn1I,MAAA,CAEA,CACA,EACAgG,GAAA/E,OAAA,CAAAulC,EAEA,IAAA8uG,GAAAV,GAAA3zI,OAAA,CAqKA,SAAAs0I,GAAAvvI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,MAEA8D,EAAAxD,EADA,IAAAgqC,EAAA1jC,EAAA8qB,IAAA,CAAAnf,EAAA6jI,GAAA1B,cAAA,CAAAttG,EAAApnC,GAEA,IAAA8D,EAAA,EAAcA,EAAA,GAAQA,IACtBxD,EAAA,CAAAiS,GAAAzO,EAAA,MAAAA,EAAA,EAAA8C,EAAAuC,GAAA,CAAArF,EAAA,EAAAxD,EAAA,IAAAwD,EAAA,EAAA8C,EAAAuC,GAAA,CAAArF,EAAA,IAAAxD,EAAA,IAAAsG,EAAAuC,GAAA,CAAAmhC,EAAA,GAAAxmC,EAAA,EAAAxD,EAAA,IAAAwD,EAAA,EAAA8C,EAAAuC,GAAA,GAAAmhC,EAAAxmC,EAAA,EAAAxD,EAAA,IAAAwD,EAAA,EAAA8C,EAAAuC,GAAA,MAAArF,EAAA,IAAAxD,EAAA,IAAAsG,EAAAuC,GAAA,MAAArF,EAAA,EAAAxD,EAAA,IACAsG,EAAAuC,GAAA,CAAAmhC,EAAA,SACA,EA1KA,SAAA1jC,CAAA,EAEA,SAAAg9B,EAAAqH,CAAA,EACA,OAAAorG,SAAAC,mBAAArrG,IAAArqC,MAAA,CAEA,SAAA6C,EAAAwnC,CAAA,CAAA28E,CAAA,CAAAp1G,CAAA,MAEA9L,EADA,IAAA48B,EAAA,GAEA,KAAW,OAAA58B,CAAAA,EAAAukC,EAAAvf,IAAA,CAAAlZ,EAAA,GACX8wB,EAAA38B,IAAA,EACAgC,KAAAjC,CAAA,IACAyV,MAAAzV,EAAAyV,KAAA,CACA6U,KAAA42F,EACAhnH,OAAA8F,CAAA,IAAA9F,MAAA,GAEA,OAAA0iC,CACA,CACA,SAAAmH,EAAAQ,CAAA,MAEA3H,EAAA58B,EADA,IAAAkhH,EAAAnkH,EAAAnD,GAAAuzI,OAAA,CAAAzsG,GAAAysG,OAAA,CAAA5oG,GAAAz4B,EAAA/O,EAAAnD,GAAAwzI,YAAA,CAAA1sG,GAAA0sG,YAAA,CAAA7oG,GAEA,OAAAve,GAAA4jH,kBAAA,GAAAhtG,CAAAA,EAAA7/B,EAAAnD,GAAAszI,IAAA,CAAAxsG,GAAAwsG,IAAA,CAAA3oG,GAAAvkC,EAAAjD,EAAAnD,GAAAozI,KAAA,CAAAtsG,GAAAssG,KAAA,CAAAzoG,EAAA,EAAA3H,CAAAA,EAAA7/B,EAAAnD,GAAAqzI,UAAA,CAAAvsG,GAAAwsG,IAAA,CAAA3oG,GAAAvkC,EAAA,IAAAkhH,EAAA/6D,MAAA,CAAAr6C,EAAA8wB,EAAA58B,GAAA4Y,IAAA,UAAAlf,CAAA,CAAA+qH,CAAA,EACA,OAAA/qH,EAAA+b,KAAA,CAAAgvG,EAAAhvG,KAAA,GACKD,GAAA,UAAA9b,CAAA,EACL,OACAuI,KAAAvI,EAAAuI,IAAA,CACAqoB,KAAA5wB,EAAA4wB,IAAA,CACApwB,OAAAR,EAAAQ,MAAA,CAEA,EACA,CACA,SAAAG,EAAAkqC,CAAA,CAAA28E,CAAA,EACA,OAAAA,GACA,KAAAxgF,GAAAysG,OAAA,CACA,OAAA7zI,GAAAy0I,aAAA,CAAAxpG,EACA,MAAA7D,GAAA0sG,YAAA,CACA,OAAAxpG,GAAAmqG,aAAA,CAAAxpG,EACA,MAAA7D,GAAAssG,KAAA,CACA,OAAA5vI,GAAA2wI,aAAA,CAAAxpG,EACA,MAAA7D,GAAAwsG,IAAA,CACA,OAAArhI,GAAAkiI,aAAA,CAAAxpG,EACA,CACA,CA0DA,SAAAoF,EAAApF,CAAA,CAAA28E,CAAA,MACAp1G,EACA,IAAA8wB,EAAA8D,GAAAktG,kBAAA,CAAArpG,GACA,GAAAz4B,CAAAA,EAAA40B,GAAAz7B,IAAA,CAAAi8G,EAAAtkF,EAAA,IAAA8D,GAAAwsG,IAAA,EAAAphI,EAAA8vG,GAAA,CAAAh/E,EAAAg/E,GAAA,CACA,gBAAAr3E,EAAA,iCAAA7D,GAAAv7B,QAAA,CAAA2G,GAAA;oBACA,EAAA40B,GAAAv7B,QAAA,CAAAy3B,IACA,OAAA9wB,IAAA40B,GAAAssG,KAAA,EAAAhnH,GAAA4jH,kBAAA,IAAA99H,CAAAA,EAAA40B,GAAAwsG,IAAA,EAAAphI,GACA,KAAA40B,GAAAysG,OAAA,CACA,WA5TA3+F,GA4TAjK,EACA,MAAA7D,GAAA0sG,YAAA,CACA,WA1PA5W,GA0PAjyF,EACA,MAAA7D,GAAAssG,KAAA,CACA,WAlLAjV,GAkLAxzF,EACA,MAAA7D,GAAAwsG,IAAA,CACA,WAlNAyB,GAkNApqG,EACA,CACA,CACArkC,EAAA2vI,SAAA,UAAA3uB,CAAA,EACA,OAAAA,EAAA9/E,MAAA,UAAAt1B,CAAA,CAAA8wB,CAAA,EACA,uBAAAA,EAAA9wB,EAAA7L,IAAA,CAAA0pC,EAAA/M,EAAA,OAAAA,EAAA36B,IAAA,EAAA6J,EAAA7L,IAAA,CAAA0pC,EAAA/M,EAAA36B,IAAA,CAAA26B,EAAAtS,IAAA,GAAAxe,CACA,EAAK,GACL,EAAG5L,EAAA8yG,UAAA,UAAAkO,CAAA,CAAAp1G,CAAA,EACH,IAAArL,EAAAgmB,SAzCA8d,CAAA,CAAA28E,CAAA,EACA,IAAAp1G,EAAA,GAAgB8wB,EAAA,CAAQtO,MAAA,IACxBtuB,EAAA,UACA,QAAAS,EAAA,EAAoBA,EAAA8jC,EAAArqC,MAAA,CAAcuG,IAAA,CAClC,IAAA/G,EAAA6qC,CAAA,CAAA9jC,EAAA,CAAAgkH,EAAA,GACA,QAAAvwE,EAAA,EAAsBA,EAAAx6C,EAAAQ,MAAA,CAAcg6C,IAAA,CACpC,IAAA2K,EAAAnlD,CAAA,CAAAw6C,EAAA,CAAAnoC,EAAA,GAAAtL,EAAAyzC,CACAuwE,CAAAA,EAAAxkH,IAAA,CAAA8L,GAAAD,CAAA,CAAAC,EAAA,EAA4BirB,KAAA6nB,EAAAixF,UAAA,GAAuBlzG,CAAA,CAAA7wB,EAAA,IACnD,QAAAw0B,EAAA,EAAwBA,EAAAvgC,EAAA9F,MAAA,CAAcqmC,IAAA,CACtC,IAAAr7B,EAAAlF,CAAA,CAAAugC,EAAA,CACAz0B,CAAA,CAAA5G,EAAA,EAAA4G,CAAA,CAAA5G,EAAA,CAAA8xB,IAAA,CAAA1M,IAAA,GAAAu0B,EAAAv0B,IAAA,CAAAsS,CAAAA,CAAA,CAAA13B,EAAA,CAAA6G,EAAA,CAAA1R,EAAAyR,CAAA,CAAA5G,EAAA,CAAA4qI,SAAA,CAAAjxF,EAAA3kD,MAAA,CAAA2kD,EAAAv0B,IAAA,EAAAjwB,EAAAyR,CAAA,CAAA5G,EAAA,CAAA4qI,SAAA,CAAAjxF,EAAAv0B,IAAA,EAAAxe,CAAA,CAAA5G,EAAA,CAAA4qI,SAAA,EAAAjxF,EAAA3kD,MAAA,EAAA4R,CAAAA,CAAA,CAAA5G,EAAA,EAAA4G,CAAAA,CAAA,CAAA5G,EAAA,CAAA4qI,SAAA,CAAAjxF,EAAA3kD,MAAA,EAAA0iC,CAAA,CAAA13B,EAAA,CAAA6G,EAAA,CAAA1R,EAAAwkD,EAAA3kD,MAAA,CAAA2kD,EAAAv0B,IAAA,IAAAoW,GAAAitG,qBAAA,CAAA9uF,EAAAv0B,IAAA,CAAA42F,EAAA,CACA,CACA,CACAlhH,EAAAykH,CACA,CACA,QAAAhkH,EAAA,EAAoBA,EAAAT,EAAA9F,MAAA,CAAcuG,IAClCm8B,CAAA,CAAA58B,CAAA,CAAAS,EAAA,EAAA4N,GAAA,GACA,OAAamH,IAAAonB,EAAAmzG,MAAAjkI,CAAA,CACb,EAuBAU,SAzEA+3B,CAAA,EACA,IAAA28E,EAAA,GACA,QAAAp1G,EAAA,EAAoBA,EAAAy4B,EAAArqC,MAAA,CAAc4R,IAAA,CAClC,IAAA8wB,EAAA2H,CAAA,CAAAz4B,EAAA,CACA,OAAA8wB,EAAAtS,IAAA,EACA,KAAAoW,GAAAysG,OAAA,CACAjsB,EAAAjhH,IAAA,EACA28B,EACA,CAAc36B,KAAA26B,EAAA36B,IAAA,CAAAqoB,KAAAoW,GAAA0sG,YAAA,CAAAlzI,OAAA0iC,EAAA1iC,MAAA,EACd,CAAc+H,KAAA26B,EAAA36B,IAAA,CAAAqoB,KAAAoW,GAAAwsG,IAAA,CAAAhzI,OAAA0iC,EAAA1iC,MAAA,EACd,EACA,KACA,MAAAwmC,GAAA0sG,YAAA,CACAlsB,EAAAjhH,IAAA,EACA28B,EACA,CAAc36B,KAAA26B,EAAA36B,IAAA,CAAAqoB,KAAAoW,GAAAwsG,IAAA,CAAAhzI,OAAA0iC,EAAA1iC,MAAA,EACd,EACA,KACA,MAAAwmC,GAAAssG,KAAA,CACA9rB,EAAAjhH,IAAA,EACA28B,EACA,CAAc36B,KAAA26B,EAAA36B,IAAA,CAAAqoB,KAAAoW,GAAAwsG,IAAA,CAAAhzI,OAAAgjC,EAAAN,EAAA36B,IAAA,GACd,EACA,KACA,MAAAy+B,GAAAwsG,IAAA,CACAhsB,EAAAjhH,IAAA,EACA,CAAcgC,KAAA26B,EAAA36B,IAAA,CAAAqoB,KAAAoW,GAAAwsG,IAAA,CAAAhzI,OAAAgjC,EAAAN,EAAA36B,IAAA,GACd,CACA,CACA,CACA,OAAAi/G,CACA,EA0CAn9E,EAAAm9E,EAAAl7F,GAAA4jH,kBAAA,KAAA99H,GAAApS,EAAA4D,GAAA8xI,SAAA,CAAA3uI,EAAA+U,GAAA,gBAAAivG,EAAA,GACA,QAAAvwE,EAAA,EAAoBA,EAAAx6C,EAAAQ,MAAA,GAAkBg6C,IACtCuwE,EAAAxkH,IAAA,CAAAQ,EAAAsvI,KAAA,CAAAr2I,CAAA,CAAAw6C,EAAA,EAAAld,IAAA,EACA,OAAA92B,EAAA2vI,SAAA,CAjFAtrG,EAAAnD,MAAA,UAAA8/E,CAAA,CAAAp1G,CAAA,EACA,IAAA8wB,EAAAskF,EAAAhnH,MAAA,MAAAgnH,CAAA,CAAAA,EAAAhnH,MAAA,SACA,OAAA0iC,GAAAA,EAAAtS,IAAA,GAAAxe,EAAAwe,IAAA,CAAA42F,CAAA,CAAAA,EAAAhnH,MAAA,IAAA+H,IAAA,EAAA6J,EAAA7J,IAAA,CAAAi/G,EAAAjhH,IAAA,CAAA6L,GAAAo1G,CACA,EAAK,IA+EL,EAAGhhH,EAAA8vI,QAAA,UAAA9uB,CAAA,EACH,OAAAhhH,EAAA2vI,SAAA,CACA9rG,EAAAm9E,EAAAl7F,GAAA4jH,kBAAA,IAEA,CACA,EAACyE,IA+HD/E,GAAAhvI,MAAA,UAAAomC,CAAA,CAAApnC,CAAA,EACA,UAAAonC,EAAA,KAAAA,KAAAA,EACA,6BACA,IAAAkD,EAAAqsG,GAAAxrB,CAAA,CAAA54G,EAAAzO,EACA,iBAAA9D,GAAAsqC,CAAAA,EAAAqsG,GAAAhrI,IAAA,CAAA3L,EAAA42I,oBAAA,CAAAD,GAAAxrB,CAAA,EAAA54G,EAAAg7E,GAAA5hF,IAAA,CAAA3L,EAAAkR,OAAA,EAAApN,EAAA+yI,GAAAlrI,IAAA,CAAA3L,EAAA82I,WAAA,EAAA92I,EAAA+2I,UAAA,EAAA79B,GAAAm3B,iBAAA,CAAArwI,EAAA+2I,UAAA,GAAAC,SAzCApwI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,MACA/3B,EACA,GAAA7G,MAAA8J,OAAA,CAAA5O,GACA2L,EAAA0kI,GAAAV,SAAA,CAAA3vI,QACA,oBAAAA,EAAA,CACA,IAAAg9B,EAAAwD,EACA,IAAAxD,EAAA,CACA,IAAAngC,EAAAwzI,GAAAP,QAAA,CAAA9vI,GACAg9B,EAAA2pD,GAAAinD,qBAAA,CAAA/wI,EAAAzD,EACA,CACAuS,EAAA0kI,GAAAv9B,UAAA,CAAA9yG,EAAAg9B,GAAA,GACA,MACA,4BACA,IAAA9/B,EAAAypF,GAAAinD,qBAAA,CAAAjiI,EAAAvS,GACA,IAAA8D,EACA,uEACA,GAAAsjC,EAEA,IAAAA,EAAAtjC,EACA,YACA;;mDAEA,EAAAA,EAAA;AACA,EACA,MAPAsjC,EAAAtjC,EAQA,IAAAxD,EAAA42I,SA1DAtwI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,IAAAsqC,EAAA,IA1nCA9mC,GA2nCAxD,EAAA+V,OAAA,UAAA/R,CAAA,EACAsmC,EAAAomG,GAAA,CAAA1sI,EAAAgtB,IAAA,CAAAsxF,GAAA,IAAAh4E,EAAAomG,GAAA,CAAA1sI,EAAA0sB,SAAA,GAAAymH,GAAA9C,qBAAA,CAAArwI,EAAAgtB,IAAA,CAAApqB,IAAA5C,EAAAixI,KAAA,CAAA3qG,EACA,GACA,IAAAhqC,EAAA,CAAAiS,GAAA49H,uBAAA,CAAAvpI,GAAAwwI,GAAAzE,sBAAA,CAAA/rI,EAAAwgC,EAAAtjC,EAAA,EACA,IAAAwmC,EAAAsmG,eAAA,MAAAtwI,GAAAgqC,EAAAomG,GAAA,MAAoDpmG,EAAAsmG,eAAA,SACpDtmG,EAAAqmG,MAAA,IACA,IAAAjkH,EAAA,CAAApsB,EAAAgqC,EAAAsmG,eAAA,MACA,QAAA5sI,EAAA,EAAkBA,EAAA0oB,EAAO1oB,IACzBsmC,EAAAomG,GAAA,CAAA1sI,EAAA,YACA,OAAAqzI,SAEAzwI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,IAAAsqC,EAAA4uE,GAAAi3B,uBAAA,CAAA/oG,GAAAtjC,EAAAwmC,EAAA8sG,GAAAzE,sBAAA,CAAAvrG,EAAApnC,GAAAM,EAAA82I,GAAA1E,cAAA,CAAAtrG,EAAApnC,GAAA0sB,EAAA4d,EAAAhqC,EAAA0D,EAAA1D,EAAAosB,EAAAkX,EAAA76B,KAAAuC,KAAA,CAAAg/B,EAAAhqC,GAAAmD,EAAAsF,KAAAuC,KAAA,CAAAxH,EAAAxD,GAAAmqC,EAAAhnC,EAAA,EAAA1C,EAAA6iC,EAAAngC,EAAA2mC,EAAA,IA9kBA2oG,GA8kBAhyI,GACAmS,EAAA,EACAia,EAAA,MAAA7sB,GAAA+vC,EAAA,MAAA/vC,GACA2qC,EAAA,EACA28E,EAAA,IAAArnH,WAAAqG,EAAAuE,MAAA,EACA,QAAA/K,EAAA,EAAkBA,EAAAE,EAAOF,IAAA,CACzB,IAAA+qH,EAAA/qH,EAAA4D,EAAAP,EAAAgnC,CACAtd,CAAAA,CAAA,CAAA/sB,EAAA,CAAAwnH,EAAAj2G,KAAA,CAAAuB,EAAAA,EAAAi4G,GAAA96E,CAAA,CAAAjwC,EAAA,CAAAgqC,EAAA18B,MAAA,CAAAyf,CAAA,CAAA/sB,EAAA,EAAA8S,GAAAi4G,EAAAlgF,EAAAliC,KAAA8T,GAAA,CAAAouB,EAAAkgF,EACA,CACA,IAAA34G,EAAA,IAAAjS,WAAA+pC,GACAhH,EAAA,EAAA58B,EAAAS,EACA,IAAAT,EAAA,EAAcA,EAAAukC,EAAOvkC,IACrB,IAAAS,EAAA,EAAgBA,EAAA7G,EAAO6G,IACvBT,EAAAymB,CAAA,CAAAhmB,EAAA,CAAAvG,MAAA,EAAA4R,CAAAA,CAAA,CAAA8wB,IAAA,CAAAnW,CAAA,CAAAhmB,EAAA,CAAAT,EAAA,EACA,IAAAA,EAAA,EAAcA,EAAA3F,EAAO2F,IACrB,IAAAS,EAAA,EAAgBA,EAAA7G,EAAO6G,IACvBqL,CAAA,CAAA8wB,IAAA,CAAA+M,CAAA,CAAAlpC,EAAA,CAAAT,EAAA,CACA,OAAA8L,CACA,EArBA83B,EAAA1jC,EAAAwgC,EACA,EA8CAA,EAAApnC,EAAAuS,GAAAvO,EAAA,IAhqCAgxC,GAgqCAkkE,GAAAg3B,aAAA,CAAA9oG,IACA,OAAA6a,SAlHAr7C,CAAA,CAAAwgC,CAAA,EACA,IAAApnC,EAAA4G,EAAA8qB,IAAA,CAAA4Y,EAAAgtG,GAAArG,YAAA,CAAA7pG,GACA,QAAA70B,EAAA,EAAkBA,EAAA+3B,EAAA1pC,MAAA,CAAc2R,IAAA,CAChC,IAAAzO,EAAAwmC,CAAA,CAAA/3B,EAAA,IAAAjS,EAAAgqC,CAAA,CAAA/3B,EAAA,IACA,QAAAma,EAAA,GAAqBA,GAAA,EAAQA,IAC7B,IAAA5oB,CAAAA,EAAA4oB,GAAA,IAAA1sB,GAAA8D,EAAA4oB,CAAAA,EACA,QAAA1oB,EAAA,GAAyBA,GAAA,EAAQA,IACjC1D,EAAA0D,GAAA,IAAAhE,GAAAM,EAAA0D,GAAA0oB,CAAAA,GAAA,GAAAA,GAAA,GAAA1oB,CAAAA,IAAAA,GAAAA,IAAAA,CAAA,GAAAA,GAAA,GAAAA,GAAA,GAAA0oB,CAAAA,IAAAA,GAAAA,IAAAA,CAAA,GAAAA,GAAA,GAAAA,GAAA,GAAA1oB,GAAA,GAAAA,GAAA,EAAA4C,EAAAuC,GAAA,CAAArF,EAAA4oB,EAAApsB,EAAA0D,EAAA,OAAA4C,EAAAuC,GAAA,CAAArF,EAAA4oB,EAAApsB,EAAA0D,EAAA,OACA,CACA,EAyGAA,EAAAojC,GAAAmwG,SAxGA3wI,CAAA,EACA,IAAAwgC,EAAAxgC,EAAA8qB,IAAA,CACA,QAAA1xB,EAAA,EAAkBA,EAAAonC,EAAA,EAAWpnC,IAAA,CAC7B,IAAAsqC,EAAAtqC,EAAA,IACA4G,CAAAA,EAAAuC,GAAA,CAAAnJ,EAAA,EAAAsqC,EAAA,IAAA1jC,EAAAuC,GAAA,GAAAnJ,EAAAsqC,EAAA,GACA,CACA,EAkGAtmC,GAAAwzI,SAjGA5wI,CAAA,CAAAwgC,CAAA,EACA,IAAApnC,EAAAy3I,GAAAxG,YAAA,CAAA7pG,GACA,QAAAkD,EAAA,EAAkBA,EAAAtqC,EAAAY,MAAA,CAAc0pC,IAAA,CAChC,IAAA/3B,EAAAvS,CAAA,CAAAsqC,EAAA,IAAAxmC,EAAA9D,CAAA,CAAAsqC,EAAA,IACA,QAAAhqC,EAAA,GAAqBA,GAAA,EAAQA,IAC7B,QAAAosB,EAAA,GAAuBA,GAAA,EAAQA,IAC/BpsB,KAAAA,GAAAA,IAAAA,GAAAosB,KAAAA,GAAAA,IAAAA,GAAApsB,IAAAA,GAAAosB,IAAAA,EAAA9lB,EAAAuC,GAAA,CAAAoJ,EAAAjS,EAAAwD,EAAA4oB,EAAA,OAAA9lB,EAAAuC,GAAA,CAAAoJ,EAAAjS,EAAAwD,EAAA4oB,EAAA,MACA,CACA,EAyFA1oB,EAAAojC,GAAA+uG,GAAAnyI,EAAAhE,EAAA,GAAAonC,GAAA,GAAAswG,SAxFA9wI,CAAA,CAAAwgC,CAAA,MAEA70B,EAAAzO,EAAAxD,EADA,IAAAN,EAAA4G,EAAA8qB,IAAA,CAAA4Y,EAAAijD,GAAAmnD,cAAA,CAAAttG,GAEA,QAAA1a,EAAA,EAAkBA,EAAA,GAAQA,IAC1Bna,EAAAxJ,KAAAuC,KAAA,CAAAohB,EAAA,GAAA5oB,EAAA4oB,EAAA,EAAA1sB,EAAA,IAAAM,EAAA,CAAAgqC,GAAA5d,EAAA,MAAA9lB,EAAAuC,GAAA,CAAAoJ,EAAAzO,EAAAxD,EAAA,IAAAsG,EAAAuC,GAAA,CAAArF,EAAAyO,EAAAjS,EAAA,GACA,EAmFA0D,EAAAojC,GAAAuwG,SA3EA/wI,CAAA,CAAAwgC,CAAA,EACA,IAAApnC,EAAA4G,EAAA8qB,IAAA,CACA4Y,EAAA,GAAA/3B,EAAAvS,EAAA,EAAA8D,EAAA,EAAAxD,EAAA,EACA,QAAAosB,EAAA1sB,EAAA,EAAsB0sB,EAAA,EAAOA,GAAA,EAC7B,IAAAA,IAAAA,GAAAA,MAA2B,CAC3B,QAAA1oB,EAAA,EAAsBA,EAAA,EAAOA,IAC7B,IAAA4C,EAAAkqI,UAAA,CAAAv+H,EAAAma,EAAA1oB,GAAA,CACA,IAAA4/B,EAAA,EACAtjC,CAAAA,EAAA8mC,EAAAxmC,MAAA,EAAAgjC,CAAAA,EAAA,CAAAwD,CAAA,CAAA9mC,EAAA,GAAAwD,EAAA,OAAA8C,EAAAuC,GAAA,CAAAoJ,EAAAma,EAAA1oB,EAAA4/B,GAAA9/B,MAAAA,GAAAxD,CAAAA,IAAAwD,EAAA,EACA,CACA,GAAAyO,CAAAA,GAAA+3B,CAAAA,EAAA,GAAAtqC,GAAAuS,EAAA,CACAA,GAAA+3B,EAAAA,EAAA,CAAAA,EACA,KACA,CACA,CACA,EA4DAtmC,EAAA1D,GAAAuT,MAAAy2B,IAAAA,CAAAA,EAAAusG,GAAAtE,WAAA,CACAvuI,EACAmyI,GAAAv8H,IAAA,MAAA5V,EAAAhE,GACA,EAAA62I,GAAAvE,SAAA,CAAAhoG,EAAAtmC,GAAAmyI,GAAAnyI,EAAAhE,EAAAsqC,GAAA,CACAstG,QAAA5zI,EACAkN,QAAAk2B,EACAwvG,qBAAA52I,EACA82I,YAAAxsG,EACAutG,SAAAtlI,CACA,CACA,EAKA60B,EAAA70B,EAAA+3B,EAAAxmC,EACA,EACA,IAAAg0I,GAAA,GAAWC,GAAA,IACX,SAAAnxI,CAAA,EACA,SAAAwgC,EAAApnC,CAAA,EACA,oBAAAA,GAAAA,CAAAA,EAAAA,EAAA6L,QAAA,qBAAA7L,EACA,qDACA,IAAAsqC,EAAAtqC,EAAA2R,KAAA,GAAA8B,OAAA,SAAAtQ,KAAA,KACA,GAAAmnC,EAAA1pC,MAAA,IAAA0pC,IAAAA,EAAA1pC,MAAA,EAAA0pC,EAAA1pC,MAAA,GACA,kCAAAZ,EACA,CAAAsqC,CAAAA,IAAAA,EAAA1pC,MAAA,EAAA0pC,IAAAA,EAAA1pC,MAAA,GAAA0pC,CAAAA,EAAA5+B,MAAAyH,SAAA,CAAA05C,MAAA,CAAA1C,KAAA,IAAA7f,EAAApuB,GAAA,UAAApY,CAAA,EACA,OAAAA,EAAAA,EAAA,GACK,EAAAwmC,IAAAA,EAAA1pC,MAAA,EAAA0pC,EAAA3jC,IAAA,UACL,IAAA4L,EAAAmB,SAAA42B,EAAA2kB,IAAA,SACA,OACA3kB,EAAA/3B,GAAA,OACA04B,EAAA14B,GAAA,OACAnS,EAAAmS,GAAA,MACAjS,EAAAiS,IAAAA,EACAxG,IAAA,IAAAu+B,EAAA34B,KAAA,MAAAs9C,IAAA,IACA,CACA,CACAroD,EAAAoxI,UAAA,UAAA1tG,CAAA,EACAA,GAAAA,CAAAA,EAAA,IAAgBA,EAAA2tG,KAAA,EAAA3tG,CAAAA,EAAA2tG,KAAA,KAChB,IAAA1lI,EAAA,OAAA+3B,EAAA4tG,MAAA,MAAA5tG,OAAAA,EAAA4tG,MAAA,EAAA5tG,EAAA4tG,MAAA,KAAA5tG,EAAA4tG,MAAA,CAAAp0I,EAAAwmC,EAAAmkC,KAAA,EAAAnkC,EAAAmkC,KAAA,KAAAnkC,EAAAmkC,KAAA,QAAAnuE,EAAAgqC,EAAA6tG,KAAA,IACA,OACA1pE,MAAA3qE,EACAq0I,MAAAr0I,EAAA,EAAAxD,EACA43I,OAAA3lI,EACA0lI,MAAA,CACAG,KAAAhxG,EAAAkD,EAAA2tG,KAAA,CAAAG,IAAA,eACAC,MAAAjxG,EAAAkD,EAAA2tG,KAAA,CAAAI,KAAA,cACA,EACA77H,KAAA8tB,EAAA9tB,IAAA,CACA87H,aAAAhuG,EAAAguG,YAAA,IACA,CACA,EAAG1xI,EAAA2xI,QAAA,UAAAjuG,CAAA,CAAA/3B,CAAA,EACH,OAAAA,EAAAk8D,KAAA,EAAAl8D,EAAAk8D,KAAA,EAAAnkC,EAAA/3B,EAAAA,EAAA2lI,MAAA,CAAA3lI,EAAAk8D,KAAA,CAAAnkC,CAAAA,EAAA/3B,EAAAA,EAAA2lI,MAAA,EAAA3lI,EAAA4lI,KAAA,EACGvxI,EAAA4xI,aAAA,UAAAluG,CAAA,CAAA/3B,CAAA,EACH,IAAAzO,EAAA8C,EAAA2xI,QAAA,CAAAjuG,EAAA/3B,GACA,OAAAxJ,KAAAuC,KAAA,EAAAg/B,EAAA/3B,EAAAA,EAAA2lI,MAAA,EAAAp0I,EACA,EAAG8C,EAAA6xI,aAAA,UAAAnuG,CAAA,CAAA/3B,CAAA,CAAAzO,CAAA,EACH,IAAAxD,EAAAiS,EAAAqlI,OAAA,CAAAlmH,IAAA,CAAAhF,EAAAna,EAAAqlI,OAAA,CAAAjvI,IAAA,CAAA3E,EAAA4C,EAAA2xI,QAAA,CAAAj4I,EAAAwD,GAAA8/B,EAAA76B,KAAAuC,KAAA,EAAAhL,EAAAwD,EAAAA,EAAAo0I,MAAA,EAAAl0I,GAAAP,EAAAK,EAAAo0I,MAAA,CAAAl0I,EAAAymC,EAAA,CAAA3mC,EAAAm0I,KAAA,CAAAI,KAAA,CAAAv0I,EAAAm0I,KAAA,CAAAG,IAAA,EACA,QAAAr3I,EAAA,EAAoBA,EAAA6iC,EAAO7iC,IAC3B,QAAAqpC,EAAA,EAAsBA,EAAAxG,EAAOwG,IAAA,CAC7B,IAAAl3B,EAAA,CAAAnS,EAAA6iC,EAAAwG,CAAAA,EAAA,EAAAjd,EAAArpB,EAAAm0I,KAAA,CAAAI,KAAA,CACAt3I,GAAA0C,GAAA2mC,GAAA3mC,GAAA1C,EAAA6iC,EAAAngC,GAAA2mC,EAAAxG,EAAAngC,GAEA0pB,CAAAA,EAAAsd,CAAA,CAAA/d,CAAA,CAAA2jB,KADA/kC,KAAA,EAAAvK,EAAA0C,CAAAA,EAAAO,GACA1D,EADAyI,KAAAuC,KAAA,EAAA8+B,EAAA3mC,CAAAA,EAAAO,GACA,OAEAsmC,CAAA,CAAAp3B,IAAA,CAAAia,EAAAmd,CAAA,CAAAA,CAAA,CAAAp3B,IAAA,CAAAia,EAAA8d,CAAA,CAAAX,CAAA,CAAAp3B,IAAA,CAAAia,EAAA/sB,CAAA,CAAAkqC,CAAA,CAAAp3B,EAAA,CAAAia,EAAA7sB,CAAA,CAEA,CACA,EAACy3I,IAaDnxI,GAAA8xI,MAAA,UAAA50I,CAAA,CAAAxD,CAAA,CAAAosB,CAAA,MAVA5oB,EAWA,IAAAE,EAAA0oB,EAAAkX,EAAAtjC,CACA,UAAA0D,EAAA,SAAA1D,EAAAq4I,UAAA,EAAA30I,CAAAA,EAAA1D,EAAAA,EAAA,QAAAA,GAAAsjC,CAAAA,EAAA0G,WARA,IACA,OAAA68F,SAAAc,aAAA,UACA,CAAM,MACN,mDACA,CACA,GAGA,EAAAjkI,EAAAojC,GAAA4wG,UAAA,CAAAh0I,GACA,IAAAP,EAAA2jC,GAAAoxG,aAAA,CAAA10I,EAAA8zI,OAAA,CAAAlmH,IAAA,CAAA1tB,GAAAymC,EAAA7G,EAAA+0G,UAAA,OAAA53I,EAAA0pC,EAAAmuG,eAAA,CAAAn1I,EAAAA,GACA,OAAA2jC,GAAAqxG,aAAA,CAAA13I,EAAA4H,IAAA,CAAA7E,EAAAE,GAdAF,EAcA8/B,EAbArxB,EAAAsmI,SAAA,KAAA/0I,EAAA2qE,KAAA,CAAA3qE,EAAAojG,MAAA,EAAApjG,EAAAmR,KAAA,EAAAnR,CAAAA,EAAAmR,KAAA,KAAkEnR,EAAAojG,MAAA,CAalEzjG,EAbkEK,EAAA2qE,KAAA,CAalEhrE,EAbkEK,EAAAmR,KAAA,CAAAiyF,MAAA,CAAA5mG,EAAA,KAAAwD,EAAAmR,KAAA,CAAAw5D,KAAA,CAAAnuE,EAAA,KAalEmqC,EAAAquG,YAAA,CAAA/3I,EAAA,KAAA6iC,CACA,EAAGh9B,GAAAmyI,eAAA,UAAAj1I,CAAA,CAAAxD,CAAA,CAAAosB,CAAA,EACH,IAAA1oB,EAAA0oB,CACA,UAAA1oB,EAAA,SAAA1D,EAAAq4I,UAAA,EAAA30I,CAAAA,EAAA1D,EAAAA,EAAA,QAAA0D,GAAAA,CAAAA,EAAA,IACA,IAAA4/B,EAAAh9B,GAAA8xI,MAAA,CAAA50I,EAAAxD,EAAA0D,GAAAP,EAAAO,EAAAwY,IAAA,cAAAiuB,EAAAzmC,EAAAs0I,YAAA,KACA,OAAA10G,EAAAo1G,SAAA,CAAAv1I,EAAAgnC,EAAAwuG,OAAA,CACA,EAEA,IAAAC,GAAA,GAEA,SAAAC,GAAAvyI,CAAA,CAAAwgC,CAAA,EACA,IAAApnC,EAAA4G,EAAAtG,CAAA,KAAAgqC,EAAAlD,EAAA,KAAAxgC,EAAAmF,GAAA,KACA,OAAA/L,EAAA,EAAAsqC,EAAA,IAAAlD,EAAA,aAAApnC,EAAAo5I,OAAA,IAAAznI,KAAA,QAAA24B,CACA,CACA,SAAA+uG,GAAAzyI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,IAAAsqC,EAAA1jC,EAAAwgC,EACA,iBAAApnC,GAAAsqC,CAAAA,GAAA,IAAAtqC,CAAAA,EAAAsqC,CACA,CAeA,SAAAgvG,GAAA1yI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,CAAA/3B,CAAA,EACA,IAAAzO,EAAA,GAAA6N,KAAA,CAAAzD,IAAA,CAAAg8C,UAAA,GAAA5pD,EAAAwD,EAAAlD,MAAA,CAAA8rB,EAAA,mBAAA5oB,CAAA,CAAAxD,EAAA,GACA,IAAAosB,GAAA,CA56CA,oBAAA6+B,SAAAA,QAAAp4C,SAAA,EAAAo4C,QAAAp4C,SAAA,CAAA64C,IAAA,EA66CA,kDACA,GAAAt/B,EAAA,CACA,GAAApsB,EAAA,EACA,yCACAA,CAAA,IAAAA,EAAAiS,CAAAA,EAAAvS,EAAAA,EAAAonC,EAAAA,EAAAkD,EAAA,QAAAhqC,IAAAA,GAAA8mC,CAAAA,EAAAuxG,UAAA,SAAApmI,EAAA,IAAAA,CAAAA,EAAA+3B,EAAAA,EAAA,QAAA/3B,CAAAA,EAAA+3B,EAAAA,EAAAtqC,EAAAA,EAAAonC,EAAAA,EAAA,QACA,KAAI,CACJ,GAAA9mC,EAAA,EACA,0CACA,OAAAA,IAAAA,EAAAN,CAAAA,EAAAonC,EAAAA,EAAAkD,EAAA,QAAAhqC,IAAAA,GAAA8mC,EAAAuxG,UAAA,EAAAruG,CAAAA,EAAAtqC,EAAAA,EAAAonC,EAAAA,EAAA,YAAAmkB,QAAA,SAAAvnD,CAAA,CAAA4/B,CAAA,EACA,IACA,IAAAngC,EAAA81I,GAAAv4I,MAAA,CAAAhB,EAAAsqC,GACAtmC,EAAA4C,EAAAnD,EAAA2jC,EAAAkD,GACA,CAAQ,MAAA7mC,EAAA,CACRmgC,EAAAngC,EACA,CACA,EACA,CACA,IACA,IAAAO,EAAAu1I,GAAAv4I,MAAA,CAAAhB,EAAAsqC,GACA/3B,EAAA,KAAA3L,EAAA5C,EAAAojC,EAAAkD,GACA,CAAI,MAAAtmC,EAAA,CACJuO,EAAAvO,EACA,CACA,CAhCAk1I,GAAAR,MAAA,UAAAtxG,CAAA,CAAApnC,CAAA,CAAAsqC,CAAA,EACA,IAAA/3B,EAAAinI,GAAAxB,UAAA,CAAAh4I,GAAA8D,EAAAsjC,EAAAwwG,OAAA,CAAAlmH,IAAA,CAAApxB,EAAA8mC,EAAAwwG,OAAA,CAAAjvI,IAAA,CAAA+jB,EAAA5oB,EAAAyO,EAAAA,EAAA2lI,MAAA,CAAAl0I,EAAAuO,EAAA0lI,KAAA,CAAAI,KAAA,CAAA/3I,CAAA,UAAA64I,GAAA5mI,EAAA0lI,KAAA,CAAAI,KAAA,qBAAA3rH,EAAA,IAAAA,EAAA,YAAAkX,EAAA,SAAAu1G,GAAA5mI,EAAA0lI,KAAA,CAAAG,IAAA,kBAAAqB,SATA7yI,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,IAAAsqC,EAAA,GAAA/3B,EAAA,EAAAzO,EAAA,GAAAxD,EAAA,EACA,QAAAosB,EAAA,EAAkBA,EAAA9lB,EAAAhG,MAAA,CAAc8rB,IAAA,CAChC,IAAA1oB,EAAA+E,KAAAuC,KAAA,CAAAohB,EAAA0a,GAAAxD,EAAA76B,KAAAuC,KAAA,CAAAohB,EAAA0a,EACA,CAAApjC,GAAAF,GAAAA,CAAAA,EAAA,IAAA8C,CAAA,CAAA8lB,EAAA,CAAApsB,CAAAA,IAAAosB,EAAA,GAAA1oB,EAAA,GAAA4C,CAAA,CAAA8lB,EAAA,IAAA4d,CAAAA,GAAAxmC,EAAAu1I,GAAA,IAAAr1I,EAAAhE,EAAA,GAAA4jC,EAAA5jC,GAAAq5I,GAAA,IAAA9mI,EAAA,GAAAA,EAAA,EAAAzO,EAAA,IAAAE,EAAA,EAAAojC,GAAAxgC,CAAA,CAAA8lB,EAAA,IAAA4d,CAAAA,GAAA+uG,GAAA,IAAA/4I,GAAAA,EAAA,IAAAiS,GACA,CACA,OAAA+3B,CACA,EAEAhqC,EAAAwD,EAAAyO,EAAA2lI,MAAA,QAAAn3I,EAAA,2CAAAwR,CAAAA,EAAAk8D,KAAA,WAAAl8D,EAAAk8D,KAAA,cAAAl8D,EAAAk8D,KAAA,2BAAA/hD,CAAAA,EAAA,IAAAA,EAAA,kCAAA1oB,EAAA4/B,EAAA;AACA,EACA,yBAAA0G,GAAAA,EAAA,KAAAvpC,GAAAA,CACA,EA6BAypC,GAAAxpC,MAAA,CAAAu4I,GAAAv4I,MAAA,CACAwpC,GAAAkvG,QAAA,CAAAJ,GAAA1/H,IAAA,MAAA+/H,GAAAjB,MAAA,EACAluG,GAAAwuG,SAAA,CAAAM,GAAA1/H,IAAA,MAAA+/H,GAAAZ,eAAA,EACAvuG,GAAA3+B,QAAA,CAAAytI,GAAA1/H,IAAA,eAAAhT,CAAA,CAAAwgC,CAAA,CAAApnC,CAAA,EACA,OAAAujF,GAAAm1D,MAAA,CAAA9xI,EAAA5G,EACA,GACA,IAAA45I,GAAA,CAAAhzI,EAAAwgC,KACA,IAAApnC,EAAA0L,MAAAyH,SAAA,CAAAxB,KAAA,CAAAzD,IAAA,CACAs8B,GAAAxpC,MAAA,CAAA4F,EAAA,CAAkBgwI,qBAAAxvG,CAAA,GAAyBwwG,OAAA,CAAAjvI,IAAA,CAC3C,GACA2hC,EAAAvhC,KAAA+jC,IAAA,CAAA9sC,EAAAY,MAAA,EACA,OAAAZ,EAAA8nC,MAAA,CACA,CAAAv1B,EAAAzO,EAAAxD,IAAA,CAAAA,EAAAgqC,GAAA,EAAA/3B,EAAA5L,IAAA,EAAA7C,EAAA,EAAAyO,CAAA,CAAAA,EAAA3R,MAAA,IAAA+F,IAAA,CAAA7C,EAAA,GAAAyO,EACA,GAEA,EACA,SAAAsnI,GAAA,CACAC,IAAAlzI,EAAA,IACAmzI,WAAA3yG,EAAA,GACA4yG,SAAAh6I,EAAA,GACA0xB,KAAA4Y,EAAA,IACAr5B,IAAAsB,CAAA,CACC,EACD,IAAAjS,EAAAgqC,EAAA52B,EAAAA,SAAA,SAAAgZ,EAA4C,GAAAs3G,GAAA8H,OAAA,EAAE,KAC9C,IAAAroI,EAAA,GAAAgnC,EAAAmvG,GAAArnI,EAAA3L,GAAA7F,EAAAT,EAAAmqC,EAAA7pC,MAAA,CACA,CACA,CAAQ6F,EAAA,EAAAC,EAAA,GACR,CAAQD,EAAA,EAAAC,EAAA,GACR,CAAQD,EAAA,EAAAC,EAAA,GACR,CAAAqP,OAAA,GAAiBtP,EAAAwkC,CAAA,CAAAvkC,EAAAkhH,CAAA,CAAY,IAC7B,IAAAp1G,EAAA,CAAAi4B,EAAA7pC,MAAA,IAAAG,EAAAkqC,EAAA3H,EAAA,CAAAmH,EAAA7pC,MAAA,IAAAG,EAAA6mH,EACA,QAAAlhH,EAAA,EAAsBA,EAAA,EAAOA,IAC7BjD,EAAAkD,IAAA,CAC0B,GAAAo+H,GAAAC,GAAA,EAC1B,OACA,CACAl9H,KAAApB,EAAA,qBACAwgG,OAAAnmG,EAAA,GAAA2F,EAAAA,CAAA,EACA+kB,GAAA,GAAA/kB,EAAA,MAAAA,CAAAA,IAAAA,EAAA,KACAuzI,GAAA,GAAAvzI,EAAA,MAAAA,CAAAA,IAAAA,EAAA,KACA+nE,MAAA1tE,EAAA,GAAA2F,EAAAA,CAAA,EACAD,EAAA+L,EAAAzR,EAAA2F,EACAA,EAAA48B,EAAAviC,EAAA2F,CACA,EACA,GAAeA,EAAE,GAAGukC,EAAE,GAAG28E,EAAE,GAG3B,GACA,IAAA10G,EAAAnK,KAAAuC,KAAA,EAAAtL,EAAAonC,EAAAA,CAAA,EAAArmC,GAAAosB,EAAAsd,EAAA7pC,MAAA,GAAAsS,EAAA,EAAAm9B,EAAA5F,EAAA7pC,MAAA,GAAAsS,EAAA,IACA,OAAAu3B,EAAA10B,OAAA,EAAAk1B,EAAA28E,KACA38E,EAAAl1B,OAAA,EAAAvD,EAAA8wB,KACAmH,CAAA,CAAAm9E,EAAA,CAAAtkF,EAAA,EAAAskF,CAAAA,EAAA,GAAAtkF,EAAA,GAAAskF,EAAAn9E,EAAA7pC,MAAA,IAAA0iC,EAAA,GAAAskF,EAAA,GAAAtkF,EAAAmH,EAAA7pC,MAAA,IAAAgnH,EAAAz6F,GAAAy6F,EAAAv3E,GAAA/M,EAAAnW,GAAAmW,EAAA+M,GAAA5sC,EAAAkD,IAAA,CAC0B,GAAAo+H,GAAAC,GAAA,EAC1B,SACA,CACAkV,GAAAtyB,EAAA7mH,EAAAA,EAAA,EACAo5I,GAAA72G,EAAAviC,EAAAA,EAAA,EACA+G,KAAA,QACAwiC,EAAAvpC,EAAA,CACA,EACA,UAAsB6mH,EAAE,GAAGtkF,EAAE,GAE7B,CACA,EACA,GAAK7/B,CACL,EAAG,CAAAmD,EAAA5G,EAAAonC,EAAA9mC,EAAAiS,EAAA,EAAAvO,EAAA1D,EAAA,EAAAN,EAAA,EAAA4jC,EAAA5jC,EAAAonC,EAAAA,EACH,MAAyB,GAAA29F,GAAAC,GAAA,EAAC,OAAUpwB,UArqEpC,YAqqEoCl4F,SAAyC,GAAAqoH,GAAAQ,IAAA,EAAC,OAAU3wB,UArqExF,YAqqEwFl4F,SAAA,CACpE,GAAAqoH,GAAAC,GAAA,EACpB,MACA,CACApwB,UAzqEA,YA0qEA3/F,MAAA,CACA8e,IAAA/vB,EACAyqE,MAAAnuE,CACA,EACAoc,SAAkC,GAAAqoH,GAAAC,GAAA,EAACM,GAAA,CAAOx9H,KAAA,SAAAo/F,OAAAlnG,CAAA,EAC1C,GAEoB,GAAA+kI,GAAAQ,IAAA,EAAC,OAAUr+B,OAAA5mG,EAAA2U,MAAA,CAAoBm8C,IAAA,UAAeqd,MAAAnuE,EAAAoc,SAAA,CAC5C,GAAAqoH,GAAAC,GAAA,EAAC,SAAYtoH,SAAA,YACb,GAAAqoH,GAAAQ,IAAA,EAAC,QAAW7oH,SAAA,CACV,GAAAqoH,GAAAC,GAAA,EAAC,YAAe90H,GAAA,eAAAwM,SAA8C,GAAAqoH,GAAAC,GAAA,EAAC,QAAW99B,OAAAtjE,EAAA6qC,MAAA7qC,CAAA,EAAqB,GAC/F,GAAAmhG,GAAAC,GAAA,EAAC,YAAe90H,GAAA,YAAAwM,SAA2C,GAAAqoH,GAAAC,GAAA,EAAC,QAAW99B,OAAAlnG,EAAAyuE,MAAAzuE,CAAA,EAAqB,GACpH,GACsB,GAAA+kI,GAAAC,GAAA,EAAC,QAAWl9H,KAAA,cAAAo/F,OAAA5mG,EAAAmuE,MAAAnuE,CAAA,GAClCosB,EACA,GACA,EAAK,EACL,CACA,SAAA0tH,GAAA,CACA5K,KAAA5oI,CAAA,CACA2oI,QAAAnoG,CAAA,CACAgqD,IAAApxF,CAAA,CACAmiE,QAAA73B,CAAA,CACA76B,MAAA8C,CAAA,CACC,EACD,MAAyB,GAAAwyH,GAAAC,GAAA,EAACsK,GAAA,CAAOE,KAAA5oI,EAAA6oI,QAAA,yBAAAF,QAAAnoG,EAAA1qB,SAAkF,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAAA,2BAAAl4F,SAAiE,GAAAqoH,GAAAQ,IAAA,EAAC,OAAU3wB,UAtiD1M,YAsiD0Ml4F,SAAA,CACtL,GAAAqoH,GAAAC,GAAA,EACpBc,GACA,CACA53E,KAAA,QACAk4E,QAAAh/F,EACAnyB,MAAA,CAAiBqgF,SAAA,WAAAvhE,IAAA,GAAA5Z,MAAA,IACjBuC,SAAkC,GAAAqoH,GAAAC,GAAA,EAClC,MACA,CACAQ,MAAA,6BACA/2D,MAAA,GACAy4B,OAAA,GACAp/F,KAAA,OACA4U,SAAsC,GAAAqoH,GAAAC,GAAA,EACtC,OACA,CACAl9H,KAAA,kBACA4/H,SAAA,UACApkG,EAAA,8NACAqkG,SAAA,SACA,EAEA,EAEA,GAEAr9F,EAAwB,GAAAy6F,GAAAQ,IAAA,EAAER,GAAArhE,QAAC,EAAIhnD,SAAA,CACT,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAAAm7B,GAAArzH,SAAA,UACX,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAAAk7B,GAAApzH,SAAA,CAAAnK,MAAAA,EAAA,OAAAA,EAAAgoC,OAAA,wCACjC,GAA2B,GAAAwqF,GAAAQ,IAAA,EAAER,GAAArhE,QAAC,EAAIhnD,SAAA,CACZ,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAAAm7B,GAAArzH,SAAA,2BACX,GAAAqoH,GAAAC,GAAA,EAAC,OAAUpwB,UAAAk7B,GAAApzH,SAAA,+CACX,GAAAqoH,GAAAC,GAAA,EACtB,MACA,CACA/vH,MAAA,CACA4b,QAAA,OACAwpH,eAAA,SACAC,UAAA,GACAC,aAAA,EACA,EACA79H,SAAoC,GAAAqoH,GAAAC,GAAA,EAAC6U,GAAA,CAAO5oI,IAAAjR,EAAA0xB,KAAA,IAAAsoH,SAAA,GAAAD,WAAA,IAC5C,GAEsB,GAAAhV,GAAAC,GAAA,EAAC,OAAU/vH,MAAA,CAAS4b,QAAA,OAAAwpH,eAAA,UAA2C39H,SAA4B,GAAAqoH,GAAAQ,IAAA,EACjHO,GACA,CACA53E,KAAA,WACAj5C,MAAA,CACA4b,QAAA,OACA22G,WAAA,SACAgT,WAAA,GACA,EACApU,QAAA,KACA1iG,OAAAmzE,QAAA,CAAAxlB,IAAA,CAAArxF,CACA,EACA0c,SAAA,CAC4B,GAAAqoH,GAAAC,GAAA,EAC5B,MACA,CACAQ,MAAA,6BACA/2D,MAAA,GACAy4B,OAAA,GACAp/F,KAAA,OACA4U,SAA0C,GAAAqoH,GAAAC,GAAA,EAC1C,OACA,CACAl9H,KAAA,UACA4/H,SAAA,UACApkG,EAAA,kOACAqkG,SAAA,SACA,EAEA,GAE4B,GAAA5C,GAAAC,GAAA,EAAC,QAAW/vH,MAAA,CAASoxH,WAAA,GAAe3pH,SAAA,yBAChE,EAEA,GACA,GACA,EAAK,EAAG,EACR,CAEA,SAAA+9H,GAAA,CACAC,MAAA9zI,CAAA,CACAogI,YAAA5/F,CAAA,CACAk9F,UAAAtkI,CAAA,CACA,GAAAsqC,EACC,EACD,IAAUqwG,UAAApoI,CAAA,CAAAqoI,iBAAA92I,CAAA,CAAA04G,QAAAl8G,CAAA,EAAgDgqC,EAAA5d,EAAS,GAAAs3G,GAAAU,WAAA,EACnE,IACAnyH,MAAAA,GAAAA,EAAA00B,EACA,EACA,CAAA10B,EAAA,EACAvO,EAAS,GAAAggI,GAAAU,WAAA,EACT,IACA5gI,MAAAA,GAAAA,EAAAmjC,EACA,EACA,CAAAnjC,EAAA,EACA8/B,EAAS,GAAAogG,GAAAU,WAAA,EACT,IACApkI,MAAAA,GAAAA,EAAA2mC,EACA,EACA,CAAA3mC,EAAA,EACAmD,EAAS,GAAAugI,GAAAU,WAAA,EAAC,KACV1kI,MAAAA,GAAAA,GACA,EAAG,CAAAA,EAAA,EAAAyqC,EAAAowG,SAx4EHj0I,CAAA,EACA,IAAAwgC,EAAA4xE,KAAA,CACAqrB,SAAArkI,CAAA,CACAskI,UAAAh6F,CAAA,CACApyB,OAAA,CAAcpH,OAAAyB,CAAA,CAAAuoI,YAAAh3I,CAAA,EACd,CAAIumC,KAAA,CAASi0C,QAAAh+E,CAAA,CAAA8vG,SAAA1jF,CAAA,CAAAiuH,UAAA32I,CAAA,CAAA42I,iBAAAh3G,CAAA,CAAA44E,QAAA/4G,CAAA,IAAAgnC,EAAA,CAA+E,CAC5F,GAAA46F,EAAA,CACA,GAAAz+H,CAAA,EACG,CACH+0E,QAAA56E,CAAA,CACAg6I,UAAA3wG,CAAA,CACAqE,MAAAv7B,CAAA,CACAvK,KAAA,CAAYy4H,aAAAj0G,CAAA,CAAAikE,IAAA/gD,CAAA,CAAAh/B,MAAA45B,CAAA,CAAmC,CAC/C+vG,UAAApzB,CAAA,CACAzlD,QAAA3vD,CAAA,CACA/C,MAAA6zB,CAAA,CACA,CAAI23G,SAhKJ,CACA5pI,MAAAzK,CAAA,CACA4K,UAAA41B,CAAA,CACA71B,eAAAvR,CAAA,CACAyR,UAAA64B,CAAA,CACAqwG,UAAApoI,CAAA,CACAiqG,QAAA14G,CAAA,CACAg3I,YAAAx6I,CAAA,CACC,EACD,IAAU4X,OAAAwU,CAAA,EAAY2d,KAAA,CAASy5F,QAAA9/H,CAAA,CAAA8M,OAAA8yB,CAAA,EAAwBlX,EAAAjpB,EAAAu1G,KAAA,CAAAvuE,EAAA1pC,EAAA,CAAwB,GAAAijI,GAAAQ,QAAA,EAAC,KAAAp6F,EAAAl3B,EAAA,CAAe,GAAA8wH,GAAAQ,QAAA,IAAC,CAAAr3G,EAAAkjB,EAAA,CAAa,GAAA2zF,GAAAQ,QAAA,IAAC,CAAAv5F,EAAA28E,EAAA,CAAa,GAAAoc,GAAAQ,QAAA,IAAC,CAAAhyH,EAAA8wB,EAAA,CAAa,GAAA0gG,GAAAQ,QAAA,EAAC,KAAA99H,EAAAS,EAAA,CAAe,GAAA68H,GAAAQ,QAAA,EAAC,KAAApkI,EAAA+qH,EAAA,CAAe,GAAA6Y,GAAAQ,QAAA,IAAC5pF,EAAQ,GAAAopF,GAAAU,WAAA,EAAC,UACnL,GAAAj6F,GAAAhnC,GAAAO,GAAA4/B,GAAA,CAAAwG,EAAA,CACA,IAAAx+B,EAAA,mBAAAhF,EAAA,MAAAA,IAAAA,EAAA,CACA+B,KAAAuyI,CAAA,CACA/4E,QAAAg5E,CAAA,CACA1rI,MAAAstH,CAAA,CACA,CAAQ,MAAAt5H,EAAAy9H,aAAA,EACR7vH,MAAAzF,EACAk4H,QAAA9/H,EACA8M,OAAA8yB,EACApyB,UAAA41B,EACA71B,eAAAvR,EACAyR,UAAA64B,EACAwwG,YAAAx6I,CACA,GACA,GAAA66I,EACAh0I,EAAA,IAAAgkH,EAAA4R,GAAAj5H,MAAAA,GAAAA,EAAAi5H,OACA,CACA,IAAgBqE,aAAAnrE,CAAA,CAAAm7B,IAAAgqD,CAAA,CAAA/pI,MAAAgqI,CAAA,EAAuCH,CACvDhoI,CAAAA,EAAA+iD,GAAA5lB,EAAA+qG,GAAAxzB,EAAAyzB,GAAA/3G,EAAA,IAAA/wB,MAAAA,GAAAA,EAAA,CAAqD6uH,aAAAnrE,EAAAm7B,IAAAgqD,EAAA/pI,MAAAgqI,CAAA,EACrD,CACA,CACA,EAAG,CACH5wG,EACAhnC,EACAO,EACA4/B,EACAwG,EACAxjC,EACAwgC,EACApnC,EACAsqC,EACAxmC,EACAyO,EACAjS,EACA,EACE,GAAA0jI,GAAAS,SAAA,EAAC,KACH7pF,GACA,EAAG,CAAAA,EAAA,EACH,IAAA2K,EAAY,GAAAy+E,GAAAU,WAAA,EAAC,UACb3jI,EAAA,GACA,EAAG,CAAAA,EAAA,EAAA0R,EAAY,GAAAuxH,GAAAU,WAAA,EAAC,KAChBxxH,EAAA,QAAAm9B,EAAA,QAAA/M,EAAA,IAAAn8B,EAAA,IAAAgkH,EAAA,OACA,EAAG,CAAAj4G,EAAAm9B,EAAA/M,EAAAn8B,EAAAgkH,EAAA,EAAAlkF,EAAwB,GAAA+8F,GAAAU,WAAA,EAAC,KAC5BjyH,IAAA8yC,GACA,EAAG,CAAAA,EAAA9yC,EAAA,EACH,OACAkpE,QAAAp2B,EACAw1F,UAAA9zG,EACAwH,MAAAh8B,EACAuoI,UAAAxoI,EACA2vD,QAAAz7D,EACA+I,MAAArP,EACAuI,KAAA,CAAYy4H,aAAAh3F,EAAAgnD,IAAAjkE,EAAA9b,MAAA45B,CAAA,CACZ,CACA,EAgGI,CAAO,GAAAR,CAAA,CAAAqwG,YAAAh3I,EAAA04G,QAAA/4G,CAAA,GAAkC,CAC7C63I,MAAA50I,CAAA,CACA60I,UAAAp0I,CAAA,CACAwB,KAAAvI,CAAA,CACA+hE,QAAAgpD,CAAA,CACA17G,MAAAmrC,CAAA,CACA,CAAI4gG,SA/DJ50I,CAAA,EACA,IAAAwgC,EAAA4xE,KAAA,CAAoBooB,aAAAphI,CAAA,CAAAs+E,QAAAh0C,CAAA,CAAA8lE,SAAA79F,CAAA,CAAAooI,UAAA72I,CAAA,CAAA04G,QAAAl8G,CAAA,CAAA4xH,WAAAxlG,CAAA,EAAoF,CACxG,GAAA04G,EAAA,CACA,GAAAx+H,CAAA,EACG,CAAA5C,EAAA4/B,EAAA,CAAW,GAAAogG,GAAAQ,QAAA,IAAC,CAAA/gI,EAAAgnC,EAAA,CAAa,GAAAu5F,GAAAQ,QAAA,EAAC,KAAAzjI,EAAAqpC,EAAA,CAAe,GAAA45F,GAAAQ,QAAA,EAAC,KAAAtxH,EAAAia,EAAA,CAAe,GAAA62G,GAAAQ,QAAA,EAAC,KAAAn0F,EAAApF,EAAA,CAAe,GAAA+4F,GAAAQ,QAAA,EAAC,KAAA5c,EAAAp1G,EAAA,CAAe,GAAAwxH,GAAAQ,QAAA,IAAClhG,EAAA,KAC7FM,EAAA,QAAA6G,EAAA,IAAAQ,EAAA,IAAAb,EAAA,IAAA53B,EAAA,OACA,EAEGrL,EAAM,GAAA68H,GAAAU,WAAA,EAAC,UACV,GAAAjhI,GAAA2jC,GAAApnC,EAAA,CACAmtB,EAAA,IACA,IACAxkB,KAAAvI,CAAA,CACA+hE,QAAAgpD,CAAA,CACA17G,MAAAmrC,CAAA,CACA,CAAQ,MAAAxT,EAAAy7F,WAAA,EACRzB,aAAAphI,EACAs+E,QAAAh0C,EACA8lE,SAAA79F,EACA2/G,WAAA,EAAuBvpH,KAAA48C,CAAA,CAAS,IAChC3hB,EAAA2hB,GAAA74B,MAAAA,GAAAA,EAAA64B,EACA,CACA,EACA4lE,CAAAA,EAAAlgF,CAAAA,EAAA,IAAA9d,EAAA,IAAA3a,EAAAooC,GAAAt6C,MAAAA,GAAAA,EAAAs6C,EAAA,EAAAxQ,CAAAA,EAAA,IAAAjd,EAAA,IAAAyW,EAAAxjC,GAAA0D,MAAAA,GAAAA,EAAA1D,EAAA,CACA,CACA,EAAG,CAAAqD,EAAA2jC,EAAApnC,EAAAsqC,EAAA/3B,EAAAzO,EAAAxD,EAAAosB,EAAA,EACH,MAAS,GAAAs3G,GAAAS,SAAA,EAAC,KACVnhG,IAAAtjC,GAAAmH,GACA,EAAG,CAAAnH,EAAAmH,EAAA,GACHm0I,MAvBG,KACH7wG,EAAA,GACA,EAsBAuwG,UAAAj6I,EACAw6I,UAAAroI,EACAivD,QAAA9xB,EACA5gC,MAAAm4G,EACAj/G,KAAA3E,CACA,CACA,EA2BI,CACJo9H,aAAAj0G,EACAmxD,QAAAh+E,EACA8vG,SAAA1jF,EACA8vF,QAAA/4G,EACAyuH,WAAAtuF,CACA,GAAG,CACHo3G,UAAAz1F,CAAA,CACA58C,KAAA,CAAY8yI,eAAAhpI,CAAA,CAAmB,CAC/B0vD,QAAAl7B,CAAA,CACAx3B,MAAA7D,CAAA,CACA,CAAI8vI,SAhHJ,CACArqI,MAAAzK,CAAA,CACAkK,OAAAs2B,CAAA,CACAmT,QAAAv6C,CAAA,CACAk6C,UAAA5P,CAAA,CACAqwG,UAAApoI,CAAA,CACAiqG,QAAA14G,CAAA,CACC,EACD,IAAAxD,EAAA04G,KAAA,CAAAtsF,EAAA1oB,EAAA,CAA2B,GAAAggI,GAAAQ,QAAA,EAAC,KAAA5gG,EAAAngC,EAAA,CAAe,GAAAugI,GAAAQ,QAAA,EAAC,KAAA/5F,EAAA1pC,EAAA,CAAe,GAAAijI,GAAAQ,QAAA,EAAC,KAAAp6F,EAAAl3B,EAAA,CAAe,GAAA8wH,GAAAQ,QAAA,IAACr3G,EAAA,UAC5EpsB,EAAA,IAAA0C,EAAA,IAAAO,EAAA,IAAAkP,EAAA,OACA,EAAGm9B,EAAM,GAAA2zF,GAAAU,WAAA,EAAC,UACV,GAAApkI,GAAAsG,GAAAwgC,GAAApnC,GAAAsqC,EAAA,CACA,IACAx4B,QAAAm5B,CAAA,CACAk3B,QAAAylD,CAAA,CACAn4G,MAAA+C,CAAA,CACA,CAAQ,MAAAlS,EAAAqiI,mBAAA,EACRtxH,MAAAzK,EACAkK,OAAAs2B,EACAmT,QAAAv6C,EACAk6C,UAAA5P,CACA,EACAs9E,CAAAA,EAAA7mH,CAAAA,EAAA,IAAAmS,EAAAV,GAAA1O,MAAAA,GAAAA,EAAA0O,EAAA,EAAAxO,CAAAA,EAAAinC,GAAAxnC,EAAA,IAAA8O,MAAAA,GAAAA,EAAA,CAA4EgoC,QAAAv6C,EAAAk6C,UAAA5P,EAAAmxG,eAAAxwG,CAAA,EAA6C,CACzH,CACA,EAAG,CAAA3qC,EAAAsG,EAAAwgC,EAAApnC,EAAAsqC,EAAA/3B,EAAAzO,EAAA,EACH,MAAS,GAAAkgI,GAAAS,SAAA,EAAC,KACVt3G,IAAAvmB,GAAAwgC,GAAApnC,GAAAsqC,GAAA+F,GACA,EAAG,CAAAzpC,EAAAwgC,EAAApnC,EAAAsqC,EAAA+F,EAAA,GACH2qG,UAAAp3G,EACAu+B,QAAA13B,EACAh7B,MAAA26B,EACAzhC,KAAA,CAAY4xC,QAAAv6C,EAAAk6C,UAAA5P,EAAAmxG,eAAA/uH,CAAA,CACZ,CACA,EA+EI,CACJrb,MAAA45B,EACAn6B,OAAAyB,EACAgoC,QAAAn6C,MAAAA,EAAA,OAAAA,EAAAm6C,OAAA,CACAL,UAAA95C,MAAAA,EAAA,OAAAA,EAAA85C,SAAA,CACAsiE,QAAA/4G,CACA,GAAGs5H,EAA2C,GAAAiH,GAAAU,WAAA,EAAC,KAC/Ch+H,GACA,EAAG,CAAAA,EAAA,EAAAuvD,EAAa,GAAA+tE,GAAAU,WAAA,EAAC,KACjBp6F,IAAAp3B,GACA,EAAG,CAAAo3B,EAAAp3B,EAAA,EACH,MAAS,GAAA8wH,GAAAS,SAAA,EAAC,KACVl/E,GAAAnlD,GAAAqS,GAAAzS,CAAAA,EAAAI,GAAA4D,MAAAA,GAAAA,EAAA5D,EAAA,CACA,EAAG,CAAAmlD,EAAAnlD,EAAAqS,EAAAzS,EAAAgE,EAAA,GACH23I,OAAA5e,EACAwJ,QAAAtwE,EACA0lB,QAAA56E,EACAg6I,UAAA3wG,EACAwxG,YAAAh0B,EACAozB,UAAAz1F,EACAg2F,UAAAp0I,EACAg7D,QAfG3vD,GAAA24G,GAAAlkF,EAgBHx3B,MAhBG6zB,GAAAsX,GAAAhvC,EAiBHw1H,aAAAj0G,EACAikE,IAAA/gD,EACA60F,UAAA99F,EACAz+B,KAAAvI,EACAq7I,eAAAhpI,CACA,CACA,EA00EG,CACH,GAAA63B,CAAA,CACAqwG,UAAAjuH,EACAkuH,iBAAA52I,EACAw4G,QAAA54E,CACA,GAAG,CACH+3G,OAAA56I,CAAA,CACAwlI,QAAAn8F,CAAA,CACAuxC,QAAAzoE,CAAA,CACA6nI,UAAA5tH,CAAA,CACA6tH,UAAA3qG,CAAA,CACA8xB,QAAAl3B,CAAA,CACAx7B,MAAAm4G,CAAA,CACAwZ,aAAA5uH,CAAA,CACA4+E,IAAA9tD,CAAA,CACA36B,KAAAjC,CAAA,CACA+0I,eAAAt0I,CAAA,CACA,CAAIsjC,EAAArqC,EAAS,GAAA4jI,GAAAU,WAAA,EAAC,KACd9pF,EAAA,IAAAxQ,IAAA3mC,GACA,EAAG,CAAA2mC,EAAA3mC,EAAA,GAAA0nH,EAAAvwE,EAAA,CAAoB,GAAAopF,GAAAQ,QAAA,EAAC,IAAAj/E,EAAU,GAAAy+E,GAAAU,WAAA,EAAC,KACnCz5F,GAAA9d,IAAAytB,EAAA,IAAA75C,IAAAuiC,GAAAwrG,MAAAprG,CAAAA,OAAAmzE,QAAA,CAAAxlB,IAAA,CAAA/tD,CAAAA,CACA,EAAG,CAAA2H,EAAA9d,EAAApsB,EAAAuiC,EAAA,EACH,MAAS,GAAA0gG,GAAAS,SAAA,EAAC,KACVjyH,GAAAU,GACA,EAAG,CAAAV,EAAAU,EAAA,EAA2B,GAAA6xH,GAAAQ,IAAA,EAAC,OAAU3wB,UAAA,2BAAAl4F,SAAA,CACzCjK,GAJGtL,EAIqB,GAAA49H,GAAAC,GAAA,EACxB8B,GACA,CACAC,SAAArgI,EACA6/H,QAAAnmI,EACA4mI,YAAA,EAAA5/F,CACA,GACwB,GAAA29F,GAAAQ,IAAA,EAAER,GAAArhE,QAAC,EAAIhnD,SAAA,CACT,GAAAqoH,GAAAC,GAAA,EAACmB,GAAA,CAAOC,QAAA7gF,EAAA4G,MAAA,YAC9B7oB,GAA2B,GAAAyhG,GAAAC,GAAA,EAC3BoV,GACA,CACA5K,KAAArkB,GAAA,CAAA2jB,KACAS,QAAA,IAAA30F,EAAA,IACAw2C,IAAA9tD,EACA6+B,QAAAl3B,EACAx7B,MAAAm4G,CACA,GAEA,GACAhhH,GAAyB,GAAAm+H,GAAAC,GAAA,EAAC,OAAUpwB,UArEpC,WAqEoCl4F,SAAyC,GAAAqoH,GAAAC,GAAA,EAAC,OAAUtoH,SAAA3K,KAAAC,SAAA,CAAAy4B,EAAA,SAAsC,GAC9H,EACA,2GC1oFA,IAAAoxG,EAAA,CACAC,WAAAC,CAAA,EACAvsI,QAAAC,KAAA,CAAAusI,EAAA,qBACA,EACAC,QAAA,EACA,EAOA,SAAAD,EAAAz/E,CAAA,CAAA2/E,CAAA,EACA,MACA,sBAAY3/E,EAAA,EAAQ,EAAG2/E,EAAU,yJARjCv6I,OAAAC,cAAA,CAAAi6I,EAAA,WACA7oI,IAAAA,KACAxD,QAAAC,KAAA,CAAAusI,EAAA,mBACA,GAEA,GASO,IAAAG,EAA2B,GAAAC,EAAAnY,aAAA,EAAa4X,GACxC,SAAAQ,IACP,MAAW,GAAAD,EAAAjX,UAAA,EAAUgX,EACrB,gGCtBO,SAAA5f,EAAAj8H,CAAA,CAAAF,CAAA,EACP,IAAS,GAAAk8I,EAAAhnB,CAAA,EAASh1H,EAAA,CAAMgX,OAAA,KACxB,UAAkBilI,EAAAn8I,CAAmB,EAAG2Q,QAAAzQ,CAAA,GACxC,IAAS,GAAAg8I,EAAAhnB,CAAA,EAASl1H,EAAA,CAAMkX,OAAA,KACxB,UAAkBilI,EAAAn8I,CAAmB,EAAG2Q,QAAA3Q,CAAA,GACxC,OAAAE,EAAAkT,WAAA,KAAApT,EAAAoT,WAAA,EACA","sources":["webpack://_N_E/../../node_modules/@noble/hashes/_assert.js","webpack://_N_E/../../node_modules/@noble/hashes/_u64.js","webpack://_N_E/../../node_modules/@noble/hashes/crypto.js","webpack://_N_E/../../node_modules/@noble/hashes/sha3.js","webpack://_N_E/../../node_modules/@noble/hashes/utils.js","webpack://_N_E/../../node_modules/@spruceid/siwe-parser/dist/abnf.js","webpack://_N_E/../../node_modules/@spruceid/siwe-parser/dist/parsers.js","webpack://_N_E/../../node_modules/@spruceid/siwe-parser/dist/utils.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/api.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/attributes.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/parser.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/rule-attributes.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/rule-dependencies.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/sabnf-grammar.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/scanner-callbacks.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/scanner-grammar.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/scanner.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/semantic-callbacks.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/show-rules.js","webpack://_N_E/../../node_modules/apg-js/src/apg-api/syntax-callbacks.js","webpack://_N_E/../../node_modules/apg-js/src/apg-conv-api/converter.js","webpack://_N_E/../../node_modules/apg-js/src/apg-conv-api/transformers.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/ast.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/circular-buffer.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/emitcss.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/identifiers.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/node-exports.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/parser.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/stats.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/style.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/trace.js","webpack://_N_E/../../node_modules/apg-js/src/apg-lib/utilities.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/_shortw_utils.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/abstract/curve.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/abstract/hash-to-curve.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/abstract/modular.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/abstract/utils.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/abstract/weierstrass.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/curves/secp256k1.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/_assert.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/_sha2.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/_u64.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/crypto.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/hmac.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/pbkdf2.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/ripemd160.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/scrypt.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/sha256.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/sha3.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/sha512.js","webpack://_N_E/../../node_modules/ethers/node_modules/@noble/hashes/utils.js","webpack://_N_E/../../node_modules/ethers/node_modules/tslib/tslib.es6.js","webpack://_N_E/../../node_modules/siwe/dist/client.js","webpack://_N_E/../../node_modules/siwe/dist/ethersCompat.js","webpack://_N_E/../../node_modules/siwe/dist/siwe.js","webpack://_N_E/../../node_modules/siwe/dist/types.js","webpack://_N_E/../../node_modules/siwe/dist/utils.js","webpack://_N_E/../../node_modules/valid-url/index.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/aes.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/index.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode-cbc.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode-cfb.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode-ctr.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode-ecb.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode-ofb.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/mode.js","webpack://_N_E/../../node_modules/aes-js/lib.commonjs/padding.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/_version.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/abi-coder.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/bytes32.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/abstract-coder.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/address.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/anonymous.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/array.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/boolean.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/bytes.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/fixed-bytes.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/null.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/number.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/string.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/coders/tuple.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/fragments.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/interface.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/abi/typed.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/address/address.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/address/checks.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/address/contract-address.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/address/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/constants/addresses.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/constants/hashes.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/constants/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/constants/numbers.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/constants/strings.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/contract/contract.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/contract/factory.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/contract/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/contract/wrappers.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/crypto-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/hmac.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/keccak.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/pbkdf2.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/random.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/ripemd160.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/scrypt.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/sha2.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/signature.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/crypto/signing-key.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/ethers.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/id.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/message.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/namehash.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/solidity.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/hash/typed-data.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/abstract-provider.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/abstract-signer.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/community.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/default-provider.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/ens-resolver.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/format.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/network.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/plugins-network.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-alchemy.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-ankr.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-chainstack.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-cloudflare.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-etherscan.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-fallback.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-infura.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-ipcsocket-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-jsonrpc.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-pocket.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-quicknode.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-socket.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider-websocket.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/provider.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/signer-noncemanager.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/subscriber-filterid.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/subscriber-polling.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/providers/ws-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/transaction/accesslist.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/transaction/address.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/transaction/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/transaction/transaction.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/base58.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/base64-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/data.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/errors.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/events.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/fetch.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/fixednumber.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/geturl-browser.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/maths.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/properties.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/rlp-decode.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/rlp-encode.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/units.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/utf8.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/utils/uuid.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/base-wallet.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/hdwallet.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/json-crowdsale.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/json-keystore.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/mnemonic.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/utils.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wallet/wallet.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/bit-reader.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/decode-owl.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/decode-owla.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/index.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/lang-en.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/wordlist-owl.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/wordlist-owla.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/wordlist.js","webpack://_N_E/../../node_modules/ethers/lib.commonjs/wordlists/wordlists-browser.js","webpack://_N_E/../../node_modules/ethers/node_modules/@adraffy/ens-normalize/dist/index.cjs","webpack://_N_E/../../node_modules/neverthrow/dist/index.es.js","webpack://_N_E/../../node_modules/viem/_esm/actions/ens/getEnsResolver.js","webpack://_N_E/../../node_modules/viem/_esm/utils/filters/createFilterRequestScope.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/createBlockFilter.js","webpack://_N_E/../../node_modules/viem/_esm/errors/log.js","webpack://_N_E/../../node_modules/viem/_esm/utils/abi/encodeEventTopics.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/createContractEventFilter.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/createEventFilter.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/createPendingTransactionFilter.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/estimateContractGas.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getBlobBaseFee.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getBlockTransactionCount.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getCode.js","webpack://_N_E/../../node_modules/viem/_esm/utils/abi/decodeEventLog.js","webpack://_N_E/../../node_modules/viem/_esm/utils/abi/parseEventLogs.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getLogs.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getContractEvents.js","webpack://_N_E/../../node_modules/viem/_esm/errors/eip712.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getEip712Domain.js","webpack://_N_E/../../node_modules/viem/_esm/utils/formatters/feeHistory.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getFeeHistory.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getFilterChanges.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getFilterLogs.js","webpack://_N_E/../../node_modules/viem/_esm/utils/formatters/proof.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getProof.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getStorageAt.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/getTransactionConfirmations.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/uninstallFilter.js","webpack://_N_E/../../node_modules/viem/_esm/constants/strings.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/toPrefixedMessage.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/hashMessage.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/abstract/utils.js","webpack://_N_E/../../node_modules/viem/_esm/utils/data/isBytesEqual.js","webpack://_N_E/../../node_modules/viem/_esm/constants/bytes.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/isErc6492Signature.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/serializeErc6492Signature.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/abstract/modular.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/hashes/esm/hmac.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/abstract/curve.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/abstract/weierstrass.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/_shortw_utils.js","webpack://_N_E/../../node_modules/viem/node_modules/@noble/curves/esm/secp256k1.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/serializeSignature.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/verifyHash.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/verifyMessage.js","webpack://_N_E/../../node_modules/viem/_esm/utils/regex.js","webpack://_N_E/../../node_modules/viem/_esm/utils/typedData.js","webpack://_N_E/../../node_modules/viem/_esm/utils/signature/hashTypedData.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/verifyTypedData.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/watchBlocks.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/watchContractEvent.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/watchEvent.js","webpack://_N_E/../../node_modules/viem/_esm/actions/public/watchPendingTransactions.js","webpack://_N_E/../../node_modules/viem/_esm/utils/siwe/parseSiweMessage.js","webpack://_N_E/../../node_modules/viem/_esm/utils/siwe/validateSiweMessage.js","webpack://_N_E/../../node_modules/viem/_esm/actions/siwe/verifySiweMessage.js","webpack://_N_E/../../node_modules/viem/_esm/clients/decorators/public.js","webpack://_N_E/../../node_modules/viem/_esm/clients/createPublicClient.js","webpack://_N_E/../../node_modules/@farcaster/auth-client/dist/index.mjs","webpack://_N_E/../../node_modules/@farcaster/auth-kit/dist/auth-kit.js","webpack://_N_E/../../node_modules/@solana/wallet-adapter-react-ui/lib/esm/useWalletModal.js","webpack://_N_E/../../node_modules/viem/_esm/utils/address/isAddressEqual.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.output = exports.exists = exports.hash = exports.bytes = exports.bool = exports.number = exports.isBytes = void 0;\nfunction number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nexports.number = number;\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\nexports.bool = bool;\n// copied from utils\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nexports.isBytes = isBytes;\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}\nexports.bytes = bytes;\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}\nexports.hash = hash;\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}\nexports.exists = exists;\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}\nexports.output = output;\nconst assert = { number, bool, bytes, hash, exists, output };\nexports.default = assert;\n//# sourceMappingURL=_assert.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.add5L = exports.add5H = exports.add4H = exports.add4L = exports.add3H = exports.add3L = exports.add = exports.rotlBL = exports.rotlBH = exports.rotlSL = exports.rotlSH = exports.rotr32L = exports.rotr32H = exports.rotrBL = exports.rotrBH = exports.rotrSL = exports.rotrSH = exports.shrSL = exports.shrSH = exports.toBig = exports.split = exports.fromBig = void 0;\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}\nexports.fromBig = fromBig;\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}\nexports.split = split;\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\nexports.toBig = toBig;\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nexports.shrSH = shrSH;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\nexports.shrSL = shrSL;\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nexports.rotrSH = rotrSH;\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\nexports.rotrSL = rotrSL;\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nexports.rotrBH = rotrBH;\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\nexports.rotrBL = rotrBL;\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nexports.rotr32H = rotr32H;\nconst rotr32L = (h, _l) => h;\nexports.rotr32L = rotr32L;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nexports.rotlSH = rotlSH;\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\nexports.rotlSL = rotlSL;\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nexports.rotlBH = rotlBH;\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\nexports.rotlBL = rotlBL;\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}\nexports.add = add;\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nexports.add3L = add3L;\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nexports.add3H = add3H;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nexports.add4L = add4L;\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nexports.add4H = add4H;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nexports.add5L = add5L;\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\nexports.add5H = add5H;\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};\nexports.default = u64;\n//# sourceMappingURL=_u64.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.crypto = void 0;\nexports.crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.shake256 = exports.shake128 = exports.keccak_512 = exports.keccak_384 = exports.keccak_256 = exports.keccak_224 = exports.sha3_512 = exports.sha3_384 = exports.sha3_256 = exports.sha3_224 = exports.Keccak = exports.keccakP = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst _u64_js_1 = require(\"./_u64.js\");\nconst utils_js_1 = require(\"./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__ */ (0, _u64_js_1.split)(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? (0, _u64_js_1.rotlBH)(h, l, s) : (0, _u64_js_1.rotlSH)(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? (0, _u64_js_1.rotlBL)(h, l, s) : (0, _u64_js_1.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}\nexports.keccakP = keccakP;\nclass Keccak extends utils_js_1.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        (0, _assert_js_1.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 = (0, utils_js_1.u32)(this.state);\n    }\n    keccak() {\n        if (!utils_js_1.isLE)\n            (0, utils_js_1.byteSwap32)(this.state32);\n        keccakP(this.state32, this.rounds);\n        if (!utils_js_1.isLE)\n            (0, utils_js_1.byteSwap32)(this.state32);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        (0, _assert_js_1.exists)(this);\n        const { blockLen, state } = this;\n        data = (0, utils_js_1.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        (0, _assert_js_1.exists)(this, false);\n        (0, _assert_js_1.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        (0, _assert_js_1.number)(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        (0, _assert_js_1.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}\nexports.Keccak = Keccak;\nconst gen = (suffix, blockLen, outputLen) => (0, utils_js_1.wrapConstructor)(() => new Keccak(blockLen, suffix, outputLen));\nexports.sha3_224 = gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexports.sha3_256 = gen(0x06, 136, 256 / 8);\nexports.sha3_384 = gen(0x06, 104, 384 / 8);\nexports.sha3_512 = gen(0x06, 72, 512 / 8);\nexports.keccak_224 = gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexports.keccak_256 = gen(0x01, 136, 256 / 8);\nexports.keccak_384 = gen(0x01, 104, 384 / 8);\nexports.keccak_512 = gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => (0, utils_js_1.wrapXOFConstructorWithOpts)((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexports.shake128 = genShake(0x1f, 168, 128 / 8);\nexports.shake256 = genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map","\"use strict\";\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = exports.wrapXOFConstructorWithOpts = exports.wrapConstructorWithOpts = exports.wrapConstructor = exports.checkOpts = exports.Hash = exports.concatBytes = exports.toBytes = exports.utf8ToBytes = exports.asyncLoop = exports.nextTick = exports.hexToBytes = exports.bytesToHex = exports.byteSwap32 = exports.byteSwapIfBE = exports.byteSwap = exports.isLE = exports.rotl = exports.rotr = exports.createView = exports.u32 = exports.u8 = exports.isBytes = void 0;\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.\nconst crypto_1 = require(\"@noble/hashes/crypto\");\nconst _assert_js_1 = require(\"./_assert.js\");\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}\nexports.isBytes = isBytes;\n// Cast array to different type\nconst u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.u8 = u8;\nconst u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\nexports.u32 = u32;\n// Cast array to view\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.createView = createView;\n// The rotate right (circular right shift) operation for uint32\nconst rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\nexports.rotr = rotr;\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexports.rotl = rotl;\nexports.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);\nexports.byteSwap = byteSwap;\n// Conditionally byte swap if on a big-endian platform\nexports.byteSwapIfBE = exports.isLE ? (n) => n : (n) => (0, exports.byteSwap)(n);\n// In place byte swap for Uint32Array\nfunction byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = (0, exports.byteSwap)(arr[i]);\n    }\n}\nexports.byteSwap32 = byteSwap32;\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    (0, _assert_js_1.bytes)(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}\nexports.bytesToHex = bytesToHex;\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}\nexports.hexToBytes = hexToBytes;\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 () => { };\nexports.nextTick = nextTick;\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 (0, exports.nextTick)();\n        ts += diff;\n    }\n}\nexports.asyncLoop = asyncLoop;\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}\nexports.utf8ToBytes = utf8ToBytes;\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_js_1.bytes)(data);\n    return data;\n}\nexports.toBytes = toBytes;\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_js_1.bytes)(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}\nexports.concatBytes = concatBytes;\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}\nexports.Hash = Hash;\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}\nexports.checkOpts = checkOpts;\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}\nexports.wrapConstructor = wrapConstructor;\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}\nexports.wrapConstructorWithOpts = wrapConstructorWithOpts;\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}\nexports.wrapXOFConstructorWithOpts = wrapXOFConstructorWithOpts;\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nfunction randomBytes(bytesLength = 32) {\n    if (crypto_1.crypto && typeof crypto_1.crypto.getRandomValues === 'function') {\n        return crypto_1.crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\nexports.randomBytes = randomBytes;\n//# sourceMappingURL=utils.js.map","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nvar _a;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ParsedMessage = void 0;\nconst api_1 = __importDefault(require(\"apg-js/src/apg-api/api\"));\nconst node_exports_1 = __importDefault(require(\"apg-js/src/apg-lib/node-exports\"));\nconst utils_1 = require(\"./utils\");\nconst GRAMMAR = `\nsign-in-with-ethereum =\n    [ scheme \"://\" ] domain %s\" wants you to sign in with your Ethereum account:\" LF\n    address LF\n    LF\n    [ statement LF ]\n    LF\n    %s\"URI: \" URI LF\n    %s\"Version: \" version LF\n    %s\"Chain ID: \" chain-id LF\n    %s\"Nonce: \" nonce LF\n    %s\"Issued At: \" issued-at\n    [ LF %s\"Expiration Time: \" expiration-time ]\n    [ LF %s\"Not Before: \" not-before ]\n    [ LF %s\"Request ID: \" request-id ]\n    [ LF %s\"Resources:\"\n    resources ]\n\ndomain = authority\n\naddress = \"0x\" 40*40HEXDIG\n    ; Must also conform to captilization\n    ; checksum encoding specified in EIP-55\n    ; where applicable (EOAs).\n\nstatement = 1*( reserved / unreserved / \" \" )\n    ; The purpose is to exclude LF (line breaks).\n\nversion = \"1\"\n\nnonce = 8*( ALPHA / DIGIT )\n\nissued-at = date-time\nexpiration-time = date-time\nnot-before = date-time\n\nrequest-id = *pchar\n\nchain-id = 1*DIGIT\n    ; See EIP-155 for valid CHAIN_IDs.\n\nresources = *( LF resource )\n\nresource = \"- \" URI\n\n; ------------------------------------------------------------------------------\n; RFC 3986\n\nURI           = scheme \":\" hier-part [ \"?\" query ] [ \"#\" fragment ]\n\nhier-part     = \"//\" authority path-abempty\n              / path-absolute\n              / path-rootless\n              / path-empty\n\nscheme        = ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\n\nauthority     = [ userinfo \"@\" ] host [ \":\" port ]\nuserinfo      = *( unreserved / pct-encoded / sub-delims / \":\" )\nhost          = IP-literal / IPv4address / reg-name\nport          = *DIGIT\n\nIP-literal    = \"[\" ( IPv6address / IPvFuture  ) \"]\"\n\nIPvFuture     = \"v\" 1*HEXDIG \".\" 1*( unreserved / sub-delims / \":\" )\n\nIPv6address   =                            6( h16 \":\" ) ls32\n              /                       \"::\" 5( h16 \":\" ) ls32\n              / [               h16 ] \"::\" 4( h16 \":\" ) ls32\n              / [ *1( h16 \":\" ) h16 ] \"::\" 3( h16 \":\" ) ls32\n              / [ *2( h16 \":\" ) h16 ] \"::\" 2( h16 \":\" ) ls32\n              / [ *3( h16 \":\" ) h16 ] \"::\"    h16 \":\"   ls32\n              / [ *4( h16 \":\" ) h16 ] \"::\"              ls32\n              / [ *5( h16 \":\" ) h16 ] \"::\"              h16\n              / [ *6( h16 \":\" ) h16 ] \"::\"\n\nh16           = 1*4HEXDIG\nls32          = ( h16 \":\" h16 ) / IPv4address\nIPv4address   = dec-octet \".\" dec-octet \".\" dec-octet \".\" dec-octet\ndec-octet     = DIGIT                 ; 0-9\n                 / %x31-39 DIGIT         ; 10-99\n                 / \"1\" 2DIGIT            ; 100-199\n                 / \"2\" %x30-34 DIGIT     ; 200-249\n                 / \"25\" %x30-35          ; 250-255\n\nreg-name      = *( unreserved / pct-encoded / sub-delims )\n\npath-abempty  = *( \"/\" segment )\npath-absolute = \"/\" [ segment-nz *( \"/\" segment ) ]\npath-rootless = segment-nz *( \"/\" segment )\npath-empty    = 0pchar\n\nsegment       = *pchar\nsegment-nz    = 1*pchar\n\npchar         = unreserved / pct-encoded / sub-delims / \":\" / \"@\"\n\nquery         = *( pchar / \"/\" / \"?\" )\n\nfragment      = *( pchar / \"/\" / \"?\" )\n\npct-encoded   = \"%\" HEXDIG HEXDIG\n\nunreserved    = ALPHA / DIGIT / \"-\" / \".\" / \"_\" / \"~\"\nreserved      = gen-delims / sub-delims\ngen-delims    = \":\" / \"/\" / \"?\" / \"#\" / \"[\" / \"]\" / \"@\"\nsub-delims    = \"!\" / \"$\" / \"&\" / \"'\" / \"(\" / \")\"\n              / \"*\" / \"+\" / \",\" / \";\" / \"=\"\n\n; ------------------------------------------------------------------------------\n; RFC 3339\n\ndate-fullyear   = 4DIGIT\ndate-month      = 2DIGIT  ; 01-12\ndate-mday       = 2DIGIT  ; 01-28, 01-29, 01-30, 01-31 based on\n                          ; month/year\ntime-hour       = 2DIGIT  ; 00-23\ntime-minute     = 2DIGIT  ; 00-59\ntime-second     = 2DIGIT  ; 00-58, 00-59, 00-60 based on leap second\n                          ; rules\ntime-secfrac    = \".\" 1*DIGIT\ntime-numoffset  = (\"+\" / \"-\") time-hour \":\" time-minute\ntime-offset     = \"Z\" / time-numoffset\n\npartial-time    = time-hour \":\" time-minute \":\" time-second\n                  [time-secfrac]\nfull-date       = date-fullyear \"-\" date-month \"-\" date-mday\nfull-time       = partial-time time-offset\n\ndate-time       = full-date \"T\" full-time\n\n; ------------------------------------------------------------------------------\n; RFC 5234\n\nALPHA          =  %x41-5A / %x61-7A   ; A-Z / a-z\nLF             =  %x0A\n                  ; linefeed\nDIGIT          =  %x30-39\n                  ; 0-9\nHEXDIG         =  DIGIT / \"A\" / \"B\" / \"C\" / \"D\" / \"E\" / \"F\"\n`;\nclass GrammarApi {\n    static generateApi() {\n        const api = new api_1.default(GRAMMAR);\n        api.generate();\n        if (api.errors.length) {\n            console.error(api.errorsToAscii());\n            console.error(api.linesToAscii());\n            console.log(api.displayAttributeErrors());\n            throw new Error(`ABNF grammar has errors`);\n        }\n        return api.toObject();\n    }\n}\n_a = GrammarApi;\nGrammarApi.grammarObj = _a.generateApi();\nclass ParsedMessage {\n    constructor(msg) {\n        const parser = new node_exports_1.default.parser();\n        parser.ast = new node_exports_1.default.ast();\n        const id = node_exports_1.default.ids;\n        const scheme = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE && phraseIndex === 0) {\n                data.scheme = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.scheme = scheme;\n        const domain = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.domain = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.domain = domain;\n        const address = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.address = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.address = address;\n        const statement = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.statement = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.statement = statement;\n        const uri = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                if (!data.uri) {\n                    data.uri = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n                }\n            }\n            return ret;\n        };\n        parser.ast.callbacks.uri = uri;\n        const version = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.version = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.version = version;\n        const chainId = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.chainId = (0, utils_1.parseIntegerNumber)(node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength));\n            }\n            return ret;\n        };\n        parser.ast.callbacks[\"chain-id\"] = chainId;\n        const nonce = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.nonce = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks.nonce = nonce;\n        const issuedAt = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.issuedAt = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks[\"issued-at\"] = issuedAt;\n        const expirationTime = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.expirationTime = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks[\"expiration-time\"] = expirationTime;\n        const notBefore = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.notBefore = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks[\"not-before\"] = notBefore;\n        const requestId = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.requestId = node_exports_1.default.utils.charsToString(chars, phraseIndex, phraseLength);\n            }\n            return ret;\n        };\n        parser.ast.callbacks[\"request-id\"] = requestId;\n        const resources = function (state, chars, phraseIndex, phraseLength, data) {\n            const ret = id.SEM_OK;\n            if (state === id.SEM_PRE) {\n                data.resources = node_exports_1.default.utils\n                    .charsToString(chars, phraseIndex, phraseLength)\n                    .slice(3)\n                    .split(\"\\n- \");\n            }\n            return ret;\n        };\n        parser.ast.callbacks.resources = resources;\n        const result = parser.parse(GrammarApi.grammarObj, \"sign-in-with-ethereum\", msg);\n        if (!result.success) {\n            throw new Error(`Invalid message: ${JSON.stringify(result)}`);\n        }\n        const elements = {};\n        parser.ast.translate(elements);\n        for (const [key, value] of Object.entries(elements)) {\n            this[key] = value;\n        }\n        if (this.domain.length === 0) {\n            throw new Error(\"Domain cannot be empty.\");\n        }\n        if (!(0, utils_1.isEIP55Address)(this.address)) {\n            throw new Error(\"Address not conformant to EIP-55.\");\n        }\n    }\n}\nexports.ParsedMessage = ParsedMessage;\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 });\nexports.ParsedMessage = void 0;\nconst abnf_1 = require(\"./abnf\");\nObject.defineProperty(exports, \"ParsedMessage\", { enumerable: true, get: function () { return abnf_1.ParsedMessage; } });\n__exportStar(require(\"./utils\"), exports);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.parseIntegerNumber = exports.isEIP55Address = void 0;\nconst sha3_1 = require(\"@noble/hashes/sha3\");\nconst utils_1 = require(\"@noble/hashes/utils\");\n/**\n * This method is supposed to check if an address is conforming to EIP-55.\n * @param address Address to be checked if conforms with EIP-55.\n * @returns Either the return is or not in the EIP-55 format.\n */\nconst isEIP55Address = (address) => {\n    if (address.length != 42) {\n        return false;\n    }\n    const lowerAddress = `${address}`.toLowerCase().replace('0x', '');\n    const hash = (0, utils_1.bytesToHex)((0, sha3_1.keccak_256)(lowerAddress));\n    let ret = '0x';\n    for (let i = 0; i < lowerAddress.length; i++) {\n        if (parseInt(hash[i], 16) >= 8) {\n            ret += lowerAddress[i].toUpperCase();\n        }\n        else {\n            ret += lowerAddress[i];\n        }\n    }\n    return address === ret;\n};\nexports.isEIP55Address = isEIP55Address;\nconst parseIntegerNumber = (number) => {\n    const parsed = parseInt(number);\n    if (isNaN(parsed))\n        throw new Error(\"Invalid number.\");\n    if (parsed === Infinity)\n        throw new Error(\"Invalid number.\");\n    return parsed;\n};\nexports.parseIntegerNumber = parseIntegerNumber;\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module is Application Programming Interface (API) for **APG** - the ABNF Parser Generator.\n//\n// *Note on teminology.*\n// APG is a parser generator.\n// However, it really only generates a \"grammar object\" (see below) from the defining SABNF grammar.\n// The generated parser is incomplete at this stage.\n// Remaining, it is the job of the user to develop the generated parser from the grammar object and the **APG** Library (**apg-lib**).\n//\n// The following terminology my help clear up any confusion between the idea of a \"generated parser\" versus a \"generated grammar object\".\n\n// - The generating parser: **APG** is an **APG** parser (yes, there is a circular dependence between **apg-api** and **apg-lib**). We'll call it the generating parser.\n// - The target parser: **APG**'s goal is to generate a parser. We'll call it the target parser.\n// - The target grammar: this is the (ASCII) SABNF grammar defining the target parser.\n// - The target grammar object: **APG** parses the SABNF grammar and generates the JavaScript source for a target grammar object constructor function\n// and/or an actual grammar object.\n// - The final target parser: The user then develops the final target parser using the generated target grammar\n// object and the **APG** parsing library, **apg-lib**.\n// Throws execeptions on fatal errors.\n//\n// src: the input SABNF grammar<br>\n// may be one of:\n// - Buffer of bytes\n// - JavaScript string\n// - Array of integer character codes\nmodule.exports = function api(src) {\n  const { Buffer } = require('buffer');\n  const thisFileName = 'api.js: ';\n  const thisObject = this;\n\n  /* PRIVATE PROPERTIES */\n  const apglib = require('../apg-lib/node-exports');\n  const converter = require('../apg-conv-api/converter');\n  const scanner = require('./scanner');\n  const parser = new (require('./parser'))();\n  const { attributes, showAttributes, showAttributeErrors, showRuleDependencies } = require('./attributes');\n  const showRules = require('./show-rules');\n\n  /* PRIVATE MEMBERS (FUNCTIONS) */\n  /* Convert a phrase (array of character codes) to HTML. */\n  const abnfToHtml = function abnfToHtml(chars, beg, len) {\n    const NORMAL = 0;\n    const CONTROL = 1;\n    const INVALID = 2;\n    const CONTROL_BEG = `<span class=\"${apglib.style.CLASS_CTRLCHAR}\">`;\n    const CONTROL_END = '</span>';\n    const INVALID_BEG = `<span class=\"${apglib.style.CLASS_NOMATCH}\">`;\n    const INVALID_END = '</span>';\n    let end;\n    let html = '';\n    const TRUE = true;\n    while (TRUE) {\n      if (!Array.isArray(chars) || chars.length === 0) {\n        break;\n      }\n      if (typeof beg !== 'number') {\n        throw new Error('abnfToHtml: beg must be type number');\n      }\n      if (beg >= chars.length) {\n        break;\n      }\n      if (typeof len !== 'number' || beg + len >= chars.length) {\n        end = chars.length;\n      } else {\n        end = beg + len;\n      }\n      let state = NORMAL;\n      for (let i = beg; i < end; i += 1) {\n        const ch = chars[i];\n        if (ch >= 32 && ch <= 126) {\n          /* normal - printable ASCII characters */\n          if (state === CONTROL) {\n            html += CONTROL_END;\n            state = NORMAL;\n          } else if (state === INVALID) {\n            html += INVALID_END;\n            state = NORMAL;\n          }\n          /* handle reserved HTML entity characters */\n          switch (ch) {\n            case 32:\n              html += '&nbsp;';\n              break;\n            case 60:\n              html += '&lt;';\n              break;\n            case 62:\n              html += '&gt;';\n              break;\n            case 38:\n              html += '&amp;';\n              break;\n            case 34:\n              html += '&quot;';\n              break;\n            case 39:\n              html += '&#039;';\n              break;\n            case 92:\n              html += '&#092;';\n              break;\n            default:\n              html += String.fromCharCode(ch);\n              break;\n          }\n        } else if (ch === 9 || ch === 10 || ch === 13) {\n          /* control characters */\n          if (state === NORMAL) {\n            html += CONTROL_BEG;\n            state = CONTROL;\n          } else if (state === INVALID) {\n            html += INVALID_END + CONTROL_BEG;\n            state = CONTROL;\n          }\n          if (ch === 9) {\n            html += 'TAB';\n          }\n          if (ch === 10) {\n            html += 'LF';\n          }\n          if (ch === 13) {\n            html += 'CR';\n          }\n        } else {\n          /* invalid characters */\n          if (state === NORMAL) {\n            html += INVALID_BEG;\n            state = INVALID;\n          } else if (state === CONTROL) {\n            html += CONTROL_END + INVALID_BEG;\n            state = INVALID;\n          }\n          /* display character as hexadecimal value */\n          html += `\\\\x${apglib.utils.charToHex(ch)}`;\n        }\n      }\n      if (state === INVALID) {\n        html += INVALID_END;\n      }\n      if (state === CONTROL) {\n        html += CONTROL_END;\n      }\n      break;\n    }\n    return html;\n  };\n  /* Convert a phrase (array of character codes) to ASCII text. */\n  const abnfToAscii = function abnfToAscii(chars, beg, len) {\n    let str = '';\n    for (let i = beg; i < beg + len; i += 1) {\n      const ch = chars[i];\n      if (ch >= 32 && ch <= 126) {\n        str += String.fromCharCode(ch);\n      } else {\n        switch (ch) {\n          case 9:\n            str += '\\\\t';\n            break;\n          case 10:\n            str += '\\\\n';\n            break;\n          case 13:\n            str += '\\\\r';\n            break;\n          default:\n            str += '\\\\unknown';\n            break;\n        }\n      }\n    }\n    return str;\n  };\n  /* translate lines (SABNF grammar) to ASCII text */\n  const linesToAscii = function linesToAscii(lines) {\n    let str = 'Annotated Input Grammar';\n    lines.forEach((val) => {\n      str += '\\n';\n      str += `line no: ${val.lineNo}`;\n      str += ` : char index: ${val.beginChar}`;\n      str += ` : length: ${val.length}`;\n      str += ` : abnf: ${abnfToAscii(thisObject.chars, val.beginChar, val.length)}`;\n    });\n    str += '\\n';\n    return str;\n  };\n  /* translate lines (SABNF grammar) to HTML */\n  const linesToHtml = function linesToHtml(lines) {\n    let html = '';\n    html += `<table class=\"${apglib.style.CLASS_GRAMMAR}\">\\n`;\n    const title = 'Annotated Input Grammar';\n    html += `<caption>${title}</caption>\\n`;\n    html += '<tr>';\n    html += '<th>line<br>no.</th><th>first<br>char</th><th><br>length</th><th><br>text</th>';\n    html += '</tr>\\n';\n    lines.forEach((val) => {\n      html += '<tr>';\n      html += `<td>${val.lineNo}`;\n      html += `</td><td>${val.beginChar}`;\n      html += `</td><td>${val.length}`;\n      html += `</td><td>${abnfToHtml(thisObject.chars, val.beginChar, val.length)}`;\n      html += '</td>';\n      html += '</tr>\\n';\n    });\n\n    html += '</table>\\n';\n    return html;\n  };\n  /* Format the error messages to HTML, for page display. */\n  const errorsToHtml = function errorsToHtml(errors, lines, chars, title) {\n    const [style] = apglib;\n    let html = '';\n    const errorArrow = `<span class=\"${style.CLASS_NOMATCH}\">&raquo;</span>`;\n    html += `<p><table class=\"${style.CLASS_GRAMMAR}\">\\n`;\n    if (title && typeof title === 'string') {\n      html += `<caption>${title}</caption>\\n`;\n    }\n    html += '<tr><th>line<br>no.</th><th>line<br>offset</th><th>error<br>offset</th><th><br>text</th></tr>\\n';\n    errors.forEach((val) => {\n      let line;\n      let relchar;\n      let beg;\n      let end;\n      let text;\n      let prefix = '';\n      let suffix = '';\n      if (lines.length === 0) {\n        text = errorArrow;\n        relchar = 0;\n      } else {\n        line = lines[val.line];\n        beg = line.beginChar;\n        if (val.char > beg) {\n          prefix = abnfToHtml(chars, beg, val.char - beg);\n        }\n        beg = val.char;\n        end = line.beginChar + line.length;\n        if (beg < end) {\n          suffix = abnfToHtml(chars, beg, end - beg);\n        }\n        text = prefix + errorArrow + suffix;\n        relchar = val.char - line.beginChar;\n        html += '<tr>';\n        html += `<td>${val.line}</td><td>${line.beginChar}</td><td>${relchar}</td><td>${text}</td>`;\n        html += '</tr>\\n';\n        html += '<tr>';\n        html += `<td colspan=\"3\"></td><td>&uarr;:&nbsp;${apglib.utils.stringToAsciiHtml(val.msg)}</td>`;\n        html += '</tr>\\n';\n      }\n    });\n    html += '</table></p>\\n';\n    return html;\n  };\n  /* Display an array of errors in ASCII text */\n  const errorsToAscii = function errorsToAscii(errors, lines, chars) {\n    let str;\n    let line;\n    let beg;\n    let len;\n    str = '';\n    errors.forEach((error) => {\n      line = lines[error.line];\n      str += `${line.lineNo}: `;\n      str += `${line.beginChar}: `;\n      str += `${error.char - line.beginChar}: `;\n      beg = line.beginChar;\n      len = error.char - line.beginChar;\n      str += abnfToAscii(chars, beg, len);\n      str += ' >> ';\n      beg = error.char;\n      len = line.beginChar + line.length - error.char;\n      str += abnfToAscii(chars, beg, len);\n      str += '\\n';\n      str += `${line.lineNo}: `;\n      str += `${line.beginChar}: `;\n      str += `${error.char - line.beginChar}: `;\n      str += 'error: ';\n      str += error.msg;\n      str += '\\n';\n    });\n    return str;\n  };\n  let isScanned = false;\n  let isParsed = false;\n  let isTranslated = false;\n  let haveAttributes = false;\n  let attributeErrors = 0;\n  let lineMap;\n\n  /* PUBLIC PROPERTIES */\n  // The input SABNF grammar as a JavaScript string.\n  // this.sabnf;\n  // The input SABNF grammar as an array of character codes.\n  // this.chars;\n  // An array of line objects, defining each line of the input SABNF grammar\n  // - lineNo : the zero-based line number\n  // - beginChar : offset (into `this.chars`) of the first character in the line\n  // - length : the number of characters in the line\n  // - textLength : the number of characters of text in the line, excluding the line ending characters\n  // - endType : \"CRLF\", \"LF\", \"CR\" or \"none\" if the last line has no line ending characters\n  // - invalidChars : `true` if the line contains invalid characters, `false` otherwise\n  // this.lines;\n  // An array of rule names and data.\n  // - name : the rule name\n  // - lower : the rule name in lower case\n  // - index : the index of the rule (ordered by appearance in SABNF grammar)\n  // - isBkr : `true` if this rule has been back referenced, `false` otherwise\n  // - opcodes : array of opcodes for this rule\n  // - attrs : the rule attributes\n  // - ctrl : system data\n  // this.rules;\n  // An array of UDT names and data.\n  // this.udts;\n  // An array of errors, if any.\n  // - line : the line number containing the error\n  // - char : the character offset of the error\n  // - msg : the error message\n  this.errors = [];\n\n  /* CONSTRUCTOR */\n  if (Buffer.isBuffer(src)) {\n    this.chars = converter.decode('BINARY', src);\n  } else if (Array.isArray(src)) {\n    this.chars = src.slice();\n  } else if (typeof src === 'string') {\n    this.chars = converter.decode('STRING', src);\n  } else {\n    throw new Error(`${thisFileName}input source is not a string, byte Buffer or character array`);\n  }\n  this.sabnf = converter.encode('STRING', this.chars);\n\n  /* PUBLIC MEMBERS (FUNCTIONS) */\n  // Scan the input SABNF grammar for invalid characters and catalog the lines via `this.lines`.\n  // - strict : (optional) if `true`, all lines, including the last must end with CRLF (\\r\\n),\n  // if `false` (in any JavaScript sense) then line endings may be any mix of CRLF, LF, CR, or end-of-file.\n  // - trace (*) : (optional) a parser trace object, which will trace the parser that does the scan\n  this.scan = function scan(strict, trace) {\n    this.lines = scanner(this.chars, this.errors, strict, trace);\n    isScanned = true;\n  };\n  // Parse the input SABNF grammar for correct syntax.\n  // - strict : (optional) if `true`, the input grammar must be strict ABNF, conforming to [RFC 5234](https://tools.ietf.org/html/rfc5234)\n  // and [RFC 7405](https://tools.ietf.org/html/rfc7405). No superset features allowed.\n  // - trace (\\*) : (optional) a parser trace object, which will trace the syntax parser\n  //\n  // <i>(*)NOTE: the trace option was used primarily during development.\n  // Error detection and reporting is now fairly robust and tracing should be unnecessary. Use at your own peril.</i>\n  this.parse = function parse(strict, lite, trace) {\n    if (!isScanned) {\n      throw new Error(`${thisFileName}grammar not scanned`);\n    }\n    parser.syntax(this.chars, this.lines, this.errors, strict, lite, trace);\n    isParsed = true;\n  };\n  // Translate the SABNF grammar syntax into the opcodes that will guide the parser for this grammar.\n  this.translate = function translate() {\n    if (!isParsed) {\n      throw new Error(`${thisFileName}grammar not scanned and parsed`);\n    }\n    const ret = parser.semantic(this.chars, this.lines, this.errors);\n    if (this.errors.length === 0) {\n      this.rules = ret.rules;\n      this.udts = ret.udts;\n      lineMap = ret.lineMap;\n      isTranslated = true;\n    }\n  };\n  // Compute the attributes of each rule.\n  this.attributes = function attrs() {\n    if (!isTranslated) {\n      throw new Error(`${thisFileName}grammar not scanned, parsed and translated`);\n    }\n    attributeErrors = attributes(this.rules, this.udts, lineMap, this.errors);\n    haveAttributes = true;\n    return attributeErrors;\n  };\n  // This function will perform the full suite of steps required to generate a parser grammar object\n  // from the input SABNF grammar.\n  this.generate = function generate(strict) {\n    this.lines = scanner(this.chars, this.errors, strict);\n    if (this.errors.length) {\n      return;\n    }\n    parser.syntax(this.chars, this.lines, this.errors, strict);\n    if (this.errors.length) {\n      return;\n    }\n    const ret = parser.semantic(this.chars, this.lines, this.errors);\n    if (this.errors.length) {\n      return;\n    }\n    this.rules = ret.rules;\n    this.udts = ret.udts;\n    lineMap = ret.lineMap;\n\n    attributeErrors = attributes(this.rules, this.udts, lineMap, this.errors);\n    haveAttributes = true;\n  };\n  // Display the rules.\n  // Must scan, parse and translate before calling this function, otherwise there are no rules to display.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - none of above, index order (default)\n  this.displayRules = function displayRules(order = 'index') {\n    if (!isTranslated) {\n      throw new Error(`${thisFileName}grammar not scanned, parsed and translated`);\n    }\n    return showRules(this.rules, this.udts, order);\n  };\n  // Display the rule dependencies.\n  // Must scan, parse, translate and compute attributes before calling this function.\n  // Otherwise the rule dependencies are not known.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - \"type\" or \"t\", ordered by type (alphabetical within each type/group)\n  //      - none of above, index order (default)\n  this.displayRuleDependencies = function displayRuleDependencies(order = 'index') {\n    if (!haveAttributes) {\n      throw new Error(`${thisFileName}no attributes - must be preceeded by call to attributes()`);\n    }\n    return showRuleDependencies(order);\n  };\n  // Display the attributes.\n  // Must scan, parse, translate and compute attributes before calling this function.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - \"type\" or \"t\", ordered by type (alphabetical within each type/group)\n  //      - none of above, type order (default)\n  this.displayAttributes = function displayAttributes(order = 'index') {\n    if (!haveAttributes) {\n      throw new Error(`${thisFileName}no attributes - must be preceeded by call to attributes()`);\n    }\n    if (attributeErrors) {\n      showAttributeErrors(order);\n    }\n    return showAttributes(order);\n  };\n  this.displayAttributeErrors = function displayAttributeErrors() {\n    if (!haveAttributes) {\n      throw new Error(`${thisFileName}no attributes - must be preceeded by call to attributes()`);\n    }\n    return showAttributeErrors();\n  };\n  // Returns a parser grammar object constructor function as a JavaScript string.\n  // This object can then be used to construct a parser.\n  this.toSource = function toSource(config = undefined) {\n    if (!haveAttributes) {\n      throw new Error(`${thisFileName}can't generate parser source - must be preceeded by call to attributes()`);\n    }\n    if (attributeErrors) {\n      throw new Error(`${thisFileName}can't generate parser source - attributes have ${attributeErrors} errors`);\n    }\n    return parser.generateSource(this.chars, this.lines, this.rules, this.udts, config);\n  };\n  // Returns a parser grammar object.\n  // This grammar object may be used by the application to construct a parser.\n  this.toObject = function toObject() {\n    if (!haveAttributes) {\n      throw new Error(`${thisFileName}can't generate parser source - must be preceeded by call to attributes()`);\n    }\n    if (attributeErrors) {\n      throw new Error(`${thisFileName}can't generate parser source - attributes have ${attributeErrors} errors`);\n    }\n    return parser.generateObject(this.sabnf, this.rules, this.udts);\n  };\n  // Display errors in text format, suitable for `console.log()`.\n  this.errorsToAscii = function errorsToAsciiFunc() {\n    return errorsToAscii(this.errors, this.lines, this.chars);\n  };\n  // Display errors in HTML format, suitable for web page display.\n  // (`apg-lib.css` required for proper styling)\n  this.errorsToHtml = function errorsToHtmlFunc(title) {\n    return errorsToHtml(this.errors, this.lines, this.chars, title);\n  };\n  // Generate an annotated the SABNF grammar display in text format.\n  this.linesToAscii = function linesToAsciiFunc() {\n    return linesToAscii(this.lines);\n  };\n  // Generate an annotated the SABNF grammar display in HTML format.\n  // (`apg-lib.css` required for proper styling)\n  this.linesToHtml = function linesToHtmlFunc() {\n    return linesToHtml(this.lines);\n  };\n  // This function was only used by apg.html which has been abandoned.\n  /*\n    this.getAttributesObject = function () {\n        return null;\n    };\n    */\n};\n","/* eslint-disable class-methods-use-this */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// Attributes Validation\n//\n// It is well known that recursive-descent parsers will fail if a rule is left recursive.\n// Besides left recursion, there are a couple of other fatal attributes that need to be disclosed as well.\n// There are several non-fatal attributes that are of interest also.\n// This module will determine six different attributes listed here with simple examples.\n//\n// **fatal attributes**<br>\n// left recursion<br>\n// S = S \"x\" / \"y\"\n//\n// cyclic<br>\n// S = S\n//\n// infinite<br>\n// S = \"y\" S\n//\n// **non-fatal attributes** (but nice to know)<br>\n// nested recursion<br>\n// S = \"a\" S \"b\" / \"y\"\n//\n// right recursion<br>\n// S = \"x\" S / \"y\"\n//\n// empty string<br>\n// S = \"x\" S / \"\"\n//\n// Note that these are “aggregate” attributes, in that if the attribute is true it only means that it can be true,\n// not that it will always be true for every input string.\n// In the simple examples above the attributes may be obvious and definite – always true or false.\n// However, for a large grammar with possibly hundreds of rules and parse tree branches,\n// it can be obscure which branches lead to which attributes.\n// Furthermore, different input strings will lead the parser down different branches.\n// One input string may parse perfectly while another will hit a left-recursive branch and bottom out the call stack.\n//\n// It is for this reason that the APG parser generator computes these attributes.\n// When using the API the attributes call is optional but generating a parser without checking the attributes - proceed at your own peril.\n//\n// Additionally, the attribute phase will identify rule dependencies and mutually-recursive groups. For example,\n//\n// S = \"a\" A \"b\" / \"y\"<br>\n// A = \"x\"\n//\n// S is dependent on A but A is not dependent on S.\n//\n// S = \"a\" A \"b\" / \"c\"<br>\n// A = \"x\" S \"y\" / \"z\"\n//\n// S and A are dependent on one another and are mutually recursive.\nmodule.exports = (function exportAttributes() {\n  const id = require('../apg-lib/identifiers');\n  const { ruleAttributes, showAttributes, showAttributeErrors } = require('./rule-attributes');\n  const { ruleDependencies, showRuleDependencies } = require('./rule-dependencies');\n  class State {\n    constructor(rules, udts) {\n      this.rules = rules;\n      this.udts = udts;\n      this.ruleCount = rules.length;\n      this.udtCount = udts.length;\n      this.startRule = 0;\n      this.dependenciesComplete = false;\n      this.attributesComplete = false;\n      this.isMutuallyRecursive = false;\n      this.ruleIndexes = this.indexArray(this.ruleCount);\n      this.ruleAlphaIndexes = this.indexArray(this.ruleCount);\n      this.ruleTypeIndexes = this.indexArray(this.ruleCount);\n      this.udtIndexes = this.indexArray(this.udtCount);\n      this.udtAlphaIndexes = this.indexArray(this.udtCount);\n      this.attrsErrorCount = 0;\n      this.attrs = [];\n      this.attrsErrors = [];\n      this.attrsWorking = [];\n      this.ruleDeps = [];\n      for (let i = 0; i < this.ruleCount; i += 1) {\n        this.attrs.push(this.attrGen(this.rules[i]));\n        this.attrsWorking.push(this.attrGen(this.rules[i]));\n        this.ruleDeps.push(this.rdGen(rules[i], this.ruleCount, this.udtCount));\n      }\n      this.compRulesAlpha = this.compRulesAlpha.bind(this);\n      this.compUdtsAlpha = this.compUdtsAlpha.bind(this);\n      this.compRulesType = this.compRulesType.bind(this);\n      this.compRulesGroup = this.compRulesGroup.bind(this);\n    }\n\n    // eslint-disable-next-line class-methods-use-this\n    attrGen(rule) {\n      return {\n        left: false,\n        nested: false,\n        right: false,\n        empty: false,\n        finite: false,\n        cyclic: false,\n        leaf: false,\n        isOpen: false,\n        isComplete: false,\n        rule,\n      };\n    }\n\n    // eslint-disable-next-line class-methods-use-this\n    attrInit(attr) {\n      attr.left = false;\n      attr.nested = false;\n      attr.right = false;\n      attr.empty = false;\n      attr.finite = false;\n      attr.cyclic = false;\n      attr.leaf = false;\n      attr.isOpen = false;\n      attr.isComplete = false;\n    }\n\n    attrCopy(dst, src) {\n      dst.left = src.left;\n      dst.nested = src.nested;\n      dst.right = src.right;\n      dst.empty = src.empty;\n      dst.finite = src.finite;\n      dst.cyclic = src.cyclic;\n      dst.leaf = src.leaf;\n      dst.isOpen = src.isOpen;\n      dst.isComplete = src.isComplete;\n      dst.rule = src.rule;\n    }\n\n    rdGen(rule, ruleCount, udtCount) {\n      const ret = {\n        rule,\n        recursiveType: id.ATTR_N,\n        groupNumber: -1,\n        refersTo: this.falseArray(ruleCount),\n        refersToUdt: this.falseArray(udtCount),\n        referencedBy: this.falseArray(ruleCount),\n      };\n      return ret;\n    }\n\n    typeToString(recursiveType) {\n      switch (recursiveType) {\n        case id.ATTR_N:\n          return ' N';\n        case id.ATTR_R:\n          return ' R';\n        case id.ATTR_MR:\n          return 'MR';\n        default:\n          return 'UNKNOWN';\n      }\n    }\n\n    falseArray(length) {\n      const ret = [];\n      if (length > 0) {\n        for (let i = 0; i < length; i += 1) {\n          ret.push(false);\n        }\n      }\n      return ret;\n    }\n\n    falsifyArray(a) {\n      for (let i = 0; i < a.length; i += 1) {\n        a[i] = false;\n      }\n    }\n\n    indexArray(length) {\n      const ret = [];\n      if (length > 0) {\n        for (let i = 0; i < length; i += 1) {\n          ret.push(i);\n        }\n      }\n      return ret;\n    }\n\n    compRulesAlpha(left, right) {\n      if (this.rules[left].lower < this.rules[right].lower) {\n        return -1;\n      }\n      if (this.rules[left].lower > this.rules[right].lower) {\n        return 1;\n      }\n      return 0;\n    }\n\n    compUdtsAlpha(left, right) {\n      if (this.udts[left].lower < this.udts[right].lower) {\n        return -1;\n      }\n      if (this.udts[left].lower > this.udts[right].lower) {\n        return 1;\n      }\n      return 0;\n    }\n\n    compRulesType(left, right) {\n      if (this.ruleDeps[left].recursiveType < this.ruleDeps[right].recursiveType) {\n        return -1;\n      }\n      if (this.ruleDeps[left].recursiveType > this.ruleDeps[right].recursiveType) {\n        return 1;\n      }\n      return 0;\n    }\n\n    compRulesGroup(left, right) {\n      if (this.ruleDeps[left].recursiveType === id.ATTR_MR && this.ruleDeps[right].recursiveType === id.ATTR_MR) {\n        if (this.ruleDeps[left].groupNumber < this.ruleDeps[right].groupNumber) {\n          return -1;\n        }\n        if (this.ruleDeps[left].groupNumber > this.ruleDeps[right].groupNumber) {\n          return 1;\n        }\n      }\n      return 0;\n    }\n  }\n  // eslint-disable-next-line no-unused-vars\n  const attributes = function attributes(rules = [], udts = [], lineMap = [], errors = []) {\n    // let i = 0;\n    // Initialize the state. The state of the computation get passed around to multiple functions in multiple files.\n    const state = new State(rules, udts);\n\n    // Determine all rule dependencies\n    //  - which rules each rule refers to\n    //  - which rules reference each rule\n    ruleDependencies(state);\n\n    // Determine the attributes for each rule.\n    ruleAttributes(state);\n    if (state.attrsErrorCount) {\n      errors.push({ line: 0, char: 0, msg: `${state.attrsErrorCount} attribute errors` });\n    }\n\n    // Return the number of attribute errors to the caller.\n    return state.attrsErrorCount;\n  };\n\n  /* Destructuring assignment - see MDN Web Docs */\n  return { attributes, showAttributes, showAttributeErrors, showRuleDependencies };\n})();\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module converts an input SABNF grammar text file into a\n// grammar object that can be used with `apg-lib` in an application parser.\n// **apg** is, in fact itself, an ABNF parser that generates an SABNF parser.\n// It is based on the grammar<br>\n// `./dist/abnf-for-sabnf-grammar.bnf`.<br>\n// In its syntax phase, **apg** analyzes the user's input SABNF grammar for correct syntax, generating an AST as it goes.\n// In its semantic phase, **apg** translates the AST to generate the parser for the input grammar.\nmodule.exports = function exportParser() {\n  const thisFileName = 'parser: ';\n  const ApgLib = require('../apg-lib/node-exports');\n  const id = ApgLib.ids;\n  const syn = new (require('./syntax-callbacks'))();\n  const sem = new (require('./semantic-callbacks'))();\n  const sabnfGrammar = new (require('./sabnf-grammar'))();\n  // eslint-disable-next-line new-cap\n  const parser = new ApgLib.parser();\n  // eslint-disable-next-line new-cap\n  parser.ast = new ApgLib.ast();\n  parser.callbacks = syn.callbacks;\n  parser.ast.callbacks = sem.callbacks;\n\n  /* find the line containing the given character index */\n  const findLine = function findLine(lines, charIndex, charLength) {\n    if (charIndex < 0 || charIndex >= charLength) {\n      /* return error if out of range */\n      return -1;\n    }\n    for (let i = 0; i < lines.length; i += 1) {\n      if (charIndex >= lines[i].beginChar && charIndex < lines[i].beginChar + lines[i].length) {\n        return i;\n      }\n    }\n    /* should never reach here */\n    return -1;\n  };\n  const translateIndex = function translateIndex(map, index) {\n    let ret = -1;\n    if (index < map.length) {\n      for (let i = index; i < map.length; i += 1) {\n        if (map[i] !== null) {\n          ret = map[i];\n          break;\n        }\n      }\n    }\n    return ret;\n  };\n  /* helper function when removing redundant opcodes */\n  const reduceOpcodes = function reduceOpcodes(rules) {\n    rules.forEach((rule) => {\n      const opcodes = [];\n      const map = [];\n      let reducedIndex = 0;\n      rule.opcodes.forEach((op) => {\n        if (op.type === id.ALT && op.children.length === 1) {\n          map.push(null);\n        } else if (op.type === id.CAT && op.children.length === 1) {\n          map.push(null);\n        } else if (op.type === id.REP && op.min === 1 && op.max === 1) {\n          map.push(null);\n        } else {\n          map.push(reducedIndex);\n          opcodes.push(op);\n          reducedIndex += 1;\n        }\n      });\n      map.push(reducedIndex);\n      /* translate original opcode indexes to the reduced set. */\n      opcodes.forEach((op) => {\n        if (op.type === id.ALT || op.type === id.CAT) {\n          for (let i = 0; i < op.children.length; i += 1) {\n            op.children[i] = translateIndex(map, op.children[i]);\n          }\n        }\n      });\n      rule.opcodes = opcodes;\n    });\n  };\n  /* Parse the grammar - the syntax phase. */\n  /* SABNF grammar syntax errors are caught and reported here. */\n  this.syntax = function syntax(chars, lines, errors, strict, lite, trace) {\n    if (trace) {\n      if (trace.traceObject !== 'traceObject') {\n        throw new TypeError(`${thisFileName}trace argument is not a trace object`);\n      }\n      parser.trace = trace;\n    }\n    const data = {};\n    data.errors = errors;\n    data.strict = !!strict;\n    data.lite = !!lite;\n    data.lines = lines;\n    data.findLine = findLine;\n    data.charsLength = chars.length;\n    data.ruleCount = 0;\n    const result = parser.parse(sabnfGrammar, 'file', chars, data);\n    if (!result.success) {\n      errors.push({\n        line: 0,\n        char: 0,\n        msg: 'syntax analysis of input grammar failed',\n      });\n    }\n  };\n  /* Parse the grammar - the semantic phase, translates the AST. */\n  /* SABNF grammar syntax errors are caught and reported here. */\n  this.semantic = function semantic(chars, lines, errors) {\n    const data = {};\n    data.errors = errors;\n    data.lines = lines;\n    data.findLine = findLine;\n    data.charsLength = chars.length;\n    parser.ast.translate(data);\n    if (errors.length) {\n      return null;\n    }\n    /* Remove unneeded operators. */\n    /* ALT operators with a single alternate */\n    /* CAT operators with a single phrase to concatenate */\n    /* REP(1,1) operators (`1*1RuleName` or `1RuleName` is the same as just `RuleName`.) */\n    reduceOpcodes(data.rules);\n    return {\n      rules: data.rules,\n      udts: data.udts,\n      lineMap: data.rulesLineMap,\n    };\n  };\n  // Generate a grammar constructor function.\n  // An object instantiated from this constructor is used with the `apg-lib` `parser()` function.\n  this.generateSource = function generateSource(chars, lines, rules, udts, config) {\n    let source = '';\n    let typescript = false;\n    let lite = false;\n    // config may have multiple grammar object type options in which case\n    // --typescript > --lite  > no options\n    if (config) {\n      if (config.typescript) {\n        typescript = true;\n        lite = false;\n      } else if (config.lite) {\n        typescript = false;\n        lite = true;\n      }\n    }\n    let i;\n    let bkrname;\n    let bkrlower;\n    let opcodeCount = 0;\n    let charCodeMin = Infinity;\n    let charCodeMax = 0;\n    const ruleNames = [];\n    const udtNames = [];\n    let alt = 0;\n    let cat = 0;\n    let rnm = 0;\n    let udt = 0;\n    let rep = 0;\n    let and = 0;\n    let not = 0;\n    let tls = 0;\n    let tbs = 0;\n    let trg = 0;\n    let bkr = 0;\n    let bka = 0;\n    let bkn = 0;\n    let abg = 0;\n    let aen = 0;\n    rules.forEach((rule) => {\n      ruleNames.push(rule.lower);\n      opcodeCount += rule.opcodes.length;\n      rule.opcodes.forEach((op) => {\n        switch (op.type) {\n          case id.ALT:\n            alt += 1;\n            break;\n          case id.CAT:\n            cat += 1;\n            break;\n          case id.RNM:\n            rnm += 1;\n            break;\n          case id.UDT:\n            udt += 1;\n            break;\n          case id.REP:\n            rep += 1;\n            break;\n          case id.AND:\n            and += 1;\n            break;\n          case id.NOT:\n            not += 1;\n            break;\n          case id.BKA:\n            bka += 1;\n            break;\n          case id.BKN:\n            bkn += 1;\n            break;\n          case id.BKR:\n            bkr += 1;\n            break;\n          case id.ABG:\n            abg += 1;\n            break;\n          case id.AEN:\n            aen += 1;\n            break;\n          case id.TLS:\n            tls += 1;\n            for (i = 0; i < op.string.length; i += 1) {\n              if (op.string[i] < charCodeMin) {\n                charCodeMin = op.string[i];\n              }\n              if (op.string[i] > charCodeMax) {\n                charCodeMax = op.string[i];\n              }\n            }\n            break;\n          case id.TBS:\n            tbs += 1;\n            for (i = 0; i < op.string.length; i += 1) {\n              if (op.string[i] < charCodeMin) {\n                charCodeMin = op.string[i];\n              }\n              if (op.string[i] > charCodeMax) {\n                charCodeMax = op.string[i];\n              }\n            }\n            break;\n          case id.TRG:\n            trg += 1;\n            if (op.min < charCodeMin) {\n              charCodeMin = op.min;\n            }\n            if (op.max > charCodeMax) {\n              charCodeMax = op.max;\n            }\n            break;\n          default:\n            throw new Error('generateSource: unrecognized opcode');\n        }\n      });\n    });\n    ruleNames.sort();\n    if (udts.length > 0) {\n      udts.forEach((udtFunc) => {\n        udtNames.push(udtFunc.lower);\n      });\n      udtNames.sort();\n    }\n    source += '// copyright: Copyright (c) 2024 Lowell D. Thomas, all rights reserved<br>\\n';\n    source += '//   license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)<br>\\n';\n    source += '//\\n';\n    source += '// Generated by apg-js, Version 4.4.0 [apg-js](https://github.com/ldthomas/apg-js)\\n';\n    if (config) {\n      if (config.funcName) {\n        source += `const ${config.funcName} = function grammar(){\\n`;\n      } else if (typescript) {\n        source += 'export function grammar(){\\n';\n      } else if (lite) {\n        source += 'export default function grammar(){\\n';\n      } else {\n        source += `module.exports = function grammar(){\\n`;\n      }\n    } else {\n      source += `module.exports = function grammar(){\\n`;\n    }\n    source += '  // ```\\n';\n    source += '  // SUMMARY\\n';\n    source += `  //      rules = ${rules.length}\\n`;\n    source += `  //       udts = ${udts.length}\\n`;\n    source += `  //    opcodes = ${opcodeCount}\\n`;\n    source += '  //        ---   ABNF original opcodes\\n';\n    source += `  //        ALT = ${alt}\\n`;\n    source += `  //        CAT = ${cat}\\n`;\n    source += `  //        REP = ${rep}\\n`;\n    source += `  //        RNM = ${rnm}\\n`;\n    source += `  //        TLS = ${tls}\\n`;\n    source += `  //        TBS = ${tbs}\\n`;\n    source += `  //        TRG = ${trg}\\n`;\n    source += '  //        ---   SABNF superset opcodes\\n';\n    source += `  //        UDT = ${udt}\\n`;\n    source += `  //        AND = ${and}\\n`;\n    source += `  //        NOT = ${not}\\n`;\n    if (!lite) {\n      source += `  //        BKA = ${bka}\\n`;\n      source += `  //        BKN = ${bkn}\\n`;\n      source += `  //        BKR = ${bkr}\\n`;\n      source += `  //        ABG = ${abg}\\n`;\n      source += `  //        AEN = ${aen}\\n`;\n    }\n    source += '  // characters = [';\n    if (tls + tbs + trg === 0) {\n      source += ' none defined ]';\n    } else {\n      source += `${charCodeMin} - ${charCodeMax}]`;\n    }\n    if (udt > 0) {\n      source += ' + user defined';\n    }\n    source += '\\n';\n    source += '  // ```\\n';\n    source += '  /* OBJECT IDENTIFIER (for internal parser use) */\\n';\n    source += \"  this.grammarObject = 'grammarObject';\\n\";\n    source += '\\n';\n    source += '  /* RULES */\\n';\n    source += '  this.rules = [];\\n';\n    rules.forEach((rule, ii) => {\n      let thisRule = '  this.rules[';\n      thisRule += ii;\n      thisRule += \"] = { name: '\";\n      thisRule += rule.name;\n      thisRule += \"', lower: '\";\n      thisRule += rule.lower;\n      thisRule += \"', index: \";\n      thisRule += rule.index;\n      thisRule += ', isBkr: ';\n      thisRule += rule.isBkr;\n      thisRule += ' };\\n';\n      source += thisRule;\n    });\n    source += '\\n';\n    source += '  /* UDTS */\\n';\n    source += '  this.udts = [];\\n';\n    if (udts.length > 0) {\n      udts.forEach((udtFunc, ii) => {\n        let thisUdt = '  this.udts[';\n        thisUdt += ii;\n        thisUdt += \"] = { name: '\";\n        thisUdt += udtFunc.name;\n        thisUdt += \"', lower: '\";\n        thisUdt += udtFunc.lower;\n        thisUdt += \"', index: \";\n        thisUdt += udtFunc.index;\n        thisUdt += ', empty: ';\n        thisUdt += udtFunc.empty;\n        thisUdt += ', isBkr: ';\n        thisUdt += udtFunc.isBkr;\n        thisUdt += ' };\\n';\n        source += thisUdt;\n      });\n    }\n    source += '\\n';\n    source += '  /* OPCODES */\\n';\n    rules.forEach((rule, ruleIndex) => {\n      if (ruleIndex > 0) {\n        source += '\\n';\n      }\n      source += `  /* ${rule.name} */\\n`;\n      source += `  this.rules[${ruleIndex}].opcodes = [];\\n`;\n      rule.opcodes.forEach((op, opIndex) => {\n        let prefix;\n        switch (op.type) {\n          case id.ALT:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${\n              op.type\n            }, children: [${op.children.toString()}] };// ALT\\n`;\n            break;\n          case id.CAT:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${\n              op.type\n            }, children: [${op.children.toString()}] };// CAT\\n`;\n            break;\n          case id.RNM:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type}, index: ${\n              op.index\n            } };// RNM(${rules[op.index].name})\\n`;\n            break;\n          case id.BKR:\n            if (op.index >= rules.length) {\n              bkrname = udts[op.index - rules.length].name;\n              bkrlower = udts[op.index - rules.length].lower;\n            } else {\n              bkrname = rules[op.index].name;\n              bkrlower = rules[op.index].lower;\n            }\n            prefix = '%i';\n            if (op.bkrCase === id.BKR_MODE_CS) {\n              prefix = '%s';\n            }\n            if (op.bkrMode === id.BKR_MODE_UM) {\n              prefix += '%u';\n            } else {\n              prefix += '%p';\n            }\n            bkrname = prefix + bkrname;\n            source +=\n              `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type}, index: ${op.index}, lower: '${bkrlower}'` +\n              `, bkrCase: ${op.bkrCase}, bkrMode: ${op.bkrMode} };// BKR(\\\\${bkrname})\\n`;\n            break;\n          case id.UDT:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type}, empty: ${\n              op.empty\n            }, index: ${op.index} };// UDT(${udts[op.index].name})\\n`;\n            break;\n          case id.REP:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type}, min: ${op.min}, max: ${op.max} };// REP\\n`;\n            break;\n          case id.AND:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// AND\\n`;\n            break;\n          case id.NOT:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// NOT\\n`;\n            break;\n          case id.ABG:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// ABG(%^)\\n`;\n            break;\n          case id.AEN:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// AEN(%$)\\n`;\n            break;\n          case id.BKA:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// BKA\\n`;\n            break;\n          case id.BKN:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type} };// BKN\\n`;\n            break;\n          case id.TLS:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${\n              op.type\n            }, string: [${op.string.toString()}] };// TLS\\n`;\n            break;\n          case id.TBS:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${\n              op.type\n            }, string: [${op.string.toString()}] };// TBS\\n`;\n            break;\n          case id.TRG:\n            source += `  this.rules[${ruleIndex}].opcodes[${opIndex}] = { type: ${op.type}, min: ${op.min}, max: ${op.max} };// TRG\\n`;\n            break;\n          default:\n            throw new Error('parser.js: ~143: unrecognized opcode');\n        }\n      });\n    });\n    source += '\\n';\n    source += '  // The `toString()` function will display the original grammar file(s) that produced these opcodes.\\n';\n    source += '  this.toString = function toString(){\\n';\n    source += '    let str = \"\";\\n';\n    let str;\n    lines.forEach((line) => {\n      const end = line.beginChar + line.length;\n      str = '';\n      source += '    str += \"';\n      for (let ii = line.beginChar; ii < end; ii += 1) {\n        switch (chars[ii]) {\n          case 9:\n            str = ' ';\n            break;\n          case 10:\n            str = '\\\\n';\n            break;\n          case 13:\n            str = '\\\\r';\n            break;\n          case 34:\n            str = '\\\\\"';\n            break;\n          case 92:\n            str = '\\\\\\\\';\n            break;\n          default:\n            str = String.fromCharCode(chars[ii]);\n            break;\n        }\n        source += str;\n      }\n      source += '\";\\n';\n    });\n    source += '    return str;\\n';\n    source += '  }\\n';\n    source += '}\\n';\n    return source;\n  };\n  // Generate a grammar file object.\n  // Returns the same object as instantiating the constructor function returned by<br>\n  // `this.generateSource()`.<br>\n  this.generateObject = function generateObject(stringArg, rules, udts) {\n    const obj = {};\n    const ruleNames = [];\n    const udtNames = [];\n    const string = stringArg.slice(0);\n    obj.grammarObject = 'grammarObject';\n    rules.forEach((rule) => {\n      ruleNames.push(rule.lower);\n    });\n    ruleNames.sort();\n    if (udts.length > 0) {\n      udts.forEach((udtFunc) => {\n        udtNames.push(udtFunc.lower);\n      });\n      udtNames.sort();\n    }\n    obj.callbacks = [];\n    ruleNames.forEach((name) => {\n      obj.callbacks[name] = false;\n    });\n    if (udts.length > 0) {\n      udtNames.forEach((name) => {\n        obj.callbacks[name] = false;\n      });\n    }\n    obj.rules = rules;\n    obj.udts = udts;\n    obj.toString = function toStringFunc() {\n      return string;\n    };\n    return obj;\n  };\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module does the heavy lifting for attribute generation.\nmodule.exports = (function exportRuleAttributes() {\n  const id = require('../apg-lib/identifiers');\n  const thisFile = 'rule-attributes.js';\n  let state = null;\n  function isEmptyOnly(attr) {\n    if (attr.left || attr.nested || attr.right || attr.cyclic) {\n      return false;\n    }\n    return attr.empty;\n  }\n  function isRecursive(attr) {\n    if (attr.left || attr.nested || attr.right || attr.cyclic) {\n      return true;\n    }\n    return false;\n  }\n  function isCatNested(attrs, count) {\n    let i = 0;\n    let j = 0;\n    let k = 0;\n    /* 1. if any child is nested, CAT is nested */\n    for (i = 0; i < count; i += 1) {\n      if (attrs[i].nested) {\n        return true;\n      }\n    }\n    /* 2.) the left-most right recursive child\n               is followed by at least one non-empty child */\n    for (i = 0; i < count; i += 1) {\n      if (attrs[i].right && !attrs[i].leaf) {\n        for (j = i + 1; j < count; j += 1) {\n          if (!isEmptyOnly(attrs[j])) {\n            return true;\n          }\n        }\n      }\n    }\n    /* 3.) the right-most left recursive child\n               is preceded by at least one non-empty child */\n    for (i = count - 1; i >= 0; i -= 1) {\n      if (attrs[i].left && !attrs[i].leaf) {\n        for (j = i - 1; j >= 0; j -= 1) {\n          if (!isEmptyOnly(attrs[j])) {\n            return true;\n          }\n        }\n      }\n    }\n    /* 4. there is at lease one recursive child between\n              the left-most and right-most non-recursive, non-empty children */\n    for (i = 0; i < count; i += 1) {\n      if (!attrs[i].empty && !isRecursive(attrs[i])) {\n        for (j = i + 1; j < count; j += 1) {\n          if (isRecursive(attrs[j])) {\n            for (k = j + 1; k < count; k += 1) {\n              if (!attrs[k].empty && !isRecursive(attrs[k])) {\n                return true;\n              }\n            }\n          }\n        }\n      }\n    }\n\n    /* none of the above */\n    return false;\n  }\n  function isCatCyclic(attrs, count) {\n    /* if all children are cyclic, CAT is cyclic */\n    for (let i = 0; i < count; i += 1) {\n      if (!attrs[i].cyclic) {\n        return false;\n      }\n    }\n    return true;\n  }\n  function isCatLeft(attrs, count) {\n    /* if the left-most non-empty is left, CAT is left */\n    for (let i = 0; i < count; i += 1) {\n      if (attrs[i].left) {\n        return true;\n      }\n      if (!attrs[i].empty) {\n        return false;\n      }\n      /* keep looking */\n    }\n    return false; /* all left-most are empty */\n  }\n  function isCatRight(attrs, count) {\n    /* if the right-most non-empty is right, CAT is right */\n    for (let i = count - 1; i >= 0; i -= 1) {\n      if (attrs[i].right) {\n        return true;\n      }\n      if (!attrs[i].empty) {\n        return false;\n      }\n      /* keep looking */\n    }\n    return false;\n  }\n  function isCatEmpty(attrs, count) {\n    /* if all children are empty, CAT is empty */\n    for (let i = 0; i < count; i += 1) {\n      if (!attrs[i].empty) {\n        return false;\n      }\n    }\n    return true;\n  }\n  function isCatFinite(attrs, count) {\n    /* if all children are finite, CAT is finite */\n    for (let i = 0; i < count; i += 1) {\n      if (!attrs[i].finite) {\n        return false;\n      }\n    }\n    return true;\n  }\n  function cat(stateArg, opcodes, opIndex, iAttr) {\n    let i = 0;\n    const opCat = opcodes[opIndex];\n    const count = opCat.children.length;\n\n    /* generate an empty array of child attributes */\n    const childAttrs = [];\n    for (i = 0; i < count; i += 1) {\n      childAttrs.push(stateArg.attrGen());\n    }\n    for (i = 0; i < count; i += 1) {\n      // eslint-disable-next-line no-use-before-define\n      opEval(stateArg, opcodes, opCat.children[i], childAttrs[i]);\n    }\n    iAttr.left = isCatLeft(childAttrs, count);\n    iAttr.right = isCatRight(childAttrs, count);\n    iAttr.nested = isCatNested(childAttrs, count);\n    iAttr.empty = isCatEmpty(childAttrs, count);\n    iAttr.finite = isCatFinite(childAttrs, count);\n    iAttr.cyclic = isCatCyclic(childAttrs, count);\n  }\n  function alt(stateArg, opcodes, opIndex, iAttr) {\n    let i = 0;\n    const opAlt = opcodes[opIndex];\n    const count = opAlt.children.length;\n\n    /* generate an empty array of child attributes */\n    const childAttrs = [];\n    for (i = 0; i < count; i += 1) {\n      childAttrs.push(stateArg.attrGen());\n    }\n    for (i = 0; i < count; i += 1) {\n      // eslint-disable-next-line no-use-before-define\n      opEval(stateArg, opcodes, opAlt.children[i], childAttrs[i]);\n    }\n\n    /* if any child attribute is true, ALT is true */\n    iAttr.left = false;\n    iAttr.right = false;\n    iAttr.nested = false;\n    iAttr.empty = false;\n    iAttr.finite = false;\n    iAttr.cyclic = false;\n    for (i = 0; i < count; i += 1) {\n      if (childAttrs[i].left) {\n        iAttr.left = true;\n      }\n      if (childAttrs[i].nested) {\n        iAttr.nested = true;\n      }\n      if (childAttrs[i].right) {\n        iAttr.right = true;\n      }\n      if (childAttrs[i].empty) {\n        iAttr.empty = true;\n      }\n      if (childAttrs[i].finite) {\n        iAttr.finite = true;\n      }\n      if (childAttrs[i].cyclic) {\n        iAttr.cyclic = true;\n      }\n    }\n  }\n  function bkr(stateArg, opcodes, opIndex, iAttr) {\n    const opBkr = opcodes[opIndex];\n    if (opBkr.index >= stateArg.ruleCount) {\n      /* use UDT values */\n      iAttr.empty = stateArg.udts[opBkr.index - stateArg.ruleCount].empty;\n      iAttr.finite = true;\n    } else {\n      /* use the empty and finite values from the back referenced rule */\n      // eslint-disable-next-line no-use-before-define\n      ruleAttrsEval(stateArg, opBkr.index, iAttr);\n\n      /* however, this is a terminal node like TLS */\n      iAttr.left = false;\n      iAttr.nested = false;\n      iAttr.right = false;\n      iAttr.cyclic = false;\n    }\n  }\n\n  function opEval(stateArg, opcodes, opIndex, iAttr) {\n    stateArg.attrInit(iAttr);\n    const opi = opcodes[opIndex];\n    switch (opi.type) {\n      case id.ALT:\n        alt(stateArg, opcodes, opIndex, iAttr);\n        break;\n      case id.CAT:\n        cat(stateArg, opcodes, opIndex, iAttr);\n        break;\n      case id.REP:\n        opEval(stateArg, opcodes, opIndex + 1, iAttr);\n        if (opi.min === 0) {\n          iAttr.empty = true;\n          iAttr.finite = true;\n        }\n        break;\n      case id.RNM:\n        // eslint-disable-next-line no-use-before-define\n        ruleAttrsEval(stateArg, opcodes[opIndex].index, iAttr);\n        break;\n      case id.BKR:\n        bkr(stateArg, opcodes, opIndex, iAttr);\n        break;\n      case id.AND:\n      case id.NOT:\n      case id.BKA:\n      case id.BKN:\n        opEval(stateArg, opcodes, opIndex + 1, iAttr);\n        iAttr.empty = true;\n        break;\n      case id.TLS:\n        iAttr.empty = !opcodes[opIndex].string.length;\n        iAttr.finite = true;\n        iAttr.cyclic = false;\n        break;\n      case id.TBS:\n      case id.TRG:\n        iAttr.empty = false;\n        iAttr.finite = true;\n        iAttr.cyclic = false;\n        break;\n      case id.UDT:\n        iAttr.empty = opi.empty;\n        iAttr.finite = true;\n        iAttr.cyclic = false;\n        break;\n      case id.ABG:\n      case id.AEN:\n        iAttr.empty = true;\n        iAttr.finite = true;\n        iAttr.cyclic = false;\n        break;\n      default:\n        throw new Error(`unknown opcode type: ${opi}`);\n    }\n  }\n  // The main logic for handling rules that:\n  //  - have already be evaluated\n  //  - have not been evaluated and is the first occurrence on this branch\n  //  - second occurrence on this branch for the start rule\n  //  - second occurrence on this branch for non-start rules\n  function ruleAttrsEval(stateArg, ruleIndex, iAttr) {\n    const attri = stateArg.attrsWorking[ruleIndex];\n    if (attri.isComplete) {\n      /* just use the completed values */\n      stateArg.attrCopy(iAttr, attri);\n    } else if (!attri.isOpen) {\n      /* open the rule and traverse it */\n      attri.isOpen = true;\n      opEval(stateArg, attri.rule.opcodes, 0, iAttr);\n      /* complete this rule's attributes */\n      attri.left = iAttr.left;\n      attri.right = iAttr.right;\n      attri.nested = iAttr.nested;\n      attri.empty = iAttr.empty;\n      attri.finite = iAttr.finite;\n      attri.cyclic = iAttr.cyclic;\n      attri.leaf = false;\n      attri.isOpen = false;\n      attri.isComplete = true;\n    } else if (ruleIndex === stateArg.startRule) {\n      /* use recursive leaf values */\n      if (ruleIndex === stateArg.startRule) {\n        iAttr.left = true;\n        iAttr.right = true;\n        iAttr.cyclic = true;\n        iAttr.leaf = true;\n      }\n    } else {\n      /* non-start rule terminal leaf */\n      iAttr.finite = true;\n    }\n  }\n  // The main driver for the attribute generation.\n  const ruleAttributes = (stateArg) => {\n    state = stateArg;\n    let i = 0;\n    let j = 0;\n    const iAttr = state.attrGen();\n    for (i = 0; i < state.ruleCount; i += 1) {\n      /* initialize working attributes */\n      for (j = 0; j < state.ruleCount; j += 1) {\n        state.attrInit(state.attrsWorking[j]);\n      }\n      state.startRule = i;\n      ruleAttrsEval(state, i, iAttr);\n\n      /* save off the working attributes for this rule */\n      state.attrCopy(state.attrs[i], state.attrsWorking[i]);\n    }\n    state.attributesComplete = true;\n    let attri = null;\n    for (i = 0; i < state.ruleCount; i += 1) {\n      attri = state.attrs[i];\n      if (attri.left || !attri.finite || attri.cyclic) {\n        const temp = state.attrGen(attri.rule);\n        state.attrCopy(temp, attri);\n        state.attrsErrors.push(temp);\n        state.attrsErrorCount += 1;\n      }\n    }\n  };\n  const truth = (val) => (val ? 't' : 'f');\n  const tError = (val) => (val ? 'e' : 'f');\n  const fError = (val) => (val ? 't' : 'e');\n  const showAttr = (seq, index, attr, dep) => {\n    let str = `${seq}:${index}:`;\n    str += `${tError(attr.left)} `;\n    str += `${truth(attr.nested)} `;\n    str += `${truth(attr.right)} `;\n    str += `${tError(attr.cyclic)} `;\n    str += `${fError(attr.finite)} `;\n    str += `${truth(attr.empty)}:`;\n    str += `${state.typeToString(dep.recursiveType)}:`;\n    str += dep.recursiveType === id.ATTR_MR ? dep.groupNumber : '-';\n    str += `:${attr.rule.name}\\n`;\n    return str;\n  };\n\n  const showLegend = () => {\n    let str = 'LEGEND - t=true, f=false, e=error\\n';\n    str += 'sequence:rule index:left nested right cyclic finite empty:type:group number:rule name\\n';\n    return str;\n  };\n  const showAttributeErrors = () => {\n    let attri = null;\n    let depi = null;\n    let str = '';\n    str += 'RULE ATTRIBUTES WITH ERRORS\\n';\n    str += showLegend();\n    if (state.attrsErrorCount) {\n      for (let i = 0; i < state.attrsErrorCount; i += 1) {\n        attri = state.attrsErrors[i];\n        depi = state.ruleDeps[attri.rule.index];\n        str += showAttr(i, attri.rule.index, attri, depi);\n      }\n    } else {\n      str += '<none>\\n';\n    }\n    return str;\n  };\n\n  const show = (type) => {\n    let i = 0;\n    let ii = 0;\n    let attri = null;\n    let depi = null;\n    let str = '';\n    let { ruleIndexes } = state;\n    // let udtIndexes = state.udtIndexes;\n    if (type === 97) {\n      ruleIndexes = state.ruleAlphaIndexes;\n      // udtIndexes = state.udtAlphaIndexes;\n    } else if (type === 116) {\n      ruleIndexes = state.ruleTypeIndexes;\n      // udtIndexes = state.udtAlphaIndexes;\n    }\n    /* show all attributes */\n    for (i = 0; i < state.ruleCount; i += 1) {\n      ii = ruleIndexes[i];\n      attri = state.attrs[ii];\n      depi = state.ruleDeps[ii];\n      str += showAttr(i, ii, attri, depi);\n    }\n    return str;\n  };\n\n  // Display the rule attributes.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - \"type\" or \"t\", ordered by type (alphabetical within each type/group)\n  //      - none of above, index order (default)\n  const showAttributes = (order = 'index') => {\n    if (!state.attributesComplete) {\n      throw new Error(`${thisFile}:showAttributes: attributes not available`);\n    }\n    let str = '';\n    const leader = 'RULE ATTRIBUTES\\n';\n    if (order.charCodeAt(0) === 97) {\n      str += 'alphabetical by rule name\\n';\n      str += leader;\n      str += showLegend();\n      str += show(97);\n    } else if (order.charCodeAt(0) === 116) {\n      str += 'ordered by rule type\\n';\n      str += leader;\n      str += showLegend();\n      str += show(116);\n    } else {\n      str += 'ordered by rule index\\n';\n      str += leader;\n      str += showLegend();\n      str += show();\n    }\n    return str;\n  };\n\n  /* Destructuring assignment - see MDN Web Docs */\n  return { ruleAttributes, showAttributes, showAttributeErrors };\n})();\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// Determine rule dependencies and types.\n// For each rule, determine which other rules it refers to\n// and which of the other rules refer back to it.\n//\n// Rule types are:\n//  - non-recursive - the rule never refers to itself, even indirectly\n//  - recursive - the rule refers to itself, possibly indirectly\n//  - mutually-recursive - belongs to a group of two or more rules, each of which refers to every other rule in the group, including itself.\nmodule.exports = (() => {\n  const id = require('../apg-lib/identifiers');\n  let state = null; /* keep a global reference to the state for the show functions */\n\n  /* scan the opcodes of the indexed rule and discover which rules it references and which rule refer back to it */\n  const scan = (ruleCount, ruleDeps, index, isScanned) => {\n    let i = 0;\n    let j = 0;\n    const rdi = ruleDeps[index];\n    isScanned[index] = true;\n    const op = rdi.rule.opcodes;\n    for (i = 0; i < op.length; i += 1) {\n      const opi = op[i];\n      if (opi.type === id.RNM) {\n        rdi.refersTo[opi.index] = true;\n        if (!isScanned[opi.index]) {\n          scan(ruleCount, ruleDeps, opi.index, isScanned);\n        }\n        for (j = 0; j < ruleCount; j += 1) {\n          if (ruleDeps[opi.index].refersTo[j]) {\n            rdi.refersTo[j] = true;\n          }\n        }\n      } else if (opi.type === id.UDT) {\n        rdi.refersToUdt[opi.index] = true;\n      } else if (opi.type === id.BKR) {\n        if (opi.index < ruleCount) {\n          rdi.refersTo[opi.index] = true;\n          if (!isScanned[opi.index]) {\n            scan(ruleCount, ruleDeps, opi.index, isScanned);\n          }\n        } else {\n          rdi.refersToUdt[ruleCount - opi.index] = true;\n        }\n      }\n    }\n  };\n  // Determine the rule dependencies, types and mutually recursive groups.\n  const ruleDependencies = (stateArg) => {\n    state = stateArg; /* make it global */\n    let i = 0;\n    let j = 0;\n    let groupCount = 0;\n    let rdi = null;\n    let rdj = null;\n    let newGroup = false;\n    state.dependenciesComplete = false;\n\n    /* make a working array of rule scanned markers */\n    const isScanned = state.falseArray(state.ruleCount);\n\n    /* discover the rule dependencies */\n    for (i = 0; i < state.ruleCount; i += 1) {\n      state.falsifyArray(isScanned);\n      scan(state.ruleCount, state.ruleDeps, i, isScanned);\n    }\n    /* discover all rules referencing each rule */\n    for (i = 0; i < state.ruleCount; i += 1) {\n      for (j = 0; j < state.ruleCount; j += 1) {\n        if (i !== j) {\n          if (state.ruleDeps[j].refersTo[i]) {\n            state.ruleDeps[i].referencedBy[j] = true;\n          }\n        }\n      }\n    }\n    /* find the non-recursive and recursive types */\n    for (i = 0; i < state.ruleCount; i += 1) {\n      state.ruleDeps[i].recursiveType = id.ATTR_N;\n      if (state.ruleDeps[i].refersTo[i]) {\n        state.ruleDeps[i].recursiveType = id.ATTR_R;\n      }\n    }\n\n    /* find the mutually-recursive groups, if any */\n    groupCount = -1;\n    for (i = 0; i < state.ruleCount; i += 1) {\n      rdi = state.ruleDeps[i];\n      if (rdi.recursiveType === id.ATTR_R) {\n        newGroup = true;\n        for (j = 0; j < state.ruleCount; j += 1) {\n          if (i !== j) {\n            rdj = state.ruleDeps[j];\n            if (rdj.recursiveType === id.ATTR_R) {\n              if (rdi.refersTo[j] && rdj.refersTo[i]) {\n                if (newGroup) {\n                  groupCount += 1;\n                  rdi.recursiveType = id.ATTR_MR;\n                  rdi.groupNumber = groupCount;\n                  newGroup = false;\n                }\n                rdj.recursiveType = id.ATTR_MR;\n                rdj.groupNumber = groupCount;\n              }\n            }\n          }\n        }\n      }\n    }\n    state.isMutuallyRecursive = groupCount > -1;\n\n    /* sort the rules/UDTS */\n    state.ruleAlphaIndexes.sort(state.compRulesAlpha);\n    state.ruleTypeIndexes.sort(state.compRulesAlpha);\n    state.ruleTypeIndexes.sort(state.compRulesType);\n    if (state.isMutuallyRecursive) {\n      state.ruleTypeIndexes.sort(state.compRulesGroup);\n    }\n    if (state.udtCount) {\n      state.udtAlphaIndexes.sort(state.compUdtsAlpha);\n    }\n\n    state.dependenciesComplete = true;\n  };\n  const show = (type = null) => {\n    let i = 0;\n    let j = 0;\n    let count = 0;\n    let startSeg = 0;\n    const maxRule = state.ruleCount - 1;\n    const maxUdt = state.udtCount - 1;\n    const lineLength = 100;\n    let str = '';\n    let pre = '';\n    const toArrow = '=> ';\n    const byArrow = '<= ';\n    let first = false;\n    let rdi = null;\n    let { ruleIndexes } = state;\n    let { udtIndexes } = state;\n    if (type === 97) {\n      ruleIndexes = state.ruleAlphaIndexes;\n      udtIndexes = state.udtAlphaIndexes;\n    } else if (type === 116) {\n      ruleIndexes = state.ruleTypeIndexes;\n      udtIndexes = state.udtAlphaIndexes;\n    }\n    for (i = 0; i < state.ruleCount; i += 1) {\n      rdi = state.ruleDeps[ruleIndexes[i]];\n      pre = `${ruleIndexes[i]}:${state.typeToString(rdi.recursiveType)}:`;\n      if (state.isMutuallyRecursive) {\n        pre += rdi.groupNumber > -1 ? rdi.groupNumber : '-';\n        pre += ':';\n      }\n      pre += ' ';\n      str += `${pre + state.rules[ruleIndexes[i]].name}\\n`;\n      first = true;\n      count = 0;\n      startSeg = str.length;\n      str += pre;\n      for (j = 0; j < state.ruleCount; j += 1) {\n        if (rdi.refersTo[ruleIndexes[j]]) {\n          if (first) {\n            str += toArrow;\n            first = false;\n            str += state.ruleDeps[ruleIndexes[j]].rule.name;\n          } else {\n            str += `, ${state.ruleDeps[ruleIndexes[j]].rule.name}`;\n          }\n          count += 1;\n        }\n        if (str.length - startSeg > lineLength && j !== maxRule) {\n          str += `\\n${pre}${toArrow}`;\n          startSeg = str.length;\n        }\n      }\n      if (state.udtCount) {\n        for (j = 0; j < state.udtCount; j += 1) {\n          if (rdi.refersToUdt[udtIndexes[j]]) {\n            if (first) {\n              str += toArrow;\n              first = false;\n              str += state.udts[udtIndexes[j]].name;\n            } else {\n              str += `, ${state.udts[udtIndexes[j]].name}`;\n            }\n            count += 1;\n          }\n          if (str.length - startSeg > lineLength && j !== maxUdt) {\n            str += `\\n${pre}${toArrow}`;\n            startSeg = str.length;\n          }\n        }\n      }\n      if (count === 0) {\n        str += '=> <none>\\n';\n      }\n      if (first === false) {\n        str += '\\n';\n      }\n      first = true;\n      count = 0;\n      startSeg = str.length;\n      str += pre;\n      for (j = 0; j < state.ruleCount; j += 1) {\n        if (rdi.referencedBy[ruleIndexes[j]]) {\n          if (first) {\n            str += byArrow;\n            first = false;\n            str += state.ruleDeps[ruleIndexes[j]].rule.name;\n          } else {\n            str += `, ${state.ruleDeps[ruleIndexes[j]].rule.name}`;\n          }\n          count += 1;\n        }\n        if (str.length - startSeg > lineLength && j !== maxRule) {\n          str += `\\n${pre}${toArrow}`;\n          startSeg = str.length;\n        }\n      }\n      if (count === 0) {\n        str += '<= <none>\\n';\n      }\n      if (first === false) {\n        str += '\\n';\n      }\n      str += '\\n';\n    }\n    return str;\n  };\n  // Display the rule dependencies.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - \"type\" or \"t\", ordered by type (alphabetical within each type/group)\n  //      - none of above, index order (default)\n  const showRuleDependencies = (order = 'index') => {\n    let str = 'RULE DEPENDENCIES(index:type:[group number:])\\n';\n    str += '=> refers to rule names\\n';\n    str += '<= referenced by rule names\\n';\n    if (!state.dependenciesComplete) {\n      return str;\n    }\n\n    if (order.charCodeAt(0) === 97) {\n      str += 'alphabetical by rule name\\n';\n      str += show(97);\n    } else if (order.charCodeAt(0) === 116) {\n      str += 'ordered by rule type\\n';\n      str += show(116);\n    } else {\n      str += 'ordered by rule index\\n';\n      str += show(null);\n    }\n    return str;\n  };\n\n  /* Destructuring assignment - see MDN Web Docs */\n  return { ruleDependencies, showRuleDependencies };\n})();\n","// copyright: Copyright (c) 2024 Lowell D. Thomas, all rights reserved<br>\n//   license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)<br>\n//\n// Generated by apg-js, Version 4.4.0 [apg-js](https://github.com/ldthomas/apg-js)\nmodule.exports = function grammar(){\n  // ```\n  // SUMMARY\n  //      rules = 95\n  //       udts = 0\n  //    opcodes = 372\n  //        ---   ABNF original opcodes\n  //        ALT = 43\n  //        CAT = 48\n  //        REP = 34\n  //        RNM = 149\n  //        TLS = 2\n  //        TBS = 61\n  //        TRG = 35\n  //        ---   SABNF superset opcodes\n  //        UDT = 0\n  //        AND = 0\n  //        NOT = 0\n  //        BKA = 0\n  //        BKN = 0\n  //        BKR = 0\n  //        ABG = 0\n  //        AEN = 0\n  // characters = [9 - 126]\n  // ```\n  /* OBJECT IDENTIFIER (for internal parser use) */\n  this.grammarObject = 'grammarObject';\n\n  /* RULES */\n  this.rules = [];\n  this.rules[0] = { name: 'File', lower: 'file', index: 0, isBkr: false };\n  this.rules[1] = { name: 'BlankLine', lower: 'blankline', index: 1, isBkr: false };\n  this.rules[2] = { name: 'Rule', lower: 'rule', index: 2, isBkr: false };\n  this.rules[3] = { name: 'RuleLookup', lower: 'rulelookup', index: 3, isBkr: false };\n  this.rules[4] = { name: 'RuleNameTest', lower: 'rulenametest', index: 4, isBkr: false };\n  this.rules[5] = { name: 'RuleName', lower: 'rulename', index: 5, isBkr: false };\n  this.rules[6] = { name: 'RuleNameError', lower: 'rulenameerror', index: 6, isBkr: false };\n  this.rules[7] = { name: 'DefinedAsTest', lower: 'definedastest', index: 7, isBkr: false };\n  this.rules[8] = { name: 'DefinedAsError', lower: 'definedaserror', index: 8, isBkr: false };\n  this.rules[9] = { name: 'DefinedAs', lower: 'definedas', index: 9, isBkr: false };\n  this.rules[10] = { name: 'Defined', lower: 'defined', index: 10, isBkr: false };\n  this.rules[11] = { name: 'IncAlt', lower: 'incalt', index: 11, isBkr: false };\n  this.rules[12] = { name: 'RuleError', lower: 'ruleerror', index: 12, isBkr: false };\n  this.rules[13] = { name: 'LineEndError', lower: 'lineenderror', index: 13, isBkr: false };\n  this.rules[14] = { name: 'Alternation', lower: 'alternation', index: 14, isBkr: false };\n  this.rules[15] = { name: 'Concatenation', lower: 'concatenation', index: 15, isBkr: false };\n  this.rules[16] = { name: 'Repetition', lower: 'repetition', index: 16, isBkr: false };\n  this.rules[17] = { name: 'Modifier', lower: 'modifier', index: 17, isBkr: false };\n  this.rules[18] = { name: 'Predicate', lower: 'predicate', index: 18, isBkr: false };\n  this.rules[19] = { name: 'BasicElement', lower: 'basicelement', index: 19, isBkr: false };\n  this.rules[20] = { name: 'BasicElementErr', lower: 'basicelementerr', index: 20, isBkr: false };\n  this.rules[21] = { name: 'Group', lower: 'group', index: 21, isBkr: false };\n  this.rules[22] = { name: 'GroupError', lower: 'grouperror', index: 22, isBkr: false };\n  this.rules[23] = { name: 'GroupOpen', lower: 'groupopen', index: 23, isBkr: false };\n  this.rules[24] = { name: 'GroupClose', lower: 'groupclose', index: 24, isBkr: false };\n  this.rules[25] = { name: 'Option', lower: 'option', index: 25, isBkr: false };\n  this.rules[26] = { name: 'OptionError', lower: 'optionerror', index: 26, isBkr: false };\n  this.rules[27] = { name: 'OptionOpen', lower: 'optionopen', index: 27, isBkr: false };\n  this.rules[28] = { name: 'OptionClose', lower: 'optionclose', index: 28, isBkr: false };\n  this.rules[29] = { name: 'RnmOp', lower: 'rnmop', index: 29, isBkr: false };\n  this.rules[30] = { name: 'BkrOp', lower: 'bkrop', index: 30, isBkr: false };\n  this.rules[31] = { name: 'bkrModifier', lower: 'bkrmodifier', index: 31, isBkr: false };\n  this.rules[32] = { name: 'cs', lower: 'cs', index: 32, isBkr: false };\n  this.rules[33] = { name: 'ci', lower: 'ci', index: 33, isBkr: false };\n  this.rules[34] = { name: 'um', lower: 'um', index: 34, isBkr: false };\n  this.rules[35] = { name: 'pm', lower: 'pm', index: 35, isBkr: false };\n  this.rules[36] = { name: 'bkr-name', lower: 'bkr-name', index: 36, isBkr: false };\n  this.rules[37] = { name: 'rname', lower: 'rname', index: 37, isBkr: false };\n  this.rules[38] = { name: 'uname', lower: 'uname', index: 38, isBkr: false };\n  this.rules[39] = { name: 'ename', lower: 'ename', index: 39, isBkr: false };\n  this.rules[40] = { name: 'UdtOp', lower: 'udtop', index: 40, isBkr: false };\n  this.rules[41] = { name: 'udt-non-empty', lower: 'udt-non-empty', index: 41, isBkr: false };\n  this.rules[42] = { name: 'udt-empty', lower: 'udt-empty', index: 42, isBkr: false };\n  this.rules[43] = { name: 'RepOp', lower: 'repop', index: 43, isBkr: false };\n  this.rules[44] = { name: 'AltOp', lower: 'altop', index: 44, isBkr: false };\n  this.rules[45] = { name: 'CatOp', lower: 'catop', index: 45, isBkr: false };\n  this.rules[46] = { name: 'StarOp', lower: 'starop', index: 46, isBkr: false };\n  this.rules[47] = { name: 'AndOp', lower: 'andop', index: 47, isBkr: false };\n  this.rules[48] = { name: 'NotOp', lower: 'notop', index: 48, isBkr: false };\n  this.rules[49] = { name: 'BkaOp', lower: 'bkaop', index: 49, isBkr: false };\n  this.rules[50] = { name: 'BknOp', lower: 'bknop', index: 50, isBkr: false };\n  this.rules[51] = { name: 'AbgOp', lower: 'abgop', index: 51, isBkr: false };\n  this.rules[52] = { name: 'AenOp', lower: 'aenop', index: 52, isBkr: false };\n  this.rules[53] = { name: 'TrgOp', lower: 'trgop', index: 53, isBkr: false };\n  this.rules[54] = { name: 'TbsOp', lower: 'tbsop', index: 54, isBkr: false };\n  this.rules[55] = { name: 'TlsOp', lower: 'tlsop', index: 55, isBkr: false };\n  this.rules[56] = { name: 'TlsCase', lower: 'tlscase', index: 56, isBkr: false };\n  this.rules[57] = { name: 'TlsOpen', lower: 'tlsopen', index: 57, isBkr: false };\n  this.rules[58] = { name: 'TlsClose', lower: 'tlsclose', index: 58, isBkr: false };\n  this.rules[59] = { name: 'TlsString', lower: 'tlsstring', index: 59, isBkr: false };\n  this.rules[60] = { name: 'StringTab', lower: 'stringtab', index: 60, isBkr: false };\n  this.rules[61] = { name: 'ClsOp', lower: 'clsop', index: 61, isBkr: false };\n  this.rules[62] = { name: 'ClsOpen', lower: 'clsopen', index: 62, isBkr: false };\n  this.rules[63] = { name: 'ClsClose', lower: 'clsclose', index: 63, isBkr: false };\n  this.rules[64] = { name: 'ClsString', lower: 'clsstring', index: 64, isBkr: false };\n  this.rules[65] = { name: 'ProsVal', lower: 'prosval', index: 65, isBkr: false };\n  this.rules[66] = { name: 'ProsValOpen', lower: 'prosvalopen', index: 66, isBkr: false };\n  this.rules[67] = { name: 'ProsValString', lower: 'prosvalstring', index: 67, isBkr: false };\n  this.rules[68] = { name: 'ProsValClose', lower: 'prosvalclose', index: 68, isBkr: false };\n  this.rules[69] = { name: 'rep-min', lower: 'rep-min', index: 69, isBkr: false };\n  this.rules[70] = { name: 'rep-min-max', lower: 'rep-min-max', index: 70, isBkr: false };\n  this.rules[71] = { name: 'rep-max', lower: 'rep-max', index: 71, isBkr: false };\n  this.rules[72] = { name: 'rep-num', lower: 'rep-num', index: 72, isBkr: false };\n  this.rules[73] = { name: 'dString', lower: 'dstring', index: 73, isBkr: false };\n  this.rules[74] = { name: 'xString', lower: 'xstring', index: 74, isBkr: false };\n  this.rules[75] = { name: 'bString', lower: 'bstring', index: 75, isBkr: false };\n  this.rules[76] = { name: 'Dec', lower: 'dec', index: 76, isBkr: false };\n  this.rules[77] = { name: 'Hex', lower: 'hex', index: 77, isBkr: false };\n  this.rules[78] = { name: 'Bin', lower: 'bin', index: 78, isBkr: false };\n  this.rules[79] = { name: 'dmin', lower: 'dmin', index: 79, isBkr: false };\n  this.rules[80] = { name: 'dmax', lower: 'dmax', index: 80, isBkr: false };\n  this.rules[81] = { name: 'bmin', lower: 'bmin', index: 81, isBkr: false };\n  this.rules[82] = { name: 'bmax', lower: 'bmax', index: 82, isBkr: false };\n  this.rules[83] = { name: 'xmin', lower: 'xmin', index: 83, isBkr: false };\n  this.rules[84] = { name: 'xmax', lower: 'xmax', index: 84, isBkr: false };\n  this.rules[85] = { name: 'dnum', lower: 'dnum', index: 85, isBkr: false };\n  this.rules[86] = { name: 'bnum', lower: 'bnum', index: 86, isBkr: false };\n  this.rules[87] = { name: 'xnum', lower: 'xnum', index: 87, isBkr: false };\n  this.rules[88] = { name: 'alphanum', lower: 'alphanum', index: 88, isBkr: false };\n  this.rules[89] = { name: 'owsp', lower: 'owsp', index: 89, isBkr: false };\n  this.rules[90] = { name: 'wsp', lower: 'wsp', index: 90, isBkr: false };\n  this.rules[91] = { name: 'space', lower: 'space', index: 91, isBkr: false };\n  this.rules[92] = { name: 'comment', lower: 'comment', index: 92, isBkr: false };\n  this.rules[93] = { name: 'LineEnd', lower: 'lineend', index: 93, isBkr: false };\n  this.rules[94] = { name: 'LineContinue', lower: 'linecontinue', index: 94, isBkr: false };\n\n  /* UDTS */\n  this.udts = [];\n\n  /* OPCODES */\n  /* File */\n  this.rules[0].opcodes = [];\n  this.rules[0].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[0].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[0].opcodes[2] = { type: 4, index: 1 };// RNM(BlankLine)\n  this.rules[0].opcodes[3] = { type: 4, index: 2 };// RNM(Rule)\n  this.rules[0].opcodes[4] = { type: 4, index: 12 };// RNM(RuleError)\n\n  /* BlankLine */\n  this.rules[1].opcodes = [];\n  this.rules[1].opcodes[0] = { type: 2, children: [1,5,7] };// CAT\n  this.rules[1].opcodes[1] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[1].opcodes[2] = { type: 1, children: [3,4] };// ALT\n  this.rules[1].opcodes[3] = { type: 6, string: [32] };// TBS\n  this.rules[1].opcodes[4] = { type: 6, string: [9] };// TBS\n  this.rules[1].opcodes[5] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[1].opcodes[6] = { type: 4, index: 92 };// RNM(comment)\n  this.rules[1].opcodes[7] = { type: 4, index: 93 };// RNM(LineEnd)\n\n  /* Rule */\n  this.rules[2].opcodes = [];\n  this.rules[2].opcodes[0] = { type: 2, children: [1,2,3,4] };// CAT\n  this.rules[2].opcodes[1] = { type: 4, index: 3 };// RNM(RuleLookup)\n  this.rules[2].opcodes[2] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[2].opcodes[3] = { type: 4, index: 14 };// RNM(Alternation)\n  this.rules[2].opcodes[4] = { type: 1, children: [5,8] };// ALT\n  this.rules[2].opcodes[5] = { type: 2, children: [6,7] };// CAT\n  this.rules[2].opcodes[6] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[2].opcodes[7] = { type: 4, index: 93 };// RNM(LineEnd)\n  this.rules[2].opcodes[8] = { type: 2, children: [9,10] };// CAT\n  this.rules[2].opcodes[9] = { type: 4, index: 13 };// RNM(LineEndError)\n  this.rules[2].opcodes[10] = { type: 4, index: 93 };// RNM(LineEnd)\n\n  /* RuleLookup */\n  this.rules[3].opcodes = [];\n  this.rules[3].opcodes[0] = { type: 2, children: [1,2,3] };// CAT\n  this.rules[3].opcodes[1] = { type: 4, index: 4 };// RNM(RuleNameTest)\n  this.rules[3].opcodes[2] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[3].opcodes[3] = { type: 4, index: 7 };// RNM(DefinedAsTest)\n\n  /* RuleNameTest */\n  this.rules[4].opcodes = [];\n  this.rules[4].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[4].opcodes[1] = { type: 4, index: 5 };// RNM(RuleName)\n  this.rules[4].opcodes[2] = { type: 4, index: 6 };// RNM(RuleNameError)\n\n  /* RuleName */\n  this.rules[5].opcodes = [];\n  this.rules[5].opcodes[0] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* RuleNameError */\n  this.rules[6].opcodes = [];\n  this.rules[6].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[6].opcodes[1] = { type: 1, children: [2,3] };// ALT\n  this.rules[6].opcodes[2] = { type: 5, min: 33, max: 60 };// TRG\n  this.rules[6].opcodes[3] = { type: 5, min: 62, max: 126 };// TRG\n\n  /* DefinedAsTest */\n  this.rules[7].opcodes = [];\n  this.rules[7].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[7].opcodes[1] = { type: 4, index: 9 };// RNM(DefinedAs)\n  this.rules[7].opcodes[2] = { type: 4, index: 8 };// RNM(DefinedAsError)\n\n  /* DefinedAsError */\n  this.rules[8].opcodes = [];\n  this.rules[8].opcodes[0] = { type: 3, min: 1, max: 2 };// REP\n  this.rules[8].opcodes[1] = { type: 5, min: 33, max: 126 };// TRG\n\n  /* DefinedAs */\n  this.rules[9].opcodes = [];\n  this.rules[9].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[9].opcodes[1] = { type: 4, index: 11 };// RNM(IncAlt)\n  this.rules[9].opcodes[2] = { type: 4, index: 10 };// RNM(Defined)\n\n  /* Defined */\n  this.rules[10].opcodes = [];\n  this.rules[10].opcodes[0] = { type: 6, string: [61] };// TBS\n\n  /* IncAlt */\n  this.rules[11].opcodes = [];\n  this.rules[11].opcodes[0] = { type: 6, string: [61,47] };// TBS\n\n  /* RuleError */\n  this.rules[12].opcodes = [];\n  this.rules[12].opcodes[0] = { type: 2, children: [1,6] };// CAT\n  this.rules[12].opcodes[1] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[12].opcodes[2] = { type: 1, children: [3,4,5] };// ALT\n  this.rules[12].opcodes[3] = { type: 5, min: 32, max: 126 };// TRG\n  this.rules[12].opcodes[4] = { type: 6, string: [9] };// TBS\n  this.rules[12].opcodes[5] = { type: 4, index: 94 };// RNM(LineContinue)\n  this.rules[12].opcodes[6] = { type: 4, index: 93 };// RNM(LineEnd)\n\n  /* LineEndError */\n  this.rules[13].opcodes = [];\n  this.rules[13].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[13].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[13].opcodes[2] = { type: 5, min: 32, max: 126 };// TRG\n  this.rules[13].opcodes[3] = { type: 6, string: [9] };// TBS\n  this.rules[13].opcodes[4] = { type: 4, index: 94 };// RNM(LineContinue)\n\n  /* Alternation */\n  this.rules[14].opcodes = [];\n  this.rules[14].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[14].opcodes[1] = { type: 4, index: 15 };// RNM(Concatenation)\n  this.rules[14].opcodes[2] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[14].opcodes[3] = { type: 2, children: [4,5,6] };// CAT\n  this.rules[14].opcodes[4] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[14].opcodes[5] = { type: 4, index: 44 };// RNM(AltOp)\n  this.rules[14].opcodes[6] = { type: 4, index: 15 };// RNM(Concatenation)\n\n  /* Concatenation */\n  this.rules[15].opcodes = [];\n  this.rules[15].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[15].opcodes[1] = { type: 4, index: 16 };// RNM(Repetition)\n  this.rules[15].opcodes[2] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[15].opcodes[3] = { type: 2, children: [4,5] };// CAT\n  this.rules[15].opcodes[4] = { type: 4, index: 45 };// RNM(CatOp)\n  this.rules[15].opcodes[5] = { type: 4, index: 16 };// RNM(Repetition)\n\n  /* Repetition */\n  this.rules[16].opcodes = [];\n  this.rules[16].opcodes[0] = { type: 2, children: [1,3] };// CAT\n  this.rules[16].opcodes[1] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[16].opcodes[2] = { type: 4, index: 17 };// RNM(Modifier)\n  this.rules[16].opcodes[3] = { type: 1, children: [4,5,6,7] };// ALT\n  this.rules[16].opcodes[4] = { type: 4, index: 21 };// RNM(Group)\n  this.rules[16].opcodes[5] = { type: 4, index: 25 };// RNM(Option)\n  this.rules[16].opcodes[6] = { type: 4, index: 19 };// RNM(BasicElement)\n  this.rules[16].opcodes[7] = { type: 4, index: 20 };// RNM(BasicElementErr)\n\n  /* Modifier */\n  this.rules[17].opcodes = [];\n  this.rules[17].opcodes[0] = { type: 1, children: [1,5] };// ALT\n  this.rules[17].opcodes[1] = { type: 2, children: [2,3] };// CAT\n  this.rules[17].opcodes[2] = { type: 4, index: 18 };// RNM(Predicate)\n  this.rules[17].opcodes[3] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[17].opcodes[4] = { type: 4, index: 43 };// RNM(RepOp)\n  this.rules[17].opcodes[5] = { type: 4, index: 43 };// RNM(RepOp)\n\n  /* Predicate */\n  this.rules[18].opcodes = [];\n  this.rules[18].opcodes[0] = { type: 1, children: [1,2,3,4] };// ALT\n  this.rules[18].opcodes[1] = { type: 4, index: 49 };// RNM(BkaOp)\n  this.rules[18].opcodes[2] = { type: 4, index: 50 };// RNM(BknOp)\n  this.rules[18].opcodes[3] = { type: 4, index: 47 };// RNM(AndOp)\n  this.rules[18].opcodes[4] = { type: 4, index: 48 };// RNM(NotOp)\n\n  /* BasicElement */\n  this.rules[19].opcodes = [];\n  this.rules[19].opcodes[0] = { type: 1, children: [1,2,3,4,5,6,7,8,9,10] };// ALT\n  this.rules[19].opcodes[1] = { type: 4, index: 40 };// RNM(UdtOp)\n  this.rules[19].opcodes[2] = { type: 4, index: 29 };// RNM(RnmOp)\n  this.rules[19].opcodes[3] = { type: 4, index: 53 };// RNM(TrgOp)\n  this.rules[19].opcodes[4] = { type: 4, index: 54 };// RNM(TbsOp)\n  this.rules[19].opcodes[5] = { type: 4, index: 55 };// RNM(TlsOp)\n  this.rules[19].opcodes[6] = { type: 4, index: 61 };// RNM(ClsOp)\n  this.rules[19].opcodes[7] = { type: 4, index: 30 };// RNM(BkrOp)\n  this.rules[19].opcodes[8] = { type: 4, index: 51 };// RNM(AbgOp)\n  this.rules[19].opcodes[9] = { type: 4, index: 52 };// RNM(AenOp)\n  this.rules[19].opcodes[10] = { type: 4, index: 65 };// RNM(ProsVal)\n\n  /* BasicElementErr */\n  this.rules[20].opcodes = [];\n  this.rules[20].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[20].opcodes[1] = { type: 1, children: [2,3,4,5] };// ALT\n  this.rules[20].opcodes[2] = { type: 5, min: 33, max: 40 };// TRG\n  this.rules[20].opcodes[3] = { type: 5, min: 42, max: 46 };// TRG\n  this.rules[20].opcodes[4] = { type: 5, min: 48, max: 92 };// TRG\n  this.rules[20].opcodes[5] = { type: 5, min: 94, max: 126 };// TRG\n\n  /* Group */\n  this.rules[21].opcodes = [];\n  this.rules[21].opcodes[0] = { type: 2, children: [1,2,3] };// CAT\n  this.rules[21].opcodes[1] = { type: 4, index: 23 };// RNM(GroupOpen)\n  this.rules[21].opcodes[2] = { type: 4, index: 14 };// RNM(Alternation)\n  this.rules[21].opcodes[3] = { type: 1, children: [4,5] };// ALT\n  this.rules[21].opcodes[4] = { type: 4, index: 24 };// RNM(GroupClose)\n  this.rules[21].opcodes[5] = { type: 4, index: 22 };// RNM(GroupError)\n\n  /* GroupError */\n  this.rules[22].opcodes = [];\n  this.rules[22].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[22].opcodes[1] = { type: 1, children: [2,3,4,5] };// ALT\n  this.rules[22].opcodes[2] = { type: 5, min: 33, max: 40 };// TRG\n  this.rules[22].opcodes[3] = { type: 5, min: 42, max: 46 };// TRG\n  this.rules[22].opcodes[4] = { type: 5, min: 48, max: 92 };// TRG\n  this.rules[22].opcodes[5] = { type: 5, min: 94, max: 126 };// TRG\n\n  /* GroupOpen */\n  this.rules[23].opcodes = [];\n  this.rules[23].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[23].opcodes[1] = { type: 6, string: [40] };// TBS\n  this.rules[23].opcodes[2] = { type: 4, index: 89 };// RNM(owsp)\n\n  /* GroupClose */\n  this.rules[24].opcodes = [];\n  this.rules[24].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[24].opcodes[1] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[24].opcodes[2] = { type: 6, string: [41] };// TBS\n\n  /* Option */\n  this.rules[25].opcodes = [];\n  this.rules[25].opcodes[0] = { type: 2, children: [1,2,3] };// CAT\n  this.rules[25].opcodes[1] = { type: 4, index: 27 };// RNM(OptionOpen)\n  this.rules[25].opcodes[2] = { type: 4, index: 14 };// RNM(Alternation)\n  this.rules[25].opcodes[3] = { type: 1, children: [4,5] };// ALT\n  this.rules[25].opcodes[4] = { type: 4, index: 28 };// RNM(OptionClose)\n  this.rules[25].opcodes[5] = { type: 4, index: 26 };// RNM(OptionError)\n\n  /* OptionError */\n  this.rules[26].opcodes = [];\n  this.rules[26].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[26].opcodes[1] = { type: 1, children: [2,3,4,5] };// ALT\n  this.rules[26].opcodes[2] = { type: 5, min: 33, max: 40 };// TRG\n  this.rules[26].opcodes[3] = { type: 5, min: 42, max: 46 };// TRG\n  this.rules[26].opcodes[4] = { type: 5, min: 48, max: 92 };// TRG\n  this.rules[26].opcodes[5] = { type: 5, min: 94, max: 126 };// TRG\n\n  /* OptionOpen */\n  this.rules[27].opcodes = [];\n  this.rules[27].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[27].opcodes[1] = { type: 6, string: [91] };// TBS\n  this.rules[27].opcodes[2] = { type: 4, index: 89 };// RNM(owsp)\n\n  /* OptionClose */\n  this.rules[28].opcodes = [];\n  this.rules[28].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[28].opcodes[1] = { type: 4, index: 89 };// RNM(owsp)\n  this.rules[28].opcodes[2] = { type: 6, string: [93] };// TBS\n\n  /* RnmOp */\n  this.rules[29].opcodes = [];\n  this.rules[29].opcodes[0] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* BkrOp */\n  this.rules[30].opcodes = [];\n  this.rules[30].opcodes[0] = { type: 2, children: [1,2,4] };// CAT\n  this.rules[30].opcodes[1] = { type: 6, string: [92] };// TBS\n  this.rules[30].opcodes[2] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[30].opcodes[3] = { type: 4, index: 31 };// RNM(bkrModifier)\n  this.rules[30].opcodes[4] = { type: 4, index: 36 };// RNM(bkr-name)\n\n  /* bkrModifier */\n  this.rules[31].opcodes = [];\n  this.rules[31].opcodes[0] = { type: 1, children: [1,7,13,19] };// ALT\n  this.rules[31].opcodes[1] = { type: 2, children: [2,3] };// CAT\n  this.rules[31].opcodes[2] = { type: 4, index: 32 };// RNM(cs)\n  this.rules[31].opcodes[3] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[31].opcodes[4] = { type: 1, children: [5,6] };// ALT\n  this.rules[31].opcodes[5] = { type: 4, index: 34 };// RNM(um)\n  this.rules[31].opcodes[6] = { type: 4, index: 35 };// RNM(pm)\n  this.rules[31].opcodes[7] = { type: 2, children: [8,9] };// CAT\n  this.rules[31].opcodes[8] = { type: 4, index: 33 };// RNM(ci)\n  this.rules[31].opcodes[9] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[31].opcodes[10] = { type: 1, children: [11,12] };// ALT\n  this.rules[31].opcodes[11] = { type: 4, index: 34 };// RNM(um)\n  this.rules[31].opcodes[12] = { type: 4, index: 35 };// RNM(pm)\n  this.rules[31].opcodes[13] = { type: 2, children: [14,15] };// CAT\n  this.rules[31].opcodes[14] = { type: 4, index: 34 };// RNM(um)\n  this.rules[31].opcodes[15] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[31].opcodes[16] = { type: 1, children: [17,18] };// ALT\n  this.rules[31].opcodes[17] = { type: 4, index: 32 };// RNM(cs)\n  this.rules[31].opcodes[18] = { type: 4, index: 33 };// RNM(ci)\n  this.rules[31].opcodes[19] = { type: 2, children: [20,21] };// CAT\n  this.rules[31].opcodes[20] = { type: 4, index: 35 };// RNM(pm)\n  this.rules[31].opcodes[21] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[31].opcodes[22] = { type: 1, children: [23,24] };// ALT\n  this.rules[31].opcodes[23] = { type: 4, index: 32 };// RNM(cs)\n  this.rules[31].opcodes[24] = { type: 4, index: 33 };// RNM(ci)\n\n  /* cs */\n  this.rules[32].opcodes = [];\n  this.rules[32].opcodes[0] = { type: 6, string: [37,115] };// TBS\n\n  /* ci */\n  this.rules[33].opcodes = [];\n  this.rules[33].opcodes[0] = { type: 6, string: [37,105] };// TBS\n\n  /* um */\n  this.rules[34].opcodes = [];\n  this.rules[34].opcodes[0] = { type: 6, string: [37,117] };// TBS\n\n  /* pm */\n  this.rules[35].opcodes = [];\n  this.rules[35].opcodes[0] = { type: 6, string: [37,112] };// TBS\n\n  /* bkr-name */\n  this.rules[36].opcodes = [];\n  this.rules[36].opcodes[0] = { type: 1, children: [1,2,3] };// ALT\n  this.rules[36].opcodes[1] = { type: 4, index: 38 };// RNM(uname)\n  this.rules[36].opcodes[2] = { type: 4, index: 39 };// RNM(ename)\n  this.rules[36].opcodes[3] = { type: 4, index: 37 };// RNM(rname)\n\n  /* rname */\n  this.rules[37].opcodes = [];\n  this.rules[37].opcodes[0] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* uname */\n  this.rules[38].opcodes = [];\n  this.rules[38].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[38].opcodes[1] = { type: 6, string: [117,95] };// TBS\n  this.rules[38].opcodes[2] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* ename */\n  this.rules[39].opcodes = [];\n  this.rules[39].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[39].opcodes[1] = { type: 6, string: [101,95] };// TBS\n  this.rules[39].opcodes[2] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* UdtOp */\n  this.rules[40].opcodes = [];\n  this.rules[40].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[40].opcodes[1] = { type: 4, index: 42 };// RNM(udt-empty)\n  this.rules[40].opcodes[2] = { type: 4, index: 41 };// RNM(udt-non-empty)\n\n  /* udt-non-empty */\n  this.rules[41].opcodes = [];\n  this.rules[41].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[41].opcodes[1] = { type: 6, string: [117,95] };// TBS\n  this.rules[41].opcodes[2] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* udt-empty */\n  this.rules[42].opcodes = [];\n  this.rules[42].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[42].opcodes[1] = { type: 6, string: [101,95] };// TBS\n  this.rules[42].opcodes[2] = { type: 4, index: 88 };// RNM(alphanum)\n\n  /* RepOp */\n  this.rules[43].opcodes = [];\n  this.rules[43].opcodes[0] = { type: 1, children: [1,5,8,11,12] };// ALT\n  this.rules[43].opcodes[1] = { type: 2, children: [2,3,4] };// CAT\n  this.rules[43].opcodes[2] = { type: 4, index: 69 };// RNM(rep-min)\n  this.rules[43].opcodes[3] = { type: 4, index: 46 };// RNM(StarOp)\n  this.rules[43].opcodes[4] = { type: 4, index: 71 };// RNM(rep-max)\n  this.rules[43].opcodes[5] = { type: 2, children: [6,7] };// CAT\n  this.rules[43].opcodes[6] = { type: 4, index: 69 };// RNM(rep-min)\n  this.rules[43].opcodes[7] = { type: 4, index: 46 };// RNM(StarOp)\n  this.rules[43].opcodes[8] = { type: 2, children: [9,10] };// CAT\n  this.rules[43].opcodes[9] = { type: 4, index: 46 };// RNM(StarOp)\n  this.rules[43].opcodes[10] = { type: 4, index: 71 };// RNM(rep-max)\n  this.rules[43].opcodes[11] = { type: 4, index: 46 };// RNM(StarOp)\n  this.rules[43].opcodes[12] = { type: 4, index: 70 };// RNM(rep-min-max)\n\n  /* AltOp */\n  this.rules[44].opcodes = [];\n  this.rules[44].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[44].opcodes[1] = { type: 6, string: [47] };// TBS\n  this.rules[44].opcodes[2] = { type: 4, index: 89 };// RNM(owsp)\n\n  /* CatOp */\n  this.rules[45].opcodes = [];\n  this.rules[45].opcodes[0] = { type: 4, index: 90 };// RNM(wsp)\n\n  /* StarOp */\n  this.rules[46].opcodes = [];\n  this.rules[46].opcodes[0] = { type: 6, string: [42] };// TBS\n\n  /* AndOp */\n  this.rules[47].opcodes = [];\n  this.rules[47].opcodes[0] = { type: 6, string: [38] };// TBS\n\n  /* NotOp */\n  this.rules[48].opcodes = [];\n  this.rules[48].opcodes[0] = { type: 6, string: [33] };// TBS\n\n  /* BkaOp */\n  this.rules[49].opcodes = [];\n  this.rules[49].opcodes[0] = { type: 6, string: [38,38] };// TBS\n\n  /* BknOp */\n  this.rules[50].opcodes = [];\n  this.rules[50].opcodes[0] = { type: 6, string: [33,33] };// TBS\n\n  /* AbgOp */\n  this.rules[51].opcodes = [];\n  this.rules[51].opcodes[0] = { type: 6, string: [37,94] };// TBS\n\n  /* AenOp */\n  this.rules[52].opcodes = [];\n  this.rules[52].opcodes[0] = { type: 6, string: [37,36] };// TBS\n\n  /* TrgOp */\n  this.rules[53].opcodes = [];\n  this.rules[53].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[53].opcodes[1] = { type: 6, string: [37] };// TBS\n  this.rules[53].opcodes[2] = { type: 1, children: [3,8,13] };// ALT\n  this.rules[53].opcodes[3] = { type: 2, children: [4,5,6,7] };// CAT\n  this.rules[53].opcodes[4] = { type: 4, index: 76 };// RNM(Dec)\n  this.rules[53].opcodes[5] = { type: 4, index: 79 };// RNM(dmin)\n  this.rules[53].opcodes[6] = { type: 6, string: [45] };// TBS\n  this.rules[53].opcodes[7] = { type: 4, index: 80 };// RNM(dmax)\n  this.rules[53].opcodes[8] = { type: 2, children: [9,10,11,12] };// CAT\n  this.rules[53].opcodes[9] = { type: 4, index: 77 };// RNM(Hex)\n  this.rules[53].opcodes[10] = { type: 4, index: 83 };// RNM(xmin)\n  this.rules[53].opcodes[11] = { type: 6, string: [45] };// TBS\n  this.rules[53].opcodes[12] = { type: 4, index: 84 };// RNM(xmax)\n  this.rules[53].opcodes[13] = { type: 2, children: [14,15,16,17] };// CAT\n  this.rules[53].opcodes[14] = { type: 4, index: 78 };// RNM(Bin)\n  this.rules[53].opcodes[15] = { type: 4, index: 81 };// RNM(bmin)\n  this.rules[53].opcodes[16] = { type: 6, string: [45] };// TBS\n  this.rules[53].opcodes[17] = { type: 4, index: 82 };// RNM(bmax)\n\n  /* TbsOp */\n  this.rules[54].opcodes = [];\n  this.rules[54].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[54].opcodes[1] = { type: 6, string: [37] };// TBS\n  this.rules[54].opcodes[2] = { type: 1, children: [3,10,17] };// ALT\n  this.rules[54].opcodes[3] = { type: 2, children: [4,5,6] };// CAT\n  this.rules[54].opcodes[4] = { type: 4, index: 76 };// RNM(Dec)\n  this.rules[54].opcodes[5] = { type: 4, index: 73 };// RNM(dString)\n  this.rules[54].opcodes[6] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[54].opcodes[7] = { type: 2, children: [8,9] };// CAT\n  this.rules[54].opcodes[8] = { type: 6, string: [46] };// TBS\n  this.rules[54].opcodes[9] = { type: 4, index: 73 };// RNM(dString)\n  this.rules[54].opcodes[10] = { type: 2, children: [11,12,13] };// CAT\n  this.rules[54].opcodes[11] = { type: 4, index: 77 };// RNM(Hex)\n  this.rules[54].opcodes[12] = { type: 4, index: 74 };// RNM(xString)\n  this.rules[54].opcodes[13] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[54].opcodes[14] = { type: 2, children: [15,16] };// CAT\n  this.rules[54].opcodes[15] = { type: 6, string: [46] };// TBS\n  this.rules[54].opcodes[16] = { type: 4, index: 74 };// RNM(xString)\n  this.rules[54].opcodes[17] = { type: 2, children: [18,19,20] };// CAT\n  this.rules[54].opcodes[18] = { type: 4, index: 78 };// RNM(Bin)\n  this.rules[54].opcodes[19] = { type: 4, index: 75 };// RNM(bString)\n  this.rules[54].opcodes[20] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[54].opcodes[21] = { type: 2, children: [22,23] };// CAT\n  this.rules[54].opcodes[22] = { type: 6, string: [46] };// TBS\n  this.rules[54].opcodes[23] = { type: 4, index: 75 };// RNM(bString)\n\n  /* TlsOp */\n  this.rules[55].opcodes = [];\n  this.rules[55].opcodes[0] = { type: 2, children: [1,2,3,4] };// CAT\n  this.rules[55].opcodes[1] = { type: 4, index: 56 };// RNM(TlsCase)\n  this.rules[55].opcodes[2] = { type: 4, index: 57 };// RNM(TlsOpen)\n  this.rules[55].opcodes[3] = { type: 4, index: 59 };// RNM(TlsString)\n  this.rules[55].opcodes[4] = { type: 4, index: 58 };// RNM(TlsClose)\n\n  /* TlsCase */\n  this.rules[56].opcodes = [];\n  this.rules[56].opcodes[0] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[56].opcodes[1] = { type: 1, children: [2,3] };// ALT\n  this.rules[56].opcodes[2] = { type: 7, string: [37,105] };// TLS\n  this.rules[56].opcodes[3] = { type: 7, string: [37,115] };// TLS\n\n  /* TlsOpen */\n  this.rules[57].opcodes = [];\n  this.rules[57].opcodes[0] = { type: 6, string: [34] };// TBS\n\n  /* TlsClose */\n  this.rules[58].opcodes = [];\n  this.rules[58].opcodes[0] = { type: 6, string: [34] };// TBS\n\n  /* TlsString */\n  this.rules[59].opcodes = [];\n  this.rules[59].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[59].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[59].opcodes[2] = { type: 5, min: 32, max: 33 };// TRG\n  this.rules[59].opcodes[3] = { type: 5, min: 35, max: 126 };// TRG\n  this.rules[59].opcodes[4] = { type: 4, index: 60 };// RNM(StringTab)\n\n  /* StringTab */\n  this.rules[60].opcodes = [];\n  this.rules[60].opcodes[0] = { type: 6, string: [9] };// TBS\n\n  /* ClsOp */\n  this.rules[61].opcodes = [];\n  this.rules[61].opcodes[0] = { type: 2, children: [1,2,3] };// CAT\n  this.rules[61].opcodes[1] = { type: 4, index: 62 };// RNM(ClsOpen)\n  this.rules[61].opcodes[2] = { type: 4, index: 64 };// RNM(ClsString)\n  this.rules[61].opcodes[3] = { type: 4, index: 63 };// RNM(ClsClose)\n\n  /* ClsOpen */\n  this.rules[62].opcodes = [];\n  this.rules[62].opcodes[0] = { type: 6, string: [39] };// TBS\n\n  /* ClsClose */\n  this.rules[63].opcodes = [];\n  this.rules[63].opcodes[0] = { type: 6, string: [39] };// TBS\n\n  /* ClsString */\n  this.rules[64].opcodes = [];\n  this.rules[64].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[64].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[64].opcodes[2] = { type: 5, min: 32, max: 38 };// TRG\n  this.rules[64].opcodes[3] = { type: 5, min: 40, max: 126 };// TRG\n  this.rules[64].opcodes[4] = { type: 4, index: 60 };// RNM(StringTab)\n\n  /* ProsVal */\n  this.rules[65].opcodes = [];\n  this.rules[65].opcodes[0] = { type: 2, children: [1,2,3] };// CAT\n  this.rules[65].opcodes[1] = { type: 4, index: 66 };// RNM(ProsValOpen)\n  this.rules[65].opcodes[2] = { type: 4, index: 67 };// RNM(ProsValString)\n  this.rules[65].opcodes[3] = { type: 4, index: 68 };// RNM(ProsValClose)\n\n  /* ProsValOpen */\n  this.rules[66].opcodes = [];\n  this.rules[66].opcodes[0] = { type: 6, string: [60] };// TBS\n\n  /* ProsValString */\n  this.rules[67].opcodes = [];\n  this.rules[67].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[67].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[67].opcodes[2] = { type: 5, min: 32, max: 61 };// TRG\n  this.rules[67].opcodes[3] = { type: 5, min: 63, max: 126 };// TRG\n  this.rules[67].opcodes[4] = { type: 4, index: 60 };// RNM(StringTab)\n\n  /* ProsValClose */\n  this.rules[68].opcodes = [];\n  this.rules[68].opcodes[0] = { type: 6, string: [62] };// TBS\n\n  /* rep-min */\n  this.rules[69].opcodes = [];\n  this.rules[69].opcodes[0] = { type: 4, index: 72 };// RNM(rep-num)\n\n  /* rep-min-max */\n  this.rules[70].opcodes = [];\n  this.rules[70].opcodes[0] = { type: 4, index: 72 };// RNM(rep-num)\n\n  /* rep-max */\n  this.rules[71].opcodes = [];\n  this.rules[71].opcodes[0] = { type: 4, index: 72 };// RNM(rep-num)\n\n  /* rep-num */\n  this.rules[72].opcodes = [];\n  this.rules[72].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[72].opcodes[1] = { type: 5, min: 48, max: 57 };// TRG\n\n  /* dString */\n  this.rules[73].opcodes = [];\n  this.rules[73].opcodes[0] = { type: 4, index: 85 };// RNM(dnum)\n\n  /* xString */\n  this.rules[74].opcodes = [];\n  this.rules[74].opcodes[0] = { type: 4, index: 87 };// RNM(xnum)\n\n  /* bString */\n  this.rules[75].opcodes = [];\n  this.rules[75].opcodes[0] = { type: 4, index: 86 };// RNM(bnum)\n\n  /* Dec */\n  this.rules[76].opcodes = [];\n  this.rules[76].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[76].opcodes[1] = { type: 6, string: [68] };// TBS\n  this.rules[76].opcodes[2] = { type: 6, string: [100] };// TBS\n\n  /* Hex */\n  this.rules[77].opcodes = [];\n  this.rules[77].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[77].opcodes[1] = { type: 6, string: [88] };// TBS\n  this.rules[77].opcodes[2] = { type: 6, string: [120] };// TBS\n\n  /* Bin */\n  this.rules[78].opcodes = [];\n  this.rules[78].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[78].opcodes[1] = { type: 6, string: [66] };// TBS\n  this.rules[78].opcodes[2] = { type: 6, string: [98] };// TBS\n\n  /* dmin */\n  this.rules[79].opcodes = [];\n  this.rules[79].opcodes[0] = { type: 4, index: 85 };// RNM(dnum)\n\n  /* dmax */\n  this.rules[80].opcodes = [];\n  this.rules[80].opcodes[0] = { type: 4, index: 85 };// RNM(dnum)\n\n  /* bmin */\n  this.rules[81].opcodes = [];\n  this.rules[81].opcodes[0] = { type: 4, index: 86 };// RNM(bnum)\n\n  /* bmax */\n  this.rules[82].opcodes = [];\n  this.rules[82].opcodes[0] = { type: 4, index: 86 };// RNM(bnum)\n\n  /* xmin */\n  this.rules[83].opcodes = [];\n  this.rules[83].opcodes[0] = { type: 4, index: 87 };// RNM(xnum)\n\n  /* xmax */\n  this.rules[84].opcodes = [];\n  this.rules[84].opcodes[0] = { type: 4, index: 87 };// RNM(xnum)\n\n  /* dnum */\n  this.rules[85].opcodes = [];\n  this.rules[85].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[85].opcodes[1] = { type: 5, min: 48, max: 57 };// TRG\n\n  /* bnum */\n  this.rules[86].opcodes = [];\n  this.rules[86].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[86].opcodes[1] = { type: 5, min: 48, max: 49 };// TRG\n\n  /* xnum */\n  this.rules[87].opcodes = [];\n  this.rules[87].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[87].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[87].opcodes[2] = { type: 5, min: 48, max: 57 };// TRG\n  this.rules[87].opcodes[3] = { type: 5, min: 65, max: 70 };// TRG\n  this.rules[87].opcodes[4] = { type: 5, min: 97, max: 102 };// TRG\n\n  /* alphanum */\n  this.rules[88].opcodes = [];\n  this.rules[88].opcodes[0] = { type: 2, children: [1,4] };// CAT\n  this.rules[88].opcodes[1] = { type: 1, children: [2,3] };// ALT\n  this.rules[88].opcodes[2] = { type: 5, min: 97, max: 122 };// TRG\n  this.rules[88].opcodes[3] = { type: 5, min: 65, max: 90 };// TRG\n  this.rules[88].opcodes[4] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[88].opcodes[5] = { type: 1, children: [6,7,8,9] };// ALT\n  this.rules[88].opcodes[6] = { type: 5, min: 97, max: 122 };// TRG\n  this.rules[88].opcodes[7] = { type: 5, min: 65, max: 90 };// TRG\n  this.rules[88].opcodes[8] = { type: 5, min: 48, max: 57 };// TRG\n  this.rules[88].opcodes[9] = { type: 6, string: [45] };// TBS\n\n  /* owsp */\n  this.rules[89].opcodes = [];\n  this.rules[89].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[89].opcodes[1] = { type: 4, index: 91 };// RNM(space)\n\n  /* wsp */\n  this.rules[90].opcodes = [];\n  this.rules[90].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[90].opcodes[1] = { type: 4, index: 91 };// RNM(space)\n\n  /* space */\n  this.rules[91].opcodes = [];\n  this.rules[91].opcodes[0] = { type: 1, children: [1,2,3,4] };// ALT\n  this.rules[91].opcodes[1] = { type: 6, string: [32] };// TBS\n  this.rules[91].opcodes[2] = { type: 6, string: [9] };// TBS\n  this.rules[91].opcodes[3] = { type: 4, index: 92 };// RNM(comment)\n  this.rules[91].opcodes[4] = { type: 4, index: 94 };// RNM(LineContinue)\n\n  /* comment */\n  this.rules[92].opcodes = [];\n  this.rules[92].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[92].opcodes[1] = { type: 6, string: [59] };// TBS\n  this.rules[92].opcodes[2] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[92].opcodes[3] = { type: 1, children: [4,5] };// ALT\n  this.rules[92].opcodes[4] = { type: 5, min: 32, max: 126 };// TRG\n  this.rules[92].opcodes[5] = { type: 6, string: [9] };// TBS\n\n  /* LineEnd */\n  this.rules[93].opcodes = [];\n  this.rules[93].opcodes[0] = { type: 1, children: [1,2,3] };// ALT\n  this.rules[93].opcodes[1] = { type: 6, string: [13,10] };// TBS\n  this.rules[93].opcodes[2] = { type: 6, string: [10] };// TBS\n  this.rules[93].opcodes[3] = { type: 6, string: [13] };// TBS\n\n  /* LineContinue */\n  this.rules[94].opcodes = [];\n  this.rules[94].opcodes[0] = { type: 2, children: [1,5] };// CAT\n  this.rules[94].opcodes[1] = { type: 1, children: [2,3,4] };// ALT\n  this.rules[94].opcodes[2] = { type: 6, string: [13,10] };// TBS\n  this.rules[94].opcodes[3] = { type: 6, string: [10] };// TBS\n  this.rules[94].opcodes[4] = { type: 6, string: [13] };// TBS\n  this.rules[94].opcodes[5] = { type: 1, children: [6,7] };// ALT\n  this.rules[94].opcodes[6] = { type: 6, string: [32] };// TBS\n  this.rules[94].opcodes[7] = { type: 6, string: [9] };// TBS\n\n  // The `toString()` function will display the original grammar file(s) that produced these opcodes.\n  this.toString = function toString(){\n    let str = \"\";\n    str += \";\\n\";\n    str += \"; ABNF for JavaScript APG 2.0 SABNF\\n\";\n    str += \"; RFC 5234 with some restrictions and additions.\\n\";\n    str += \"; Updated 11/24/2015 for RFC 7405 case-sensitive literal string notation\\n\";\n    str += \";  - accepts %s\\\"string\\\" as a case-sensitive string\\n\";\n    str += \";  - accepts %i\\\"string\\\" as a case-insensitive string\\n\";\n    str += \";  - accepts \\\"string\\\" as a case-insensitive string\\n\";\n    str += \";\\n\";\n    str += \"; Some restrictions:\\n\";\n    str += \";   1. Rules must begin at first character of each line.\\n\";\n    str += \";      Indentations on first rule and rules thereafter are not allowed.\\n\";\n    str += \";   2. Relaxed line endings. CRLF, LF or CR are accepted as valid line ending.\\n\";\n    str += \";   3. Prose values, i.e. <prose value>, are accepted as valid grammar syntax.\\n\";\n    str += \";      However, a working parser cannot be generated from them.\\n\";\n    str += \";\\n\";\n    str += \"; Super set (SABNF) additions:\\n\";\n    str += \";   1. Look-ahead (syntactic predicate) operators are accepted as element prefixes.\\n\";\n    str += \";      & is the positive look-ahead operator, succeeds and backtracks if the look-ahead phrase is found\\n\";\n    str += \";      ! is the negative look-ahead operator, succeeds and backtracks if the look-ahead phrase is NOT found\\n\";\n    str += \";      e.g. &%d13 or &rule or !(A / B)\\n\";\n    str += \";   2. User-Defined Terminals (UDT) of the form, u_name and e_name are accepted.\\n\";\n    str += \";      'name' is alpha followed by alpha/num/hyphen just like a rule name.\\n\";\n    str += \";      u_name may be used as an element but no rule definition is given.\\n\";\n    str += \";      e.g. rule = A / u_myUdt\\n\";\n    str += \";           A = \\\"a\\\"\\n\";\n    str += \";      would be a valid grammar.\\n\";\n    str += \";   3. Case-sensitive, single-quoted strings are accepted.\\n\";\n    str += \";      e.g. 'abc' would be equivalent to %d97.98.99\\n\";\n    str += \";      (kept for backward compatibility, but superseded by %s\\\"abc\\\")  \\n\";\n    str += \"; New 12/26/2015\\n\";\n    str += \";   4. Look-behind operators are accepted as element prefixes.\\n\";\n    str += \";      && is the positive look-behind operator, succeeds and backtracks if the look-behind phrase is found\\n\";\n    str += \";      !! is the negative look-behind operator, succeeds and backtracks if the look-behind phrase is NOT found\\n\";\n    str += \";      e.g. &&%d13 or &&rule or !!(A / B)\\n\";\n    str += \";   5. Back reference operators, i.e. \\\\rulename, are accepted.\\n\";\n    str += \";      A back reference operator acts like a TLS or TBS terminal except that the phrase it attempts\\n\";\n    str += \";      to match is a phrase previously matched by the rule 'rulename'.\\n\";\n    str += \";      There are two modes of previous phrase matching - the parent-frame mode and the universal mode.\\n\";\n    str += \";      In universal mode, \\\\rulename matches the last match to 'rulename' regardless of where it was found.\\n\";\n    str += \";      In parent-frame mode, \\\\rulename matches only the last match found on the parent's frame or parse tree level.\\n\";\n    str += \";      Back reference modifiers can be used to specify case and mode.\\n\";\n    str += \";      \\\\A defaults to case-insensitive and universal mode, e.g. \\\\A === \\\\%i%uA\\n\";\n    str += \";      Modifiers %i and %s determine case-insensitive and case-sensitive mode, respectively.\\n\";\n    str += \";      Modifiers %u and %p determine universal mode and parent frame mode, respectively.\\n\";\n    str += \";      Case and mode modifiers can appear in any order, e.g. \\\\%s%pA === \\\\%p%sA. \\n\";\n    str += \";   7. String begin anchor, ABG(%^) matches the beginning of the input string location.\\n\";\n    str += \";      Returns EMPTY or NOMATCH. Never consumes any characters.\\n\";\n    str += \";   8. String end anchor, AEN(%$) matches the end of the input string location.\\n\";\n    str += \";      Returns EMPTY or NOMATCH. Never consumes any characters.\\n\";\n    str += \";\\n\";\n    str += \"File            = *(BlankLine / Rule / RuleError)\\n\";\n    str += \"BlankLine       = *(%d32/%d9) [comment] LineEnd\\n\";\n    str += \"Rule            = RuleLookup owsp Alternation ((owsp LineEnd)\\n\";\n    str += \"                / (LineEndError LineEnd))\\n\";\n    str += \"RuleLookup      = RuleNameTest owsp DefinedAsTest\\n\";\n    str += \"RuleNameTest    = RuleName/RuleNameError\\n\";\n    str += \"RuleName        = alphanum\\n\";\n    str += \"RuleNameError   = 1*(%d33-60/%d62-126)\\n\";\n    str += \"DefinedAsTest   = DefinedAs / DefinedAsError\\n\";\n    str += \"DefinedAsError  = 1*2%d33-126\\n\";\n    str += \"DefinedAs       = IncAlt / Defined\\n\";\n    str += \"Defined         = %d61\\n\";\n    str += \"IncAlt          = %d61.47\\n\";\n    str += \"RuleError       = 1*(%d32-126 / %d9  / LineContinue) LineEnd\\n\";\n    str += \"LineEndError    = 1*(%d32-126 / %d9  / LineContinue)\\n\";\n    str += \"Alternation     = Concatenation *(owsp AltOp Concatenation)\\n\";\n    str += \"Concatenation   = Repetition *(CatOp Repetition)\\n\";\n    str += \"Repetition      = [Modifier] (Group / Option / BasicElement / BasicElementErr)\\n\";\n    str += \"Modifier        = (Predicate [RepOp])\\n\";\n    str += \"                / RepOp\\n\";\n    str += \"Predicate       = BkaOp\\n\";\n    str += \"                / BknOp\\n\";\n    str += \"                / AndOp\\n\";\n    str += \"                / NotOp\\n\";\n    str += \"BasicElement    = UdtOp\\n\";\n    str += \"                / RnmOp\\n\";\n    str += \"                / TrgOp\\n\";\n    str += \"                / TbsOp\\n\";\n    str += \"                / TlsOp\\n\";\n    str += \"                / ClsOp\\n\";\n    str += \"                / BkrOp\\n\";\n    str += \"                / AbgOp\\n\";\n    str += \"                / AenOp\\n\";\n    str += \"                / ProsVal\\n\";\n    str += \"BasicElementErr = 1*(%d33-40/%d42-46/%d48-92/%d94-126)\\n\";\n    str += \"Group           = GroupOpen  Alternation (GroupClose / GroupError)\\n\";\n    str += \"GroupError      = 1*(%d33-40/%d42-46/%d48-92/%d94-126) ; same as BasicElementErr\\n\";\n    str += \"GroupOpen       = %d40 owsp\\n\";\n    str += \"GroupClose      = owsp %d41\\n\";\n    str += \"Option          = OptionOpen Alternation (OptionClose / OptionError)\\n\";\n    str += \"OptionError     = 1*(%d33-40/%d42-46/%d48-92/%d94-126) ; same as BasicElementErr\\n\";\n    str += \"OptionOpen      = %d91 owsp\\n\";\n    str += \"OptionClose     = owsp %d93\\n\";\n    str += \"RnmOp           = alphanum\\n\";\n    str += \"BkrOp           = %d92 [bkrModifier] bkr-name\\n\";\n    str += \"bkrModifier     = (cs [um / pm]) / (ci [um / pm]) / (um [cs /ci]) / (pm [cs / ci])\\n\";\n    str += \"cs              = '%s'\\n\";\n    str += \"ci              = '%i'\\n\";\n    str += \"um              = '%u'\\n\";\n    str += \"pm              = '%p'\\n\";\n    str += \"bkr-name        = uname / ename / rname\\n\";\n    str += \"rname           = alphanum\\n\";\n    str += \"uname           = %d117.95 alphanum\\n\";\n    str += \"ename           = %d101.95 alphanum\\n\";\n    str += \"UdtOp           = udt-empty\\n\";\n    str += \"                / udt-non-empty\\n\";\n    str += \"udt-non-empty   = %d117.95 alphanum\\n\";\n    str += \"udt-empty       = %d101.95 alphanum\\n\";\n    str += \"RepOp           = (rep-min StarOp rep-max)\\n\";\n    str += \"                / (rep-min StarOp)\\n\";\n    str += \"                / (StarOp rep-max)\\n\";\n    str += \"                / StarOp\\n\";\n    str += \"                / rep-min-max\\n\";\n    str += \"AltOp           = %d47 owsp\\n\";\n    str += \"CatOp           = wsp\\n\";\n    str += \"StarOp          = %d42\\n\";\n    str += \"AndOp           = %d38\\n\";\n    str += \"NotOp           = %d33\\n\";\n    str += \"BkaOp           = %d38.38\\n\";\n    str += \"BknOp           = %d33.33\\n\";\n    str += \"AbgOp           = %d37.94\\n\";\n    str += \"AenOp           = %d37.36\\n\";\n    str += \"TrgOp           = %d37 ((Dec dmin %d45 dmax) / (Hex xmin %d45 xmax) / (Bin bmin %d45 bmax))\\n\";\n    str += \"TbsOp           = %d37 ((Dec dString *(%d46 dString)) / (Hex xString *(%d46 xString)) / (Bin bString *(%d46 bString)))\\n\";\n    str += \"TlsOp           = TlsCase TlsOpen TlsString TlsClose\\n\";\n    str += \"TlsCase         = [\\\"%i\\\" / \\\"%s\\\"]\\n\";\n    str += \"TlsOpen         = %d34\\n\";\n    str += \"TlsClose        = %d34\\n\";\n    str += \"TlsString       = *(%d32-33/%d35-126/StringTab)\\n\";\n    str += \"StringTab       = %d9\\n\";\n    str += \"ClsOp           = ClsOpen ClsString ClsClose\\n\";\n    str += \"ClsOpen         = %d39\\n\";\n    str += \"ClsClose        = %d39\\n\";\n    str += \"ClsString       = *(%d32-38/%d40-126/StringTab)\\n\";\n    str += \"ProsVal         = ProsValOpen ProsValString ProsValClose\\n\";\n    str += \"ProsValOpen     = %d60\\n\";\n    str += \"ProsValString   = *(%d32-61/%d63-126/StringTab)\\n\";\n    str += \"ProsValClose    = %d62\\n\";\n    str += \"rep-min         = rep-num\\n\";\n    str += \"rep-min-max     = rep-num\\n\";\n    str += \"rep-max         = rep-num\\n\";\n    str += \"rep-num         = 1*(%d48-57)\\n\";\n    str += \"dString         = dnum\\n\";\n    str += \"xString         = xnum\\n\";\n    str += \"bString         = bnum\\n\";\n    str += \"Dec             = (%d68/%d100)\\n\";\n    str += \"Hex             = (%d88/%d120)\\n\";\n    str += \"Bin             = (%d66/%d98)\\n\";\n    str += \"dmin            = dnum\\n\";\n    str += \"dmax            = dnum\\n\";\n    str += \"bmin            = bnum\\n\";\n    str += \"bmax            = bnum\\n\";\n    str += \"xmin            = xnum\\n\";\n    str += \"xmax            = xnum\\n\";\n    str += \"dnum            = 1*(%d48-57)\\n\";\n    str += \"bnum            = 1*%d48-49\\n\";\n    str += \"xnum            = 1*(%d48-57 / %d65-70 / %d97-102)\\n\";\n    str += \";\\n\";\n    str += \"; Basics\\n\";\n    str += \"alphanum        = (%d97-122/%d65-90) *(%d97-122/%d65-90/%d48-57/%d45)\\n\";\n    str += \"owsp            = *space\\n\";\n    str += \"wsp             = 1*space\\n\";\n    str += \"space           = %d32\\n\";\n    str += \"                / %d9\\n\";\n    str += \"                / comment\\n\";\n    str += \"                / LineContinue\\n\";\n    str += \"comment         = %d59 *(%d32-126 / %d9)\\n\";\n    str += \"LineEnd         = %d13.10\\n\";\n    str += \"                / %d10\\n\";\n    str += \"                / %d13\\n\";\n    str += \"LineContinue    = (%d13.10 / %d10 / %d13) (%d32 / %d9)\\n\";\n    return str;\n  }\n}\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// These are the AST translation callback functions used by the scanner\n// to analyze the characters and lines.\nconst ids = require('../apg-lib/identifiers');\nconst utils = require('../apg-lib/utilities');\n\nfunction semLine(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.endLength = 0;\n    data.textLength = 0;\n    data.invalidCount = 0;\n  } else {\n    data.lines.push({\n      lineNo: data.lines.length,\n      beginChar: phraseIndex,\n      length: phraseCount,\n      textLength: data.textLength,\n      endType: data.endType,\n      invalidChars: data.invalidCount,\n    });\n  }\n  return ids.SEM_OK;\n}\nfunction semLineText(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.textLength = phraseCount;\n  }\n  return ids.SEM_OK;\n}\nfunction semLastLine(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.endLength = 0;\n    data.textLength = 0;\n    data.invalidCount = 0;\n  } else if (data.strict) {\n    data.lines.push({\n      lineNo: data.lines.length,\n      beginChar: phraseIndex,\n      length: phraseCount,\n      textLength: phraseCount,\n      endType: 'none',\n      invalidChars: data.invalidCount,\n    });\n    data.errors.push({\n      line: data.lineNo,\n      char: phraseIndex + phraseCount,\n      msg: 'no line end on last line - strict ABNF specifies CRLF(\\\\r\\\\n, \\\\x0D\\\\x0A)',\n    });\n  } else {\n    /* add a line ender */\n    chars.push(10);\n    data.lines.push({\n      lineNo: data.lines.length,\n      beginChar: phraseIndex,\n      length: phraseCount + 1,\n      textLength: phraseCount,\n      endType: 'LF',\n      invalidChars: data.invalidCount,\n    });\n  }\n  return ids.SEM_OK;\n}\nfunction semInvalid(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.errors.push({\n      line: data.lineNo,\n      char: phraseIndex,\n      msg: `invalid character found '\\\\x${utils.charToHex(chars[phraseIndex])}'`,\n    });\n  }\n  return ids.SEM_OK;\n}\nfunction semEnd(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_POST) {\n    data.lineNo += 1;\n  }\n  return ids.SEM_OK;\n}\nfunction semLF(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.endType = 'LF';\n    if (data.strict) {\n      data.errors.push({\n        line: data.lineNo,\n        char: phraseIndex,\n        msg: 'line end character LF(\\\\n, \\\\x0A) - strict ABNF specifies CRLF(\\\\r\\\\n, \\\\x0D\\\\x0A)',\n      });\n    }\n  }\n  return ids.SEM_OK;\n}\nfunction semCR(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.endType = 'CR';\n    if (data.strict) {\n      data.errors.push({\n        line: data.lineNo,\n        char: phraseIndex,\n        msg: 'line end character CR(\\\\r, \\\\x0D) - strict ABNF specifies CRLF(\\\\r\\\\n, \\\\x0D\\\\x0A)',\n      });\n    }\n  }\n  return ids.SEM_OK;\n}\nfunction semCRLF(state, chars, phraseIndex, phraseCount, data) {\n  if (state === ids.SEM_PRE) {\n    data.endType = 'CRLF';\n  }\n  return ids.SEM_OK;\n}\nconst callbacks = [];\ncallbacks.line = semLine;\ncallbacks['line-text'] = semLineText;\ncallbacks['last-line'] = semLastLine;\ncallbacks.invalid = semInvalid;\ncallbacks.end = semEnd;\ncallbacks.lf = semLF;\ncallbacks.cr = semCR;\ncallbacks.crlf = semCRLF;\nexports.callbacks = callbacks;\n","// copyright: Copyright (c) 2024 Lowell D. Thomas, all rights reserved<br>\n//   license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)<br>\n//\n// Generated by apg-js, Version 4.4.0 [apg-js](https://github.com/ldthomas/apg-js)\nmodule.exports = function grammar(){\n  // ```\n  // SUMMARY\n  //      rules = 10\n  //       udts = 0\n  //    opcodes = 31\n  //        ---   ABNF original opcodes\n  //        ALT = 5\n  //        CAT = 2\n  //        REP = 4\n  //        RNM = 11\n  //        TLS = 0\n  //        TBS = 4\n  //        TRG = 5\n  //        ---   SABNF superset opcodes\n  //        UDT = 0\n  //        AND = 0\n  //        NOT = 0\n  //        BKA = 0\n  //        BKN = 0\n  //        BKR = 0\n  //        ABG = 0\n  //        AEN = 0\n  // characters = [0 - 4294967295]\n  // ```\n  /* OBJECT IDENTIFIER (for internal parser use) */\n  this.grammarObject = 'grammarObject';\n\n  /* RULES */\n  this.rules = [];\n  this.rules[0] = { name: 'file', lower: 'file', index: 0, isBkr: false };\n  this.rules[1] = { name: 'line', lower: 'line', index: 1, isBkr: false };\n  this.rules[2] = { name: 'line-text', lower: 'line-text', index: 2, isBkr: false };\n  this.rules[3] = { name: 'last-line', lower: 'last-line', index: 3, isBkr: false };\n  this.rules[4] = { name: 'valid', lower: 'valid', index: 4, isBkr: false };\n  this.rules[5] = { name: 'invalid', lower: 'invalid', index: 5, isBkr: false };\n  this.rules[6] = { name: 'end', lower: 'end', index: 6, isBkr: false };\n  this.rules[7] = { name: 'CRLF', lower: 'crlf', index: 7, isBkr: false };\n  this.rules[8] = { name: 'LF', lower: 'lf', index: 8, isBkr: false };\n  this.rules[9] = { name: 'CR', lower: 'cr', index: 9, isBkr: false };\n\n  /* UDTS */\n  this.udts = [];\n\n  /* OPCODES */\n  /* file */\n  this.rules[0].opcodes = [];\n  this.rules[0].opcodes[0] = { type: 2, children: [1,3] };// CAT\n  this.rules[0].opcodes[1] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[0].opcodes[2] = { type: 4, index: 1 };// RNM(line)\n  this.rules[0].opcodes[3] = { type: 3, min: 0, max: 1 };// REP\n  this.rules[0].opcodes[4] = { type: 4, index: 3 };// RNM(last-line)\n\n  /* line */\n  this.rules[1].opcodes = [];\n  this.rules[1].opcodes[0] = { type: 2, children: [1,2] };// CAT\n  this.rules[1].opcodes[1] = { type: 4, index: 2 };// RNM(line-text)\n  this.rules[1].opcodes[2] = { type: 4, index: 6 };// RNM(end)\n\n  /* line-text */\n  this.rules[2].opcodes = [];\n  this.rules[2].opcodes[0] = { type: 3, min: 0, max: Infinity };// REP\n  this.rules[2].opcodes[1] = { type: 1, children: [2,3] };// ALT\n  this.rules[2].opcodes[2] = { type: 4, index: 4 };// RNM(valid)\n  this.rules[2].opcodes[3] = { type: 4, index: 5 };// RNM(invalid)\n\n  /* last-line */\n  this.rules[3].opcodes = [];\n  this.rules[3].opcodes[0] = { type: 3, min: 1, max: Infinity };// REP\n  this.rules[3].opcodes[1] = { type: 1, children: [2,3] };// ALT\n  this.rules[3].opcodes[2] = { type: 4, index: 4 };// RNM(valid)\n  this.rules[3].opcodes[3] = { type: 4, index: 5 };// RNM(invalid)\n\n  /* valid */\n  this.rules[4].opcodes = [];\n  this.rules[4].opcodes[0] = { type: 1, children: [1,2] };// ALT\n  this.rules[4].opcodes[1] = { type: 5, min: 32, max: 126 };// TRG\n  this.rules[4].opcodes[2] = { type: 6, string: [9] };// TBS\n\n  /* invalid */\n  this.rules[5].opcodes = [];\n  this.rules[5].opcodes[0] = { type: 1, children: [1,2,3,4] };// ALT\n  this.rules[5].opcodes[1] = { type: 5, min: 0, max: 8 };// TRG\n  this.rules[5].opcodes[2] = { type: 5, min: 11, max: 12 };// TRG\n  this.rules[5].opcodes[3] = { type: 5, min: 14, max: 31 };// TRG\n  this.rules[5].opcodes[4] = { type: 5, min: 127, max: 4294967295 };// TRG\n\n  /* end */\n  this.rules[6].opcodes = [];\n  this.rules[6].opcodes[0] = { type: 1, children: [1,2,3] };// ALT\n  this.rules[6].opcodes[1] = { type: 4, index: 7 };// RNM(CRLF)\n  this.rules[6].opcodes[2] = { type: 4, index: 8 };// RNM(LF)\n  this.rules[6].opcodes[3] = { type: 4, index: 9 };// RNM(CR)\n\n  /* CRLF */\n  this.rules[7].opcodes = [];\n  this.rules[7].opcodes[0] = { type: 6, string: [13,10] };// TBS\n\n  /* LF */\n  this.rules[8].opcodes = [];\n  this.rules[8].opcodes[0] = { type: 6, string: [10] };// TBS\n\n  /* CR */\n  this.rules[9].opcodes = [];\n  this.rules[9].opcodes[0] = { type: 6, string: [13] };// TBS\n\n  // The `toString()` function will display the original grammar file(s) that produced these opcodes.\n  this.toString = function toString(){\n    let str = \"\";\n    str += \"file = *line [last-line]\\n\";\n    str += \"line = line-text end\\n\";\n    str += \"line-text = *(valid/invalid)\\n\";\n    str += \"last-line = 1*(valid/invalid)\\n\";\n    str += \"valid = %d32-126 / %d9\\n\";\n    str += \"invalid = %d0-8 / %d11-12 /%d14-31 / %x7f-ffffffff\\n\";\n    str += \"end = CRLF / LF / CR\\n\";\n    str += \"CRLF = %d13.10\\n\";\n    str += \"LF = %d10\\n\";\n    str += \"CR = %d13\\n\";\n    return str;\n  }\n}\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module reads the input grammar file and does a preliminary analysis\n// before attempting to parse it into a grammar object.\n// See:<br>\n// `./dist/scanner-grammar.bnf`<br>\n// for the grammar file this parser is based on.\n//\n// It has two primary functions.\n// - verify the character codes - no non-printing ASCII characters\n// - catalog the lines - create an array with a line object for each line.\n// The object carries information about the line number and character length which is used\n// by the parser generator primarily for error reporting.\nmodule.exports = function exfn(chars, errors, strict, trace) {\n  const thisFileName = 'scanner.js: ';\n  const apglib = require('../apg-lib/node-exports');\n  const grammar = new (require('./scanner-grammar'))();\n  const { callbacks } = require('./scanner-callbacks');\n\n  /* Scan the grammar for character code errors and catalog the lines. */\n  const lines = [];\n  // eslint-disable-next-line new-cap\n  const parser = new apglib.parser();\n  // eslint-disable-next-line new-cap\n  parser.ast = new apglib.ast();\n  parser.ast.callbacks = callbacks;\n  if (trace) {\n    if (trace.traceObject !== 'traceObject') {\n      throw new TypeError(`${thisFileName}trace argument is not a trace object`);\n    }\n    parser.trace = trace;\n  }\n\n  /* parse the input SABNF grammar */\n  const test = parser.parse(grammar, 'file', chars);\n  if (test.success !== true) {\n    errors.push({\n      line: 0,\n      char: 0,\n      msg: 'syntax analysis error analyzing input SABNF grammar',\n    });\n    return;\n  }\n  const data = {\n    lines,\n    lineNo: 0,\n    errors,\n    strict: !!strict,\n  };\n\n  /* translate (analyze) the input SABNF grammar */\n  parser.ast.translate(data);\n  // eslint-disable-next-line consistent-return\n  return lines;\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module has all of the AST translation callback functions for the semantic analysis\n// phase of the generator.\n// See:<br>\n// `./dist/abnf-for-sabnf-grammar.bnf`<br>\n// for the grammar file these callback functions are based on.\nmodule.exports = function exfn() {\n  const apglib = require('../apg-lib/node-exports');\n  const id = apglib.ids;\n\n  /* Some helper functions. */\n  const NameList = function NameList() {\n    this.names = [];\n    /* Adds a new rule name object to the list. Returns -1 if the name already exists. */\n    /* Returns the added name object if the name does not already exist. */\n    this.add = function add(name) {\n      let ret = -1;\n      const find = this.get(name);\n      if (find === -1) {\n        ret = {\n          name,\n          lower: name.toLowerCase(),\n          index: this.names.length,\n        };\n        this.names.push(ret);\n      }\n      return ret;\n    };\n    /* Brute-force look up. */\n    this.get = function get(name) {\n      let ret = -1;\n      const lower = name.toLowerCase();\n      for (let i = 0; i < this.names.length; i += 1) {\n        if (this.names[i].lower === lower) {\n          ret = this.names[i];\n          break;\n        }\n      }\n      return ret;\n    };\n  };\n  /* converts text decimal numbers from, e.g. %d99, to an integer */\n  const decnum = function decnum(chars, beg, len) {\n    let num = 0;\n    for (let i = beg; i < beg + len; i += 1) {\n      num = 10 * num + chars[i] - 48;\n    }\n    return num;\n  };\n  /* converts text binary numbers from, e.g. %b10, to an integer */\n  const binnum = function binnum(chars, beg, len) {\n    let num = 0;\n    for (let i = beg; i < beg + len; i += 1) {\n      num = 2 * num + chars[i] - 48;\n    }\n    return num;\n  };\n  /* converts text hexadecimal numbers from, e.g. %xff, to an integer */\n  const hexnum = function hexnum(chars, beg, len) {\n    let num = 0;\n    for (let i = beg; i < beg + len; i += 1) {\n      let digit = chars[i];\n      if (digit >= 48 && digit <= 57) {\n        digit -= 48;\n      } else if (digit >= 65 && digit <= 70) {\n        digit -= 55;\n      } else if (digit >= 97 && digit <= 102) {\n        digit -= 87;\n      } else {\n        throw new Error('hexnum out of range');\n      }\n      num = 16 * num + digit;\n    }\n    return num;\n  };\n\n  // This is the prototype for all semantic analysis callback functions.\n  // ````\n  // state - the translator state\n  //   id.SEM_PRE for downward (pre-branch) traversal of the AST\n  //   id.SEM_POST for upward (post branch) traversal of the AST\n  // chars - the array of character codes for the input string\n  // phraseIndex - index into the chars array to the first\n  //               character of the phrase\n  // phraseCount - the number of characters in the phrase\n  // data - user-defined data passed to the translator\n  //        for use by the callback functions.\n  // @return id.SEM_OK, normal return.\n  //         id.SEM_SKIP in state id.SEM_PRE will\n  //         skip the branch below.\n  //         Any thing else is an error which will\n  //         stop the translation.\n  // ````\n  /*\n  function semCallbackPrototype(state, chars, phraseIndex, phraseCount, data) {\n    let ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n    } else if (state === id.SEM_POST) {\n    }\n    return ret;\n  }\n  */\n  // The AST callback functions.\n  function semFile(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.ruleNames = new NameList();\n      data.udtNames = new NameList();\n      data.rules = [];\n      data.udts = [];\n      data.rulesLineMap = [];\n      data.opcodes = [];\n      data.altStack = [];\n      data.topStack = null;\n      data.topRule = null;\n    } else if (state === id.SEM_POST) {\n      /* validate RNM rule names and set opcode rule index */\n      let nameObj;\n      data.rules.forEach((rule) => {\n        rule.isBkr = false;\n        rule.opcodes.forEach((op) => {\n          if (op.type === id.RNM) {\n            nameObj = data.ruleNames.get(op.index.name);\n            if (nameObj === -1) {\n              data.errors.push({\n                line: data.findLine(data.lines, op.index.phraseIndex, data.charsLength),\n                char: op.index.phraseIndex,\n                msg: `Rule name '${op.index.name}' used but not defined.`,\n              });\n              op.index = -1;\n            } else {\n              op.index = nameObj.index;\n            }\n          }\n        });\n      });\n      /* validate BKR rule names and set opcode rule index */\n      data.udts.forEach((udt) => {\n        udt.isBkr = false;\n      });\n      data.rules.forEach((rule) => {\n        rule.opcodes.forEach((op) => {\n          if (op.type === id.BKR) {\n            rule.hasBkr = true;\n            nameObj = data.ruleNames.get(op.index.name);\n            if (nameObj !== -1) {\n              data.rules[nameObj.index].isBkr = true;\n              op.index = nameObj.index;\n            } else {\n              nameObj = data.udtNames.get(op.index.name);\n              if (nameObj !== -1) {\n                data.udts[nameObj.index].isBkr = true;\n                op.index = data.rules.length + nameObj.index;\n              } else {\n                data.errors.push({\n                  line: data.findLine(data.lines, op.index.phraseIndex, data.charsLength),\n                  char: op.index.phraseIndex,\n                  msg: `Back reference name '${op.index.name}' refers to undefined rule or unamed UDT.`,\n                });\n                op.index = -1;\n              }\n            }\n          }\n        });\n      });\n    }\n    return ret;\n  }\n  function semRule(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.altStack.length = 0;\n      data.topStack = null;\n      data.rulesLineMap.push({\n        line: data.findLine(data.lines, phraseIndex, data.charsLength),\n        char: phraseIndex,\n      });\n    }\n    return ret;\n  }\n  function semRuleLookup(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.ruleName = '';\n      data.definedas = '';\n    } else if (state === id.SEM_POST) {\n      let ruleName;\n      if (data.definedas === '=') {\n        ruleName = data.ruleNames.add(data.ruleName);\n        if (ruleName === -1) {\n          data.definedas = null;\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `Rule name '${data.ruleName}' previously defined.`,\n          });\n        } else {\n          /* start a new rule */\n          data.topRule = {\n            name: ruleName.name,\n            lower: ruleName.lower,\n            opcodes: [],\n            index: ruleName.index,\n          };\n          data.rules.push(data.topRule);\n          data.opcodes = data.topRule.opcodes;\n        }\n      } else {\n        ruleName = data.ruleNames.get(data.ruleName);\n        if (ruleName === -1) {\n          data.definedas = null;\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `Rule name '${data.ruleName}' for incremental alternate not previously defined.`,\n          });\n        } else {\n          data.topRule = data.rules[ruleName.index];\n          data.opcodes = data.topRule.opcodes;\n        }\n      }\n    }\n    return ret;\n  }\n  function semAlternation(state, chars, phraseIndex, phraseCount, data) {\n    let ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      const TRUE = true;\n      while (TRUE) {\n        if (data.definedas === null) {\n          /* rule error - skip opcode generation */\n          ret = id.SEM_SKIP;\n          break;\n        }\n        if (data.topStack === null) {\n          /* top-level ALT */\n          if (data.definedas === '=') {\n            /* \"=\" new rule */\n            data.topStack = {\n              alt: {\n                type: id.ALT,\n                children: [],\n              },\n              cat: null,\n            };\n            data.altStack.push(data.topStack);\n            data.opcodes.push(data.topStack.alt);\n            break;\n          }\n          /* \"=/\" incremental alternate */\n          data.topStack = {\n            alt: data.opcodes[0],\n            cat: null,\n          };\n          data.altStack.push(data.topStack);\n          break;\n        }\n        /* lower-level ALT */\n        data.topStack = {\n          alt: {\n            type: id.ALT,\n            children: [],\n          },\n          cat: null,\n        };\n        data.altStack.push(data.topStack);\n        data.opcodes.push(data.topStack.alt);\n        break;\n      }\n    } else if (state === id.SEM_POST) {\n      data.altStack.pop();\n      if (data.altStack.length > 0) {\n        data.topStack = data.altStack[data.altStack.length - 1];\n      } else {\n        data.topStack = null;\n      }\n    }\n    return ret;\n  }\n  function semConcatenation(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.topStack.alt.children.push(data.opcodes.length);\n      data.topStack.cat = {\n        type: id.CAT,\n        children: [],\n      };\n      data.opcodes.push(data.topStack.cat);\n    } else if (state === id.SEM_POST) {\n      data.topStack.cat = null;\n    }\n    return ret;\n  }\n  function semRepetition(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.topStack.cat.children.push(data.opcodes.length);\n    }\n    return ret;\n  }\n  function semOptionOpen(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.REP,\n        min: 0,\n        max: 1,\n        char: phraseIndex,\n      });\n    }\n    return ret;\n  }\n  function semRuleName(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.ruleName = apglib.utils.charsToString(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semDefined(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.definedas = '=';\n    }\n    return ret;\n  }\n  function semIncAlt(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.definedas = '=/';\n    }\n    return ret;\n  }\n  function semRepOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.min = 0;\n      data.max = Infinity;\n      data.topRep = {\n        type: id.REP,\n        min: 0,\n        max: Infinity,\n      };\n      data.opcodes.push(data.topRep);\n    } else if (state === id.SEM_POST) {\n      if (data.min > data.max) {\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: `repetition min cannot be greater than max: min: ${data.min}: max: ${data.max}`,\n        });\n      }\n      data.topRep.min = data.min;\n      data.topRep.max = data.max;\n    }\n    return ret;\n  }\n  function semRepMin(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.min = decnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semRepMax(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.max = decnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semRepMinMax(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.max = decnum(chars, phraseIndex, phraseCount);\n      data.min = data.max;\n    }\n    return ret;\n  }\n  function semAndOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.AND,\n      });\n    }\n    return ret;\n  }\n  function semNotOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.NOT,\n      });\n    }\n    return ret;\n  }\n  function semRnmOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.RNM,\n        /* NOTE: this is temporary info, index will be replaced with integer later. */\n        /* Probably not the best coding practice but here you go. */\n        index: {\n          phraseIndex,\n          name: apglib.utils.charsToString(chars, phraseIndex, phraseCount),\n        },\n      });\n    }\n    return ret;\n  }\n  function semAbgOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.ABG,\n      });\n    }\n    return ret;\n  }\n  function semAenOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.AEN,\n      });\n    }\n    return ret;\n  }\n  function semBkaOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.BKA,\n      });\n    }\n    return ret;\n  }\n  function semBknOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.BKN,\n      });\n    }\n    return ret;\n  }\n  function semBkrOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.ci = true; /* default to case insensitive */\n      data.cs = false;\n      data.um = true;\n      data.pm = false;\n    } else if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.BKR,\n        bkrCase: data.cs === true ? id.BKR_MODE_CS : id.BKR_MODE_CI,\n        bkrMode: data.pm === true ? id.BKR_MODE_PM : id.BKR_MODE_UM,\n        /* NOTE: this is temporary info, index will be replaced with integer later. */\n        /* Probably not the best coding practice but here you go. */\n        index: {\n          phraseIndex: data.bkrname.phraseIndex,\n          name: apglib.utils.charsToString(chars, data.bkrname.phraseIndex, data.bkrname.phraseLength),\n        },\n      });\n    }\n    return ret;\n  }\n  function semBkrCi(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.ci = true;\n    }\n    return ret;\n  }\n  function semBkrCs(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.cs = true;\n    }\n    return ret;\n  }\n  function semBkrUm(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.um = true;\n    }\n    return ret;\n  }\n  function semBkrPm(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.pm = true;\n    }\n    return ret;\n  }\n  function semBkrName(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.bkrname = {\n        phraseIndex,\n        phraseLength: phraseCount,\n      };\n    }\n    return ret;\n  }\n  function semUdtEmpty(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      const name = apglib.utils.charsToString(chars, phraseIndex, phraseCount);\n      let udtName = data.udtNames.add(name);\n      if (udtName === -1) {\n        udtName = data.udtNames.get(name);\n        if (udtName === -1) {\n          throw new Error('semUdtEmpty: name look up error');\n        }\n      } else {\n        data.udts.push({\n          name: udtName.name,\n          lower: udtName.lower,\n          index: udtName.index,\n          empty: true,\n        });\n      }\n      data.opcodes.push({\n        type: id.UDT,\n        empty: true,\n        index: udtName.index,\n      });\n    }\n    return ret;\n  }\n  function semUdtNonEmpty(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      const name = apglib.utils.charsToString(chars, phraseIndex, phraseCount);\n      let udtName = data.udtNames.add(name);\n      if (udtName === -1) {\n        udtName = data.udtNames.get(name);\n        if (udtName === -1) {\n          throw new Error('semUdtNonEmpty: name look up error');\n        }\n      } else {\n        data.udts.push({\n          name: udtName.name,\n          lower: udtName.lower,\n          index: udtName.index,\n          empty: false,\n        });\n      }\n      data.opcodes.push({\n        type: id.UDT,\n        empty: false,\n        index: udtName.index,\n        syntax: null,\n        semantic: null,\n      });\n    }\n    return ret;\n  }\n  function semTlsOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.tlscase = true; /* default to case insensitive */\n    }\n    return ret;\n  }\n  function semTlsCase(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      if (phraseCount > 0 && (chars[phraseIndex + 1] === 83 || chars[phraseIndex + 1] === 115)) {\n        data.tlscase = false; /* set to case sensitive */\n      }\n    }\n    return ret;\n  }\n  function semTlsString(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      if (data.tlscase) {\n        const str = chars.slice(phraseIndex, phraseIndex + phraseCount);\n        for (let i = 0; i < str.length; i += 1) {\n          if (str[i] >= 65 && str[i] <= 90) {\n            str[i] += 32;\n          }\n        }\n        data.opcodes.push({\n          type: id.TLS,\n          string: str,\n        });\n      } else {\n        data.opcodes.push({\n          type: id.TBS,\n          string: chars.slice(phraseIndex, phraseIndex + phraseCount),\n        });\n      }\n    }\n    return ret;\n  }\n  function semClsOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      if (phraseCount <= 2) {\n        /* only TLS is allowed to be empty */\n        data.opcodes.push({\n          type: id.TLS,\n          string: [],\n        });\n      } else {\n        data.opcodes.push({\n          type: id.TBS,\n          string: chars.slice(phraseIndex + 1, phraseIndex + phraseCount - 1),\n        });\n      }\n    }\n    return ret;\n  }\n  function semTbsOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.tbsstr = [];\n    } else if (state === id.SEM_POST) {\n      data.opcodes.push({\n        type: id.TBS,\n        string: data.tbsstr,\n      });\n    }\n    return ret;\n  }\n  function semTrgOp(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_PRE) {\n      data.min = 0;\n      data.max = 0;\n    } else if (state === id.SEM_POST) {\n      if (data.min > data.max) {\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: `TRG, (%dmin-max), min cannot be greater than max: min: ${data.min}: max: ${data.max}`,\n        });\n      }\n      data.opcodes.push({\n        type: id.TRG,\n        min: data.min,\n        max: data.max,\n      });\n    }\n    return ret;\n  }\n  function semDmin(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.min = decnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semDmax(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.max = decnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semBmin(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.min = binnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semBmax(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.max = binnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semXmin(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.min = hexnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semXmax(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.max = hexnum(chars, phraseIndex, phraseCount);\n    }\n    return ret;\n  }\n  function semDstring(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.tbsstr.push(decnum(chars, phraseIndex, phraseCount));\n    }\n    return ret;\n  }\n  function semBstring(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.tbsstr.push(binnum(chars, phraseIndex, phraseCount));\n    }\n    return ret;\n  }\n  function semXstring(state, chars, phraseIndex, phraseCount, data) {\n    const ret = id.SEM_OK;\n    if (state === id.SEM_POST) {\n      data.tbsstr.push(hexnum(chars, phraseIndex, phraseCount));\n    }\n    return ret;\n  }\n  // Define the callback functions to the AST object.\n  this.callbacks = [];\n  this.callbacks.abgop = semAbgOp;\n  this.callbacks.aenop = semAenOp;\n  this.callbacks.alternation = semAlternation;\n  this.callbacks.andop = semAndOp;\n  this.callbacks.bmax = semBmax;\n  this.callbacks.bmin = semBmin;\n  this.callbacks.bkaop = semBkaOp;\n  this.callbacks.bknop = semBknOp;\n  this.callbacks.bkrop = semBkrOp;\n  this.callbacks['bkr-name'] = semBkrName;\n  this.callbacks.bstring = semBstring;\n  this.callbacks.clsop = semClsOp;\n  this.callbacks.ci = semBkrCi;\n  this.callbacks.cs = semBkrCs;\n  this.callbacks.um = semBkrUm;\n  this.callbacks.pm = semBkrPm;\n  this.callbacks.concatenation = semConcatenation;\n  this.callbacks.defined = semDefined;\n  this.callbacks.dmax = semDmax;\n  this.callbacks.dmin = semDmin;\n  this.callbacks.dstring = semDstring;\n  this.callbacks.file = semFile;\n  this.callbacks.incalt = semIncAlt;\n  this.callbacks.notop = semNotOp;\n  this.callbacks.optionopen = semOptionOpen;\n  this.callbacks['rep-max'] = semRepMax;\n  this.callbacks['rep-min'] = semRepMin;\n  this.callbacks['rep-min-max'] = semRepMinMax;\n  this.callbacks.repetition = semRepetition;\n  this.callbacks.repop = semRepOp;\n  this.callbacks.rnmop = semRnmOp;\n  this.callbacks.rule = semRule;\n  this.callbacks.rulelookup = semRuleLookup;\n  this.callbacks.rulename = semRuleName;\n  this.callbacks.tbsop = semTbsOp;\n  this.callbacks.tlscase = semTlsCase;\n  this.callbacks.tlsstring = semTlsString;\n  this.callbacks.tlsop = semTlsOp;\n  this.callbacks.trgop = semTrgOp;\n  this.callbacks['udt-empty'] = semUdtEmpty;\n  this.callbacks['udt-non-empty'] = semUdtNonEmpty;\n  this.callbacks.xmax = semXmax;\n  this.callbacks.xmin = semXmin;\n  this.callbacks.xstring = semXstring;\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\nmodule.exports = (function exfn() {\n  const thisFileName = 'show-rules.js';\n  // Display the rules.\n  // This function may be called before the attributes calculation.\n  // Sorting is done independently from the attributes.\n  // - order\n  //      - \"index\" or \"i\", index order (default)\n  //      - \"alpha\" or \"a\", alphabetical order\n  //      - none of above, index order (default)\n  const showRules = function showRules(rulesIn = [], udtsIn = [], order = 'index') {\n    const thisFuncName = 'showRules';\n    let alphaArray = [];\n    let udtAlphaArray = [];\n    const indexArray = [];\n    const udtIndexArray = [];\n    const rules = rulesIn;\n    const udts = udtsIn;\n    const ruleCount = rulesIn.length;\n    const udtCount = udtsIn.length;\n    let str = 'RULE/UDT NAMES';\n    let i;\n    function compRulesAlpha(left, right) {\n      if (rules[left].lower < rules[right].lower) {\n        return -1;\n      }\n      if (rules[left].lower > rules[right].lower) {\n        return 1;\n      }\n      return 0;\n    }\n    function compUdtsAlpha(left, right) {\n      if (udts[left].lower < udts[right].lower) {\n        return -1;\n      }\n      if (udts[left].lower > udts[right].lower) {\n        return 1;\n      }\n      return 0;\n    }\n    if (!(Array.isArray(rulesIn) && rulesIn.length)) {\n      throw new Error(`${thisFileName}:${thisFuncName}: rules arg must be array with length > 0`);\n    }\n    if (!Array.isArray(udtsIn)) {\n      throw new Error(`${thisFileName}:${thisFuncName}: udts arg must be array`);\n    }\n\n    for (i = 0; i < ruleCount; i += 1) {\n      indexArray.push(i);\n    }\n    alphaArray = indexArray.slice(0);\n    alphaArray.sort(compRulesAlpha);\n    if (udtCount) {\n      for (i = 0; i < udtCount; i += 1) {\n        udtIndexArray.push(i);\n      }\n      udtAlphaArray = udtIndexArray.slice(0);\n      udtAlphaArray.sort(compUdtsAlpha);\n    }\n    if (order.charCodeAt(0) === 97) {\n      str += ' - alphabetical by rule/UDT name\\n';\n      for (i = 0; i < ruleCount; i += 1) {\n        str += `${i}: ${alphaArray[i]}: ${rules[alphaArray[i]].name}\\n`;\n      }\n      if (udtCount) {\n        for (i = 0; i < udtCount; i += 1) {\n          str += `${i}: ${udtAlphaArray[i]}: ${udts[udtAlphaArray[i]].name}\\n`;\n        }\n      }\n    } else {\n      str += ' - ordered by rule/UDT index\\n';\n      for (i = 0; i < ruleCount; i += 1) {\n        str += `${i}: ${rules[i].name}\\n`;\n      }\n      if (udtCount) {\n        for (i = 0; i < udtCount; i += 1) {\n          str += `${i}: ${udts[i].name}\\n`;\n        }\n      }\n    }\n    return str;\n  };\n  return showRules;\n})();\n","/* eslint-disable func-names */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module has all of the callback functions for the syntax phase of the generation.\n// See:<br>\n// `./dist/abnf-for-sabnf-grammar.bnf`<br>\n// for the grammar file these callback functions are based on.\nmodule.exports = function exfn() {\n  const thisFileName = 'syntax-callbacks.js: ';\n  const apglib = require('../apg-lib/node-exports');\n  const id = apglib.ids;\n  let topAlt;\n  /* syntax, RNM, callback functions */\n  const synFile = function synFile(result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        data.altStack = [];\n        data.repCount = 0;\n        break;\n      case id.EMPTY:\n        data.errors.push({\n          line: 0,\n          char: 0,\n          msg: 'grammar file is empty',\n        });\n        break;\n      case id.MATCH:\n        if (data.ruleCount === 0) {\n          data.errors.push({\n            line: 0,\n            char: 0,\n            msg: 'no rules defined',\n          });\n        }\n        break;\n      case id.NOMATCH:\n        throw new Error(`${thisFileName}synFile: grammar file NOMATCH: design error: should never happen.`);\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  // eslint-disable-next-line func-names\n  const synRule = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        data.altStack.length = 0;\n        topAlt = {\n          groupOpen: null,\n          groupError: false,\n          optionOpen: null,\n          optionError: false,\n          tlsOpen: null,\n          clsOpen: null,\n          prosValOpen: null,\n          basicError: false,\n        };\n        data.altStack.push(topAlt);\n        break;\n      case id.EMPTY:\n        throw new Error(`${thisFileName}synRule: EMPTY: rule cannot be empty`);\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.ruleCount += 1;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synRuleError = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: 'Unrecognized SABNF line. Invalid rule, comment or blank line.',\n        });\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synRuleNameError = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: 'Rule names must be alphanum and begin with alphabetic character.',\n        });\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synDefinedAsError = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: \"Expected '=' or '=/'. Not found.\",\n        });\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synAndOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'AND operator(&) found - strict ABNF specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synNotOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'NOT operator(!) found - strict ABNF specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synBkaOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Positive look-behind operator(&&) found - strict ABNF specified.',\n          });\n        } else if (data.lite) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Positive look-behind operator(&&) found - apg-lite specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synBknOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Negative look-behind operator(!!) found - strict ABNF specified.',\n          });\n        } else if (data.lite) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Negative look-behind operator(!!) found - apg-lite specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synAbgOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Beginning of string anchor(%^) found - strict ABNF specified.',\n          });\n        } else if (data.lite) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Beginning of string anchor(%^) found - apg-lite specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synAenOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'End of string anchor(%$) found - strict ABNF specified.',\n          });\n        } else if (data.lite) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'End of string anchor(%$) found - apg-lite specified.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synBkrOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          const name = apglib.utils.charsToString(chars, phraseIndex, result.phraseLength);\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `Back reference operator(${name}) found - strict ABNF specified.`,\n          });\n        } else if (data.lite) {\n          const name = apglib.utils.charsToString(chars, phraseIndex, result.phraseLength);\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `Back reference operator(${name}) found - apg-lite specified.`,\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synUdtOp = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          const name = apglib.utils.charsToString(chars, phraseIndex, result.phraseLength);\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `UDT operator found(${name}) - strict ABNF specified.`,\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synTlsOpen = function (result, chars, phraseIndex) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        topAlt.tlsOpen = phraseIndex;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synTlsString = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        data.stringTabChar = false;\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.stringTabChar !== false) {\n          data.errors.push({\n            line: data.findLine(data.lines, data.stringTabChar),\n            char: data.stringTabChar,\n            msg: \"Tab character (\\\\t, x09) not allowed in literal string (see 'quoted-string' definition, RFC 7405.)\",\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synStringTab = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.stringTabChar = phraseIndex;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synTlsClose = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.tlsOpen),\n          char: topAlt.tlsOpen,\n          msg: 'Case-insensitive literal string(\"...\") opened but not closed.',\n        });\n        topAlt.basicError = true;\n        topAlt.tlsOpen = null;\n        break;\n      case id.MATCH:\n        topAlt.tlsOpen = null;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synClsOpen = function (result, chars, phraseIndex) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        topAlt.clsOpen = phraseIndex;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synClsString = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        data.stringTabChar = false;\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.stringTabChar !== false) {\n          data.errors.push({\n            line: data.findLine(data.lines, data.stringTabChar),\n            char: data.stringTabChar,\n            msg: 'Tab character (\\\\t, x09) not allowed in literal string.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synClsClose = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.clsOpen),\n          char: topAlt.clsOpen,\n          msg: \"Case-sensitive literal string('...') opened but not closed.\",\n        });\n        topAlt.clsOpen = null;\n        topAlt.basicError = true;\n        break;\n      case id.MATCH:\n        if (data.strict) {\n          data.errors.push({\n            line: data.findLine(data.lines, topAlt.clsOpen),\n            char: topAlt.clsOpen,\n            msg: \"Case-sensitive string operator('...') found - strict ABNF specified.\",\n          });\n        }\n        topAlt.clsOpen = null;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synProsValOpen = function (result, chars, phraseIndex) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        topAlt.prosValOpen = phraseIndex;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synProsValString = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        data.stringTabChar = false;\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (data.stringTabChar !== false) {\n          data.errors.push({\n            line: data.findLine(data.lines, data.stringTabChar),\n            char: data.stringTabChar,\n            msg: 'Tab character (\\\\t, x09) not allowed in prose value string.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synProsValClose = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.prosValOpen),\n          char: topAlt.prosValOpen,\n          msg: 'Prose value operator(<...>) opened but not closed.',\n        });\n        topAlt.basicError = true;\n        topAlt.prosValOpen = null;\n        break;\n      case id.MATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.prosValOpen),\n          char: topAlt.prosValOpen,\n          msg: 'Prose value operator(<...>) found. The ABNF syntax is valid, but a parser cannot be generated from this grammar.',\n        });\n        topAlt.prosValOpen = null;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synGroupOpen = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        topAlt = {\n          groupOpen: phraseIndex,\n          groupError: false,\n          optionOpen: null,\n          optionError: false,\n          tlsOpen: null,\n          clsOpen: null,\n          prosValOpen: null,\n          basicError: false,\n        };\n        data.altStack.push(topAlt);\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synGroupClose = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.groupOpen),\n          char: topAlt.groupOpen,\n          msg: 'Group \"(...)\" opened but not closed.',\n        });\n        topAlt = data.altStack.pop();\n        topAlt.groupError = true;\n        break;\n      case id.MATCH:\n        topAlt = data.altStack.pop();\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synOptionOpen = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        topAlt = {\n          groupOpen: null,\n          groupError: false,\n          optionOpen: phraseIndex,\n          optionError: false,\n          tlsOpen: null,\n          clsOpen: null,\n          prosValOpen: null,\n          basicError: false,\n        };\n        data.altStack.push(topAlt);\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synOptionClose = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, topAlt.optionOpen),\n          char: topAlt.optionOpen,\n          msg: 'Option \"[...]\" opened but not closed.',\n        });\n        topAlt = data.altStack.pop();\n        topAlt.optionError = true;\n        break;\n      case id.MATCH:\n        topAlt = data.altStack.pop();\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synBasicElementError = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (topAlt.basicError === false) {\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: 'Unrecognized SABNF element.',\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synLineEnd = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        if (result.phraseLength === 1 && data.strict) {\n          const end = chars[phraseIndex] === 13 ? 'CR' : 'LF';\n          data.errors.push({\n            line: data.findLine(data.lines, phraseIndex, data.charsLength),\n            char: phraseIndex,\n            msg: `Line end '${end}' found - strict ABNF specified, only CRLF allowed.`,\n          });\n        }\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synLineEndError = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        break;\n      case id.MATCH:\n        data.errors.push({\n          line: data.findLine(data.lines, phraseIndex, data.charsLength),\n          char: phraseIndex,\n          msg: 'Unrecognized grammar element or characters.',\n        });\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  const synRepetition = function (result, chars, phraseIndex, data) {\n    switch (result.state) {\n      case id.ACTIVE:\n        break;\n      case id.EMPTY:\n        break;\n      case id.NOMATCH:\n        data.repCount += 1;\n        break;\n      case id.MATCH:\n        data.repCount += 1;\n        break;\n      default:\n        throw new Error(`${thisFileName}synFile: unrecognized case.`);\n    }\n  };\n  // Define the list of callback functions.\n  this.callbacks = [];\n  this.callbacks.andop = synAndOp;\n  this.callbacks.basicelementerr = synBasicElementError;\n  this.callbacks.clsclose = synClsClose;\n  this.callbacks.clsopen = synClsOpen;\n  this.callbacks.clsstring = synClsString;\n  this.callbacks.definedaserror = synDefinedAsError;\n  this.callbacks.file = synFile;\n  this.callbacks.groupclose = synGroupClose;\n  this.callbacks.groupopen = synGroupOpen;\n  this.callbacks.lineenderror = synLineEndError;\n  this.callbacks.lineend = synLineEnd;\n  this.callbacks.notop = synNotOp;\n  this.callbacks.optionclose = synOptionClose;\n  this.callbacks.optionopen = synOptionOpen;\n  this.callbacks.prosvalclose = synProsValClose;\n  this.callbacks.prosvalopen = synProsValOpen;\n  this.callbacks.prosvalstring = synProsValString;\n  this.callbacks.repetition = synRepetition;\n  this.callbacks.rule = synRule;\n  this.callbacks.ruleerror = synRuleError;\n  this.callbacks.rulenameerror = synRuleNameError;\n  this.callbacks.stringtab = synStringTab;\n  this.callbacks.tlsclose = synTlsClose;\n  this.callbacks.tlsopen = synTlsOpen;\n  this.callbacks.tlsstring = synTlsString;\n  this.callbacks.udtop = synUdtOp;\n  this.callbacks.bkaop = synBkaOp;\n  this.callbacks.bknop = synBknOp;\n  this.callbacks.bkrop = synBkrOp;\n  this.callbacks.abgop = synAbgOp;\n  this.callbacks.aenop = synAenOp;\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module exposes the public encoding, decoding and conversion functions.\n// Its private functions provide the disassembling and interpetation of the source and destination encoding types.\n// In the case of Unicode encodings, private functions determine the presence of Byte Order Marks (BOMs), if any.\n//\n// Throws \"TypeError\" exceptions on input errors.\n//\n\n'use strict;';\n\nconst { Buffer } = require('buffer');\n\nconst trans = require('./transformers');\n\n/* types */\nconst UTF8 = 'UTF8';\nconst UTF16 = 'UTF16';\nconst UTF16BE = 'UTF16BE';\nconst UTF16LE = 'UTF16LE';\nconst UTF32 = 'UTF32';\nconst UTF32BE = 'UTF32BE';\nconst UTF32LE = 'UTF32LE';\nconst UINT7 = 'UINT7';\nconst ASCII = 'ASCII';\nconst BINARY = 'BINARY';\nconst UINT8 = 'UINT8';\nconst UINT16 = 'UINT16';\nconst UINT16LE = 'UINT16LE';\nconst UINT16BE = 'UINT16BE';\nconst UINT32 = 'UINT32';\nconst UINT32LE = 'UINT32LE';\nconst UINT32BE = 'UINT32BE';\nconst ESCAPED = 'ESCAPED';\nconst STRING = 'STRING';\n\n/* private functions */\n// Find the UTF8 BOM, if any.\nconst bom8 = function bom8(src) {\n  src.type = UTF8;\n  const buf = src.data;\n  src.bom = 0;\n  if (buf.length >= 3) {\n    if (buf[0] === 0xef && buf[1] === 0xbb && buf[2] === 0xbf) {\n      src.bom = 3;\n    }\n  }\n};\n// Find the UTF16 BOM, if any, and determine the UTF16 type.\n// Defaults to UTF16BE.\n// Throws TypeError exception if BOM does not match the specified type.\nconst bom16 = function bom16(src) {\n  const buf = src.data;\n  src.bom = 0;\n  switch (src.type) {\n    case UTF16:\n      src.type = UTF16BE;\n      if (buf.length >= 2) {\n        if (buf[0] === 0xfe && buf[1] === 0xff) {\n          src.bom = 2;\n        } else if (buf[0] === 0xff && buf[1] === 0xfe) {\n          src.type = UTF16LE;\n          src.bom = 2;\n        }\n      }\n      break;\n    case UTF16BE:\n      src.type = UTF16BE;\n      if (buf.length >= 2) {\n        if (buf[0] === 0xfe && buf[1] === 0xff) {\n          src.bom = 2;\n        } else if (buf[0] === 0xff && buf[1] === 0xfe) {\n          throw new TypeError(`src type: \"${UTF16BE}\" specified but BOM is for \"${UTF16LE}\"`);\n        }\n      }\n      break;\n    case UTF16LE:\n      src.type = UTF16LE;\n      if (buf.length >= 0) {\n        if (buf[0] === 0xfe && buf[1] === 0xff) {\n          throw new TypeError(`src type: \"${UTF16LE}\" specified but BOM is for \"${UTF16BE}\"`);\n        } else if (buf[0] === 0xff && buf[1] === 0xfe) {\n          src.bom = 2;\n        }\n      }\n      break;\n    default:\n      throw new TypeError(`UTF16 BOM: src type \"${src.type}\" unrecognized`);\n  }\n};\n// Find the UTF32 BOM, if any, and determine the UTF32 type.\n// Defaults to UTF32BE.\n// Throws exception if BOM does not match the specified type.\nconst bom32 = function bom32(src) {\n  const buf = src.data;\n  src.bom = 0;\n  switch (src.type) {\n    case UTF32:\n      src.type = UTF32BE;\n      if (buf.length >= 4) {\n        if (buf[0] === 0 && buf[1] === 0 && buf[2] === 0xfe && buf[3] === 0xff) {\n          src.bom = 4;\n        }\n        if (buf[0] === 0xff && buf[1] === 0xfe && buf[2] === 0 && buf[3] === 0) {\n          src.type = UTF32LE;\n          src.bom = 4;\n        }\n      }\n      break;\n    case UTF32BE:\n      src.type = UTF32BE;\n      if (buf.length >= 4) {\n        if (buf[0] === 0 && buf[1] === 0 && buf[2] === 0xfe && buf[3] === 0xff) {\n          src.bom = 4;\n        }\n        if (buf[0] === 0xff && buf[1] === 0xfe && buf[2] === 0 && buf[3] === 0) {\n          throw new TypeError(`src type: ${UTF32BE} specified but BOM is for ${UTF32LE}\"`);\n        }\n      }\n      break;\n    case UTF32LE:\n      src.type = UTF32LE;\n      if (buf.length >= 4) {\n        if (buf[0] === 0 && buf[1] === 0 && buf[2] === 0xfe && buf[3] === 0xff) {\n          throw new TypeError(`src type: \"${UTF32LE}\" specified but BOM is for \"${UTF32BE}\"`);\n        }\n        if (buf[0] === 0xff && buf[1] === 0xfe && buf[2] === 0 && buf[3] === 0) {\n          src.bom = 4;\n        }\n      }\n      break;\n    default:\n      throw new TypeError(`UTF32 BOM: src type \"${src.type}\" unrecognized`);\n  }\n};\n// Validates the source encoding type and matching data.\n// If the BASE64: prefix is present, the base 64 decoding is done here as the initial step.\n// - For type STRING, data must be a JavaScript string.\n// - For type BASE64:*, data may be a string or Buffer.\n// - For all other types, data must be a Buffer.\n// - The BASE64: prefix is not allowed for type STRING.\nconst validateSrc = function validateSrc(type, data) {\n  function getType(typeArg) {\n    const ret = {\n      type: '',\n      base64: false,\n    };\n    const rx = /^(base64:)?([a-zA-Z0-9]+)$/i;\n    const result = rx.exec(typeArg);\n    if (result) {\n      if (result[2]) {\n        ret.type = result[2].toUpperCase();\n      }\n      if (result[1]) {\n        ret.base64 = true;\n      }\n    }\n    return ret;\n  }\n  const ret = getType(type.toUpperCase());\n  if (ret.base64) {\n    /* handle base 64 */\n    if (ret.type === STRING) {\n      throw new TypeError(`type: \"${type} \"BASE64:\" prefix not allowed with type ${STRING}`);\n    }\n    if (Buffer.isBuffer(data)) {\n      ret.data = trans.base64.decode(data);\n    } else if (typeof data === 'string') {\n      const buf = Buffer.from(data, 'ascii');\n      ret.data = trans.base64.decode(buf);\n    } else {\n      throw new TypeError(`type: \"${type} unrecognized data type: typeof(data): ${typeof data}`);\n    }\n  } else {\n    ret.data = data;\n  }\n  switch (ret.type) {\n    case UTF8:\n      bom8(ret);\n      break;\n    case UTF16:\n    case UTF16BE:\n    case UTF16LE:\n      bom16(ret);\n      break;\n    case UTF32:\n    case UTF32BE:\n    case UTF32LE:\n      bom32(ret);\n      break;\n    case UINT16:\n      ret.type = UINT16BE;\n      break;\n    case UINT32:\n      ret.type = UINT32BE;\n      break;\n    case ASCII:\n      ret.type = UINT7;\n      break;\n    case BINARY:\n      ret.type = UINT8;\n      break;\n    case UINT7:\n    case UINT8:\n    case UINT16LE:\n    case UINT16BE:\n    case UINT32LE:\n    case UINT32BE:\n    case STRING:\n    case ESCAPED:\n      break;\n    default:\n      throw new TypeError(`type: \"${type}\" not recognized`);\n  }\n  if (ret.type === STRING) {\n    if (typeof ret.data !== 'string') {\n      throw new TypeError(`type: \"${type}\" but data is not a string`);\n    }\n  } else if (!Buffer.isBuffer(ret.data)) {\n    throw new TypeError(`type: \"${type}\" but data is not a Buffer`);\n  }\n  return ret;\n};\n// Disassembles and validates the destination type.\n// `chars` must be an Array of integers.\n// The :BASE64 suffix is not allowed for type STRING.\nconst validateDst = function validateDst(type, chars) {\n  function getType(typeArg) {\n    let fix;\n    let rem;\n    const ret = {\n      crlf: false,\n      lf: false,\n      base64: false,\n      type: '',\n    };\n    /* prefix, if any */\n    const TRUE = true;\n    while (TRUE) {\n      rem = typeArg;\n      fix = typeArg.slice(0, 5);\n      if (fix === 'CRLF:') {\n        ret.crlf = true;\n        rem = typeArg.slice(5);\n        break;\n      }\n      fix = typeArg.slice(0, 3);\n      if (fix === 'LF:') {\n        ret.lf = true;\n        rem = typeArg.slice(3);\n        break;\n      }\n      break;\n    }\n    /* suffix, if any */\n    fix = rem.split(':');\n    if (fix.length === 1) {\n      // eslint-disable-next-line prefer-destructuring\n      ret.type = fix[0];\n    } else if (fix.length === 2 && fix[1] === 'BASE64') {\n      ret.base64 = true;\n      // eslint-disable-next-line prefer-destructuring\n      ret.type = fix[0];\n    }\n    return ret;\n  }\n  if (!Array.isArray(chars)) {\n    throw new TypeError(`dst chars: not array: \"${typeof chars}`);\n  }\n  if (typeof type !== 'string') {\n    throw new TypeError(`dst type: not string: \"${typeof type}`);\n  }\n  const ret = getType(type.toUpperCase());\n  switch (ret.type) {\n    case UTF8:\n    case UTF16BE:\n    case UTF16LE:\n    case UTF32BE:\n    case UTF32LE:\n    case UINT7:\n    case UINT8:\n    case UINT16LE:\n    case UINT16BE:\n    case UINT32LE:\n    case UINT32BE:\n    case ESCAPED:\n      break;\n    case STRING:\n      if (ret.base64) {\n        throw new TypeError(`\":BASE64\" suffix not allowed with type ${STRING}`);\n      }\n      break;\n    case ASCII:\n      ret.type = UINT7;\n      break;\n    case BINARY:\n      ret.type = UINT8;\n      break;\n    case UTF16:\n      ret.type = UTF16BE;\n      break;\n    case UTF32:\n      ret.type = UTF32BE;\n      break;\n    case UINT16:\n      ret.type = UINT16BE;\n      break;\n    case UINT32:\n      ret.type = UINT32BE;\n      break;\n    default:\n      throw new TypeError(`dst type unrecognized: \"${type}\" : must have form [crlf:|lf:]type[:base64]`);\n  }\n  return ret;\n};\n// Select and call the requested encoding function.\nconst encode = function encode(type, chars) {\n  switch (type) {\n    case UTF8:\n      return trans.utf8.encode(chars);\n    case UTF16BE:\n      return trans.utf16be.encode(chars);\n    case UTF16LE:\n      return trans.utf16le.encode(chars);\n    case UTF32BE:\n      return trans.utf32be.encode(chars);\n    case UTF32LE:\n      return trans.utf32le.encode(chars);\n    case UINT7:\n      return trans.uint7.encode(chars);\n    case UINT8:\n      return trans.uint8.encode(chars);\n    case UINT16BE:\n      return trans.uint16be.encode(chars);\n    case UINT16LE:\n      return trans.uint16le.encode(chars);\n    case UINT32BE:\n      return trans.uint32be.encode(chars);\n    case UINT32LE:\n      return trans.uint32le.encode(chars);\n    case STRING:\n      return trans.string.encode(chars);\n    case ESCAPED:\n      return trans.escaped.encode(chars);\n    default:\n      throw new TypeError(`encode type \"${type}\" not recognized`);\n  }\n};\n// Select and call the requested decoding function.\n// `src` contains BOM information as well as the source type and data.\nconst decode = function decode(src) {\n  switch (src.type) {\n    case UTF8:\n      return trans.utf8.decode(src.data, src.bom);\n    case UTF16LE:\n      return trans.utf16le.decode(src.data, src.bom);\n    case UTF16BE:\n      return trans.utf16be.decode(src.data, src.bom);\n    case UTF32BE:\n      return trans.utf32be.decode(src.data, src.bom);\n    case UTF32LE:\n      return trans.utf32le.decode(src.data, src.bom);\n    case UINT7:\n      return trans.uint7.decode(src.data);\n    case UINT8:\n      return trans.uint8.decode(src.data);\n    case UINT16BE:\n      return trans.uint16be.decode(src.data);\n    case UINT16LE:\n      return trans.uint16le.decode(src.data);\n    case UINT32BE:\n      return trans.uint32be.decode(src.data);\n    case UINT32LE:\n      return trans.uint32le.decode(src.data);\n    case STRING:\n      return trans.string.decode(src.data);\n    case ESCAPED:\n      return trans.escaped.decode(src.data);\n    default:\n      throw new TypeError(`decode type \"${src.type}\" not recognized`);\n  }\n};\n\n// The public decoding function. Returns an array of integers.\nexports.decode = function exportsDecode(type, data) {\n  const src = validateSrc(type, data);\n  return decode(src);\n};\n// The public encoding function. Returns a Buffer-typed byte array.\nexports.encode = function exportsEncode(type, chars) {\n  let c;\n  let buf;\n  const dst = validateDst(type, chars);\n  if (dst.crlf) {\n    /* prefix with CRLF line end conversion, don't contaminate caller's chars array */\n    c = trans.lineEnds.crlf(chars);\n    buf = encode(dst.type, c);\n  } else if (dst.lf) {\n    /* prefix with LF line end conversion, don't contaminate caller's chars array */\n    c = trans.lineEnds.lf(chars);\n    buf = encode(dst.type, c);\n  } else {\n    buf = encode(dst.type, chars);\n  }\n  if (dst.base64) {\n    /* post base 64 encoding */\n    buf = trans.base64.encode(buf);\n  }\n  return buf;\n};\n// Converts data of type `srcType` to data of type `dstType`.\n// `srcData` may be a JavaScript String, or node.js Buffer, depending on the corresponding type.\nconst convert = function convert(srcType, srcData, dstType) {\n  return exports.encode(dstType, exports.decode(srcType, srcData));\n};\nexports.convert = convert;\n","/* eslint-disable prefer-destructuring */\n/* eslint-disable no-plusplus */\n/* eslint-disable no-bitwise */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module contains the actual encoding and decoding algorithms.\n// Throws \"RangeError\" exceptions on characters or bytes out of range for the given encoding.\n\n'use strict;';\n\nconst { Buffer } = require('buffer');\n\n/* decoding error codes */\nconst NON_SHORTEST = 0xfffffffc;\nconst TRAILING = 0xfffffffd;\nconst RANGE = 0xfffffffe;\nconst ILL_FORMED = 0xffffffff;\n\n/* mask[n] = 2**n - 1, ie. mask[n] = n bits on. e.g. mask[6] = %b111111 */\nconst mask = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023];\n\n/* ascii[n] = 'HH', where 0xHH = n, eg. ascii[254] = 'FE' */\nconst ascii = [\n  '00',\n  '01',\n  '02',\n  '03',\n  '04',\n  '05',\n  '06',\n  '07',\n  '08',\n  '09',\n  '0A',\n  '0B',\n  '0C',\n  '0D',\n  '0E',\n  '0F',\n  '10',\n  '11',\n  '12',\n  '13',\n  '14',\n  '15',\n  '16',\n  '17',\n  '18',\n  '19',\n  '1A',\n  '1B',\n  '1C',\n  '1D',\n  '1E',\n  '1F',\n  '20',\n  '21',\n  '22',\n  '23',\n  '24',\n  '25',\n  '26',\n  '27',\n  '28',\n  '29',\n  '2A',\n  '2B',\n  '2C',\n  '2D',\n  '2E',\n  '2F',\n  '30',\n  '31',\n  '32',\n  '33',\n  '34',\n  '35',\n  '36',\n  '37',\n  '38',\n  '39',\n  '3A',\n  '3B',\n  '3C',\n  '3D',\n  '3E',\n  '3F',\n  '40',\n  '41',\n  '42',\n  '43',\n  '44',\n  '45',\n  '46',\n  '47',\n  '48',\n  '49',\n  '4A',\n  '4B',\n  '4C',\n  '4D',\n  '4E',\n  '4F',\n  '50',\n  '51',\n  '52',\n  '53',\n  '54',\n  '55',\n  '56',\n  '57',\n  '58',\n  '59',\n  '5A',\n  '5B',\n  '5C',\n  '5D',\n  '5E',\n  '5F',\n  '60',\n  '61',\n  '62',\n  '63',\n  '64',\n  '65',\n  '66',\n  '67',\n  '68',\n  '69',\n  '6A',\n  '6B',\n  '6C',\n  '6D',\n  '6E',\n  '6F',\n  '70',\n  '71',\n  '72',\n  '73',\n  '74',\n  '75',\n  '76',\n  '77',\n  '78',\n  '79',\n  '7A',\n  '7B',\n  '7C',\n  '7D',\n  '7E',\n  '7F',\n  '80',\n  '81',\n  '82',\n  '83',\n  '84',\n  '85',\n  '86',\n  '87',\n  '88',\n  '89',\n  '8A',\n  '8B',\n  '8C',\n  '8D',\n  '8E',\n  '8F',\n  '90',\n  '91',\n  '92',\n  '93',\n  '94',\n  '95',\n  '96',\n  '97',\n  '98',\n  '99',\n  '9A',\n  '9B',\n  '9C',\n  '9D',\n  '9E',\n  '9F',\n  'A0',\n  'A1',\n  'A2',\n  'A3',\n  'A4',\n  'A5',\n  'A6',\n  'A7',\n  'A8',\n  'A9',\n  'AA',\n  'AB',\n  'AC',\n  'AD',\n  'AE',\n  'AF',\n  'B0',\n  'B1',\n  'B2',\n  'B3',\n  'B4',\n  'B5',\n  'B6',\n  'B7',\n  'B8',\n  'B9',\n  'BA',\n  'BB',\n  'BC',\n  'BD',\n  'BE',\n  'BF',\n  'C0',\n  'C1',\n  'C2',\n  'C3',\n  'C4',\n  'C5',\n  'C6',\n  'C7',\n  'C8',\n  'C9',\n  'CA',\n  'CB',\n  'CC',\n  'CD',\n  'CE',\n  'CF',\n  'D0',\n  'D1',\n  'D2',\n  'D3',\n  'D4',\n  'D5',\n  'D6',\n  'D7',\n  'D8',\n  'D9',\n  'DA',\n  'DB',\n  'DC',\n  'DD',\n  'DE',\n  'DF',\n  'E0',\n  'E1',\n  'E2',\n  'E3',\n  'E4',\n  'E5',\n  'E6',\n  'E7',\n  'E8',\n  'E9',\n  'EA',\n  'EB',\n  'EC',\n  'ED',\n  'EE',\n  'EF',\n  'F0',\n  'F1',\n  'F2',\n  'F3',\n  'F4',\n  'F5',\n  'F6',\n  'F7',\n  'F8',\n  'F9',\n  'FA',\n  'FB',\n  'FC',\n  'FD',\n  'FE',\n  'FF',\n];\n\n/* vector of base 64 characters */\nconst base64chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='.split('');\n\n/* vector of base 64 character codes */\nconst base64codes = [];\nbase64chars.forEach((char) => {\n  base64codes.push(char.charCodeAt(0));\n});\n\n// The UTF8 algorithms.\nexports.utf8 = {\n  encode(chars) {\n    const bytes = [];\n    chars.forEach((char) => {\n      if (char >= 0 && char <= 0x7f) {\n        bytes.push(char);\n      } else if (char <= 0x7ff) {\n        bytes.push(0xc0 + ((char >> 6) & mask[5]));\n        bytes.push(0x80 + (char & mask[6]));\n      } else if (char < 0xd800 || (char > 0xdfff && char <= 0xffff)) {\n        bytes.push(0xe0 + ((char >> 12) & mask[4]));\n        bytes.push(0x80 + ((char >> 6) & mask[6]));\n        bytes.push(0x80 + (char & mask[6]));\n      } else if (char >= 0x10000 && char <= 0x10ffff) {\n        const u = (char >> 16) & mask[5];\n        bytes.push(0xf0 + (u >> 2));\n        bytes.push(0x80 + ((u & mask[2]) << 4) + ((char >> 12) & mask[4]));\n        bytes.push(0x80 + ((char >> 6) & mask[6]));\n        bytes.push(0x80 + (char & mask[6]));\n      } else {\n        throw new RangeError(`utf8.encode: character out of range: char: ${char}`);\n      }\n    });\n    return Buffer.from(bytes);\n  },\n  decode(buf, bom) {\n    /* bytes functions return error for non-shortest forms & values out of range */\n    function bytes2(b1, b2) {\n      /* U+0080..U+07FF */\n      /* 00000000 00000yyy yyxxxxxx | 110yyyyy 10xxxxxx */\n      if ((b2 & 0xc0) !== 0x80) {\n        return TRAILING;\n      }\n      const x = ((b1 & mask[5]) << 6) + (b2 & mask[6]);\n      if (x < 0x80) {\n        return NON_SHORTEST;\n      }\n      return x;\n    }\n    function bytes3(b1, b2, b3) {\n      /* U+0800..U+FFFF */\n      /* 00000000 zzzzyyyy yyxxxxxx | 1110zzzz 10yyyyyy 10xxxxxx */\n      if ((b3 & 0xc0) !== 0x80 || (b2 & 0xc0) !== 0x80) {\n        return TRAILING;\n      }\n      const x = ((b1 & mask[4]) << 12) + ((b2 & mask[6]) << 6) + (b3 & mask[6]);\n      if (x < 0x800) {\n        return NON_SHORTEST;\n      }\n      if (x >= 0xd800 && x <= 0xdfff) {\n        return RANGE;\n      }\n      return x;\n    }\n    function bytes4(b1, b2, b3, b4) {\n      /* U+10000..U+10FFFF */\n      /* 000uuuuu zzzzyyyy yyxxxxxx | 11110uuu 10uuzzzz 10yyyyyy 10xxxxxx */\n      if ((b4 & 0xc0) !== 0x80 || (b3 & 0xc0) !== 0x80 || (b2 & 0xc0) !== 0x80) {\n        return TRAILING;\n      }\n      const x =\n        ((((b1 & mask[3]) << 2) + ((b2 >> 4) & mask[2])) << 16) +\n        ((b2 & mask[4]) << 12) +\n        ((b3 & mask[6]) << 6) +\n        (b4 & mask[6]);\n      if (x < 0x10000) {\n        return NON_SHORTEST;\n      }\n      if (x > 0x10ffff) {\n        return RANGE;\n      }\n      return x;\n    }\n    let c;\n    let b1;\n    let i1;\n    let i2;\n    let i3;\n    let inc;\n    const len = buf.length;\n    let i = bom ? 3 : 0;\n    const chars = [];\n    while (i < len) {\n      b1 = buf[i];\n      c = ILL_FORMED;\n      const TRUE = true;\n      while (TRUE) {\n        if (b1 >= 0 && b1 <= 0x7f) {\n          /* U+0000..U+007F 00..7F */\n          c = b1;\n          inc = 1;\n          break;\n        }\n        i1 = i + 1;\n        if (i1 < len && b1 >= 0xc2 && b1 <= 0xdf) {\n          /* U+0080..U+07FF C2..DF 80..BF */\n          c = bytes2(b1, buf[i1]);\n          inc = 2;\n          break;\n        }\n        i2 = i + 2;\n        if (i2 < len && b1 >= 0xe0 && b1 <= 0xef) {\n          /* U+0800..U+FFFF */\n          c = bytes3(b1, buf[i1], buf[i2]);\n          inc = 3;\n          break;\n        }\n        i3 = i + 3;\n        if (i3 < len && b1 >= 0xf0 && b1 <= 0xf4) {\n          /* U+10000..U+10FFFF */\n          c = bytes4(b1, buf[i1], buf[i2], buf[i3]);\n          inc = 4;\n          break;\n        }\n        /* if we fall through to here, it is an ill-formed sequence */\n        break;\n      }\n      if (c > 0x10ffff) {\n        const at = `byte[${i}]`;\n        if (c === ILL_FORMED) {\n          throw new RangeError(`utf8.decode: ill-formed UTF8 byte sequence found at: ${at}`);\n        }\n        if (c === TRAILING) {\n          throw new RangeError(`utf8.decode: illegal trailing byte found at: ${at}`);\n        }\n        if (c === RANGE) {\n          throw new RangeError(`utf8.decode: code point out of range found at: ${at}`);\n        }\n        if (c === NON_SHORTEST) {\n          throw new RangeError(`utf8.decode: non-shortest form found at: ${at}`);\n        }\n        throw new RangeError(`utf8.decode: unrecognized error found at: ${at}`);\n      }\n      chars.push(c);\n      i += inc;\n    }\n    return chars;\n  },\n};\n\n// The UTF16BE algorithms.\nexports.utf16be = {\n  encode(chars) {\n    const bytes = [];\n    let char;\n    let h;\n    let l;\n    for (let i = 0; i < chars.length; i += 1) {\n      char = chars[i];\n      if ((char >= 0 && char <= 0xd7ff) || (char >= 0xe000 && char <= 0xffff)) {\n        bytes.push((char >> 8) & mask[8]);\n        bytes.push(char & mask[8]);\n      } else if (char >= 0x10000 && char <= 0x10ffff) {\n        l = char - 0x10000;\n        h = 0xd800 + (l >> 10);\n        l = 0xdc00 + (l & mask[10]);\n        bytes.push((h >> 8) & mask[8]);\n        bytes.push(h & mask[8]);\n        bytes.push((l >> 8) & mask[8]);\n        bytes.push(l & mask[8]);\n      } else {\n        throw new RangeError(`utf16be.encode: UTF16BE value out of range: char[${i}]: ${char}`);\n      }\n    }\n    return Buffer.from(bytes);\n  },\n  decode(buf, bom) {\n    /* assumes caller has insured that buf is a Buffer of bytes */\n    if (buf.length % 2 > 0) {\n      throw new RangeError(`utf16be.decode: data length must be even multiple of 2: length: ${buf.length}`);\n    }\n    const chars = [];\n    const len = buf.length;\n    let i = bom ? 2 : 0;\n    let j = 0;\n    let c;\n    let inc;\n    let i1;\n    let i3;\n    let high;\n    let low;\n    while (i < len) {\n      const TRUE = true;\n      while (TRUE) {\n        i1 = i + 1;\n        if (i1 < len) {\n          high = (buf[i] << 8) + buf[i1];\n          if (high < 0xd800 || high > 0xdfff) {\n            c = high;\n            inc = 2;\n            break;\n          }\n          i3 = i + 3;\n          if (i3 < len) {\n            low = (buf[i + 2] << 8) + buf[i3];\n            if (high <= 0xdbff && low >= 0xdc00 && low <= 0xdfff) {\n              c = 0x10000 + ((high - 0xd800) << 10) + (low - 0xdc00);\n              inc = 4;\n              break;\n            }\n          }\n        }\n        /* if we fall through to here, it is an ill-formed sequence */\n        throw new RangeError(`utf16be.decode: ill-formed UTF16BE byte sequence found: byte[${i}]`);\n      }\n      chars[j++] = c;\n      i += inc;\n    }\n    return chars;\n  },\n};\n\n// The UTF16LE algorithms.\nexports.utf16le = {\n  encode(chars) {\n    const bytes = [];\n    let char;\n    let h;\n    let l;\n    for (let i = 0; i < chars.length; i += 1) {\n      char = chars[i];\n      if ((char >= 0 && char <= 0xd7ff) || (char >= 0xe000 && char <= 0xffff)) {\n        bytes.push(char & mask[8]);\n        bytes.push((char >> 8) & mask[8]);\n      } else if (char >= 0x10000 && char <= 0x10ffff) {\n        l = char - 0x10000;\n        h = 0xd800 + (l >> 10);\n        l = 0xdc00 + (l & mask[10]);\n        bytes.push(h & mask[8]);\n        bytes.push((h >> 8) & mask[8]);\n        bytes.push(l & mask[8]);\n        bytes.push((l >> 8) & mask[8]);\n      } else {\n        throw new RangeError(`utf16le.encode: UTF16LE value out of range: char[${i}]: ${char}`);\n      }\n    }\n    return Buffer.from(bytes);\n  },\n  decode(buf, bom) {\n    /* assumes caller has insured that buf is a Buffer of bytes */\n    if (buf.length % 2 > 0) {\n      throw new RangeError(`utf16le.decode: data length must be even multiple of 2: length: ${buf.length}`);\n    }\n    const chars = [];\n    const len = buf.length;\n    let i = bom ? 2 : 0;\n    let j = 0;\n    let c;\n    let inc;\n    let i1;\n    let i3;\n    let high;\n    let low;\n    while (i < len) {\n      const TRUE = true;\n      while (TRUE) {\n        i1 = i + 1;\n        if (i1 < len) {\n          high = (buf[i1] << 8) + buf[i];\n          if (high < 0xd800 || high > 0xdfff) {\n            c = high;\n            inc = 2;\n            break;\n          }\n          i3 = i + 3;\n          if (i3 < len) {\n            low = (buf[i3] << 8) + buf[i + 2];\n            if (high <= 0xdbff && low >= 0xdc00 && low <= 0xdfff) {\n              c = 0x10000 + ((high - 0xd800) << 10) + (low - 0xdc00);\n              inc = 4;\n              break;\n            }\n          }\n        }\n        /* if we fall through to here, it is an ill-formed sequence */\n        throw new RangeError(`utf16le.decode: ill-formed UTF16LE byte sequence found: byte[${i}]`);\n      }\n      chars[j++] = c;\n      i += inc;\n    }\n    return chars;\n  },\n};\n\n// The UTF32BE algorithms.\nexports.utf32be = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 4);\n    let i = 0;\n    chars.forEach((char) => {\n      if ((char >= 0xd800 && char <= 0xdfff) || char > 0x10ffff) {\n        throw new RangeError(`utf32be.encode: UTF32BE character code out of range: char[${i / 4}]: ${char}`);\n      }\n      buf[i++] = (char >> 24) & mask[8];\n      buf[i++] = (char >> 16) & mask[8];\n      buf[i++] = (char >> 8) & mask[8];\n      buf[i++] = char & mask[8];\n    });\n    return buf;\n  },\n  decode(buf, bom) {\n    /* caller to insure buf is a Buffer of bytes */\n    if (buf.length % 4 > 0) {\n      throw new RangeError(`utf32be.decode: UTF32BE byte length must be even multiple of 4: length: ${buf.length}`);\n    }\n    const chars = [];\n    let i = bom ? 4 : 0;\n    for (; i < buf.length; i += 4) {\n      const char = (buf[i] << 24) + (buf[i + 1] << 16) + (buf[i + 2] << 8) + buf[i + 3];\n      if ((char >= 0xd800 && char <= 0xdfff) || char > 0x10ffff) {\n        throw new RangeError(`utf32be.decode: UTF32BE character code out of range: char[${i / 4}]: ${char}`);\n      }\n      chars.push(char);\n    }\n    return chars;\n  },\n};\n\n// The UTF32LE algorithms.\nexports.utf32le = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 4);\n    let i = 0;\n    chars.forEach((char) => {\n      if ((char >= 0xd800 && char <= 0xdfff) || char > 0x10ffff) {\n        throw new RangeError(`utf32le.encode: UTF32LE character code out of range: char[${i / 4}]: ${char}`);\n      }\n      buf[i++] = char & mask[8];\n      buf[i++] = (char >> 8) & mask[8];\n      buf[i++] = (char >> 16) & mask[8];\n      buf[i++] = (char >> 24) & mask[8];\n    });\n    return buf;\n  },\n  decode(buf, bom) {\n    /* caller to insure buf is a Buffer of bytes */\n    if (buf.length % 4 > 0) {\n      throw new RangeError(`utf32be.decode: UTF32LE byte length must be even multiple of 4: length: ${buf.length}`);\n    }\n    const chars = [];\n    let i = bom ? 4 : 0;\n    for (; i < buf.length; i += 4) {\n      const char = (buf[i + 3] << 24) + (buf[i + 2] << 16) + (buf[i + 1] << 8) + buf[i];\n      if ((char >= 0xd800 && char <= 0xdfff) || char > 0x10ffff) {\n        throw new RangeError(`utf32le.encode: UTF32LE character code out of range: char[${i / 4}]: ${char}`);\n      }\n      chars.push(char);\n    }\n    return chars;\n  },\n};\n\n// The UINT7 algorithms. ASCII or 7-bit unsigned integers.\nexports.uint7 = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length);\n    for (let i = 0; i < chars.length; i += 1) {\n      if (chars[i] > 0x7f) {\n        throw new RangeError(`uint7.encode: UINT7 character code out of range: char[${i}]: ${chars[i]}`);\n      }\n      buf[i] = chars[i];\n    }\n    return buf;\n  },\n  decode(buf) {\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 1) {\n      if (buf[i] > 0x7f) {\n        throw new RangeError(`uint7.decode: UINT7 character code out of range: byte[${i}]: ${buf[i]}`);\n      }\n      chars[i] = buf[i];\n    }\n    return chars;\n  },\n};\n\n// The UINT8 algorithms. BINARY, Latin 1 or 8-bit unsigned integers.\nexports.uint8 = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length);\n    for (let i = 0; i < chars.length; i += 1) {\n      if (chars[i] > 0xff) {\n        throw new RangeError(`uint8.encode: UINT8 character code out of range: char[${i}]: ${chars[i]}`);\n      }\n      buf[i] = chars[i];\n    }\n    return buf;\n  },\n  decode(buf) {\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 1) {\n      chars[i] = buf[i];\n    }\n    return chars;\n  },\n};\n\n// The UINT16BE algorithms. Big-endian 16-bit unsigned integers.\nexports.uint16be = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 2);\n    let i = 0;\n    chars.forEach((char) => {\n      if (char > 0xffff) {\n        throw new RangeError(`uint16be.encode: UINT16BE character code out of range: char[${i / 2}]: ${char}`);\n      }\n      buf[i++] = (char >> 8) & mask[8];\n      buf[i++] = char & mask[8];\n    });\n    return buf;\n  },\n  decode(buf) {\n    if (buf.length % 2 > 0) {\n      throw new RangeError(`uint16be.decode: UINT16BE byte length must be even multiple of 2: length: ${buf.length}`);\n    }\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 2) {\n      chars.push((buf[i] << 8) + buf[i + 1]);\n    }\n    return chars;\n  },\n};\n\n// The UINT16LE algorithms. Little-endian 16-bit unsigned integers.\nexports.uint16le = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 2);\n    let i = 0;\n    chars.forEach((char) => {\n      if (char > 0xffff) {\n        throw new RangeError(`uint16le.encode: UINT16LE character code out of range: char[${i / 2}]: ${char}`);\n      }\n      buf[i++] = char & mask[8];\n      buf[i++] = (char >> 8) & mask[8];\n    });\n    return buf;\n  },\n  decode(buf) {\n    if (buf.length % 2 > 0) {\n      throw new RangeError(`uint16le.decode: UINT16LE byte length must be even multiple of 2: length: ${buf.length}`);\n    }\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 2) {\n      chars.push((buf[i + 1] << 8) + buf[i]);\n    }\n    return chars;\n  },\n};\n\n// The UINT32BE algorithms. Big-endian 32-bit unsigned integers.\nexports.uint32be = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 4);\n    let i = 0;\n    chars.forEach((char) => {\n      buf[i++] = (char >> 24) & mask[8];\n      buf[i++] = (char >> 16) & mask[8];\n      buf[i++] = (char >> 8) & mask[8];\n      buf[i++] = char & mask[8];\n    });\n    return buf;\n  },\n  decode(buf) {\n    if (buf.length % 4 > 0) {\n      throw new RangeError(`uint32be.decode: UINT32BE byte length must be even multiple of 4: length: ${buf.length}`);\n    }\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 4) {\n      chars.push((buf[i] << 24) + (buf[i + 1] << 16) + (buf[i + 2] << 8) + buf[i + 3]);\n    }\n    return chars;\n  },\n};\n\n// The UINT32LE algorithms. Little-endian 32-bit unsigned integers.\nexports.uint32le = {\n  encode(chars) {\n    const buf = Buffer.alloc(chars.length * 4);\n    let i = 0;\n    chars.forEach((char) => {\n      buf[i++] = char & mask[8];\n      buf[i++] = (char >> 8) & mask[8];\n      buf[i++] = (char >> 16) & mask[8];\n      buf[i++] = (char >> 24) & mask[8];\n    });\n    return buf;\n  },\n  decode(buf) {\n    /* caller to insure buf is a Buffer of bytes */\n    if (buf.length % 4 > 0) {\n      throw new RangeError(`uint32le.decode: UINT32LE byte length must be even multiple of 4: length: ${buf.length}`);\n    }\n    const chars = [];\n    for (let i = 0; i < buf.length; i += 4) {\n      chars.push((buf[i + 3] << 24) + (buf[i + 2] << 16) + (buf[i + 1] << 8) + buf[i]);\n    }\n    return chars;\n  },\n};\n\n// The STRING algorithms. Converts JavaScript strings to Array of 32-bit integers and vice versa.\n// Uses the node.js Buffer's native \"utf16le\" capabilites.\nexports.string = {\n  encode(chars) {\n    return exports.utf16le.encode(chars).toString('utf16le');\n  },\n  decode(str) {\n    return exports.utf16le.decode(Buffer.from(str, 'utf16le'), 0);\n  },\n};\n\n// The ESCAPED algorithms.\n// Note that ESCAPED format contains only ASCII characters.\n// The characters are always in the form of a Buffer of bytes.\nexports.escaped = {\n  // Encodes an Array of 32-bit integers into ESCAPED format.\n  encode(chars) {\n    const bytes = [];\n    for (let i = 0; i < chars.length; i += 1) {\n      const char = chars[i];\n      if (char === 96) {\n        bytes.push(char);\n        bytes.push(char);\n      } else if (char === 10) {\n        bytes.push(char);\n      } else if (char >= 32 && char <= 126) {\n        bytes.push(char);\n      } else {\n        let str = '';\n        if (char >= 0 && char <= 31) {\n          str += `\\`x${ascii[char]}`;\n        } else if (char >= 127 && char <= 255) {\n          str += `\\`x${ascii[char]}`;\n        } else if (char >= 0x100 && char <= 0xffff) {\n          str += `\\`u${ascii[(char >> 8) & mask[8]]}${ascii[char & mask[8]]}`;\n        } else if (char >= 0x10000 && char <= 0xffffffff) {\n          str += '`u{';\n          const digit = (char >> 24) & mask[8];\n          if (digit > 0) {\n            str += ascii[digit];\n          }\n          str += `${ascii[(char >> 16) & mask[8]] + ascii[(char >> 8) & mask[8]] + ascii[char & mask[8]]}}`;\n        } else {\n          throw new Error('escape.encode(char): char > 0xffffffff not allowed');\n        }\n        const buf = Buffer.from(str);\n        buf.forEach((b) => {\n          bytes.push(b);\n        });\n      }\n    }\n    return Buffer.from(bytes);\n  },\n  // Decodes ESCAPED format from a Buffer of bytes to an Array of 32-bit integers.\n  decode(buf) {\n    function isHex(hex) {\n      if ((hex >= 48 && hex <= 57) || (hex >= 65 && hex <= 70) || (hex >= 97 && hex <= 102)) {\n        return true;\n      }\n      return false;\n    }\n    function getx(i, len, bufArg) {\n      const ret = { char: null, nexti: i + 2, error: true };\n      if (i + 1 < len) {\n        if (isHex(bufArg[i]) && isHex(bufArg[i + 1])) {\n          const str = String.fromCodePoint(bufArg[i], bufArg[i + 1]);\n          ret.char = parseInt(str, 16);\n          if (!Number.isNaN(ret.char)) {\n            ret.error = false;\n          }\n        }\n      }\n      return ret;\n    }\n    function getu(i, len, bufArg) {\n      const ret = { char: null, nexti: i + 4, error: true };\n      if (i + 3 < len) {\n        if (isHex(bufArg[i]) && isHex(bufArg[i + 1]) && isHex(bufArg[i + 2]) && isHex(bufArg[i + 3])) {\n          const str = String.fromCodePoint(bufArg[i], bufArg[i + 1], bufArg[i + 2], bufArg[i + 3]);\n          ret.char = parseInt(str, 16);\n          if (!Number.isNaN(ret.char)) {\n            ret.error = false;\n          }\n        }\n      }\n      return ret;\n    }\n    function getU(i, len, bufArg) {\n      const ret = { char: null, nexti: i + 4, error: true };\n      let str = '';\n      while (i < len && isHex(bufArg[i])) {\n        str += String.fromCodePoint(bufArg[i]);\n        // eslint-disable-next-line no-param-reassign\n        i += 1;\n      }\n      ret.char = parseInt(str, 16);\n      if (bufArg[i] === 125 && !Number.isNaN(ret.char)) {\n        ret.error = false;\n      }\n      ret.nexti = i + 1;\n      return ret;\n    }\n    const chars = [];\n    const len = buf.length;\n    let i1;\n    let ret;\n    let error;\n    let i = 0;\n    while (i < len) {\n      const TRUE = true;\n      while (TRUE) {\n        error = true;\n        if (buf[i] !== 96) {\n          /* unescaped character */\n          chars.push(buf[i]);\n          i += 1;\n          error = false;\n          break;\n        }\n        i1 = i + 1;\n        if (i1 >= len) {\n          break;\n        }\n        if (buf[i1] === 96) {\n          /* escaped grave accent */\n          chars.push(96);\n          i += 2;\n          error = false;\n          break;\n        }\n        if (buf[i1] === 120) {\n          ret = getx(i1 + 1, len, buf);\n          if (ret.error) {\n            break;\n          }\n          /* escaped hex */\n          chars.push(ret.char);\n          i = ret.nexti;\n          error = false;\n          break;\n        }\n        if (buf[i1] === 117) {\n          if (buf[i1 + 1] === 123) {\n            ret = getU(i1 + 2, len, buf);\n            if (ret.error) {\n              break;\n            }\n            /* escaped utf-32 */\n            chars.push(ret.char);\n            i = ret.nexti;\n            error = false;\n            break;\n          }\n          ret = getu(i1 + 1, len, buf);\n          if (ret.error) {\n            break;\n          }\n          /* escaped utf-16 */\n          chars.push(ret.char);\n          i = ret.nexti;\n          error = false;\n          break;\n        }\n        break;\n      }\n      if (error) {\n        throw new Error(`escaped.decode: ill-formed escape sequence at buf[${i}]`);\n      }\n    }\n    return chars;\n  },\n};\n\n// The line end conversion algorigthms.\nconst CR = 13;\nconst LF = 10;\nexports.lineEnds = {\n  crlf(chars) {\n    const lfchars = [];\n    let i = 0;\n    while (i < chars.length) {\n      switch (chars[i]) {\n        case CR:\n          if (i + 1 < chars.length && chars[i + 1] === LF) {\n            i += 2;\n          } else {\n            i += 1;\n          }\n          lfchars.push(CR);\n          lfchars.push(LF);\n          break;\n        case LF:\n          lfchars.push(CR);\n          lfchars.push(LF);\n          i += 1;\n          break;\n        default:\n          lfchars.push(chars[i]);\n          i += 1;\n          break;\n      }\n    }\n    if (lfchars.length > 0 && lfchars[lfchars.length - 1] !== LF) {\n      lfchars.push(CR);\n      lfchars.push(LF);\n    }\n    return lfchars;\n  },\n  lf(chars) {\n    const lfchars = [];\n    let i = 0;\n    while (i < chars.length) {\n      switch (chars[i]) {\n        case CR:\n          if (i + 1 < chars.length && chars[i + 1] === LF) {\n            i += 2;\n          } else {\n            i += 1;\n          }\n          lfchars.push(LF);\n          break;\n        case LF:\n          lfchars.push(LF);\n          i += 1;\n          break;\n        default:\n          lfchars.push(chars[i]);\n          i += 1;\n          break;\n      }\n    }\n    if (lfchars.length > 0 && lfchars[lfchars.length - 1] !== LF) {\n      lfchars.push(LF);\n    }\n    return lfchars;\n  },\n};\n\n// The base 64 algorithms.\nexports.base64 = {\n  encode(buf) {\n    if (buf.length === 0) {\n      return Buffer.alloc(0);\n    }\n    let i;\n    let j;\n    let n;\n    let tail = buf.length % 3;\n    tail = tail > 0 ? 3 - tail : 0;\n    let units = (buf.length + tail) / 3;\n    const base64 = Buffer.alloc(units * 4);\n    if (tail > 0) {\n      units -= 1;\n    }\n    i = 0;\n    j = 0;\n    for (let u = 0; u < units; u += 1) {\n      n = buf[i++] << 16;\n      n += buf[i++] << 8;\n      n += buf[i++];\n      base64[j++] = base64codes[(n >> 18) & mask[6]];\n      base64[j++] = base64codes[(n >> 12) & mask[6]];\n      base64[j++] = base64codes[(n >> 6) & mask[6]];\n      base64[j++] = base64codes[n & mask[6]];\n    }\n    if (tail === 0) {\n      return base64;\n    }\n    if (tail === 1) {\n      n = buf[i++] << 16;\n      n += buf[i] << 8;\n      base64[j++] = base64codes[(n >> 18) & mask[6]];\n      base64[j++] = base64codes[(n >> 12) & mask[6]];\n      base64[j++] = base64codes[(n >> 6) & mask[6]];\n      base64[j] = base64codes[64];\n      return base64;\n    }\n    if (tail === 2) {\n      n = buf[i] << 16;\n      base64[j++] = base64codes[(n >> 18) & mask[6]];\n      base64[j++] = base64codes[(n >> 12) & mask[6]];\n      base64[j++] = base64codes[64];\n      base64[j] = base64codes[64];\n      return base64;\n    }\n    return undefined;\n  },\n  decode(codes) {\n    /* remove white space and ctrl characters, validate & translate characters */\n    function validate(buf) {\n      const chars = [];\n      let tail = 0;\n      for (let i = 0; i < buf.length; i += 1) {\n        const char = buf[i];\n        const TRUE = true;\n        while (TRUE) {\n          if (char === 32 || char === 9 || char === 10 || char === 13) {\n            break;\n          }\n          if (char >= 65 && char <= 90) {\n            chars.push(char - 65);\n            break;\n          }\n          if (char >= 97 && char <= 122) {\n            chars.push(char - 71);\n            break;\n          }\n          if (char >= 48 && char <= 57) {\n            chars.push(char + 4);\n            break;\n          }\n          if (char === 43) {\n            chars.push(62);\n            break;\n          }\n          if (char === 47) {\n            chars.push(63);\n            break;\n          }\n          if (char === 61) {\n            chars.push(64);\n            tail += 1;\n            break;\n          }\n          /* invalid character */\n          throw new RangeError(`base64.decode: invalid character buf[${i}]: ${char}`);\n        }\n      }\n      /* validate length */\n      if (chars.length % 4 > 0) {\n        throw new RangeError(`base64.decode: string length not integral multiple of 4: ${chars.length}`);\n      }\n      /* validate tail */\n      switch (tail) {\n        case 0:\n          break;\n        case 1:\n          if (chars[chars.length - 1] !== 64) {\n            throw new RangeError('base64.decode: one tail character found: not last character');\n          }\n          break;\n        case 2:\n          if (chars[chars.length - 1] !== 64 || chars[chars.length - 2] !== 64) {\n            throw new RangeError('base64.decode: two tail characters found: not last characters');\n          }\n          break;\n        default:\n          throw new RangeError(`base64.decode: more than two tail characters found: ${tail}`);\n      }\n      return { tail, buf: Buffer.from(chars) };\n    }\n\n    if (codes.length === 0) {\n      return Buffer.alloc(0);\n    }\n    const val = validate(codes);\n    const { tail } = val;\n    const base64 = val.buf;\n    let i;\n    let j;\n    let n;\n    let units = base64.length / 4;\n    const buf = Buffer.alloc(units * 3 - tail);\n    if (tail > 0) {\n      units -= 1;\n    }\n    j = 0;\n    i = 0;\n    for (let u = 0; u < units; u += 1) {\n      n = base64[i++] << 18;\n      n += base64[i++] << 12;\n      n += base64[i++] << 6;\n      n += base64[i++];\n      buf[j++] = (n >> 16) & mask[8];\n      buf[j++] = (n >> 8) & mask[8];\n      buf[j++] = n & mask[8];\n    }\n    if (tail === 1) {\n      n = base64[i++] << 18;\n      n += base64[i++] << 12;\n      n += base64[i] << 6;\n      buf[j++] = (n >> 16) & mask[8];\n      buf[j] = (n >> 8) & mask[8];\n    }\n    if (tail === 2) {\n      n = base64[i++] << 18;\n      n += base64[i++] << 12;\n      buf[j] = (n >> 16) & mask[8];\n    }\n    return buf;\n  },\n  // Converts a base 64 Buffer of bytes to a JavaScript string with line breaks.\n  toString(buf) {\n    if (buf.length % 4 > 0) {\n      throw new RangeError(`base64.toString: input buffer length not multiple of 4: ${buf.length}`);\n    }\n    let str = '';\n    let lineLen = 0;\n    function buildLine(c1, c2, c3, c4) {\n      switch (lineLen) {\n        case 76:\n          str += `\\r\\n${c1}${c2}${c3}${c4}`;\n          lineLen = 4;\n          break;\n        case 75:\n          str += `${c1}\\r\\n${c2}${c3}${c4}`;\n          lineLen = 3;\n          break;\n        case 74:\n          str += `${c1 + c2}\\r\\n${c3}${c4}`;\n          lineLen = 2;\n          break;\n        case 73:\n          str += `${c1 + c2 + c3}\\r\\n${c4}`;\n          lineLen = 1;\n          break;\n        default:\n          str += c1 + c2 + c3 + c4;\n          lineLen += 4;\n          break;\n      }\n    }\n    function validate(c) {\n      if (c >= 65 && c <= 90) {\n        return true;\n      }\n      if (c >= 97 && c <= 122) {\n        return true;\n      }\n      if (c >= 48 && c <= 57) {\n        return true;\n      }\n      if (c === 43) {\n        return true;\n      }\n      if (c === 47) {\n        return true;\n      }\n      if (c === 61) {\n        return true;\n      }\n      return false;\n    }\n    for (let i = 0; i < buf.length; i += 4) {\n      for (let j = i; j < i + 4; j += 1) {\n        if (!validate(buf[j])) {\n          throw new RangeError(`base64.toString: buf[${j}]: ${buf[j]} : not valid base64 character code`);\n        }\n      }\n      buildLine(\n        String.fromCharCode(buf[i]),\n        String.fromCharCode(buf[i + 1]),\n        String.fromCharCode(buf[i + 2]),\n        String.fromCharCode(buf[i + 3])\n      );\n    }\n    return str;\n  },\n};\n","/* eslint-disable guard-for-in */\n/* eslint-disable no-restricted-syntax */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module is used by the parser to build an [Abstract Syntax Tree](https://en.wikipedia.org/wiki/Abstract_syntax_tree) (AST).\n// The AST can be thought of as a subset of the full parse tree.\n// Each node of the AST holds the phrase that was matched at the corresponding, named parse tree node.\n// It is built as the parser successfully matches phrases to the rule names\n// (`RNM` operators) and `UDT`s as it parses an input string.\n// The user controls which `RNM` or `UDT` names to keep on the AST.\n// The user can also associate callback functions with some or all of the retained\n// AST nodes to be used to translate the node phrases. That is, associate semantic\n// actions to the matched phrases.\n// Translating the AST rather that attempting to apply semantic actions during\n// the parsing process, has the advantage that there is no backtracking and that the phrases\n// are known while traversing down tree as will as up.\n//\n// Let `ast` be an `ast.js` object. To identify a node to be kept on the AST:\n// ```\n// ast.callbacks[\"rulename\"] = true; (all nodes default to false)\n// ```\n// To associate a callback function with a node:\n// ```\n// ast.callbacks[\"rulename\"] = fn\n// ```\n// `rulename` is any `RNM` or `UDT` name defined by the associated grammar\n// and `fn` is a user-written callback function.\n// (See [`apg-examples`](https://github.com/ldthomas/apg-js2-examples/tree/master/ast) for examples of how to create an AST,\n// define the nodes and callback functions and attach it to a parser.)\nmodule.exports = function exportsAst() {\n  const id = require('./identifiers');\n  const utils = require('./utilities');\n\n  const thisFileName = 'ast.js: ';\n  const that = this;\n  let rules = null;\n  let udts = null;\n  let chars = null;\n  let nodeCount = 0;\n  const nodesDefined = [];\n  const nodeCallbacks = [];\n  const stack = [];\n  const records = [];\n  this.callbacks = [];\n  this.astObject = 'astObject';\n  /* called by the parser to initialize the AST with the rules, UDTs and the input characters */\n  this.init = function init(rulesIn, udtsIn, charsIn) {\n    stack.length = 0;\n    records.length = 0;\n    nodesDefined.length = 0;\n    nodeCount = 0;\n    rules = rulesIn;\n    udts = udtsIn;\n    chars = charsIn;\n    let i;\n    const list = [];\n    for (i = 0; i < rules.length; i += 1) {\n      list.push(rules[i].lower);\n    }\n    for (i = 0; i < udts.length; i += 1) {\n      list.push(udts[i].lower);\n    }\n    nodeCount = rules.length + udts.length;\n    for (i = 0; i < nodeCount; i += 1) {\n      nodesDefined[i] = false;\n      nodeCallbacks[i] = null;\n    }\n    for (const index in that.callbacks) {\n      const lower = index.toLowerCase();\n      i = list.indexOf(lower);\n      if (i < 0) {\n        throw new Error(`${thisFileName}init: node '${index}' not a rule or udt name`);\n      }\n      if (typeof that.callbacks[index] === 'function') {\n        nodesDefined[i] = true;\n        nodeCallbacks[i] = that.callbacks[index];\n      }\n      if (that.callbacks[index] === true) {\n        nodesDefined[i] = true;\n      }\n    }\n  };\n  /* AST node definitions - called by the parser's `RNM` operator */\n  this.ruleDefined = function ruleDefined(index) {\n    return nodesDefined[index] !== false;\n  };\n  /* AST node definitions - called by the parser's `UDT` operator */\n  this.udtDefined = function udtDefined(index) {\n    return nodesDefined[rules.length + index] !== false;\n  };\n  /* called by the parser's `RNM` & `UDT` operators */\n  /* builds a record for the downward traversal of the node */\n  this.down = function down(callbackIndex, name) {\n    const thisIndex = records.length;\n    stack.push(thisIndex);\n    records.push({\n      name,\n      thisIndex,\n      thatIndex: null,\n      state: id.SEM_PRE,\n      callbackIndex,\n      phraseIndex: null,\n      phraseLength: null,\n      stack: stack.length,\n    });\n    return thisIndex;\n  };\n  /* called by the parser's `RNM` & `UDT` operators */\n  /* builds a record for the upward traversal of the node */\n  this.up = function up(callbackIndex, name, phraseIndex, phraseLength) {\n    const thisIndex = records.length;\n    const thatIndex = stack.pop();\n    records.push({\n      name,\n      thisIndex,\n      thatIndex,\n      state: id.SEM_POST,\n      callbackIndex,\n      phraseIndex,\n      phraseLength,\n      stack: stack.length,\n    });\n    records[thatIndex].thatIndex = thisIndex;\n    records[thatIndex].phraseIndex = phraseIndex;\n    records[thatIndex].phraseLength = phraseLength;\n    return thisIndex;\n  };\n  // Called by the user to translate the AST.\n  // Translate means to associate or apply some semantic action to the\n  // phrases that were syntactically matched to the AST nodes according\n  // to the defining grammar.\n  // ```\n  // data - optional user-defined data\n  //        passed to the callback functions by the translator\n  // ```\n  this.translate = function translate(data) {\n    let ret;\n    let callback;\n    let record;\n    for (let i = 0; i < records.length; i += 1) {\n      record = records[i];\n      callback = nodeCallbacks[record.callbackIndex];\n      if (record.state === id.SEM_PRE) {\n        if (callback !== null) {\n          ret = callback(id.SEM_PRE, chars, record.phraseIndex, record.phraseLength, data);\n          if (ret === id.SEM_SKIP) {\n            i = record.thatIndex;\n          }\n        }\n      } else if (callback !== null) {\n        callback(id.SEM_POST, chars, record.phraseIndex, record.phraseLength, data);\n      }\n    }\n  };\n  /* called by the parser to reset the length of the records array */\n  /* necessary on backtracking */\n  this.setLength = function setLength(length) {\n    records.length = length;\n    if (length > 0) {\n      stack.length = records[length - 1].stack;\n    } else {\n      stack.length = 0;\n    }\n  };\n  /* called by the parser to get the length of the records array */\n  this.getLength = function getLength() {\n    return records.length;\n  };\n  /* helper for XML display */\n  function indent(n) {\n    let ret = '';\n    for (let i = 0; i < n; i += 1) {\n      ret += ' ';\n    }\n    return ret;\n  }\n  // Generate an `XML` version of the AST.\n  // Useful if you want to use a special or favorite XML parser to translate the\n  // AST.\n  // ```\n  // mode - the display mode of the captured phrases\n  //      - default mode is \"ascii\"\n  //      - can be: \"ascii\"\n  //                \"decimal\"\n  //                \"hexadecimal\"\n  //                \"unicode\"\n  // ```\n  this.toXml = function toSml(modeArg) {\n    let display = utils.charsToDec;\n    let caption = 'decimal integer character codes';\n    if (typeof modeArg === 'string' && modeArg.length >= 3) {\n      const mode = modeArg.slice(0, 3).toLowerCase();\n      if (mode === 'asc') {\n        display = utils.charsToAscii;\n        caption = 'ASCII for printing characters, hex for non-printing';\n      } else if (mode === 'hex') {\n        display = utils.charsToHex;\n        caption = 'hexadecimal integer character codes';\n      } else if (mode === 'uni') {\n        display = utils.charsToUnicode;\n        caption = 'Unicode UTF-32 integer character codes';\n      }\n    }\n    let xml = '';\n    let depth = 0;\n    xml += '<?xml version=\"1.0\" encoding=\"utf-8\"?>\\n';\n    xml += `<root nodes=\"${records.length / 2}\" characters=\"${chars.length}\">\\n`;\n    xml += `<!-- input string, ${caption} -->\\n`;\n    xml += indent(depth + 2);\n    xml += display(chars);\n    xml += '\\n';\n    records.forEach((rec) => {\n      if (rec.state === id.SEM_PRE) {\n        depth += 1;\n        xml += indent(depth);\n        xml += `<node name=\"${rec.name}\" index=\"${rec.phraseIndex}\" length=\"${rec.phraseLength}\">\\n`;\n        xml += indent(depth + 2);\n        xml += display(chars, rec.phraseIndex, rec.phraseLength);\n        xml += '\\n';\n      } else {\n        xml += indent(depth);\n        xml += `</node><!-- name=\"${rec.name}\" -->\\n`;\n        depth -= 1;\n      }\n    });\n\n    xml += '</root>\\n';\n    return xml;\n  };\n  /* generate a JavaScript object version of the AST */\n  /* for the phrase-matching engine apg-exp */\n  this.phrases = function phrases() {\n    const obj = {};\n    let i;\n    let record;\n    for (i = 0; i < records.length; i += 1) {\n      record = records[i];\n      if (record.state === id.SEM_PRE) {\n        if (!Array.isArray(obj[record.name])) {\n          obj[record.name] = [];\n        }\n        obj[record.name].push({\n          index: record.phraseIndex,\n          length: record.phraseLength,\n        });\n      }\n    }\n    return obj;\n  };\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module acts as a \"circular buffer\". It is used to keep track\n// only the last N records in an array of records. If more than N records\n// are saved, each additional record overwrites the previously oldest record.\n// This module deals only with the record indexes and does not save\n// any actual records. It is used by [`trace.js`](./trace.html) for limiting the number of\n// trace records saved.\nmodule.exports = function exportsCircularBuffer() {\n  'use strict;';\n\n  const thisFileName = 'circular-buffer.js: ';\n  let itemIndex = -1;\n  let maxListSize = 0;\n  // Initialize buffer.<br>\n  // *size* is `maxListSize`, the maximum number of records saved before overwriting begins.\n  this.init = function init(size) {\n    if (typeof size !== 'number' || size <= 0) {\n      throw new Error(`${thisFileName}init: circular buffer size must an integer > 0`);\n    }\n    maxListSize = Math.ceil(size);\n    itemIndex = -1;\n  };\n  // Call this to increment the number of records collected.<br>\n  // Returns the array index number to store the next record in.\n  this.increment = function increment() {\n    itemIndex += 1;\n    return (itemIndex + maxListSize) % maxListSize;\n  };\n  // Returns `maxListSize` - the maximum number of records to keep in the buffer.\n  this.maxSize = function maxSize() {\n    return maxListSize;\n  };\n  // Returns the highest number of items saved.<br>\n  // (The number of items is the actual number of records processed\n  // even though only `maxListSize` records are actually retained.)\n  this.items = function items() {\n    return itemIndex + 1;\n  };\n  // Returns the record number associated with this item index.\n  this.getListIndex = function getListIndex(item) {\n    if (itemIndex === -1) {\n      return -1;\n    }\n    if (item < 0 || item > itemIndex) {\n      return -1;\n    }\n    if (itemIndex - item >= maxListSize) {\n      return -1;\n    }\n    return (item + maxListSize) % maxListSize;\n  };\n  // The iterator over the circular buffer.\n  // The user's function, `fn`, will be called with arguments `fn(listIndex, itemIndex)`\n  // where `listIndex` is the saved record index and `itemIndex` is the actual item index.\n  this.forEach = function forEach(fn) {\n    if (itemIndex === -1) {\n      /* no records have been collected */\n      return;\n    }\n    if (itemIndex < maxListSize) {\n      /* fewer than maxListSize records have been collected - number of items = number of records */\n      for (let i = 0; i <= itemIndex; i += 1) {\n        fn(i, i);\n      }\n      return;\n    }\n    /* start with the oldest record saved and finish with the most recent record saved */\n    for (let i = itemIndex - maxListSize + 1; i <= itemIndex; i += 1) {\n      const listIndex = (i + maxListSize) % maxListSize;\n      fn(listIndex, i);\n    }\n  };\n};\n","// This module has been developed programmatically in the `apg-lib` build process.\n// It is used to build web pages programatically on the fly without the need for <script> or <style> tags.\n\nmodule.exports = function emittcss(){\nreturn '/* This file automatically generated by jsonToless() and LESS. */\\n.apg-mono {\\n  font-family: monospace;\\n}\\n.apg-active {\\n  font-weight: bold;\\n  color: #000000;\\n}\\n.apg-match {\\n  font-weight: bold;\\n  color: #264BFF;\\n}\\n.apg-empty {\\n  font-weight: bold;\\n  color: #0fbd0f;\\n}\\n.apg-nomatch {\\n  font-weight: bold;\\n  color: #FF4000;\\n}\\n.apg-lh-match {\\n  font-weight: bold;\\n  color: #1A97BA;\\n}\\n.apg-lb-match {\\n  font-weight: bold;\\n  color: #5F1687;\\n}\\n.apg-remainder {\\n  font-weight: bold;\\n  color: #999999;\\n}\\n.apg-ctrl-char {\\n  font-weight: bolder;\\n  font-style: italic;\\n  font-size: 0.6em;\\n}\\n.apg-line-end {\\n  font-weight: bold;\\n  color: #000000;\\n}\\n.apg-error {\\n  font-weight: bold;\\n  color: #FF4000;\\n}\\n.apg-phrase {\\n  color: #000000;\\n  background-color: #8caae6;\\n}\\n.apg-empty-phrase {\\n  color: #0fbd0f;\\n}\\ntable.apg-state {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: left;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-state th,\\ntable.apg-state td {\\n  text-align: left;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-state th:nth-last-child(2),\\ntable.apg-state td:nth-last-child(2) {\\n  text-align: right;\\n}\\ntable.apg-state caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-stats {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-stats th,\\ntable.apg-stats td {\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-stats caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-trace {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-trace caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-trace th,\\ntable.apg-trace td {\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-trace th:last-child,\\ntable.apg-trace th:nth-last-child(2),\\ntable.apg-trace td:last-child,\\ntable.apg-trace td:nth-last-child(2) {\\n  text-align: left;\\n}\\ntable.apg-grammar {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-grammar caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-grammar th,\\ntable.apg-grammar td {\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-grammar th:last-child,\\ntable.apg-grammar td:last-child {\\n  text-align: left;\\n}\\ntable.apg-rules {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-rules caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-rules th,\\ntable.apg-rules td {\\n  text-align: right;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-rules a {\\n  color: #003399 !important;\\n}\\ntable.apg-rules a:hover {\\n  color: #8caae6 !important;\\n}\\ntable.apg-attrs {\\n  font-family: monospace;\\n  margin-top: 5px;\\n  font-size: 11px;\\n  line-height: 130%;\\n  text-align: center;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-attrs caption {\\n  font-size: 125%;\\n  line-height: 130%;\\n  font-weight: bold;\\n  text-align: left;\\n}\\ntable.apg-attrs th,\\ntable.apg-attrs td {\\n  text-align: center;\\n  border: 1px solid black;\\n  border-collapse: collapse;\\n}\\ntable.apg-attrs th:nth-child(1),\\ntable.apg-attrs th:nth-child(2),\\ntable.apg-attrs th:nth-child(3) {\\n  text-align: right;\\n}\\ntable.apg-attrs td:nth-child(1),\\ntable.apg-attrs td:nth-child(2),\\ntable.apg-attrs td:nth-child(3) {\\n  text-align: right;\\n}\\ntable.apg-attrs a {\\n  color: #003399 !important;\\n}\\ntable.apg-attrs a:hover {\\n  color: #8caae6 !important;\\n}\\n';\n}\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module exposes a list of named identifiers, shared across the parser generator\n// and the parsers that are generated.\n\nmodule.exports = {\n  // Identifies the operator type. Used by the generator\n  // to indicate operator types in the grammar object.\n  // Used by the [parser](./parser.html) when interpreting the grammar object.\n  /* the original ABNF operators */\n  ALT: 1 /* alternation */,\n  CAT: 2 /* concatenation */,\n  REP: 3 /* repetition */,\n  RNM: 4 /* rule name */,\n  TRG: 5 /* terminal range */,\n  TBS: 6 /* terminal binary string, case sensitive */,\n  TLS: 7 /* terminal literal string, case insensitive */,\n  /* the super set, SABNF operators */\n  UDT: 11 /* user-defined terminal */,\n  AND: 12 /* positive look ahead */,\n  NOT: 13 /* negative look ahead */,\n  BKR: 14 /* back reference to a previously matched rule name */,\n  BKA: 15 /* positive look behind */,\n  BKN: 16 /* negative look behind */,\n  ABG: 17 /* anchor - begin of string */,\n  AEN: 18 /* anchor - end of string */,\n  // Used by the parser and the user's `RNM` and `UDT` callback functions.\n  // Identifies the parser state as it traverses the parse tree nodes.\n  // - *ACTIVE* - indicates the downward direction through the parse tree node.\n  // - *MATCH* - indicates the upward direction and a phrase, of length \\> 0, has been successfully matched\n  // - *EMPTY* - indicates the upward direction and a phrase, of length = 0, has been successfully matched\n  // - *NOMATCH* - indicates the upward direction and the parser failed to match any phrase at all\n  ACTIVE: 100,\n  MATCH: 101,\n  EMPTY: 102,\n  NOMATCH: 103,\n  // Used by [`AST` translator](./ast.html) (semantic analysis) and the user's callback functions\n  // to indicate the direction of flow through the `AST` nodes.\n  // - *SEM_PRE* - indicates the downward (pre-branch) direction through the `AST` node.\n  // - *SEM_POST* - indicates the upward (post-branch) direction through the `AST` node.\n  SEM_PRE: 200,\n  SEM_POST: 201,\n  // Used by the user's callback functions to indicate to the `AST` translator (semantic analysis) how to proceed.\n  // - *SEM_OK* - normal return value\n  // - *SEM_SKIP* - if a callback function returns this value from the SEM_PRE state,\n  // the translator will skip processing all `AST` nodes in the branch below the current node.\n  // Ignored if returned from the SEM_POST state.\n  SEM_OK: 300,\n  SEM_SKIP: 301,\n  // Used in attribute generation to distinguish the necessary attribute categories.\n  // - *ATTR_N* - non-recursive\n  // - *ATTR_R* - recursive\n  // - *ATTR_MR* - belongs to a mutually-recursive set\n  ATTR_N: 400,\n  ATTR_R: 401,\n  ATTR_MR: 402,\n  // Look around values indicate whether the parser is in look ahead or look behind mode.\n  // Used by the tracing facility to indicate the look around mode in the trace records display.\n  // - *LOOKAROUND_NONE* - the parser is in normal parsing mode\n  // - *LOOKAROUND_AHEAD* - the parse is in look-ahead mode, phrase matching for operator `AND(&)` or `NOT(!)`\n  // - *LOOKAROUND_BEHIND* - the parse is in look-behind mode, phrase matching for operator `BKA(&&)` or `BKN(!!)`\n  LOOKAROUND_NONE: 500,\n  LOOKAROUND_AHEAD: 501,\n  LOOKAROUND_BEHIND: 502,\n  // Back reference rule mode indicators\n  // - *BKR_MODE_UM* - the back reference is using universal mode\n  // - *BKR_MODE_PM* - the back reference is using parent frame mode\n  // - *BKR_MODE_CS* - the back reference is using case-sensitive phrase matching\n  // - *BKR_MODE_CI* - the back reference is using case-insensitive phrase matching\n  BKR_MODE_UM: 601,\n  BKR_MODE_PM: 602,\n  BKR_MODE_CS: 603,\n  BKR_MODE_CI: 604,\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module serves to export all library objects and object constructors with the `require(\"apg-lib\")` statement.\n// For example, to create a new parser in your program,\n// ````\n// let apglib = require(\"../apg-lib/node-exports\");\n// let my-parser = new apglib.parser();\n// ````\nmodule.exports = {\n  ast: require('./ast'),\n  circular: require('./circular-buffer'),\n  ids: require('./identifiers'),\n  parser: require('./parser'),\n  stats: require('./stats'),\n  trace: require('./trace'),\n  utils: require('./utilities'),\n  emitcss: require('./emitcss'),\n  style: require('./style'),\n};\n","/* eslint-disable func-names */\n/* eslint-disable no-restricted-syntax */\n/* eslint-disable new-cap */\n/* eslint-disable guard-for-in */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This is the primary object of `apg-lib`. Calling its `parse()` member function\n// walks the parse tree of opcodes, matching phrases from the input string as it goes.\n// The working code for all of the operators, `ALT`, `CAT`, etc. is in this module.\nmodule.exports = function parser() {\n  const id = require('./identifiers');\n  const utils = require('./utilities');\n\n  const thisFileName = 'parser.js: ';\n  const thisThis = this;\n  let opExecute;\n  this.ast = null;\n  this.stats = null;\n  this.trace = null;\n  this.callbacks = [];\n  let opcodes = null;\n  let chars = null;\n  let charsBegin;\n  let charsLength;\n  let charsEnd;\n  let lookAround;\n  let treeDepth = 0;\n  let maxTreeDepth = 0;\n  let nodeHits = 0;\n  let ruleCallbacks = null;\n  let udtCallbacks = null;\n  let rules = null;\n  let udts = null;\n  let syntaxData = null;\n  let maxMatched = 0;\n  let limitTreeDepth = Infinity;\n  let limitNodeHits = Infinity;\n  // Evaluates any given rule. This can be called from the syntax callback\n  // functions to evaluate any rule in the grammar's rule list. Great caution\n  // should be used. Use of this function will alter the language that the\n  // parser accepts.\n  const evaluateRule = function evaluateRule(ruleIndex, phraseIndex, sysData) {\n    const functionName = `${thisFileName}evaluateRule(): `;\n    if (ruleIndex >= rules.length) {\n      throw new Error(`${functionName}rule index: ${ruleIndex} out of range`);\n    }\n    if (phraseIndex >= charsEnd) {\n      throw new Error(`${functionName}phrase index: ${phraseIndex} out of range`);\n    }\n    const { length } = opcodes;\n    opcodes.push({\n      type: id.RNM,\n      index: ruleIndex,\n    });\n    opExecute(length, phraseIndex, sysData);\n    opcodes.pop();\n  };\n  // Evaluates any given UDT. This can be called from the syntax callback\n  // functions to evaluate any UDT in the grammar's UDT list. Great caution\n  // should be used. Use of this function will alter the language that the\n  // parser accepts.\n  const evaluateUdt = function (udtIndex, phraseIndex, sysData) {\n    const functionName = `${thisFileName}evaluateUdt(): `;\n    if (udtIndex >= udts.length) {\n      throw new Error(`${functionName}udt index: ${udtIndex} out of range`);\n    }\n    if (phraseIndex >= charsEnd) {\n      throw new Error(`${functionName}phrase index: ${phraseIndex} out of range`);\n    }\n    const { length } = opcodes;\n    opcodes.push({\n      type: id.UDT,\n      empty: udts[udtIndex].empty,\n      index: udtIndex,\n    });\n    opExecute(length, phraseIndex, sysData);\n    opcodes.pop();\n  };\n  /* Clears this object of any/all data that has been initialized or added to it. */\n  /* Called by parse() on initialization, allowing this object to be re-used for multiple parsing calls. */\n  const clear = function () {\n    treeDepth = 0;\n    maxTreeDepth = 0;\n    nodeHits = 0;\n    maxMatched = 0;\n    lookAround = [\n      {\n        lookAround: id.LOOKAROUND_NONE,\n        anchor: 0,\n        charsEnd: 0,\n        charsLength: 0,\n      },\n    ];\n    rules = null;\n    udts = null;\n    chars = null;\n    charsBegin = 0;\n    charsLength = 0;\n    charsEnd = 0;\n    ruleCallbacks = null;\n    udtCallbacks = null;\n    syntaxData = null;\n    opcodes = null;\n  };\n  /* object for maintaining a stack of back reference frames */\n  const backRef = function () {\n    const stack = [];\n    const init = function () {\n      const obj = {};\n      rules.forEach((rule) => {\n        if (rule.isBkr) {\n          obj[rule.lower] = null;\n        }\n      });\n      if (udts.length > 0) {\n        udts.forEach((udt) => {\n          if (udt.isBkr) {\n            obj[udt.lower] = null;\n          }\n        });\n      }\n      stack.push(obj);\n    };\n    const copy = function () {\n      const top = stack[stack.length - 1];\n      const obj = {};\n      /* // eslint-disable-next-line no-restricted-syntax */\n      for (const name in top) {\n        obj[name] = top[name];\n      }\n      return obj;\n    };\n    this.push = function push() {\n      stack.push(copy());\n    };\n    this.pop = function pop(lengthArg) {\n      let length = lengthArg;\n      if (!length) {\n        length = stack.length - 1;\n      }\n      if (length < 1 || length > stack.length) {\n        throw new Error(`${thisFileName}backRef.pop(): bad length: ${length}`);\n      }\n      stack.length = length;\n      return stack[stack.length - 1];\n    };\n    this.length = function length() {\n      return stack.length;\n    };\n    this.savePhrase = function savePhrase(name, index, length) {\n      stack[stack.length - 1][name] = {\n        phraseIndex: index,\n        phraseLength: length,\n      };\n    };\n    this.getPhrase = function (name) {\n      return stack[stack.length - 1][name];\n    };\n    /* constructor */\n    init();\n  };\n  // The system data structure that relays system information to and from the rule and UDT callback functions.\n  // - *state* - the state of the parser, ACTIVE, MATCH, EMPTY or NOMATCH (see the `identifiers` object in\n  // [`apg-lib`](https://github.com/ldthomas/apg-js2-lib))\n  // - *phraseLength* - the number of characters matched if the state is MATCHED or EMPTY\n  // - *lookaround* - the top of the stack holds the current look around state,\n  // LOOKAROUND_NONE, LOOKAROUND_AHEAD or LOOKAROUND_BEHIND,\n  // - *uFrame* - the \"universal\" back reference frame.\n  // Holds the last matched phrase for each of the back referenced rules and UDTs.\n  // - *pFrame* - the stack of \"parent\" back reference frames.\n  // Holds the matched phrase from the parent frame of each back referenced rules and UDTs.\n  // - *evaluateRule* - a reference to this object's `evaluateRule()` function.\n  // Can be called from a callback function (use with extreme caution!)\n  // - *evaluateUdt* - a reference to this object's `evaluateUdt()` function.\n  // Can be called from a callback function (use with extreme caution!)\n  const systemData = function systemData() {\n    const thisData = this;\n    this.state = id.ACTIVE;\n    this.phraseLength = 0;\n    this.ruleIndex = 0;\n    this.udtIndex = 0;\n    this.lookAround = lookAround[lookAround.length - 1];\n    this.uFrame = new backRef();\n    this.pFrame = new backRef();\n    this.evaluateRule = evaluateRule;\n    this.evaluateUdt = evaluateUdt;\n    /* refresh the parser state for the next operation */\n    this.refresh = function refresh() {\n      thisData.state = id.ACTIVE;\n      thisData.phraseLength = 0;\n      thisData.lookAround = lookAround[lookAround.length - 1];\n    };\n  };\n  /* some look around helper functions */\n  const lookAroundValue = function lookAroundValue() {\n    return lookAround[lookAround.length - 1];\n  };\n  /* return true if parser is in look around (ahead or behind) state */\n  const inLookAround = function inLookAround() {\n    return lookAround.length > 1;\n  };\n  /* return true if parser is in look behind state */\n  const inLookBehind = function () {\n    return lookAround[lookAround.length - 1].lookAround === id.LOOKAROUND_BEHIND;\n  };\n  /* called by parse() to initialize the AST object, if one has been defined */\n  const initializeAst = function () {\n    const functionName = `${thisFileName}initializeAst(): `;\n    const TRUE = true;\n    while (TRUE) {\n      if (thisThis.ast === undefined) {\n        thisThis.ast = null;\n        break;\n      }\n      if (thisThis.ast === null) {\n        break;\n      }\n      if (thisThis.ast.astObject !== 'astObject') {\n        throw new Error(`${functionName}ast object not recognized`);\n      }\n      break;\n    }\n    if (thisThis.ast !== null) {\n      thisThis.ast.init(rules, udts, chars);\n    }\n  };\n  /* called by parse() to initialize the trace object, if one has been defined */\n  const initializeTrace = function () {\n    const functionName = `${thisFileName}initializeTrace(): `;\n    const TRUE = true;\n    while (TRUE) {\n      if (thisThis.trace === undefined) {\n        thisThis.trace = null;\n        break;\n      }\n      if (thisThis.trace === null) {\n        break;\n      }\n      if (thisThis.trace.traceObject !== 'traceObject') {\n        throw new Error(`${functionName}trace object not recognized`);\n      }\n      break;\n    }\n    if (thisThis.trace !== null) {\n      thisThis.trace.init(rules, udts, chars);\n    }\n  };\n  /* called by parse() to initialize the statistics object, if one has been defined */\n  const initializeStats = function () {\n    const functionName = `${thisFileName}initializeStats(): `;\n    const TRUE = true;\n    while (TRUE) {\n      if (thisThis.stats === undefined) {\n        thisThis.stats = null;\n        break;\n      }\n      if (thisThis.stats === null) {\n        break;\n      }\n      if (thisThis.stats.statsObject !== 'statsObject') {\n        throw new Error(`${functionName}stats object not recognized`);\n      }\n      break;\n    }\n    if (thisThis.stats !== null) {\n      thisThis.stats.init(rules, udts);\n    }\n  };\n  /* called by parse() to initialize the rules & udts from the grammar object */\n  /* (the grammar object generated previously by apg) */\n  const initializeGrammar = function (grammar) {\n    const functionName = `${thisFileName}initializeGrammar(): `;\n    if (!grammar) {\n      throw new Error(`${functionName}grammar object undefined`);\n    }\n    if (grammar.grammarObject !== 'grammarObject') {\n      throw new Error(`${functionName}bad grammar object`);\n    }\n    rules = grammar.rules;\n    udts = grammar.udts;\n  };\n  /* called by parse() to initialize the start rule */\n  const initializeStartRule = function (startRule) {\n    const functionName = `${thisFileName}initializeStartRule(): `;\n    let start = null;\n    if (typeof startRule === 'number') {\n      if (startRule >= rules.length) {\n        throw new Error(`${functionName}start rule index too large: max: ${rules.length}: index: ${startRule}`);\n      }\n      start = startRule;\n    } else if (typeof startRule === 'string') {\n      const lower = startRule.toLowerCase();\n      for (let i = 0; i < rules.length; i += 1) {\n        if (lower === rules[i].lower) {\n          start = rules[i].index;\n          break;\n        }\n      }\n      if (start === null) {\n        throw new Error(`${functionName}start rule name '${startRule}' not recognized`);\n      }\n    } else {\n      throw new Error(`${functionName}type of start rule '${typeof startRule}' not recognized`);\n    }\n    return start;\n  };\n  /* called by parse() to initialize the array of characters codes representing the input string */\n  const initializeInputChars = function initializeInputChars(inputArg, begArg, lenArg) {\n    const functionName = `${thisFileName}initializeInputChars(): `;\n    /* varify and normalize input */\n    let input = inputArg;\n    let beg = begArg;\n    let len = lenArg;\n    if (input === undefined) {\n      throw new Error(`${functionName}input string is undefined`);\n    }\n    if (input === null) {\n      throw new Error(`${functionName}input string is null`);\n    }\n    if (typeof input === 'string') {\n      input = utils.stringToChars(input);\n    } else if (!Array.isArray(input)) {\n      throw new Error(`${functionName}input string is not a string or array`);\n    }\n    if (input.length > 0) {\n      if (typeof input[0] !== 'number') {\n        throw new Error(`${functionName}input string not an array of integers`);\n      }\n    }\n    /* verify and normalize beginning index */\n    if (typeof beg !== 'number') {\n      beg = 0;\n    } else {\n      beg = Math.floor(beg);\n      if (beg < 0 || beg > input.length) {\n        throw new Error(`${functionName}input beginning index out of range: ${beg}`);\n      }\n    }\n    /* verify and normalize input length */\n    if (typeof len !== 'number') {\n      len = input.length - beg;\n    } else {\n      len = Math.floor(len);\n      if (len < 0 || len > input.length - beg) {\n        throw new Error(`${functionName}input length out of range: ${len}`);\n      }\n    }\n    chars = input;\n    charsBegin = beg;\n    charsLength = len;\n    charsEnd = charsBegin + charsLength;\n  };\n  /* called by parse() to initialize the user-written, syntax callback functions, if any */\n  const initializeCallbacks = function () {\n    const functionName = `${thisFileName}initializeCallbacks(): `;\n    let i;\n    ruleCallbacks = [];\n    udtCallbacks = [];\n    for (i = 0; i < rules.length; i += 1) {\n      ruleCallbacks[i] = null;\n    }\n    for (i = 0; i < udts.length; i += 1) {\n      udtCallbacks[i] = null;\n    }\n    let func;\n    const list = [];\n    for (i = 0; i < rules.length; i += 1) {\n      list.push(rules[i].lower);\n    }\n    for (i = 0; i < udts.length; i += 1) {\n      list.push(udts[i].lower);\n    }\n    for (const index in thisThis.callbacks) {\n      i = list.indexOf(index.toLowerCase());\n      if (i < 0) {\n        throw new Error(`${functionName}syntax callback '${index}' not a rule or udt name`);\n      }\n      func = thisThis.callbacks[index];\n      if (!func) {\n        func = null;\n      }\n      if (typeof func === 'function' || func === null) {\n        if (i < rules.length) {\n          ruleCallbacks[i] = func;\n        } else {\n          udtCallbacks[i - rules.length] = func;\n        }\n      } else {\n        throw new Error(\n          `${functionName}syntax callback[${index}] must be function reference or 'false' (false/null/undefined/etc.)`\n        );\n      }\n    }\n    /* make sure all udts have been defined - the parser can't work without them */\n    for (i = 0; i < udts.length; i += 1) {\n      if (udtCallbacks[i] === null) {\n        throw new Error(\n          `${functionName}all UDT callbacks must be defined. UDT callback[${udts[i].lower}] not a function reference`\n        );\n      }\n    }\n  };\n  // Set the maximum parse tree depth allowed. The default is `Infinity`.\n  // A limit is not normally needed, but can be used to protect against an\n  // exponentual or \"catastrophically backtracking\" grammar.\n  // <ul>\n  // <li>\n  // depth - max allowed parse tree depth. An exception is thrown if exceeded.\n  // </li>\n  // </ul>\n  this.setMaxTreeDepth = function (depth) {\n    if (typeof depth !== 'number') {\n      throw new Error(`parser: max tree depth must be integer > 0: ${depth}`);\n    }\n    limitTreeDepth = Math.floor(depth);\n    if (limitTreeDepth <= 0) {\n      throw new Error(`parser: max tree depth must be integer > 0: ${depth}`);\n    }\n  };\n  // Set the maximum number of node hits (parser unit steps or opcode function calls) allowed.\n  // The default is `Infinity`.\n  // A limit is not normally needed, but can be used to protect against an\n  // exponentual or \"catastrophically backtracking\" grammar.\n  // <ul>\n  // <li>\n  // hits - maximum number of node hits or parser unit steps allowed.\n  // An exception thrown if exceeded.\n  // </li>\n  // </ul>\n  this.setMaxNodeHits = function (hits) {\n    if (typeof hits !== 'number') {\n      throw new Error(`parser: max node hits must be integer > 0: ${hits}`);\n    }\n    limitNodeHits = Math.floor(hits);\n    if (limitNodeHits <= 0) {\n      throw new Error(`parser: max node hits must be integer > 0: ${hits}`);\n    }\n  };\n  /* the main parser function */\n  const privateParse = function (grammar, startRuleArg, callbackData) {\n    let success;\n    const functionName = `${thisFileName}parse(): `;\n    initializeGrammar(grammar);\n    const startRule = initializeStartRule(startRuleArg);\n    initializeCallbacks();\n    initializeTrace();\n    initializeStats();\n    initializeAst();\n    const sysData = new systemData();\n    if (!(callbackData === undefined || callbackData === null)) {\n      syntaxData = callbackData;\n    }\n    /* create a dummy opcode for the start rule */\n    opcodes = [\n      {\n        type: id.RNM,\n        index: startRule,\n      },\n    ];\n    /* execute the start rule */\n    opExecute(0, charsBegin, sysData);\n    opcodes = null;\n    /* test and return the sysData */\n    switch (sysData.state) {\n      case id.ACTIVE:\n        throw new Error(`${functionName}final state should never be 'ACTIVE'`);\n      case id.NOMATCH:\n        success = false;\n        break;\n      case id.EMPTY:\n      case id.MATCH:\n        if (sysData.phraseLength === charsLength) {\n          success = true;\n        } else {\n          success = false;\n        }\n        break;\n      default:\n        throw new Error('unrecognized state');\n    }\n    return {\n      success,\n      state: sysData.state,\n      length: charsLength,\n      matched: sysData.phraseLength,\n      maxMatched,\n      maxTreeDepth,\n      nodeHits,\n      inputLength: chars.length,\n      subBegin: charsBegin,\n      subEnd: charsEnd,\n      subLength: charsLength,\n    };\n  };\n\n  // This form allows parsing of a sub-string of the full input string.\n  // <ul>\n  // <li>*inputIndex* - index of the first character in the sub-string</li>\n  // <li>*inputLength* - length of the sub-string</li>\n  // </ul>\n  // All other parameters as for the above function `parse()`.\n  this.parseSubstring = function parseSubstring(grammar, startRule, inputChars, inputIndex, inputLength, callbackData) {\n    clear();\n    initializeInputChars(inputChars, inputIndex, inputLength);\n    return privateParse(grammar, startRule, callbackData);\n  };\n  // This is the main function, called to parse an input string.\n  // <ul>\n  // <li>*grammar* - an instantiated grammar object - the output of `apg` for a\n  // specific SABNF grammar</li>\n  // <li>*startRule* - the rule name or rule index to be used as the root of the\n  // parse tree. This is usually the first rule, index = 0, of the grammar\n  // but can be any rule defined in the above grammar object.</li>\n  // <li>*inputChars* - the input string. Can be a string or an array of integer character codes representing the\n  // string.</li>\n  // <li>*callbackData* - user-defined data object to be passed to the user's\n  // callback functions.\n  // This is not used by the parser in any way, merely passed on to the user.\n  // May be `null` or omitted.</li>\n  // </ul>\n  this.parse = function parse(grammar, startRule, inputChars, callbackData) {\n    clear();\n    initializeInputChars(inputChars, 0, inputChars.length);\n    return privateParse(grammar, startRule, callbackData);\n  };\n  // The `ALT` operator.<br>\n  // Executes its child nodes, from left to right, until it finds a match.\n  // Fails if *all* of its child nodes fail.\n  const opALT = function (opIndex, phraseIndex, sysData) {\n    const op = opcodes[opIndex];\n    for (let i = 0; i < op.children.length; i += 1) {\n      opExecute(op.children[i], phraseIndex, sysData);\n      if (sysData.state !== id.NOMATCH) {\n        break;\n      }\n    }\n  };\n  // The `CAT` operator.<br>\n  // Executes all of its child nodes, from left to right,\n  // concatenating the matched phrases.\n  // Fails if *any* child nodes fail.\n  const opCAT = function (opIndex, phraseIndex, sysData) {\n    let success;\n    let astLength;\n    let catCharIndex;\n    let catPhrase;\n    const op = opcodes[opIndex];\n    const ulen = sysData.uFrame.length();\n    const plen = sysData.pFrame.length();\n    if (thisThis.ast) {\n      astLength = thisThis.ast.getLength();\n    }\n    success = true;\n    catCharIndex = phraseIndex;\n    catPhrase = 0;\n    for (let i = 0; i < op.children.length; i += 1) {\n      opExecute(op.children[i], catCharIndex, sysData);\n      if (sysData.state === id.NOMATCH) {\n        success = false;\n        break;\n      } else {\n        catCharIndex += sysData.phraseLength;\n        catPhrase += sysData.phraseLength;\n      }\n    }\n    if (success) {\n      sysData.state = catPhrase === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = catPhrase;\n    } else {\n      sysData.state = id.NOMATCH;\n      sysData.phraseLength = 0;\n      /* reset the back referencing frames on failure */\n      sysData.uFrame.pop(ulen);\n      sysData.pFrame.pop(plen);\n      if (thisThis.ast) {\n        thisThis.ast.setLength(astLength);\n      }\n    }\n  };\n  // The `REP` operator.<br>\n  // Repeatedly executes its single child node,\n  // concatenating each of the matched phrases found.\n  // The number of repetitions executed and its final sysData depends\n  // on its `min` & `max` repetition values.\n  const opREP = function (opIndex, phraseIndex, sysData) {\n    let astLength;\n    let repCharIndex;\n    let repPhrase;\n    let repCount;\n    const op = opcodes[opIndex];\n    if (op.max === 0) {\n      // this is an empty-string acceptor\n      // deprecated: use the TLS empty string operator, \"\", instead\n      sysData.state = id.EMPTY;\n      sysData.phraseLength = 0;\n      return;\n    }\n    repCharIndex = phraseIndex;\n    repPhrase = 0;\n    repCount = 0;\n    const ulen = sysData.uFrame.length();\n    const plen = sysData.pFrame.length();\n    if (thisThis.ast) {\n      astLength = thisThis.ast.getLength();\n    }\n    const TRUE = true;\n    while (TRUE) {\n      if (repCharIndex >= charsEnd) {\n        /* exit on end of input string */\n        break;\n      }\n      opExecute(opIndex + 1, repCharIndex, sysData);\n      if (sysData.state === id.NOMATCH) {\n        /* always end if the child node fails */\n        break;\n      }\n      if (sysData.state === id.EMPTY) {\n        /* REP always succeeds when the child node returns an empty phrase */\n        /* this may not seem obvious, but that's the way it works out */\n        break;\n      }\n      repCount += 1;\n      repPhrase += sysData.phraseLength;\n      repCharIndex += sysData.phraseLength;\n      if (repCount === op.max) {\n        /* end on maxed out reps */\n        break;\n      }\n    }\n    /* evaluate the match count according to the min, max values */\n    if (sysData.state === id.EMPTY) {\n      sysData.state = repPhrase === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = repPhrase;\n    } else if (repCount >= op.min) {\n      sysData.state = repPhrase === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = repPhrase;\n    } else {\n      sysData.state = id.NOMATCH;\n      sysData.phraseLength = 0;\n      /* reset the back referencing frames on failure */\n      sysData.uFrame.pop(ulen);\n      sysData.pFrame.pop(plen);\n      if (thisThis.ast) {\n        thisThis.ast.setLength(astLength);\n      }\n    }\n  };\n  // Validate the callback function's returned sysData values.\n  // It's the user's responsibility to get them right\n  // but `RNM` fails if not.\n  const validateRnmCallbackResult = function (rule, sysData, charsLeft, down) {\n    if (sysData.phraseLength > charsLeft) {\n      let str = `${thisFileName}opRNM(${rule.name}): callback function error: `;\n      str += `sysData.phraseLength: ${sysData.phraseLength}`;\n      str += ` must be <= remaining chars: ${charsLeft}`;\n      throw new Error(str);\n    }\n    switch (sysData.state) {\n      case id.ACTIVE:\n        if (down !== true) {\n          throw new Error(\n            `${thisFileName}opRNM(${rule.name}): callback function return error. ACTIVE state not allowed.`\n          );\n        }\n        break;\n      case id.EMPTY:\n        sysData.phraseLength = 0;\n        break;\n      case id.MATCH:\n        if (sysData.phraseLength === 0) {\n          sysData.state = id.EMPTY;\n        }\n        break;\n      case id.NOMATCH:\n        sysData.phraseLength = 0;\n        break;\n      default:\n        throw new Error(\n          `${thisFileName}opRNM(${rule.name}): callback function return error. Unrecognized return state: ${sysData.state}`\n        );\n    }\n  };\n  // The `RNM` operator.<br>\n  // This operator will acts as a root node for a parse tree branch below and\n  // returns the matched phrase to its parent.\n  // However, its larger responsibility is handling user-defined callback functions, back references and `AST` nodes.\n  // Note that the `AST` is a separate object, but `RNM` calls its functions to create its nodes.\n  // See [`ast.js`](./ast.html) for usage.\n  const opRNM = function (opIndex, phraseIndex, sysData) {\n    let astLength;\n    let astDefined;\n    let savedOpcodes;\n    let ulen;\n    let plen;\n    let saveFrame;\n    const op = opcodes[opIndex];\n    const rule = rules[op.index];\n    const callback = ruleCallbacks[rule.index];\n    const notLookAround = !inLookAround();\n    /* ignore AST and back references in lookaround */\n    if (notLookAround) {\n      /* begin AST and back references */\n      astDefined = thisThis.ast && thisThis.ast.ruleDefined(op.index);\n      if (astDefined) {\n        astLength = thisThis.ast.getLength();\n        thisThis.ast.down(op.index, rules[op.index].name);\n      }\n      ulen = sysData.uFrame.length();\n      plen = sysData.pFrame.length();\n      sysData.uFrame.push();\n      sysData.pFrame.push();\n      saveFrame = sysData.pFrame;\n      sysData.pFrame = new backRef();\n    }\n    if (callback === null) {\n      /* no callback - just execute the rule */\n      savedOpcodes = opcodes;\n      opcodes = rule.opcodes;\n      opExecute(0, phraseIndex, sysData);\n      opcodes = savedOpcodes;\n    } else {\n      /* call user's callback */\n      const charsLeft = charsEnd - phraseIndex;\n      sysData.ruleIndex = rule.index;\n      callback(sysData, chars, phraseIndex, syntaxData);\n      validateRnmCallbackResult(rule, sysData, charsLeft, true);\n      if (sysData.state === id.ACTIVE) {\n        savedOpcodes = opcodes;\n        opcodes = rule.opcodes;\n        opExecute(0, phraseIndex, sysData);\n        opcodes = savedOpcodes;\n        sysData.ruleIndex = rule.index;\n        callback(sysData, chars, phraseIndex, syntaxData);\n        validateRnmCallbackResult(rule, sysData, charsLeft, false);\n      } /* implied else clause: just accept the callback sysData - RNM acting as UDT */\n    }\n    if (notLookAround) {\n      /* end AST */\n      if (astDefined) {\n        if (sysData.state === id.NOMATCH) {\n          thisThis.ast.setLength(astLength);\n        } else {\n          thisThis.ast.up(op.index, rule.name, phraseIndex, sysData.phraseLength);\n        }\n      }\n      /* end back reference */\n      sysData.pFrame = saveFrame;\n      if (sysData.state === id.NOMATCH) {\n        sysData.uFrame.pop(ulen);\n        sysData.pFrame.pop(plen);\n      } else if (rule.isBkr) {\n        /* save phrase on both the parent and universal frames */\n        /* BKR operator will decide which to use later */\n        sysData.pFrame.savePhrase(rule.lower, phraseIndex, sysData.phraseLength);\n        sysData.uFrame.savePhrase(rule.lower, phraseIndex, sysData.phraseLength);\n      }\n    }\n  };\n  // Validate the callback function's returned sysData values.\n  // It's the user's responsibility to get it right but `UDT` fails if not.\n  const validateUdtCallbackResult = function (udt, sysData, charsLeft) {\n    if (sysData.phraseLength > charsLeft) {\n      let str = `${thisFileName}opUDT(${udt.name}): callback function error: `;\n      str += `sysData.phraseLength: ${sysData.phraseLength}`;\n      str += ` must be <= remaining chars: ${charsLeft}`;\n      throw new Error(str);\n    }\n    switch (sysData.state) {\n      case id.ACTIVE:\n        throw new Error(`${thisFileName}opUDT(${udt.name}): callback function return error. ACTIVE state not allowed.`);\n      case id.EMPTY:\n        if (udt.empty === false) {\n          throw new Error(`${thisFileName}opUDT(${udt.name}): callback function return error. May not return EMPTY.`);\n        } else {\n          sysData.phraseLength = 0;\n        }\n        break;\n      case id.MATCH:\n        if (sysData.phraseLength === 0) {\n          if (udt.empty === false) {\n            throw new Error(`${thisFileName}opUDT(${udt.name}): callback function return error. May not return EMPTY.`);\n          } else {\n            sysData.state = id.EMPTY;\n          }\n        }\n        break;\n      case id.NOMATCH:\n        sysData.phraseLength = 0;\n        break;\n      default:\n        throw new Error(\n          `${thisFileName}opUDT(${udt.name}): callback function return error. Unrecognized return state: ${sysData.state}`\n        );\n    }\n  };\n  // The `UDT` operator.<br>\n  // Simply calls the user's callback function, but operates like `RNM` with regard to the `AST`\n  // and back referencing.\n  // There is some ambiguity here. `UDT`s act as terminals for phrase recognition but as named rules\n  // for `AST` nodes and back referencing.\n  // See [`ast.js`](./ast.html) for usage.\n  const opUDT = function (opIndex, phraseIndex, sysData) {\n    let astLength;\n    let astIndex;\n    let astDefined;\n    let ulen;\n    let plen;\n    let saveFrame;\n    const op = opcodes[opIndex];\n    const udt = udts[op.index];\n    sysData.UdtIndex = udt.index;\n\n    const notLookAround = !inLookAround();\n    /* ignore AST and back references in lookaround */\n    if (notLookAround) {\n      /* begin AST and back reference */\n      astDefined = thisThis.ast && thisThis.ast.udtDefined(op.index);\n      if (astDefined) {\n        astIndex = rules.length + op.index;\n        astLength = thisThis.ast.getLength();\n        thisThis.ast.down(astIndex, udt.name);\n      }\n      /* NOTE: push and pop of the back reference frame is normally not necessary */\n      /* only in the case that the UDT calls evaluateRule() or evaluateUdt() */\n      ulen = sysData.uFrame.length();\n      plen = sysData.pFrame.length();\n      sysData.uFrame.push();\n      sysData.pFrame.push();\n      saveFrame = sysData.pFrame;\n      sysData.pFrame = new backRef();\n    }\n    /* call the UDT */\n    const charsLeft = charsEnd - phraseIndex;\n    udtCallbacks[op.index](sysData, chars, phraseIndex, syntaxData);\n    validateUdtCallbackResult(udt, sysData, charsLeft);\n    if (notLookAround) {\n      /* end AST */\n      if (astDefined) {\n        if (sysData.state === id.NOMATCH) {\n          thisThis.ast.setLength(astLength);\n        } else {\n          thisThis.ast.up(astIndex, udt.name, phraseIndex, sysData.phraseLength);\n        }\n      }\n      /* end back reference */\n      sysData.pFrame = saveFrame;\n      if (sysData.state === id.NOMATCH) {\n        sysData.uFrame.pop(ulen);\n        sysData.pFrame.pop(plen);\n      } else if (udt.isBkr) {\n        /* save phrase on both the parent and universal frames */\n        /* BKR operator will decide which to use later */\n        sysData.pFrame.savePhrase(udt.lower, phraseIndex, sysData.phraseLength);\n        sysData.uFrame.savePhrase(udt.lower, phraseIndex, sysData.phraseLength);\n      }\n    }\n  };\n  // The `AND` operator.<br>\n  // This is the positive `look ahead` operator.\n  // Executes its single child node, returning the EMPTY state\n  // if it succeedsand NOMATCH if it fails.\n  // *Always* backtracks on any matched phrase and returns EMPTY on success.\n  const opAND = function (opIndex, phraseIndex, sysData) {\n    lookAround.push({\n      lookAround: id.LOOKAROUND_AHEAD,\n      anchor: phraseIndex,\n      charsEnd,\n      charsLength,\n    });\n    charsEnd = chars.length;\n    charsLength = chars.length - charsBegin;\n    opExecute(opIndex + 1, phraseIndex, sysData);\n    const pop = lookAround.pop();\n    charsEnd = pop.charsEnd;\n    charsLength = pop.charsLength;\n    sysData.phraseLength = 0;\n    switch (sysData.state) {\n      case id.EMPTY:\n        sysData.state = id.EMPTY;\n        break;\n      case id.MATCH:\n        sysData.state = id.EMPTY;\n        break;\n      case id.NOMATCH:\n        sysData.state = id.NOMATCH;\n        break;\n      default:\n        throw new Error(`opAND: invalid state ${sysData.state}`);\n    }\n  };\n  // The `NOT` operator.<br>\n  // This is the negative `look ahead` operator.\n  // Executes its single child node, returning the EMPTY state\n  // if it *fails* and NOMATCH if it succeeds.\n  // *Always* backtracks on any matched phrase and returns EMPTY\n  // on success (failure of its child node).\n  const opNOT = function (opIndex, phraseIndex, sysData) {\n    lookAround.push({\n      lookAround: id.LOOKAROUND_AHEAD,\n      anchor: phraseIndex,\n      charsEnd,\n      charsLength,\n    });\n    charsEnd = chars.length;\n    charsLength = chars.length - charsBegin;\n    opExecute(opIndex + 1, phraseIndex, sysData);\n    const pop = lookAround.pop();\n    charsEnd = pop.charsEnd;\n    charsLength = pop.charsLength;\n    sysData.phraseLength = 0;\n    switch (sysData.state) {\n      case id.EMPTY:\n      case id.MATCH:\n        sysData.state = id.NOMATCH;\n        break;\n      case id.NOMATCH:\n        sysData.state = id.EMPTY;\n        break;\n      default:\n        throw new Error(`opNOT: invalid state ${sysData.state}`);\n    }\n  };\n  // The `TRG` operator.<br>\n  // Succeeds if the single first character of the phrase is\n  // within the `min - max` range.\n  const opTRG = function (opIndex, phraseIndex, sysData) {\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    if (phraseIndex < charsEnd) {\n      if (op.min <= chars[phraseIndex] && chars[phraseIndex] <= op.max) {\n        sysData.state = id.MATCH;\n        sysData.phraseLength = 1;\n      }\n    }\n  };\n  // The `TBS` operator.<br>\n  // Matches its pre-defined phrase against the input string.\n  // All characters must match exactly.\n  // Case-sensitive literal strings (`'string'` & `%s\"string\"`) are translated to `TBS`\n  // operators by `apg`.\n  // Phrase length of zero is not allowed.\n  // Empty phrases can only be defined with `TLS` operators.\n  const opTBS = function (opIndex, phraseIndex, sysData) {\n    let i;\n    const op = opcodes[opIndex];\n    const len = op.string.length;\n    sysData.state = id.NOMATCH;\n    if (phraseIndex + len <= charsEnd) {\n      for (i = 0; i < len; i += 1) {\n        if (chars[phraseIndex + i] !== op.string[i]) {\n          return;\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    } /* implied else NOMATCH */\n  };\n  // The `TLS` operator.<br>\n  // Matches its pre-defined phrase against the input string.\n  // A case-insensitive match is attempted for ASCII alphbetical characters.\n  // `TLS` is the only operator that explicitly allows empty phrases.\n  // `apg` will fail for empty `TBS`, case-sensitive strings (`''`) or\n  // zero repetitions (`0*0RuleName` or `0RuleName`).\n  const opTLS = function (opIndex, phraseIndex, sysData) {\n    let i;\n    let code;\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    const len = op.string.length;\n    if (len === 0) {\n      /* EMPTY match allowed for TLS */\n      sysData.state = id.EMPTY;\n      return;\n    }\n    if (phraseIndex + len <= charsEnd) {\n      for (i = 0; i < len; i += 1) {\n        code = chars[phraseIndex + i];\n        if (code >= 65 && code <= 90) {\n          code += 32;\n        }\n        if (code !== op.string[i]) {\n          return;\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    } /* implied else NOMATCH */\n  };\n  // The `ABG` operator.<br>\n  // This is an \"anchor\" for the beginning of the string, similar to the familiar regex `^` anchor.\n  // An anchor matches a position rather than a phrase.\n  // Returns EMPTY if `phraseIndex` is 0, NOMATCH otherwise.\n  const opABG = function (opIndex, phraseIndex, sysData) {\n    sysData.state = id.NOMATCH;\n    sysData.phraseLength = 0;\n    sysData.state = phraseIndex === 0 ? id.EMPTY : id.NOMATCH;\n  };\n  // The `AEN` operator.<br>\n  // This is an \"anchor\" for the end of the string, similar to the familiar regex `$` anchor.\n  // An anchor matches a position rather than a phrase.\n  // Returns EMPTY if `phraseIndex` equals the input string length, NOMATCH otherwise.\n  const opAEN = function (opIndex, phraseIndex, sysData) {\n    sysData.state = id.NOMATCH;\n    sysData.phraseLength = 0;\n    sysData.state = phraseIndex === chars.length ? id.EMPTY : id.NOMATCH;\n  };\n  // The `BKR` operator.<br>\n  // The back reference operator.\n  // Matches the last matched phrase of the named rule or UDT against the input string.\n  // For ASCII alphbetical characters the match may be case sensitive (`%s`) or insensitive (`%i`),\n  // depending on the back reference definition.\n  // For `universal` mode (`%u`) matches the last phrase found anywhere in the grammar.\n  // For `parent frame` mode (`%p`) matches the last phrase found in the parent rule only.\n  const opBKR = function (opIndex, phraseIndex, sysData) {\n    let i;\n    let code;\n    let lmcode;\n    let lower;\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    if (op.index < rules.length) {\n      lower = rules[op.index].lower;\n    } else {\n      lower = udts[op.index - rules.length].lower;\n    }\n    const frame = op.bkrMode === id.BKR_MODE_PM ? sysData.pFrame.getPhrase(lower) : sysData.uFrame.getPhrase(lower);\n    const insensitive = op.bkrCase === id.BKR_MODE_CI;\n    if (frame === null) {\n      return;\n    }\n    const lmIndex = frame.phraseIndex;\n    const len = frame.phraseLength;\n    if (len === 0) {\n      sysData.state = id.EMPTY;\n      return;\n    }\n    if (phraseIndex + len <= charsEnd) {\n      if (insensitive) {\n        /* case-insensitive match */\n        for (i = 0; i < len; i += 1) {\n          code = chars[phraseIndex + i];\n          lmcode = chars[lmIndex + i];\n          if (code >= 65 && code <= 90) {\n            code += 32;\n          }\n          if (lmcode >= 65 && lmcode <= 90) {\n            lmcode += 32;\n          }\n          if (code !== lmcode) {\n            return;\n          }\n        }\n        sysData.state = id.MATCH;\n        sysData.phraseLength = len;\n      } else {\n        /* case-sensitive match */\n        for (i = 0; i < len; i += 1) {\n          code = chars[phraseIndex + i];\n          lmcode = chars[lmIndex + i];\n          if (code !== lmcode) {\n            return;\n          }\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    }\n  };\n  // The `BKA` operator.<br>\n  // This is the positive `look behind` operator.\n  // It's child node is parsed right-to-left.\n  // Returns the EMPTY state if a match is found, NOMATCH otherwise.\n  // Like the look ahead operators, it always backtracks to `phraseIndex`.\n  const opBKA = function (opIndex, phraseIndex, sysData) {\n    lookAround.push({\n      lookAround: id.LOOKAROUND_BEHIND,\n      anchor: phraseIndex,\n    });\n    opExecute(opIndex + 1, phraseIndex, sysData);\n    lookAround.pop();\n    sysData.phraseLength = 0;\n    switch (sysData.state) {\n      case id.EMPTY:\n        sysData.state = id.EMPTY;\n        break;\n      case id.MATCH:\n        sysData.state = id.EMPTY;\n        break;\n      case id.NOMATCH:\n        sysData.state = id.NOMATCH;\n        break;\n      default:\n        throw new Error(`opBKA: invalid state ${sysData.state}`);\n    }\n  };\n  // The `BKN` operator.<br>\n  // This is the negative `look behind` operator.\n  // It's child node is parsed right-to-left.\n  // Returns the EMPTY state if a match is *not* found, NOMATCH otherwise.\n  // Like the look ahead operators, it always backtracks to `phraseIndex`.\n  const opBKN = function (opIndex, phraseIndex, sysData) {\n    // let op;\n    // op = opcodes[opIndex];\n    lookAround.push({\n      lookAround: id.LOOKAROUND_BEHIND,\n      anchor: phraseIndex,\n    });\n    opExecute(opIndex + 1, phraseIndex, sysData);\n    lookAround.pop();\n    sysData.phraseLength = 0;\n    switch (sysData.state) {\n      case id.EMPTY:\n      case id.MATCH:\n        sysData.state = id.NOMATCH;\n        break;\n      case id.NOMATCH:\n        sysData.state = id.EMPTY;\n        break;\n      default:\n        throw new Error(`opBKN: invalid state ${sysData.state}`);\n    }\n  };\n  // The right-to-left `CAT` operator.<br>\n  // Called for `CAT` operators when in look behind mode.\n  // Calls its child nodes from right to left concatenating matched phrases right to left.\n  const opCATBehind = function (opIndex, phraseIndex, sysData) {\n    let success;\n    let astLength;\n    let catCharIndex;\n    let catMatched;\n    const op = opcodes[opIndex];\n    const ulen = sysData.uFrame.length();\n    const plen = sysData.pFrame.length();\n    if (thisThis.ast) {\n      astLength = thisThis.ast.getLength();\n    }\n    success = true;\n    catCharIndex = phraseIndex;\n    catMatched = 0;\n    // catPhrase = 0;\n    for (let i = op.children.length - 1; i >= 0; i -= 1) {\n      opExecute(op.children[i], catCharIndex, sysData);\n      catCharIndex -= sysData.phraseLength;\n      catMatched += sysData.phraseLength;\n      // catPhrase += sysData.phraseLength;\n      if (sysData.state === id.NOMATCH) {\n        success = false;\n        break;\n      }\n    }\n    if (success) {\n      sysData.state = catMatched === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = catMatched;\n    } else {\n      sysData.state = id.NOMATCH;\n      sysData.phraseLength = 0;\n      sysData.uFrame.pop(ulen);\n      sysData.pFrame.pop(plen);\n      if (thisThis.ast) {\n        thisThis.ast.setLength(astLength);\n      }\n    }\n  };\n  // The right-to-left `REP` operator.<br>\n  // Called for `REP` operators in look behind mode.\n  // Makes repeated calls to its child node, concatenating matched phrases right to left.\n  const opREPBehind = function (opIndex, phraseIndex, sysData) {\n    let astLength;\n    let repCharIndex;\n    let repPhrase;\n    let repCount;\n    const op = opcodes[opIndex];\n    repCharIndex = phraseIndex;\n    repPhrase = 0;\n    repCount = 0;\n    const ulen = sysData.uFrame.length();\n    const plen = sysData.pFrame.length();\n    if (thisThis.ast) {\n      astLength = thisThis.ast.getLength();\n    }\n    const TRUE = true;\n    while (TRUE) {\n      if (repCharIndex <= 0) {\n        /* exit on end of input string */\n        break;\n      }\n      opExecute(opIndex + 1, repCharIndex, sysData);\n      if (sysData.state === id.NOMATCH) {\n        /* always end if the child node fails */\n        break;\n      }\n      if (sysData.state === id.EMPTY) {\n        /* REP always succeeds when the child node returns an empty phrase */\n        /* this may not seem obvious, but that's the way it works out */\n        break;\n      }\n      repCount += 1;\n      repPhrase += sysData.phraseLength;\n      repCharIndex -= sysData.phraseLength;\n      if (repCount === op.max) {\n        /* end on maxed out reps */\n        break;\n      }\n    }\n    /* evaluate the match count according to the min, max values */\n    if (sysData.state === id.EMPTY) {\n      sysData.state = repPhrase === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = repPhrase;\n    } else if (repCount >= op.min) {\n      sysData.state = repPhrase === 0 ? id.EMPTY : id.MATCH;\n      sysData.phraseLength = repPhrase;\n    } else {\n      sysData.state = id.NOMATCH;\n      sysData.phraseLength = 0;\n      sysData.uFrame.pop(ulen);\n      sysData.pFrame.pop(plen);\n      if (thisThis.ast) {\n        thisThis.ast.setLength(astLength);\n      }\n    }\n  };\n  // The right-to-left `TRG` operator.<br>\n  // Called for `TRG` operators in look behind mode.\n  // Matches a single character at `phraseIndex - 1` to the `min` - `max` range.\n  const opTRGBehind = function (opIndex, phraseIndex, sysData) {\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    sysData.phraseLength = 0;\n    if (phraseIndex > 0) {\n      const char = chars[phraseIndex - 1];\n      if (op.min <= char && char <= op.max) {\n        sysData.state = id.MATCH;\n        sysData.phraseLength = 1;\n      }\n    }\n  };\n  // The right-to-left `TBS` operator.<br>\n  // Called for `TBS` operators in look behind mode.\n  // Matches the `TBS` phrase to the left of `phraseIndex`.\n  const opTBSBehind = function (opIndex, phraseIndex, sysData) {\n    let i;\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    const len = op.string.length;\n    const beg = phraseIndex - len;\n    if (beg >= 0) {\n      for (i = 0; i < len; i += 1) {\n        if (chars[beg + i] !== op.string[i]) {\n          return;\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    }\n  };\n  // The right-to-left `TLS` operator.<br>\n  // Called for `TLS` operators in look behind mode.\n  // Matches the `TLS` phrase to the left of `phraseIndex`.\n  const opTLSBehind = function (opIndex, phraseIndex, sysData) {\n    let char;\n    const op = opcodes[opIndex];\n    sysData.state = id.NOMATCH;\n    const len = op.string.length;\n    if (len === 0) {\n      /* EMPTY match allowed for TLS */\n      sysData.state = id.EMPTY;\n      return;\n    }\n    const beg = phraseIndex - len;\n    if (beg >= 0) {\n      for (let i = 0; i < len; i += 1) {\n        char = chars[beg + i];\n        if (char >= 65 && char <= 90) {\n          char += 32;\n        }\n        if (char !== op.string[i]) {\n          return;\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    }\n  };\n  // The right-to-left back reference operator.<br>\n  // Matches the back referenced phrase to the left of `phraseIndex`.\n  const opBKRBehind = function (opIndex, phraseIndex, sysData) {\n    let i;\n    let code;\n    let lmcode;\n    let lower;\n    const op = opcodes[opIndex];\n    /* NOMATCH default */\n    sysData.state = id.NOMATCH;\n    sysData.phraseLength = 0;\n    if (op.index < rules.length) {\n      lower = rules[op.index].lower;\n    } else {\n      lower = udts[op.index - rules.length].lower;\n    }\n    const frame = op.bkrMode === id.BKR_MODE_PM ? sysData.pFrame.getPhrase(lower) : sysData.uFrame.getPhrase(lower);\n    const insensitive = op.bkrCase === id.BKR_MODE_CI;\n    if (frame === null) {\n      return;\n    }\n    const lmIndex = frame.phraseIndex;\n    const len = frame.phraseLength;\n    if (len === 0) {\n      sysData.state = id.EMPTY;\n      sysData.phraseLength = 0;\n      return;\n    }\n    const beg = phraseIndex - len;\n    if (beg >= 0) {\n      if (insensitive) {\n        /* case-insensitive match */\n        for (i = 0; i < len; i += 1) {\n          code = chars[beg + i];\n          lmcode = chars[lmIndex + i];\n          if (code >= 65 && code <= 90) {\n            code += 32;\n          }\n          if (lmcode >= 65 && lmcode <= 90) {\n            lmcode += 32;\n          }\n          if (code !== lmcode) {\n            return;\n          }\n        }\n        sysData.state = id.MATCH;\n        sysData.phraseLength = len;\n      } else {\n        /* case-sensitive match */\n        for (i = 0; i < len; i += 1) {\n          code = chars[beg + i];\n          lmcode = chars[lmIndex + i];\n          if (code !== lmcode) {\n            return;\n          }\n        }\n      }\n      sysData.state = id.MATCH;\n      sysData.phraseLength = len;\n    }\n  };\n  // Generalized execution function.<br>\n  // Having a single, generalized function, allows a single location\n  // for tracing and statistics gathering functions to be called.\n  // Tracing and statistics are handled in separate objects.\n  // However, the parser calls their API to build the object data records.\n  // See [`trace.js`](./trace.html) and [`stats.js`](./stats.html) for their\n  // usage.\n  opExecute = function opExecuteFunc(opIndex, phraseIndex, sysData) {\n    let ret = true;\n    const op = opcodes[opIndex];\n    nodeHits += 1;\n    if (nodeHits > limitNodeHits) {\n      throw new Error(`parser: maximum number of node hits exceeded: ${limitNodeHits}`);\n    }\n    treeDepth += 1;\n    if (treeDepth > maxTreeDepth) {\n      maxTreeDepth = treeDepth;\n      if (maxTreeDepth > limitTreeDepth) {\n        throw new Error(`parser: maximum parse tree depth exceeded: ${limitTreeDepth}`);\n      }\n    }\n    sysData.refresh();\n    if (thisThis.trace !== null) {\n      /* collect the trace record for down the parse tree */\n      const lk = lookAroundValue();\n      thisThis.trace.down(op, sysData.state, phraseIndex, sysData.phraseLength, lk.anchor, lk.lookAround);\n    }\n    if (inLookBehind()) {\n      switch (op.type) {\n        case id.ALT:\n          opALT(opIndex, phraseIndex, sysData);\n          break;\n        case id.CAT:\n          opCATBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.REP:\n          opREPBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.RNM:\n          opRNM(opIndex, phraseIndex, sysData);\n          break;\n        case id.UDT:\n          opUDT(opIndex, phraseIndex, sysData);\n          break;\n        case id.AND:\n          opAND(opIndex, phraseIndex, sysData);\n          break;\n        case id.NOT:\n          opNOT(opIndex, phraseIndex, sysData);\n          break;\n        case id.TRG:\n          opTRGBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.TBS:\n          opTBSBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.TLS:\n          opTLSBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKR:\n          opBKRBehind(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKA:\n          opBKA(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKN:\n          opBKN(opIndex, phraseIndex, sysData);\n          break;\n        case id.ABG:\n          opABG(opIndex, phraseIndex, sysData);\n          break;\n        case id.AEN:\n          opAEN(opIndex, phraseIndex, sysData);\n          break;\n        default:\n          ret = false;\n          break;\n      }\n    } else {\n      switch (op.type) {\n        case id.ALT:\n          opALT(opIndex, phraseIndex, sysData);\n          break;\n        case id.CAT:\n          opCAT(opIndex, phraseIndex, sysData);\n          break;\n        case id.REP:\n          opREP(opIndex, phraseIndex, sysData);\n          break;\n        case id.RNM:\n          opRNM(opIndex, phraseIndex, sysData);\n          break;\n        case id.UDT:\n          opUDT(opIndex, phraseIndex, sysData);\n          break;\n        case id.AND:\n          opAND(opIndex, phraseIndex, sysData);\n          break;\n        case id.NOT:\n          opNOT(opIndex, phraseIndex, sysData);\n          break;\n        case id.TRG:\n          opTRG(opIndex, phraseIndex, sysData);\n          break;\n        case id.TBS:\n          opTBS(opIndex, phraseIndex, sysData);\n          break;\n        case id.TLS:\n          opTLS(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKR:\n          opBKR(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKA:\n          opBKA(opIndex, phraseIndex, sysData);\n          break;\n        case id.BKN:\n          opBKN(opIndex, phraseIndex, sysData);\n          break;\n        case id.ABG:\n          opABG(opIndex, phraseIndex, sysData);\n          break;\n        case id.AEN:\n          opAEN(opIndex, phraseIndex, sysData);\n          break;\n        default:\n          ret = false;\n          break;\n      }\n    }\n    if (!inLookAround() && phraseIndex + sysData.phraseLength > maxMatched) {\n      maxMatched = phraseIndex + sysData.phraseLength;\n    }\n    if (thisThis.stats !== null) {\n      /* collect the statistics */\n      thisThis.stats.collect(op, sysData);\n    }\n    if (thisThis.trace !== null) {\n      /* collect the trace record for up the parse tree */\n      const lk = lookAroundValue();\n      thisThis.trace.up(op, sysData.state, phraseIndex, sysData.phraseLength, lk.anchor, lk.lookAround);\n    }\n    treeDepth -= 1;\n    return ret;\n  };\n};\n","/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module is the constructor for the statistics gathering object.\n// The statistics are nothing more than keeping a count of the\n// number of times each node in the parse tree is traversed.\n//\n// Counts are collected for each of the individual types of operators.\n// Additionally, counts are collected for each of the individually named\n// `RNM` and `UDT` operators.\nmodule.exports = function statsFunc() {\n  const id = require('./identifiers');\n  const utils = require('./utilities');\n  const style = require('./style');\n\n  const thisFileName = 'stats.js: ';\n  let rules = [];\n  let udts = [];\n  const stats = [];\n  let totals;\n  const ruleStats = [];\n  const udtStats = [];\n  this.statsObject = 'statsObject';\n  const nameId = 'stats';\n  /* `Array.sort()` callback function for sorting `RNM` and `UDT` operators alphabetically by name. */\n  const sortAlpha = function sortAlpha(lhs, rhs) {\n    if (lhs.lower < rhs.lower) {\n      return -1;\n    }\n    if (lhs.lower > rhs.lower) {\n      return 1;\n    }\n    return 0;\n  };\n  /* `Array.sort()` callback function for sorting `RNM` and `UDT` operators by hit count. */\n  const sortHits = function sortHits(lhs, rhs) {\n    if (lhs.total < rhs.total) {\n      return 1;\n    }\n    if (lhs.total > rhs.total) {\n      return -1;\n    }\n    return sortAlpha(lhs, rhs);\n  };\n  /* `Array.sort()` callback function for sorting `RNM` and `UDT` operators by index */\n  /* (in the order in which they appear in the SABNF grammar). */\n  const sortIndex = function sortIndex(lhs, rhs) {\n    if (lhs.index < rhs.index) {\n      return -1;\n    }\n    if (lhs.index > rhs.index) {\n      return 1;\n    }\n    return 0;\n  };\n  const EmptyStat = function EmptyStat() {\n    this.empty = 0;\n    this.match = 0;\n    this.nomatch = 0;\n    this.total = 0;\n  };\n  /* Zero out all stats */\n  const clear = function clear() {\n    stats.length = 0;\n    totals = new EmptyStat();\n    stats[id.ALT] = new EmptyStat();\n    stats[id.CAT] = new EmptyStat();\n    stats[id.REP] = new EmptyStat();\n    stats[id.RNM] = new EmptyStat();\n    stats[id.TRG] = new EmptyStat();\n    stats[id.TBS] = new EmptyStat();\n    stats[id.TLS] = new EmptyStat();\n    stats[id.UDT] = new EmptyStat();\n    stats[id.AND] = new EmptyStat();\n    stats[id.NOT] = new EmptyStat();\n    stats[id.BKR] = new EmptyStat();\n    stats[id.BKA] = new EmptyStat();\n    stats[id.BKN] = new EmptyStat();\n    stats[id.ABG] = new EmptyStat();\n    stats[id.AEN] = new EmptyStat();\n    ruleStats.length = 0;\n    for (let i = 0; i < rules.length; i += 1) {\n      ruleStats.push({\n        empty: 0,\n        match: 0,\n        nomatch: 0,\n        total: 0,\n        name: rules[i].name,\n        lower: rules[i].lower,\n        index: rules[i].index,\n      });\n    }\n    if (udts.length > 0) {\n      udtStats.length = 0;\n      for (let i = 0; i < udts.length; i += 1) {\n        udtStats.push({\n          empty: 0,\n          match: 0,\n          nomatch: 0,\n          total: 0,\n          name: udts[i].name,\n          lower: udts[i].lower,\n          index: udts[i].index,\n        });\n      }\n    }\n  };\n  /* increment the designated operator hit count by one */\n  const incStat = function incStat(stat, state) {\n    stat.total += 1;\n    switch (state) {\n      case id.EMPTY:\n        stat.empty += 1;\n        break;\n      case id.MATCH:\n        stat.match += 1;\n        break;\n      case id.NOMATCH:\n        stat.nomatch += 1;\n        break;\n      default:\n        throw new Error(`${thisFileName}collect(): incStat(): unrecognized state: ${state}`);\n    }\n  };\n  /* helper for toHtml() */\n  const displayRow = function displayRow(name, stat) {\n    let html = '';\n    html += '<tr>';\n    html += `<td class=\"${style.CLASS_ACTIVE}\">${name}</td>`;\n    html += `<td class=\"${style.CLASS_EMPTY}\">${stat.empty}</td>`;\n    html += `<td class=\"${style.CLASS_MATCH}\">${stat.match}</td>`;\n    html += `<td class=\"${style.CLASS_NOMATCH}\">${stat.nomatch}</td>`;\n    html += `<td class=\"${style.CLASS_ACTIVE}\">${stat.total}</td>`;\n    html += '</tr>\\n';\n    return html;\n  };\n  const displayOpsOnly = function displayOpsOnly() {\n    let html = '';\n    html += displayRow('ALT', stats[id.ALT]);\n    html += displayRow('CAT', stats[id.CAT]);\n    html += displayRow('REP', stats[id.REP]);\n    html += displayRow('RNM', stats[id.RNM]);\n    html += displayRow('TRG', stats[id.TRG]);\n    html += displayRow('TBS', stats[id.TBS]);\n    html += displayRow('TLS', stats[id.TLS]);\n    html += displayRow('UDT', stats[id.UDT]);\n    html += displayRow('AND', stats[id.AND]);\n    html += displayRow('NOT', stats[id.NOT]);\n    html += displayRow('BKR', stats[id.BKR]);\n    html += displayRow('BKA', stats[id.BKA]);\n    html += displayRow('BKN', stats[id.BKN]);\n    html += displayRow('ABG', stats[id.ABG]);\n    html += displayRow('AEN', stats[id.AEN]);\n    html += displayRow('totals', totals);\n    return html;\n  };\n  /* helper for toHtml() */\n  const displayRules = function displayRules() {\n    let html = '';\n    html += '<tr><th></th><th></th><th></th><th></th><th></th></tr>\\n';\n    html += '<tr><th>rules</th><th></th><th></th><th></th><th></th></tr>\\n';\n    for (let i = 0; i < rules.length; i += 1) {\n      if (ruleStats[i].total > 0) {\n        html += '<tr>';\n        html += `<td class=\"${style.CLASS_ACTIVE}\">${ruleStats[i].name}</td>`;\n        html += `<td class=\"${style.CLASS_EMPTY}\">${ruleStats[i].empty}</td>`;\n        html += `<td class=\"${style.CLASS_MATCH}\">${ruleStats[i].match}</td>`;\n        html += `<td class=\"${style.CLASS_NOMATCH}\">${ruleStats[i].nomatch}</td>`;\n        html += `<td class=\"${style.CLASS_ACTIVE}\">${ruleStats[i].total}</td>`;\n        html += '</tr>\\n';\n      }\n    }\n    if (udts.length > 0) {\n      html += '<tr><th></th><th></th><th></th><th></th><th></th></tr>\\n';\n      html += '<tr><th>udts</th><th></th><th></th><th></th><th></th></tr>\\n';\n      for (let i = 0; i < udts.length; i += 1) {\n        if (udtStats[i].total > 0) {\n          html += '<tr>';\n          html += `<td class=\"${style.CLASS_ACTIVE}\">${udtStats[i].name}</td>`;\n          html += `<td class=\"${style.CLASS_EMPTY}\">${udtStats[i].empty}</td>`;\n          html += `<td class=\"${style.CLASS_MATCH}\">${udtStats[i].match}</td>`;\n          html += `<td class=\"${style.CLASS_NOMATCH}\">${udtStats[i].nomatch}</td>`;\n          html += `<td class=\"${style.CLASS_ACTIVE}\">${udtStats[i].total}</td>`;\n          html += '</tr>\\n';\n        }\n      }\n    }\n    return html;\n  };\n  /* called only by the parser to validate a stats object */\n  this.validate = function validate(name) {\n    let ret = false;\n    if (typeof name === 'string' && nameId === name) {\n      ret = true;\n    }\n    return ret;\n  };\n  /* no verification of input - only called by parser() */\n  this.init = function init(inputRules, inputUdts) {\n    rules = inputRules;\n    udts = inputUdts;\n    clear();\n  };\n  /* This function is the main interaction with the parser. */\n  /* The parser calls it after each node has been traversed. */\n  this.collect = function collect(op, result) {\n    incStat(totals, result.state, result.phraseLength);\n    incStat(stats[op.type], result.state, result.phraseLength);\n    if (op.type === id.RNM) {\n      incStat(ruleStats[op.index], result.state, result.phraseLength);\n    }\n    if (op.type === id.UDT) {\n      incStat(udtStats[op.index], result.state, result.phraseLength);\n    }\n  };\n  // Display the statistics as an HTML table.\n  // - *type*\n  //   - \"ops\" - (default) display only the total hit counts for all operator types.\n  //   - \"index\" - additionally, display the hit counts for the individual `RNM` and `UDT` operators ordered by index.\n  //   - \"hits\" - additionally, display the hit counts for the individual `RNM` and `UDT` operators by hit count.\n  //   - \"alpha\" - additionally, display the hit counts for the individual `RNM` and `UDT` operators by name alphabetically.\n  // - *caption* - optional caption for the table\n  this.toHtml = function toHtml(type, caption) {\n    let html = '';\n    html += `<table class=\"${style.CLASS_STATS}\">\\n`;\n    if (typeof caption === 'string') {\n      html += `<caption>${caption}</caption>\\n`;\n    }\n    html += `<tr><th class=\"${style.CLASS_ACTIVE}\">ops</th>\\n`;\n    html += `<th class=\"${style.CLASS_EMPTY}\">EMPTY</th>\\n`;\n    html += `<th class=\"${style.CLASS_MATCH}\">MATCH</th>\\n`;\n    html += `<th class=\"${style.CLASS_NOMATCH}\">NOMATCH</th>\\n`;\n    html += `<th class=\"${style.CLASS_ACTIVE}\">totals</th></tr>\\n`;\n    const test = true;\n    while (test) {\n      if (type === undefined) {\n        html += displayOpsOnly();\n        break;\n      }\n      if (type === null) {\n        html += displayOpsOnly();\n        break;\n      }\n      if (type === 'ops') {\n        html += displayOpsOnly();\n        break;\n      }\n      if (type === 'index') {\n        ruleStats.sort(sortIndex);\n        if (udtStats.length > 0) {\n          udtStats.sort(sortIndex);\n        }\n        html += displayOpsOnly();\n        html += displayRules();\n        break;\n      }\n      if (type === 'hits') {\n        ruleStats.sort(sortHits);\n        if (udtStats.length > 0) {\n          udtStats.sort(sortIndex);\n        }\n        html += displayOpsOnly();\n        html += displayRules();\n        break;\n      }\n      if (type === 'alpha') {\n        ruleStats.sort(sortAlpha);\n        if (udtStats.length > 0) {\n          udtStats.sort(sortAlpha);\n        }\n        html += displayOpsOnly();\n        html += displayRules();\n        break;\n      }\n      break;\n    }\n    html += '</table>\\n';\n    return html;\n  };\n  // Display the stats table in a complete HTML5 page.\n  this.toHtmlPage = function toHtmlPage(type, caption, title) {\n    return utils.htmlToPage(this.toHtml(type, caption), title);\n  };\n};\n","module.exports = {\n\n  // Generated by apglib/style.js \n  CLASS_MONOSPACE: 'apg-mono',\n  CLASS_ACTIVE: 'apg-active',\n  CLASS_EMPTY: 'apg-empty',\n  CLASS_MATCH: 'apg-match',\n  CLASS_NOMATCH: 'apg-nomatch',\n  CLASS_LOOKAHEAD: 'apg-lh-match',\n  CLASS_LOOKBEHIND: 'apg-lb-match',\n  CLASS_REMAINDER: 'apg-remainder',\n  CLASS_CTRLCHAR: 'apg-ctrl-char',\n  CLASS_LINEEND: 'apg-line-end',\n  CLASS_ERROR: 'apg-error',\n  CLASS_PHRASE: 'apg-phrase',\n  CLASS_EMPTYPHRASE: 'apg-empty-phrase',\n  CLASS_STATE: 'apg-state',\n  CLASS_STATS: 'apg-stats',\n  CLASS_TRACE: 'apg-trace',\n  CLASS_GRAMMAR: 'apg-grammar',\n  CLASS_RULES: 'apg-rules',\n  CLASS_RULESLINK: 'apg-rules-link',\n  CLASS_ATTRIBUTES: 'apg-attrs',\n}\n","/* eslint-disable func-names */\n/* eslint-disable prefer-destructuring */\n/* eslint-disable no-restricted-syntax */\n/* eslint-disable guard-for-in */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module provides a means of tracing the parser through the parse tree as it goes.\n// It is the primary debugging facility for debugging both the SABNF grammar syntax\n// and the input strings that are supposed to be valid grammar sentences.\n// It is also a very informative and educational tool for understanding\n// how a parser actually operates for a given language.\n//\n// Tracing is the process of generating and saving a record of information for each passage\n// of the parser through a parse tree node. And since it traverses each node twice, once down the tree\n// and once coming back up, there are two records for each node.\n// This, obviously, has the potential of generating lots of records.\n// And since these records are normally displayed on a web page\n// it is important to have a means to limit the actual number of records generated to\n// probably no more that a few thousand. This is almost always enough to find any errors.\n// The problem is to get the *right* few thousand records.\n// Therefore, this module has a number of ways of limiting and/or filtering, the number and type of records.\n// Considerable effort has been made to make this filtering of the trace output as simple\n// and intuitive as possible.\n//\n// However, the ability to filter the trace records, or for that matter even understand what they are\n// and the information they contain, does require a minimum amount of understanding of the APG parsing\n// method. The parse tree nodes are all represented by APG operators. They break down into two natural groups.\n// - The `RNM` operators and `UDT` operators are named phrases.\n// These are names chosen by the writer of the SABNF grammar to represent special phrases of interest.\n// - All others collect, concatenate and otherwise manipulate various intermediate phrases along the way.\n//\n// There are separate means of filtering which of these operators in each of these two groups get traced.\n// Let `trace` be an instantiated `trace.js` object.\n// Prior to parsing the string, filtering the rules and UDTs can be defined as follows:\n// ```\n// trace.filter.rules[\"rulename\"] = true;\n//     /* trace rule name \"rulename\" */\n// trace.filter.rules[\"udtname\"]  = true;\n//     /* trace UDT name \"udtname\" */\n// trace.filter.rules[\"<ALL>\"]    = true;\n//     /* trace all rules and UDTs (the default) */\n// trace.filter.rules[\"<NONE>\"]   = true;\n//     /* trace no rules or UDTS */\n// ```\n// If any rule or UDT name other than \"&lt;ALL>\" or \"&lt;NONE>\" is specified, all other names are turned off.\n// Therefore, to be selective of rule names, a filter statement is required for each rule/UDT name desired.\n//\n// Filtering of the other operators follows a similar procedure.\n// ```\n// trace.filter.operators[\"TRG\"] = true;\n//     /* trace the terminal range, TRG, operators */\n// trace.filter.operators[\"CAT\"]  = true;\n//     /* trace the concatenations, CAT, operators */\n// trace.filter.operators[\"<ALL>\"]    = true;\n//     /* trace all operators */\n// trace.filter.operators[\"<NONE>\"]   = true;\n//     /* trace no operators (the default) */\n// ```\n// If any operator name other than \"&lt;ALL>\" or \"&lt;NONE>\" is specified, all other names are turned off.\n// Therefore, to be selective of operator names, a filter statement is required for each name desired.\n//\n// There is, additionally, a means for limiting the total number of filtered or saved trace records.\n// See the function, `setMaxRecords(max)` below. This will result in only the last `max` records being saved.\n//\n// (See [`apg-examples`](https://github.com/ldthomas/apg-js-examples) for examples of using `trace.js`.)\nmodule.exports = function exportTrace() {\n  const utils = require('./utilities');\n  const style = require('./style');\n  const circular = new (require('./circular-buffer'))();\n  const id = require('./identifiers');\n\n  const thisFileName = 'trace.js: ';\n  const that = this;\n  const MODE_HEX = 16;\n  const MODE_DEC = 10;\n  const MODE_ASCII = 8;\n  const MODE_UNICODE = 32;\n  const MAX_PHRASE = 80;\n  const MAX_TLS = 5;\n  const records = [];\n  let maxRecords = 5000;\n  let lastRecord = -1;\n  let filteredRecords = 0;\n  let treeDepth = 0;\n  const recordStack = [];\n  let chars = null;\n  let rules = null;\n  let udts = null;\n  const operatorFilter = [];\n  const ruleFilter = [];\n  /* special trace table phrases */\n  const PHRASE_END = `<span class=\"${style.CLASS_LINEEND}\">&bull;</span>`;\n  const PHRASE_CONTINUE = `<span class=\"${style.CLASS_LINEEND}\">&hellip;</span>`;\n  const PHRASE_EMPTY = `<span class=\"${style.CLASS_EMPTY}\">&#120634;</span>`;\n  /* filter the non-RNM & non-UDT operators */\n  const initOperatorFilter = function () {\n    const setOperators = function (set) {\n      operatorFilter[id.ALT] = set;\n      operatorFilter[id.CAT] = set;\n      operatorFilter[id.REP] = set;\n      operatorFilter[id.TLS] = set;\n      operatorFilter[id.TBS] = set;\n      operatorFilter[id.TRG] = set;\n      operatorFilter[id.AND] = set;\n      operatorFilter[id.NOT] = set;\n      operatorFilter[id.BKR] = set;\n      operatorFilter[id.BKA] = set;\n      operatorFilter[id.BKN] = set;\n      operatorFilter[id.ABG] = set;\n      operatorFilter[id.AEN] = set;\n    };\n    let items = 0;\n    // eslint-disable-next-line no-unused-vars\n    for (const name in that.filter.operators) {\n      items += 1;\n    }\n    if (items === 0) {\n      /* case 1: no operators specified: default: do not trace any operators */\n      setOperators(false);\n      return;\n    }\n    for (const name in that.filter.operators) {\n      const upper = name.toUpperCase();\n      if (upper === '<ALL>') {\n        /* case 2: <all> operators specified: trace all operators ignore all other operator commands */\n        setOperators(true);\n        return;\n      }\n      if (upper === '<NONE>') {\n        /* case 3: <none> operators specified: trace NO operators ignore all other operator commands */\n        setOperators(false);\n        return;\n      }\n    }\n    setOperators(false);\n    for (const name in that.filter.operators) {\n      const upper = name.toUpperCase();\n      /* case 4: one or more individual operators specified: trace 'true' operators only */\n      if (upper === 'ALT') {\n        operatorFilter[id.ALT] = that.filter.operators[name] === true;\n      } else if (upper === 'CAT') {\n        operatorFilter[id.CAT] = that.filter.operators[name] === true;\n      } else if (upper === 'REP') {\n        operatorFilter[id.REP] = that.filter.operators[name] === true;\n      } else if (upper === 'AND') {\n        operatorFilter[id.AND] = that.filter.operators[name] === true;\n      } else if (upper === 'NOT') {\n        operatorFilter[id.NOT] = that.filter.operators[name] === true;\n      } else if (upper === 'TLS') {\n        operatorFilter[id.TLS] = that.filter.operators[name] === true;\n      } else if (upper === 'TBS') {\n        operatorFilter[id.TBS] = that.filter.operators[name] === true;\n      } else if (upper === 'TRG') {\n        operatorFilter[id.TRG] = that.filter.operators[name] === true;\n      } else if (upper === 'BKR') {\n        operatorFilter[id.BKR] = that.filter.operators[name] === true;\n      } else if (upper === 'BKA') {\n        operatorFilter[id.BKA] = that.filter.operators[name] === true;\n      } else if (upper === 'BKN') {\n        operatorFilter[id.BKN] = that.filter.operators[name] === true;\n      } else if (upper === 'ABG') {\n        operatorFilter[id.ABG] = that.filter.operators[name] === true;\n      } else if (upper === 'AEN') {\n        operatorFilter[id.AEN] = that.filter.operators[name] === true;\n      } else {\n        throw new Error(\n          `${thisFileName}initOpratorFilter: '${name}' not a valid operator name.` +\n            ` Must be <all>, <none>, alt, cat, rep, tls, tbs, trg, and, not, bkr, bka or bkn`\n        );\n      }\n    }\n  };\n  /* filter the rule and `UDT` named operators */\n  const initRuleFilter = function () {\n    const setRules = function (set) {\n      operatorFilter[id.RNM] = set;\n      operatorFilter[id.UDT] = set;\n      const count = rules.length + udts.length;\n      ruleFilter.length = 0;\n      for (let i = 0; i < count; i += 1) {\n        ruleFilter.push(set);\n      }\n    };\n    let items;\n    let i;\n    const list = [];\n    for (i = 0; i < rules.length; i += 1) {\n      list.push(rules[i].lower);\n    }\n    for (i = 0; i < udts.length; i += 1) {\n      list.push(udts[i].lower);\n    }\n    ruleFilter.length = 0;\n    items = 0;\n    // eslint-disable-next-line no-unused-vars\n    for (const name in that.filter.rules) {\n      items += 1;\n    }\n    if (items === 0) {\n      /* case 1: default to all rules & udts */\n      setRules(true);\n      return;\n    }\n    for (const name in that.filter.rules) {\n      const lower = name.toLowerCase();\n      if (lower === '<all>') {\n        /* case 2: trace all rules ignore all other rule commands */\n        setRules(true);\n        return;\n      }\n      if (lower === '<none>') {\n        /* case 3: trace no rules */\n        setRules(false);\n        return;\n      }\n    }\n    /* case 4: trace only individually specified rules */\n    setRules(false);\n    operatorFilter[id.RNM] = true;\n    operatorFilter[id.UDT] = true;\n    for (const name in that.filter.rules) {\n      const lower = name.toLowerCase();\n      i = list.indexOf(lower);\n      if (i < 0) {\n        throw new Error(`${thisFileName}initRuleFilter: '${name}' not a valid rule or udt name`);\n      }\n      ruleFilter[i] = that.filter.rules[name] === true;\n    }\n  };\n  /* used by other APG components to verify that they have a valid trace object */\n  this.traceObject = 'traceObject';\n  this.filter = {\n    operators: [],\n    rules: [],\n  };\n  // Set the maximum number of records to keep (default = 5000).\n  // Each record number larger than `maxRecords`\n  // will result in deleting the previously oldest record.\n  // - `max`: maximum number of records to retain (default = 5000)\n  // - `last`: last record number to retain, (default = -1 for (unknown) actual last record)\n  this.setMaxRecords = function (max, last) {\n    lastRecord = -1;\n    if (typeof max === 'number' && max > 0) {\n      maxRecords = Math.ceil(max);\n    } else {\n      maxRecords = 0;\n      return;\n    }\n    if (typeof last === 'number') {\n      lastRecord = Math.floor(last);\n      if (lastRecord < 0) {\n        lastRecord = -1;\n      }\n    }\n  };\n  // Returns `maxRecords` to the caller.\n  this.getMaxRecords = function () {\n    return maxRecords;\n  };\n  // Returns `lastRecord` to the caller.\n  this.getLastRecord = function () {\n    return lastRecord;\n  };\n  /* Called only by the `parser.js` object. No verification of input. */\n  this.init = function (rulesIn, udtsIn, charsIn) {\n    records.length = 0;\n    recordStack.length = 0;\n    filteredRecords = 0;\n    treeDepth = 0;\n    chars = charsIn;\n    rules = rulesIn;\n    udts = udtsIn;\n    initOperatorFilter();\n    initRuleFilter();\n    circular.init(maxRecords);\n  };\n  /* returns true if this records passes through the designated filter, false if the record is to be skipped */\n  const filterOps = function (op) {\n    let ret = false;\n    if (op.type === id.RNM) {\n      if (operatorFilter[op.type] && ruleFilter[op.index]) {\n        ret = true;\n      } else {\n        ret = false;\n      }\n    } else if (op.type === id.UDT) {\n      if (operatorFilter[op.type] && ruleFilter[rules.length + op.index]) {\n        ret = true;\n      } else {\n        ret = false;\n      }\n    } else {\n      ret = operatorFilter[op.type];\n    }\n    return ret;\n  };\n  const filterRecords = function (record) {\n    if (lastRecord === -1) {\n      return true;\n    }\n    if (record <= lastRecord) {\n      return true;\n    }\n    return false;\n  };\n  /* Collect the \"down\" record. */\n  this.down = function (op, state, offset, length, anchor, lookAround) {\n    if (filterRecords(filteredRecords) && filterOps(op)) {\n      recordStack.push(filteredRecords);\n      records[circular.increment()] = {\n        dirUp: false,\n        depth: treeDepth,\n        thisLine: filteredRecords,\n        thatLine: undefined,\n        opcode: op,\n        state,\n        phraseIndex: offset,\n        phraseLength: length,\n        lookAnchor: anchor,\n        lookAround,\n      };\n      filteredRecords += 1;\n      treeDepth += 1;\n    }\n  };\n  /* Collect the \"up\" record. */\n  this.up = function (op, state, offset, length, anchor, lookAround) {\n    if (filterRecords(filteredRecords) && filterOps(op)) {\n      const thisLine = filteredRecords;\n      const thatLine = recordStack.pop();\n      const thatRecord = circular.getListIndex(thatLine);\n      if (thatRecord !== -1) {\n        records[thatRecord].thatLine = thisLine;\n      }\n      treeDepth -= 1;\n      records[circular.increment()] = {\n        dirUp: true,\n        depth: treeDepth,\n        thisLine,\n        thatLine,\n        opcode: op,\n        state,\n        phraseIndex: offset,\n        phraseLength: length,\n        lookAnchor: anchor,\n        lookAround,\n      };\n      filteredRecords += 1;\n    }\n  };\n  /* convert the trace records to a tree of nodes */\n  const toTreeObj = function () {\n    /* private helper functions */\n    function nodeOpcode(node, opcode) {\n      let name;\n      let casetype;\n      let modetype;\n      if (opcode) {\n        node.op = { id: opcode.type, name: utils.opcodeToString(opcode.type) };\n        node.opData = undefined;\n        switch (opcode.type) {\n          case id.RNM:\n            node.opData = rules[opcode.index].name;\n            break;\n          case id.UDT:\n            node.opData = udts[opcode.index].name;\n            break;\n          case id.BKR:\n            if (opcode.index < rules.length) {\n              name = rules[opcode.index].name;\n            } else {\n              name = udts[opcode.index - rules.length].name;\n            }\n            casetype = opcode.bkrCase === id.BKR_MODE_CI ? '%i' : '%s';\n            modetype = opcode.bkrMode === id.BKR_MODE_UM ? '%u' : '%p';\n            node.opData = `\\\\\\\\${casetype}${modetype}${name}`;\n            break;\n          case id.TLS:\n            node.opData = [];\n            for (let i = 0; i < opcode.string.length; i += 1) {\n              node.opData.push(opcode.string[i]);\n            }\n            break;\n          case id.TBS:\n            node.opData = [];\n            for (let i = 0; i < opcode.string.length; i += 1) {\n              node.opData.push(opcode.string[i]);\n            }\n            break;\n          case id.TRG:\n            node.opData = [opcode.min, opcode.max];\n            break;\n          case id.REP:\n            node.opData = [opcode.min, opcode.max];\n            break;\n          default:\n            throw new Error('unrecognized opcode');\n        }\n      } else {\n        node.op = { id: undefined, name: undefined };\n        node.opData = undefined;\n      }\n    }\n    function nodePhrase(state, index, length) {\n      if (state === id.MATCH) {\n        return {\n          index,\n          length,\n        };\n      }\n      if (state === id.NOMATCH) {\n        return {\n          index,\n          length: 0,\n        };\n      }\n      if (state === id.EMPTY) {\n        return {\n          index,\n          length: 0,\n        };\n      }\n      return null;\n    }\n    let nodeId = -1;\n    function nodeDown(parent, record, depth) {\n      const node = {\n        // eslint-disable-next-line no-plusplus\n        id: nodeId++,\n        branch: -1,\n        parent,\n        up: false,\n        down: false,\n        depth,\n        children: [],\n      };\n      if (record) {\n        node.down = true;\n        node.state = { id: record.state, name: utils.stateToString(record.state) };\n        node.phrase = null;\n        nodeOpcode(node, record.opcode);\n      } else {\n        node.state = { id: undefined, name: undefined };\n        node.phrase = nodePhrase();\n        nodeOpcode(node, undefined);\n      }\n      return node;\n    }\n    function nodeUp(node, record) {\n      if (record) {\n        node.up = true;\n        node.state = { id: record.state, name: utils.stateToString(record.state) };\n        node.phrase = nodePhrase(record.state, record.phraseIndex, record.phraseLength);\n        if (!node.down) {\n          nodeOpcode(node, record.opcode);\n        }\n      }\n    }\n    /* walk the final tree: label branches and count leaf nodes */\n    let leafNodes = 0;\n    let depth = -1;\n    let branchCount = 1;\n    function walk(node) {\n      depth += 1;\n      node.branch = branchCount;\n      if (depth > treeDepth) {\n        treeDepth = depth;\n      }\n      if (node.children.length === 0) {\n        leafNodes += 1;\n      } else {\n        for (let i = 0; i < node.children.length; i += 1) {\n          if (i > 0) {\n            branchCount += 1;\n          }\n          node.children[i].leftMost = false;\n          node.children[i].rightMost = false;\n          if (node.leftMost) {\n            node.children[i].leftMost = i === 0;\n          }\n          if (node.rightMost) {\n            node.children[i].rightMost = i === node.children.length - 1;\n          }\n          walk(node.children[i]);\n        }\n      }\n      depth -= 1;\n    }\n    function display(node, offset) {\n      let name;\n      const obj = {};\n      obj.id = node.id;\n      obj.branch = node.branch;\n      obj.leftMost = node.leftMost;\n      obj.rightMost = node.rightMost;\n      name = node.state.name ? node.state.name : 'ACTIVE';\n      obj.state = { id: node.state.id, name };\n      name = node.op.name ? node.op.name : '?';\n      obj.op = { id: node.op.id, name };\n      if (typeof node.opData === 'string') {\n        obj.opData = node.opData;\n      } else if (Array.isArray(node.opData)) {\n        obj.opData = [];\n        for (let i = 0; i < node.opData.length; i += 1) {\n          obj.opData[i] = node.opData[i];\n        }\n      } else {\n        obj.opData = undefined;\n      }\n      if (node.phrase) {\n        obj.phrase = { index: node.phrase.index, length: node.phrase.length };\n      } else {\n        obj.phrase = null;\n      }\n      obj.depth = node.depth;\n      obj.children = [];\n      for (let i = 0; i < node.children.length; i += 1) {\n        const c = i !== node.children.length - 1;\n        obj.children[i] = display(node.children[i], offset, c);\n      }\n      return obj;\n    }\n\n    /* construct the tree beginning here */\n    const branch = [];\n    let root;\n    let node;\n    let parent;\n    let record;\n    let firstRecord = true;\n    /* push a dummy node so the root node will have a non-null parent */\n    const dummy = nodeDown(null, null, -1);\n    branch.push(dummy);\n    node = dummy;\n    circular.forEach((lineIndex) => {\n      record = records[lineIndex];\n      if (firstRecord) {\n        firstRecord = false;\n        if (record.depth > 0) {\n          /* push some dummy nodes to fill in for missing records */\n          const num = record.dirUp ? record.depth + 1 : record.depth;\n          for (let i = 0; i < num; i += 1) {\n            parent = node;\n            node = nodeDown(node, null, i);\n            branch.push(node);\n            parent.children.push(node);\n          }\n        }\n      }\n      if (record.dirUp) {\n        /* handle the next record up */\n        node = branch.pop();\n        nodeUp(node, record);\n        node = branch[branch.length - 1];\n      } else {\n        /* handle the next record down */\n        parent = node;\n        node = nodeDown(node, record, record.depth);\n        branch.push(node);\n        parent.children.push(node);\n      }\n    });\n\n    /* if not at root, walk it up to root */\n    while (branch.length > 1) {\n      node = branch.pop();\n      nodeUp(node, null);\n    }\n    /* maybe redundant or paranoid tests: these should never happen */\n    if (dummy.children.length === 0) {\n      throw new Error('trace.toTree(): parse tree has no nodes');\n    }\n    if (branch.length === 0) {\n      throw new Error('trace.toTree(): integrity check: dummy root node disappeared?');\n    }\n\n    /* if no record for start rule: find the pseudo root node (first dummy node above a real node) */\n    root = dummy.children[0];\n    let prev = root;\n    while (root && !root.down && !root.up) {\n      prev = root;\n      root = root.children[0];\n    }\n    root = prev;\n\n    /* walk the tree of nodes: label brances and count leaves */\n    root.leftMost = true;\n    root.rightMost = true;\n    walk(root);\n    root.branch = 0;\n\n    /* generate the exported object */\n    const obj = {};\n    obj.string = [];\n    for (let i = 0; i < chars.length; i += 1) {\n      obj.string[i] = chars[i];\n    }\n    /* generate the exported rule names */\n    obj.rules = [];\n    for (let i = 0; i < rules.length; i += 1) {\n      obj.rules[i] = rules[i].name;\n    }\n    /* generate the exported UDT names */\n    obj.udts = [];\n    for (let i = 0; i < udts.length; i += 1) {\n      obj.udts[i] = udts[i].name;\n    }\n    /* generate the ids */\n    obj.id = {};\n    obj.id.ALT = { id: id.ALT, name: 'ALT' };\n    obj.id.CAT = { id: id.CAT, name: 'CAT' };\n    obj.id.REP = { id: id.REP, name: 'REP' };\n    obj.id.RNM = { id: id.RNM, name: 'RNM' };\n    obj.id.TLS = { id: id.TLS, name: 'TLS' };\n    obj.id.TBS = { id: id.TBS, name: 'TBS' };\n    obj.id.TRG = { id: id.TRG, name: 'TRG' };\n    obj.id.UDT = { id: id.UDT, name: 'UDT' };\n    obj.id.AND = { id: id.AND, name: 'AND' };\n    obj.id.NOT = { id: id.NOT, name: 'NOT' };\n    obj.id.BKR = { id: id.BKR, name: 'BKR' };\n    obj.id.BKA = { id: id.BKA, name: 'BKA' };\n    obj.id.BKN = { id: id.BKN, name: 'BKN' };\n    obj.id.ABG = { id: id.ABG, name: 'ABG' };\n    obj.id.AEN = { id: id.AEN, name: 'AEN' };\n    obj.id.ACTIVE = { id: id.ACTIVE, name: 'ACTIVE' };\n    obj.id.MATCH = { id: id.MATCH, name: 'MATCH' };\n    obj.id.EMPTY = { id: id.EMPTY, name: 'EMPTY' };\n    obj.id.NOMATCH = { id: id.NOMATCH, name: 'NOMATCH' };\n    /* generate the max tree depth */\n    obj.treeDepth = treeDepth;\n    /* generate the number of leaf nodes (branches) */\n    obj.leafNodes = leafNodes;\n    /* generate the types of the left- and right-most branches */\n    let branchesIncomplete;\n    if (root.down) {\n      if (root.up) {\n        branchesIncomplete = 'none';\n      } else {\n        branchesIncomplete = 'right';\n      }\n    } else if (root.up) {\n      branchesIncomplete = 'left';\n    } else {\n      branchesIncomplete = 'both';\n    }\n    obj.branchesIncomplete = branchesIncomplete;\n    obj.tree = display(root, root.depth, false);\n    return obj;\n  };\n  // Returns the trace records as JSON parse tree object.\n  // - stringify: if `true`, the object is 'stringified' before returning, otherwise, the object itself is returned.\n  this.toTree = function (stringify) {\n    const obj = toTreeObj();\n    if (stringify) {\n      return JSON.stringify(obj);\n    }\n    return obj;\n  };\n  // Translate the trace records to HTML format and create a complete HTML page for browser display.\n  this.toHtmlPage = function (mode, caption, title) {\n    return utils.htmlToPage(this.toHtml(mode, caption), title);\n  };\n\n  /* From here on down, these are just helper functions for `toHtml()`. */\n  const htmlHeader = function (mode, caption) {\n    /* open the page */\n    /* write the HTML5 header with table style */\n    /* open the <table> tag */\n    let modeName;\n    switch (mode) {\n      case MODE_HEX:\n        modeName = 'hexadecimal';\n        break;\n      case MODE_DEC:\n        modeName = 'decimal';\n        break;\n      case MODE_ASCII:\n        modeName = 'ASCII';\n        break;\n      case MODE_UNICODE:\n        modeName = 'UNICODE';\n        break;\n      default:\n        throw new Error(`${thisFileName}htmlHeader: unrecognized mode: ${mode}`);\n    }\n    let header = '';\n    header += `<p>display mode: ${modeName}</p>\\n`;\n    header += `<table class=\"${style.CLASS_TRACE}\">\\n`;\n    if (typeof caption === 'string') {\n      header += `<caption>${caption}</caption>`;\n    }\n    return header;\n  };\n  const htmlFooter = function () {\n    let footer = '';\n    /* close the </table> tag */\n    footer += '</table>\\n';\n    /* display a table legend */\n    footer += `<p class=\"${style.CLASS_MONOSPACE}\">legend:<br>\\n`;\n    footer += '(a)&nbsp;-&nbsp;line number<br>\\n';\n    footer += '(b)&nbsp;-&nbsp;matching line number<br>\\n';\n    footer += '(c)&nbsp;-&nbsp;phrase offset<br>\\n';\n    footer += '(d)&nbsp;-&nbsp;phrase length<br>\\n';\n    footer += '(e)&nbsp;-&nbsp;tree depth<br>\\n';\n    footer += '(f)&nbsp;-&nbsp;operator state<br>\\n';\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_ACTIVE}\">&darr;</span>&nbsp;&nbsp;phrase opened<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_MATCH}\">&uarr;M</span> phrase matched<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_EMPTY}\">&uarr;E</span> empty phrase matched<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_NOMATCH}\">&uarr;N</span> phrase not matched<br>\\n`;\n    footer +=\n      'operator&nbsp;-&nbsp;ALT, CAT, REP, RNM, TRG, TLS, TBS<sup>&dagger;</sup>, UDT, AND, NOT, BKA, BKN, BKR, ABG, AEN<sup>&Dagger;</sup><br>\\n';\n    footer += `phrase&nbsp;&nbsp;&nbsp;-&nbsp;up to ${MAX_PHRASE} characters of the phrase being matched<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_MATCH}\">matched characters</span><br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_LOOKAHEAD}\">matched characters in look ahead mode</span><br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_LOOKBEHIND}\">matched characters in look behind mode</span><br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_REMAINDER}\">remainder characters(not yet examined by parser)</span><br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;<span class=\"${style.CLASS_CTRLCHAR}\">control characters, TAB, LF, CR, etc. (ASCII mode only)</span><br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;${PHRASE_EMPTY} empty string<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;${PHRASE_END} end of input string<br>\\n`;\n    footer += `&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;-&nbsp;${PHRASE_CONTINUE} input string display truncated<br>\\n`;\n    footer += '</p>\\n';\n    footer += `<p class=\"${style.CLASS_MONOSPACE}\">\\n`;\n    footer += '<sup>&dagger;</sup>original ABNF operators:<br>\\n';\n    footer += 'ALT - alternation<br>\\n';\n    footer += 'CAT - concatenation<br>\\n';\n    footer += 'REP - repetition<br>\\n';\n    footer += 'RNM - rule name<br>\\n';\n    footer += 'TRG - terminal range<br>\\n';\n    footer += 'TLS - terminal literal string (case insensitive)<br>\\n';\n    footer += 'TBS - terminal binary string (case sensitive)<br>\\n';\n    footer += '<br>\\n';\n    footer += '<sup>&Dagger;</sup>super set SABNF operators:<br>\\n';\n    footer += 'UDT - user-defined terminal<br>\\n';\n    footer += 'AND - positive look ahead<br>\\n';\n    footer += 'NOT - negative look ahead<br>\\n';\n    footer += 'BKA - positive look behind<br>\\n';\n    footer += 'BKN - negative look behind<br>\\n';\n    footer += 'BKR - back reference<br>\\n';\n    footer += 'ABG - anchor - begin of input string<br>\\n';\n    footer += 'AEN - anchor - end of input string<br>\\n';\n    footer += '</p>\\n';\n    return footer;\n  };\n  this.indent = function (depth) {\n    let html = '';\n    for (let i = 0; i < depth; i += 1) {\n      html += '.';\n    }\n    return html;\n  };\n  /* format the TRG operator */\n  const displayTrg = function (mode, op) {\n    let html = '';\n    if (op.type === id.TRG) {\n      if (mode === MODE_HEX || mode === MODE_UNICODE) {\n        let hex = op.min.toString(16).toUpperCase();\n        if (hex.length % 2 !== 0) {\n          hex = `0${hex}`;\n        }\n        html += mode === MODE_HEX ? '%x' : 'U+';\n        html += hex;\n        hex = op.max.toString(16).toUpperCase();\n        if (hex.length % 2 !== 0) {\n          hex = `0${hex}`;\n        }\n        html += `&ndash;${hex}`;\n      } else {\n        html = `%d${op.min.toString(10)}&ndash;${op.max.toString(10)}`;\n      }\n    }\n    return html;\n  };\n  /* format the REP operator */\n  const displayRep = function (mode, op) {\n    let html = '';\n    if (op.type === id.REP) {\n      if (mode === MODE_HEX) {\n        let hex = op.min.toString(16).toUpperCase();\n        if (hex.length % 2 !== 0) {\n          hex = `0${hex}`;\n        }\n        html = `x${hex}`;\n        if (op.max < Infinity) {\n          hex = op.max.toString(16).toUpperCase();\n          if (hex.length % 2 !== 0) {\n            hex = `0${hex}`;\n          }\n        } else {\n          hex = 'inf';\n        }\n        html += `&ndash;${hex}`;\n      } else if (op.max < Infinity) {\n        html = `${op.min.toString(10)}&ndash;${op.max.toString(10)}`;\n      } else {\n        html = `${op.min.toString(10)}&ndash;inf`;\n      }\n    }\n    return html;\n  };\n  /* format the TBS operator */\n  const displayTbs = function (mode, op) {\n    let html = '';\n    if (op.type === id.TBS) {\n      const len = Math.min(op.string.length, MAX_TLS * 2);\n      if (mode === MODE_HEX || mode === MODE_UNICODE) {\n        html += mode === MODE_HEX ? '%x' : 'U+';\n        for (let i = 0; i < len; i += 1) {\n          let hex;\n          if (i > 0) {\n            html += '.';\n          }\n          hex = op.string[i].toString(16).toUpperCase();\n          if (hex.length % 2 !== 0) {\n            hex = `0${hex}`;\n          }\n          html += hex;\n        }\n      } else {\n        html = '%d';\n        for (let i = 0; i < len; i += 1) {\n          if (i > 0) {\n            html += '.';\n          }\n          html += op.string[i].toString(10);\n        }\n      }\n      if (len < op.string.length) {\n        html += PHRASE_CONTINUE;\n      }\n    }\n    return html;\n  };\n  /* format the TLS operator */\n  const displayTls = function (mode, op) {\n    let html = '';\n    if (op.type === id.TLS) {\n      const len = Math.min(op.string.length, MAX_TLS);\n      if (mode === MODE_HEX || mode === MODE_DEC) {\n        let charu;\n        let charl;\n        let base;\n        if (mode === MODE_HEX) {\n          html = '%x';\n          base = 16;\n        } else {\n          html = '%d';\n          base = 10;\n        }\n        for (let i = 0; i < len; i += 1) {\n          if (i > 0) {\n            html += '.';\n          }\n          charl = op.string[i];\n          if (charl >= 97 && charl <= 122) {\n            charu = charl - 32;\n            html += `${charu.toString(base)}/${charl.toString(base)}`.toUpperCase();\n          } else if (charl >= 65 && charl <= 90) {\n            charu = charl;\n            charl += 32;\n            html += `${charu.toString(base)}/${charl.toString(base)}`.toUpperCase();\n          } else {\n            html += charl.toString(base).toUpperCase();\n          }\n        }\n        if (len < op.string.length) {\n          html += PHRASE_CONTINUE;\n        }\n      } else {\n        html = '\"';\n        for (let i = 0; i < len; i += 1) {\n          html += utils.asciiChars[op.string[i]];\n        }\n        if (len < op.string.length) {\n          html += PHRASE_CONTINUE;\n        }\n        html += '\"';\n      }\n    }\n    return html;\n  };\n  const subPhrase = function (mode, charsArg, index, length, prev) {\n    if (length === 0) {\n      return '';\n    }\n    let phrase = '';\n    const comma = prev ? ',' : '';\n    switch (mode) {\n      case MODE_HEX:\n        phrase = comma + utils.charsToHex(charsArg, index, length);\n        break;\n      case MODE_DEC:\n        if (prev) {\n          return `,${utils.charsToDec(charsArg, index, length)}`;\n        }\n        phrase = comma + utils.charsToDec(charsArg, index, length);\n        break;\n      case MODE_UNICODE:\n        phrase = utils.charsToUnicode(charsArg, index, length);\n        break;\n      case MODE_ASCII:\n      default:\n        phrase = utils.charsToAsciiHtml(charsArg, index, length);\n        break;\n    }\n    return phrase;\n  };\n  /* display phrases matched in look-behind mode */\n  const displayBehind = function (mode, charsArg, state, index, length, anchor) {\n    let html = '';\n    let beg1;\n    let len1;\n    let beg2;\n    let len2;\n    let lastchar = PHRASE_END;\n    const spanBehind = `<span class=\"${style.CLASS_LOOKBEHIND}\">`;\n    const spanRemainder = `<span class=\"${style.CLASS_REMAINDER}\">`;\n    const spanend = '</span>';\n    let prev = false;\n    switch (state) {\n      case id.EMPTY:\n        html += PHRASE_EMPTY;\n      /* // eslint-disable-next-line no-fallthrough */\n      case id.NOMATCH:\n      case id.MATCH:\n      case id.ACTIVE:\n        beg1 = index - length;\n        len1 = anchor - beg1;\n        beg2 = anchor;\n        len2 = charsArg.length - beg2;\n        break;\n      default:\n        throw new Error('unrecognized state');\n    }\n    lastchar = PHRASE_END;\n    if (len1 > MAX_PHRASE) {\n      len1 = MAX_PHRASE;\n      lastchar = PHRASE_CONTINUE;\n      len2 = 0;\n    } else if (len1 + len2 > MAX_PHRASE) {\n      lastchar = PHRASE_CONTINUE;\n      len2 = MAX_PHRASE - len1;\n    }\n    if (len1 > 0) {\n      html += spanBehind;\n      html += subPhrase(mode, charsArg, beg1, len1, prev);\n      html += spanend;\n      prev = true;\n    }\n    if (len2 > 0) {\n      html += spanRemainder;\n      html += subPhrase(mode, charsArg, beg2, len2, prev);\n      html += spanend;\n    }\n    return html + lastchar;\n  };\n  const displayForward = function (mode, charsArg, state, index, length, spanAhead) {\n    let html = '';\n    let beg1;\n    let len1;\n    let beg2;\n    let len2;\n    let lastchar = PHRASE_END;\n    const spanRemainder = `<span class=\"${style.CLASS_REMAINDER}\">`;\n    const spanend = '</span>';\n    let prev = false;\n    switch (state) {\n      case id.EMPTY:\n        html += PHRASE_EMPTY;\n      /* // eslint-disable-next-line no-fallthrough */\n      case id.NOMATCH:\n      case id.ACTIVE:\n        beg1 = index;\n        len1 = 0;\n        beg2 = index;\n        len2 = charsArg.length - beg2;\n        break;\n      case id.MATCH:\n        beg1 = index;\n        len1 = length;\n        beg2 = index + len1;\n        len2 = charsArg.length - beg2;\n        break;\n      default:\n        throw new Error('unrecognized state');\n    }\n    lastchar = PHRASE_END;\n    if (len1 > MAX_PHRASE) {\n      len1 = MAX_PHRASE;\n      lastchar = PHRASE_CONTINUE;\n      len2 = 0;\n    } else if (len1 + len2 > MAX_PHRASE) {\n      lastchar = PHRASE_CONTINUE;\n      len2 = MAX_PHRASE - len1;\n    }\n    if (len1 > 0) {\n      html += spanAhead;\n      html += subPhrase(mode, charsArg, beg1, len1, prev);\n      html += spanend;\n      prev = true;\n    }\n    if (len2 > 0) {\n      html += spanRemainder;\n      html += subPhrase(mode, charsArg, beg2, len2, prev);\n      html += spanend;\n    }\n    return html + lastchar;\n  };\n  /* display phrases matched in look-ahead mode */\n  const displayAhead = function (mode, charsArg, state, index, length) {\n    const spanAhead = `<span class=\"${style.CLASS_LOOKAHEAD}\">`;\n    return displayForward(mode, charsArg, state, index, length, spanAhead);\n  };\n  /* display phrases matched in normal parsing mode */\n  const displayNone = function (mode, charsArg, state, index, length) {\n    const spanAhead = `<span class=\"${style.CLASS_MATCH}\">`;\n    return displayForward(mode, charsArg, state, index, length, spanAhead);\n  };\n  /* Returns the filtered records, formatted as an HTML table. */\n  const htmlTable = function (mode) {\n    if (rules === null) {\n      return '';\n    }\n    let html = '';\n    let thisLine;\n    let thatLine;\n    let lookAhead;\n    let lookBehind;\n    let lookAround;\n    let anchor;\n    html += '<tr><th>(a)</th><th>(b)</th><th>(c)</th><th>(d)</th><th>(e)</th><th>(f)</th>';\n    html += '<th>operator</th><th>phrase</th></tr>\\n';\n    circular.forEach((lineIndex) => {\n      const line = records[lineIndex];\n      thisLine = line.thisLine;\n      thatLine = line.thatLine !== undefined ? line.thatLine : '--';\n      lookAhead = false;\n      lookBehind = false;\n      lookAround = false;\n      if (line.lookAround === id.LOOKAROUND_AHEAD) {\n        lookAhead = true;\n        lookAround = true;\n        anchor = line.lookAnchor;\n      }\n      if (line.opcode.type === id.AND || line.opcode.type === id.NOT) {\n        lookAhead = true;\n        lookAround = true;\n        anchor = line.phraseIndex;\n      }\n      if (line.lookAround === id.LOOKAROUND_BEHIND) {\n        lookBehind = true;\n        lookAround = true;\n        anchor = line.lookAnchor;\n      }\n      if (line.opcode.type === id.BKA || line.opcode.type === id.BKN) {\n        lookBehind = true;\n        lookAround = true;\n        anchor = line.phraseIndex;\n      }\n      html += '<tr>';\n      html += `<td>${thisLine}</td><td>${thatLine}</td>`;\n      html += `<td>${line.phraseIndex}</td>`;\n      html += `<td>${line.phraseLength}</td>`;\n      html += `<td>${line.depth}</td>`;\n      html += '<td>';\n      switch (line.state) {\n        case id.ACTIVE:\n          html += `<span class=\"${style.CLASS_ACTIVE}\">&darr;&nbsp;</span>`;\n          break;\n        case id.MATCH:\n          html += `<span class=\"${style.CLASS_MATCH}\">&uarr;M</span>`;\n          break;\n        case id.NOMATCH:\n          html += `<span class=\"${style.CLASS_NOMATCH}\">&uarr;N</span>`;\n          break;\n        case id.EMPTY:\n          html += `<span class=\"${style.CLASS_EMPTY}\">&uarr;E</span>`;\n          break;\n        default:\n          html += `<span class=\"${style.CLASS_ACTIVE}\">--</span>`;\n          break;\n      }\n      html += '</td>';\n      html += '<td>';\n      html += that.indent(line.depth);\n      if (lookAhead) {\n        html += `<span class=\"${style.CLASS_LOOKAHEAD}\">`;\n      } else if (lookBehind) {\n        html += `<span class=\"${style.CLASS_LOOKBEHIND}\">`;\n      }\n      html += utils.opcodeToString(line.opcode.type);\n      if (line.opcode.type === id.RNM) {\n        html += `(${rules[line.opcode.index].name}) `;\n      }\n      if (line.opcode.type === id.BKR) {\n        const casetype = line.opcode.bkrCase === id.BKR_MODE_CI ? '%i' : '%s';\n        const modetype = line.opcode.bkrMode === id.BKR_MODE_UM ? '%u' : '%p';\n        html += `(\\\\${casetype}${modetype}${rules[line.opcode.index].name}) `;\n      }\n      if (line.opcode.type === id.UDT) {\n        html += `(${udts[line.opcode.index].name}) `;\n      }\n      if (line.opcode.type === id.TRG) {\n        html += `(${displayTrg(mode, line.opcode)}) `;\n      }\n      if (line.opcode.type === id.TBS) {\n        html += `(${displayTbs(mode, line.opcode)}) `;\n      }\n      if (line.opcode.type === id.TLS) {\n        html += `(${displayTls(mode, line.opcode)}) `;\n      }\n      if (line.opcode.type === id.REP) {\n        html += `(${displayRep(mode, line.opcode)}) `;\n      }\n      if (lookAround) {\n        html += '</span>';\n      }\n      html += '</td>';\n      html += '<td>';\n      if (lookBehind) {\n        html += displayBehind(mode, chars, line.state, line.phraseIndex, line.phraseLength, anchor);\n      } else if (lookAhead) {\n        html += displayAhead(mode, chars, line.state, line.phraseIndex, line.phraseLength);\n      } else {\n        html += displayNone(mode, chars, line.state, line.phraseIndex, line.phraseLength);\n      }\n      html += '</td></tr>\\n';\n    });\n    html += '<tr><th>(a)</th><th>(b)</th><th>(c)</th><th>(d)</th><th>(e)</th><th>(f)</th>';\n    html += '<th>operator</th><th>phrase</th></tr>\\n';\n    html += '</table>\\n';\n    return html;\n  };\n  // Translate the trace records to HTML format.\n  // - *modearg* - can be `\"ascii\"`, `\"decimal\"`, `\"hexadecimal\"` or `\"unicode\"`.\n  // Determines the format of the string character code display.\n  // - *caption* - optional caption for the HTML table.\n  this.toHtml = function (modearg, caption) {\n    /* writes the trace records as a table in a complete html page */\n    let mode = MODE_ASCII;\n    if (typeof modearg === 'string' && modearg.length >= 3) {\n      const modein = modearg.toLowerCase().slice(0, 3);\n      if (modein === 'hex') {\n        mode = MODE_HEX;\n      } else if (modein === 'dec') {\n        mode = MODE_DEC;\n      } else if (modein === 'uni') {\n        mode = MODE_UNICODE;\n      }\n    }\n    let html = '';\n    html += htmlHeader(mode, caption);\n    html += htmlTable(mode);\n    html += htmlFooter();\n    return html;\n  };\n};\n","/* eslint-disable func-names */\n/*  *************************************************************************************\n *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved\n *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)\n *   ********************************************************************************* */\n// This module exports a variety of utility functions that support\n// [`apg`](https://github.com/ldthomas/apg-js2), [`apg-lib`](https://github.com/ldthomas/apg-js2-lib)\n// and the generated parser applications.\n\nconst style = require('./style');\nconst converter = require('../apg-conv-api/converter');\nconst emitCss = require('./emitcss');\nconst id = require('./identifiers');\n\nconst thisFileName = 'utilities.js: ';\n\n/* translate (implied) phrase beginning character and length to actual first and last character indexes */\n/* used by multiple phrase handling functions */\nconst getBounds = function (length, begArg, len) {\n  let end;\n  let beg = begArg;\n  const TRUE = true;\n  while (TRUE) {\n    if (length <= 0) {\n      beg = 0;\n      end = 0;\n      break;\n    }\n    if (typeof beg !== 'number') {\n      beg = 0;\n      end = length;\n      break;\n    }\n    if (beg >= length) {\n      beg = length;\n      end = length;\n      break;\n    }\n    if (typeof len !== 'number') {\n      end = length;\n      break;\n    }\n    end = beg + len;\n    if (end > length) {\n      end = length;\n      break;\n    }\n    break;\n  }\n  return {\n    beg,\n    end,\n  };\n};\n// Generates a complete, minimal HTML5 page, inserting the user's HTML text on the page.\n// - *html* - the page text in HTML format\n// - *title* - the HTML page `<title>` - defaults to `htmlToPage`.\nexports.htmlToPage = function (html, titleArg) {\n  let title;\n  if (typeof html !== 'string') {\n    throw new Error(`${thisFileName}htmlToPage: input HTML is not a string`);\n  }\n  if (typeof titleArg !== 'string') {\n    title = 'htmlToPage';\n  } else {\n    title = titleArg;\n  }\n  let page = '';\n  page += '<!DOCTYPE html>\\n';\n  page += '<html lang=\"en\">\\n';\n  page += '<head>\\n';\n  page += '<meta charset=\"utf-8\">\\n';\n  page += `<title>${title}</title>\\n`;\n  page += '<style>\\n';\n  page += emitCss();\n  page += '</style>\\n';\n  page += '</head>\\n<body>\\n';\n  page += `<p>${new Date()}</p>\\n`;\n  page += html;\n  page += '</body>\\n</html>\\n';\n  return page;\n};\n// Formats the returned object from `parser.parse()`\n// into an HTML table.\n// ```\n// return {\n//   success : sysData.success,\n//   state : sysData.state,\n//   length : charsLength,\n//   matched : sysData.phraseLength,\n//   maxMatched : maxMatched,\n//   maxTreeDepth : maxTreeDepth,\n//   nodeHits : nodeHits,\n//   inputLength : chars.length,\n//   subBegin : charsBegin,\n//   subEnd : charsEnd,\n//   subLength : charsLength\n// };\n// ```\nexports.parserResultToHtml = function (result, caption) {\n  let cap = null;\n  if (typeof caption === 'string' && caption !== '') {\n    cap = caption;\n  }\n  let success;\n  let state;\n  if (result.success === true) {\n    success = `<span class=\"${style.CLASS_MATCH}\">true</span>`;\n  } else {\n    success = `<span class=\"${style.CLASS_NOMATCH}\">false</span>`;\n  }\n  if (result.state === id.EMPTY) {\n    state = `<span class=\"${style.CLASS_EMPTY}\">EMPTY</span>`;\n  } else if (result.state === id.MATCH) {\n    state = `<span class=\"${style.CLASS_MATCH}\">MATCH</span>`;\n  } else if (result.state === id.NOMATCH) {\n    state = `<span class=\"${style.CLASS_NOMATCH}\">NOMATCH</span>`;\n  } else {\n    state = `<span class=\"${style.CLASS_NOMATCH}\">unrecognized</span>`;\n  }\n  let html = '';\n  html += `<table class=\"${style.CLASS_STATE}\">\\n`;\n  if (cap) {\n    html += `<caption>${cap}</caption>\\n`;\n  }\n  html += '<tr><th>state item</th><th>value</th><th>description</th></tr>\\n';\n  html += `<tr><td>parser success</td><td>${success}</td>\\n`;\n  html += `<td><span class=\"${style.CLASS_MATCH}\">true</span> if the parse succeeded,\\n`;\n  html += ` <span class=\"${style.CLASS_NOMATCH}\">false</span> otherwise`;\n  html += '<br><i>NOTE: for success, entire string must be matched</i></td></tr>\\n';\n  html += `<tr><td>parser state</td><td>${state}</td>\\n`;\n  html += `<td><span class=\"${style.CLASS_EMPTY}\">EMPTY</span>, `;\n  html += `<span class=\"${style.CLASS_MATCH}\">MATCH</span> or \\n`;\n  html += `<span class=\"${style.CLASS_NOMATCH}\">NOMATCH</span></td></tr>\\n`;\n  html += `<tr><td>string length</td><td>${result.length}</td><td>length of the input (sub)string</td></tr>\\n`;\n  html += `<tr><td>matched length</td><td>${result.matched}</td><td>number of input string characters matched</td></tr>\\n`;\n  html += `<tr><td>max matched</td><td>${result.maxMatched}</td><td>maximum number of input string characters matched</td></tr>\\n`;\n  html += `<tr><td>max tree depth</td><td>${result.maxTreeDepth}</td><td>maximum depth of the parse tree reached</td></tr>\\n`;\n  html += `<tr><td>node hits</td><td>${result.nodeHits}</td><td>number of parse tree node hits (opcode function calls)</td></tr>\\n`;\n  html += `<tr><td>input length</td><td>${result.inputLength}</td><td>length of full input string</td></tr>\\n`;\n  html += `<tr><td>sub-string begin</td><td>${result.subBegin}</td><td>sub-string first character index</td></tr>\\n`;\n  html += `<tr><td>sub-string end</td><td>${result.subEnd}</td><td>sub-string end-of-string index</td></tr>\\n`;\n  html += `<tr><td>sub-string length</td><td>${result.subLength}</td><td>sub-string length</td></tr>\\n`;\n  html += '</table>\\n';\n  return html;\n};\n// Translates a sub-array of integer character codes into a string.\n// Very useful in callback functions to translate the matched phrases into strings.\nexports.charsToString = function (chars, phraseIndex, phraseLength) {\n  let beg;\n  let end;\n  if (typeof phraseIndex === 'number') {\n    if (phraseIndex >= chars.length) {\n      return '';\n    }\n    beg = phraseIndex < 0 ? 0 : phraseIndex;\n  } else {\n    beg = 0;\n  }\n  if (typeof phraseLength === 'number') {\n    if (phraseLength <= 0) {\n      return '';\n    }\n    end = phraseLength > chars.length - beg ? chars.length : beg + phraseLength;\n  } else {\n    end = chars.length;\n  }\n  if (beg < end) {\n    return converter.encode('UTF16LE', chars.slice(beg, end)).toString('utf16le');\n  }\n  return '';\n};\n// Translates a string into an array of integer character codes.\nexports.stringToChars = function (string) {\n  return converter.decode('STRING', string);\n};\n// Translates an opcode identifier into a human-readable string.\nexports.opcodeToString = function (type) {\n  let ret = 'unknown';\n  switch (type) {\n    case id.ALT:\n      ret = 'ALT';\n      break;\n    case id.CAT:\n      ret = 'CAT';\n      break;\n    case id.RNM:\n      ret = 'RNM';\n      break;\n    case id.UDT:\n      ret = 'UDT';\n      break;\n    case id.AND:\n      ret = 'AND';\n      break;\n    case id.NOT:\n      ret = 'NOT';\n      break;\n    case id.REP:\n      ret = 'REP';\n      break;\n    case id.TRG:\n      ret = 'TRG';\n      break;\n    case id.TBS:\n      ret = 'TBS';\n      break;\n    case id.TLS:\n      ret = 'TLS';\n      break;\n    case id.BKR:\n      ret = 'BKR';\n      break;\n    case id.BKA:\n      ret = 'BKA';\n      break;\n    case id.BKN:\n      ret = 'BKN';\n      break;\n    case id.ABG:\n      ret = 'ABG';\n      break;\n    case id.AEN:\n      ret = 'AEN';\n      break;\n    default:\n      throw new Error('unrecognized opcode');\n  }\n  return ret;\n};\n// Translates an state identifier into a human-readable string.\nexports.stateToString = function (state) {\n  let ret = 'unknown';\n  switch (state) {\n    case id.ACTIVE:\n      ret = 'ACTIVE';\n      break;\n    case id.MATCH:\n      ret = 'MATCH';\n      break;\n    case id.EMPTY:\n      ret = 'EMPTY';\n      break;\n    case id.NOMATCH:\n      ret = 'NOMATCH';\n      break;\n    default:\n      throw new Error('unrecognized state');\n  }\n  return ret;\n};\n// Array which translates all 128, 7-bit ASCII character codes to their respective HTML format.\nexports.asciiChars = [\n  'NUL',\n  'SOH',\n  'STX',\n  'ETX',\n  'EOT',\n  'ENQ',\n  'ACK',\n  'BEL',\n  'BS',\n  'TAB',\n  'LF',\n  'VT',\n  'FF',\n  'CR',\n  'SO',\n  'SI',\n  'DLE',\n  'DC1',\n  'DC2',\n  'DC3',\n  'DC4',\n  'NAK',\n  'SYN',\n  'ETB',\n  'CAN',\n  'EM',\n  'SUB',\n  'ESC',\n  'FS',\n  'GS',\n  'RS',\n  'US',\n  '&nbsp;',\n  '!',\n  '&#34;',\n  '#',\n  '$',\n  '%',\n  '&#38;',\n  '&#39;',\n  '(',\n  ')',\n  '*',\n  '+',\n  ',',\n  '-',\n  '.',\n  '/',\n  '0',\n  '1',\n  '2',\n  '3',\n  '4',\n  '5',\n  '6',\n  '7',\n  '8',\n  '9',\n  ':',\n  ';',\n  '&#60;',\n  '=',\n  '&#62;',\n  '?',\n  '@',\n  'A',\n  'B',\n  'C',\n  'D',\n  'E',\n  'F',\n  'G',\n  'H',\n  'I',\n  'J',\n  'K',\n  'L',\n  'M',\n  'N',\n  'O',\n  'P',\n  'Q',\n  'R',\n  'S',\n  'T',\n  'U',\n  'V',\n  'W',\n  'X',\n  'Y',\n  'Z',\n  '[',\n  '&#92;',\n  ']',\n  '^',\n  '_',\n  '`',\n  'a',\n  'b',\n  'c',\n  'd',\n  'e',\n  'f',\n  'g',\n  'h',\n  'i',\n  'j',\n  'k',\n  'l',\n  'm',\n  'n',\n  'o',\n  'p',\n  'q',\n  'r',\n  's',\n  't',\n  'u',\n  'v',\n  'w',\n  'x',\n  'y',\n  'z',\n  '{',\n  '|',\n  '}',\n  '~',\n  'DEL',\n];\n// Translates a single character to hexadecimal with leading zeros for 2, 4, or 8 digit display.\nexports.charToHex = function (char) {\n  let ch = char.toString(16).toUpperCase();\n  switch (ch.length) {\n    case 1:\n    case 3:\n    case 7:\n      ch = `0${ch}`;\n      break;\n    case 2:\n    case 6:\n      ch = `00${ch}`;\n      break;\n    case 4:\n      break;\n    case 5:\n      ch = `000${ch}`;\n      break;\n    default:\n      throw new Error('unrecognized option');\n  }\n  return ch;\n};\n// Translates a sub-array of character codes to decimal display format.\nexports.charsToDec = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToDec: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  if (bounds.end > bounds.beg) {\n    ret += chars[bounds.beg];\n    for (let i = bounds.beg + 1; i < bounds.end; i += 1) {\n      ret += `,${chars[i]}`;\n    }\n  }\n  return ret;\n};\n// Translates a sub-array of character codes to hexadecimal display format.\nexports.charsToHex = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToHex: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  if (bounds.end > bounds.beg) {\n    ret += `\\\\x${exports.charToHex(chars[bounds.beg])}`;\n    for (let i = bounds.beg + 1; i < bounds.end; i += 1) {\n      ret += `,\\\\x${exports.charToHex(chars[i])}`;\n    }\n  }\n  return ret;\n};\nexports.charsToHtmlEntities = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToHex: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  if (bounds.end > bounds.beg) {\n    for (let i = bounds.beg; i < bounds.end; i += 1) {\n      ret += `&#x${chars[i].toString(16)};`;\n    }\n  }\n  return ret;\n};\n// Translates a sub-array of character codes to Unicode display format.\nfunction isUnicode(char) {\n  if (char >= 0xd800 && char <= 0xdfff) {\n    return false;\n  }\n  if (char > 0x10ffff) {\n    return false;\n  }\n  return true;\n}\nexports.charsToUnicode = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToUnicode: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  if (bounds.end > bounds.beg) {\n    for (let i = bounds.beg; i < bounds.end; i += 1) {\n      if (isUnicode(chars[i])) {\n        ret += `&#${chars[i]};`;\n      } else {\n        ret += ` U+${exports.charToHex(chars[i])}`;\n      }\n    }\n  }\n  return ret;\n};\n// Translates a sub-array of character codes to JavaScript Unicode display format (`\\uXXXX`).\nexports.charsToJsUnicode = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToJsUnicode: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  if (bounds.end > bounds.beg) {\n    ret += `\\\\u${exports.charToHex(chars[bounds.beg])}`;\n    for (let i = bounds.beg + 1; i < bounds.end; i += 1) {\n      ret += `,\\\\u${exports.charToHex(chars[i])}`;\n    }\n  }\n  return ret;\n};\n// Translates a sub-array of character codes to printing ASCII character display format.\nexports.charsToAscii = function (chars, beg, len) {\n  let ret = '';\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToAscii: input must be an array of integers`);\n  }\n  const bounds = getBounds(chars.length, beg, len);\n  for (let i = bounds.beg; i < bounds.end; i += 1) {\n    const char = chars[i];\n    if (char >= 32 && char <= 126) {\n      ret += String.fromCharCode(char);\n    } else {\n      ret += `\\\\x${exports.charToHex(char)}`;\n    }\n  }\n  return ret;\n};\n// Translates a sub-array of character codes to HTML display format.\nexports.charsToAsciiHtml = function (chars, beg, len) {\n  if (!Array.isArray(chars)) {\n    throw new Error(`${thisFileName}charsToAsciiHtml: input must be an array of integers`);\n  }\n  let html = '';\n  let char;\n  const bounds = getBounds(chars.length, beg, len);\n  for (let i = bounds.beg; i < bounds.end; i += 1) {\n    char = chars[i];\n    if (char < 32 || char === 127) {\n      /* control characters */\n      html += `<span class=\"${style.CLASS_CTRLCHAR}\">${exports.asciiChars[char]}</span>`;\n    } else if (char > 127) {\n      /* non-ASCII */\n      html += `<span class=\"${style.CLASS_CTRLCHAR}\">U+${exports.charToHex(char)}</span>`;\n    } else {\n      /* printing ASCII, 32 <= char <= 126 */\n      html += exports.asciiChars[char];\n    }\n  }\n  return html;\n};\n// Translates a JavaScript string to HTML display format.\nexports.stringToAsciiHtml = function (str) {\n  const chars = converter.decode('STRING', str);\n  return this.charsToAsciiHtml(chars);\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createCurve = exports.getHash = void 0;\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nconst hmac_1 = require(\"@noble/hashes/hmac\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst weierstrass_js_1 = require(\"./abstract/weierstrass.js\");\n// connects noble-curves to noble-hashes\nfunction getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => (0, hmac_1.hmac)(hash, key, (0, utils_1.concatBytes)(...msgs)),\n        randomBytes: utils_1.randomBytes,\n    };\n}\nexports.getHash = getHash;\nfunction createCurve(curveDef, defHash) {\n    const create = (hash) => (0, weierstrass_js_1.weierstrass)({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\nexports.createCurve = createCurve;\n//# sourceMappingURL=_shortw_utils.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateBasic = exports.wNAF = void 0;\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nconst modular_js_1 = require(\"./modular.js\");\nconst utils_js_1 = require(\"./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\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 > _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}\nexports.wNAF = wNAF;\nfunction validateBasic(curve) {\n    (0, modular_js_1.validateField)(curve.Fp);\n    (0, utils_js_1.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        ...(0, modular_js_1.nLength)(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\nexports.validateBasic = validateBasic;\n//# sourceMappingURL=curve.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createHasher = exports.isogenyMap = exports.hash_to_field = exports.expand_message_xof = exports.expand_message_xmd = void 0;\nconst modular_js_1 = require(\"./modular.js\");\nconst utils_js_1 = require(\"./utils.js\");\nfunction validateDST(dst) {\n    if (dst instanceof Uint8Array)\n        return dst;\n    if (typeof dst === 'string')\n        return (0, utils_js_1.utf8ToBytes)(dst);\n    throw new Error('DST must be Uint8Array or string');\n}\n// Octet Stream to Integer. \"spec\" implementation of os2ip is 2.5x slower vs bytesToNumberBE.\nconst os2ip = utils_js_1.bytesToNumberBE;\n// Integer to Octet Stream (numberToBytesBE)\nfunction i2osp(value, length) {\n    if (value < 0 || value >= 1 << (8 * length)) {\n        throw new Error(`bad I2OSP call: value=${value} length=${length}`);\n    }\n    const res = Array.from({ length }).fill(0);\n    for (let i = length - 1; i >= 0; i--) {\n        res[i] = value & 0xff;\n        value >>>= 8;\n    }\n    return new Uint8Array(res);\n}\nfunction strxor(a, b) {\n    const arr = new Uint8Array(a.length);\n    for (let i = 0; i < a.length; i++) {\n        arr[i] = a[i] ^ b[i];\n    }\n    return arr;\n}\nfunction isBytes(item) {\n    if (!(item instanceof Uint8Array))\n        throw new Error('Uint8Array expected');\n}\nfunction isNum(item) {\n    if (!Number.isSafeInteger(item))\n        throw new Error('number expected');\n}\n// Produces a uniformly random byte string using a cryptographic hash function H that outputs b bits\n// https://www.rfc-editor.org/rfc/rfc9380#section-5.3.1\nfunction expand_message_xmd(msg, DST, lenInBytes, H) {\n    isBytes(msg);\n    isBytes(DST);\n    isNum(lenInBytes);\n    // https://www.rfc-editor.org/rfc/rfc9380#section-5.3.3\n    if (DST.length > 255)\n        DST = H((0, utils_js_1.concatBytes)((0, utils_js_1.utf8ToBytes)('H2C-OVERSIZE-DST-'), DST));\n    const { outputLen: b_in_bytes, blockLen: r_in_bytes } = H;\n    const ell = Math.ceil(lenInBytes / b_in_bytes);\n    if (ell > 255)\n        throw new Error('Invalid xmd length');\n    const DST_prime = (0, utils_js_1.concatBytes)(DST, i2osp(DST.length, 1));\n    const Z_pad = i2osp(0, r_in_bytes);\n    const l_i_b_str = i2osp(lenInBytes, 2); // len_in_bytes_str\n    const b = new Array(ell);\n    const b_0 = H((0, utils_js_1.concatBytes)(Z_pad, msg, l_i_b_str, i2osp(0, 1), DST_prime));\n    b[0] = H((0, utils_js_1.concatBytes)(b_0, i2osp(1, 1), DST_prime));\n    for (let i = 1; i <= ell; i++) {\n        const args = [strxor(b_0, b[i - 1]), i2osp(i + 1, 1), DST_prime];\n        b[i] = H((0, utils_js_1.concatBytes)(...args));\n    }\n    const pseudo_random_bytes = (0, utils_js_1.concatBytes)(...b);\n    return pseudo_random_bytes.slice(0, lenInBytes);\n}\nexports.expand_message_xmd = expand_message_xmd;\n// Produces a uniformly random byte string using an extendable-output function (XOF) H.\n// 1. The collision resistance of H MUST be at least k bits.\n// 2. H MUST be an XOF that has been proved indifferentiable from\n//    a random oracle under a reasonable cryptographic assumption.\n// https://www.rfc-editor.org/rfc/rfc9380#section-5.3.2\nfunction expand_message_xof(msg, DST, lenInBytes, k, H) {\n    isBytes(msg);\n    isBytes(DST);\n    isNum(lenInBytes);\n    // https://www.rfc-editor.org/rfc/rfc9380#section-5.3.3\n    // DST = H('H2C-OVERSIZE-DST-' || a_very_long_DST, Math.ceil((lenInBytes * k) / 8));\n    if (DST.length > 255) {\n        const dkLen = Math.ceil((2 * k) / 8);\n        DST = H.create({ dkLen }).update((0, utils_js_1.utf8ToBytes)('H2C-OVERSIZE-DST-')).update(DST).digest();\n    }\n    if (lenInBytes > 65535 || DST.length > 255)\n        throw new Error('expand_message_xof: invalid lenInBytes');\n    return (H.create({ dkLen: lenInBytes })\n        .update(msg)\n        .update(i2osp(lenInBytes, 2))\n        // 2. DST_prime = DST || I2OSP(len(DST), 1)\n        .update(DST)\n        .update(i2osp(DST.length, 1))\n        .digest());\n}\nexports.expand_message_xof = expand_message_xof;\n/**\n * Hashes arbitrary-length byte strings to a list of one or more elements of a finite field F\n * https://www.rfc-editor.org/rfc/rfc9380#section-5.2\n * @param msg a byte string containing the message to hash\n * @param count the number of elements of F to output\n * @param options `{DST: string, p: bigint, m: number, k: number, expand: 'xmd' | 'xof', hash: H}`, see above\n * @returns [u_0, ..., u_(count - 1)], a list of field elements.\n */\nfunction hash_to_field(msg, count, options) {\n    (0, utils_js_1.validateObject)(options, {\n        DST: 'stringOrUint8Array',\n        p: 'bigint',\n        m: 'isSafeInteger',\n        k: 'isSafeInteger',\n        hash: 'hash',\n    });\n    const { p, k, m, hash, expand, DST: _DST } = options;\n    isBytes(msg);\n    isNum(count);\n    const DST = validateDST(_DST);\n    const log2p = p.toString(2).length;\n    const L = Math.ceil((log2p + k) / 8); // section 5.1 of ietf draft link above\n    const len_in_bytes = count * m * L;\n    let prb; // pseudo_random_bytes\n    if (expand === 'xmd') {\n        prb = expand_message_xmd(msg, DST, len_in_bytes, hash);\n    }\n    else if (expand === 'xof') {\n        prb = expand_message_xof(msg, DST, len_in_bytes, k, hash);\n    }\n    else if (expand === '_internal_pass') {\n        // for internal tests only\n        prb = msg;\n    }\n    else {\n        throw new Error('expand must be \"xmd\" or \"xof\"');\n    }\n    const u = new Array(count);\n    for (let i = 0; i < count; i++) {\n        const e = new Array(m);\n        for (let j = 0; j < m; j++) {\n            const elm_offset = L * (j + i * m);\n            const tv = prb.subarray(elm_offset, elm_offset + L);\n            e[j] = (0, modular_js_1.mod)(os2ip(tv), p);\n        }\n        u[i] = e;\n    }\n    return u;\n}\nexports.hash_to_field = hash_to_field;\nfunction isogenyMap(field, map) {\n    // Make same order as in spec\n    const COEFF = map.map((i) => Array.from(i).reverse());\n    return (x, y) => {\n        const [xNum, xDen, yNum, yDen] = COEFF.map((val) => val.reduce((acc, i) => field.add(field.mul(acc, x), i)));\n        x = field.div(xNum, xDen); // xNum / xDen\n        y = field.mul(y, field.div(yNum, yDen)); // y * (yNum / yDev)\n        return { x, y };\n    };\n}\nexports.isogenyMap = isogenyMap;\nfunction createHasher(Point, mapToCurve, def) {\n    if (typeof mapToCurve !== 'function')\n        throw new Error('mapToCurve() must be defined');\n    return {\n        // Encodes byte string to elliptic curve.\n        // hash_to_curve from https://www.rfc-editor.org/rfc/rfc9380#section-3\n        hashToCurve(msg, options) {\n            const u = hash_to_field(msg, 2, { ...def, DST: def.DST, ...options });\n            const u0 = Point.fromAffine(mapToCurve(u[0]));\n            const u1 = Point.fromAffine(mapToCurve(u[1]));\n            const P = u0.add(u1).clearCofactor();\n            P.assertValidity();\n            return P;\n        },\n        // Encodes byte string to elliptic curve.\n        // encode_to_curve from https://www.rfc-editor.org/rfc/rfc9380#section-3\n        encodeToCurve(msg, options) {\n            const u = hash_to_field(msg, 1, { ...def, DST: def.encodeDST, ...options });\n            const P = Point.fromAffine(mapToCurve(u[0])).clearCofactor();\n            P.assertValidity();\n            return P;\n        },\n    };\n}\nexports.createHasher = createHasher;\n//# sourceMappingURL=hash-to-curve.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mapHashToField = exports.getMinHashLength = exports.getFieldBytesLength = exports.hashToPrivateScalar = exports.FpSqrtEven = exports.FpSqrtOdd = exports.Field = exports.nLength = exports.FpIsSquare = exports.FpDiv = exports.FpInvertBatch = exports.FpPow = exports.validateField = exports.isNegativeLE = exports.FpSqrt = exports.tonelliShanks = exports.invert = exports.pow2 = exports.pow = exports.mod = void 0;\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nconst utils_js_1 = require(\"./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\nfunction mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\nexports.mod = mod;\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 <= _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}\nexports.pow = pow;\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nfunction pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\nexports.pow2 = pow2;\n// Inverses number over modulo\nfunction 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}\nexports.invert = invert;\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 - _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}\nexports.tonelliShanks = tonelliShanks;\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 + _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}\nexports.FpSqrt = FpSqrt;\n// Little-endian check for first LE bit (last BE bit);\nconst isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\nexports.isNegativeLE = isNegativeLE;\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 (0, utils_js_1.validateObject)(field, opts);\n}\nexports.validateField = validateField;\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 < _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}\nexports.FpPow = FpPow;\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}\nexports.FpInvertBatch = FpInvertBatch;\nfunction FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\nexports.FpDiv = FpDiv;\n// This function returns True whenever the value x is a square in the field F.\nfunction 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}\nexports.FpIsSquare = FpIsSquare;\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}\nexports.nLength = nLength;\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 <= _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: (0, utils_js_1.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 ? (0, utils_js_1.numberToBytesLE)(num, BYTES) : (0, utils_js_1.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 ? (0, utils_js_1.bytesToNumberLE)(bytes) : (0, utils_js_1.bytesToNumberBE)(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexports.Field = Field;\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}\nexports.FpSqrtOdd = FpSqrtOdd;\nfunction 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}\nexports.FpSqrtEven = FpSqrtEven;\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 = (0, utils_js_1.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 ? (0, utils_js_1.bytesToNumberLE)(hash) : (0, utils_js_1.bytesToNumberBE)(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\nexports.hashToPrivateScalar = hashToPrivateScalar;\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}\nexports.getFieldBytesLength = getFieldBytesLength;\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}\nexports.getMinHashLength = getMinHashLength;\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 ? (0, utils_js_1.bytesToNumberBE)(key) : (0, utils_js_1.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 ? (0, utils_js_1.numberToBytesLE)(reduced, fieldLen) : (0, utils_js_1.numberToBytesBE)(reduced, fieldLen);\n}\nexports.mapHashToField = mapHashToField;\n//# sourceMappingURL=modular.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateObject = exports.createHmacDrbg = exports.bitMask = exports.bitSet = exports.bitGet = exports.bitLen = exports.utf8ToBytes = exports.equalBytes = exports.concatBytes = exports.ensureBytes = exports.numberToVarBytesBE = exports.numberToBytesLE = exports.numberToBytesBE = exports.bytesToNumberLE = exports.bytesToNumberBE = exports.hexToBytes = exports.hexToNumber = exports.numberToHexUnpadded = exports.bytesToHex = void 0;\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 = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst u8a = (a) => a instanceof Uint8Array;\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    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\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}\nexports.bytesToHex = bytesToHex;\nfunction numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexports.numberToHexUnpadded = numberToHexUnpadded;\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}\nexports.hexToNumber = hexToNumber;\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 len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\nexports.hexToBytes = hexToBytes;\n// BE: Big Endian, LE: Little Endian\nfunction bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexports.bytesToNumberBE = bytesToNumberBE;\nfunction bytesToNumberLE(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexports.bytesToNumberLE = bytesToNumberLE;\nfunction numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexports.numberToBytesBE = numberToBytesBE;\nfunction numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\nexports.numberToBytesLE = numberToBytesLE;\n// Unpadded, rarely used\nfunction numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\nexports.numberToVarBytesBE = numberToVarBytesBE;\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 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 (u8a(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}\nexports.ensureBytes = ensureBytes;\n/**\n * Copies several Uint8Arrays into one.\n */\nfunction concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexports.concatBytes = concatBytes;\nfunction equalBytes(b1, b2) {\n    // We don't care about timing attacks here\n    if (b1.length !== b2.length)\n        return false;\n    for (let i = 0; i < b1.length; i++)\n        if (b1[i] !== b2[i])\n            return false;\n    return true;\n}\nexports.equalBytes = equalBytes;\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}\nexports.utf8ToBytes = utf8ToBytes;\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}\nexports.bitLen = bitLen;\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}\nexports.bitGet = bitGet;\n/**\n * Sets single bit at position.\n */\nconst bitSet = (n, pos, value) => {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n};\nexports.bitSet = bitSet;\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;\nexports.bitMask = bitMask;\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 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}\nexports.createHmacDrbg = createHmacDrbg;\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' || val instanceof Uint8Array,\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}\nexports.validateObject = validateObject;\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","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mapToCurveSimpleSWU = exports.SWUFpSqrtRatio = exports.weierstrass = exports.weierstrassPoints = exports.DER = void 0;\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nconst mod = require(\"./modular.js\");\nconst ut = require(\"./utils.js\");\nconst utils_js_1 = require(\"./utils.js\");\nconst curve_js_1 = require(\"./curve.js\");\nfunction validatePointOpts(curve) {\n    const opts = (0, curve_js_1.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;\nexports.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 } = exports.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 } = exports.DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        if (!(data instanceof Uint8Array))\n            throw new Error('ui8a expected');\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 } = exports.DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = exports.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);\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 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 (key instanceof Uint8Array)\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((0, utils_js_1.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((0, utils_js_1.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 = (0, curve_js_1.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}\nexports.weierstrassPoints = weierstrassPoints;\nfunction validateOpts(curve) {\n    const opts = (0, curve_js_1.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}\nfunction 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 = Fp.sqrt(y2); // y = y² ^ (p+1)/4\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 = (0, utils_js_1.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 } = exports.DER.toSig((0, utils_js_1.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((0, utils_js_1.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 exports.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 = item instanceof Uint8Array;\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 = (0, utils_js_1.ensureBytes)('msgHash', msgHash);\n        if (prehash)\n            msgHash = (0, utils_js_1.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) {\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((0, utils_js_1.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 = (0, utils_js_1.ensureBytes)('msgHash', msgHash);\n        publicKey = (0, utils_js_1.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' || sg instanceof Uint8Array) {\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 exports.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}\nexports.weierstrass = weierstrass;\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 = _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}\nexports.SWUFpSqrtRatio = SWUFpSqrtRatio;\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nfunction 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}\nexports.mapToCurveSimpleSWU = mapToCurveSimpleSWU;\n//# sourceMappingURL=weierstrass.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeToCurve = exports.hashToCurve = exports.schnorr = exports.secp256k1 = void 0;\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst utils_1 = require(\"@noble/hashes/utils\");\nconst modular_js_1 = require(\"./abstract/modular.js\");\nconst weierstrass_js_1 = require(\"./abstract/weierstrass.js\");\nconst utils_js_1 = require(\"./abstract/utils.js\");\nconst hash_to_curve_js_1 = require(\"./abstract/hash-to-curve.js\");\nconst _shortw_utils_js_1 = require(\"./_shortw_utils.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 = ((0, modular_js_1.pow2)(b3, _3n, P) * b3) % P;\n    const b9 = ((0, modular_js_1.pow2)(b6, _3n, P) * b3) % P;\n    const b11 = ((0, modular_js_1.pow2)(b9, _2n, P) * b2) % P;\n    const b22 = ((0, modular_js_1.pow2)(b11, _11n, P) * b11) % P;\n    const b44 = ((0, modular_js_1.pow2)(b22, _22n, P) * b22) % P;\n    const b88 = ((0, modular_js_1.pow2)(b44, _44n, P) * b44) % P;\n    const b176 = ((0, modular_js_1.pow2)(b88, _88n, P) * b88) % P;\n    const b220 = ((0, modular_js_1.pow2)(b176, _44n, P) * b44) % P;\n    const b223 = ((0, modular_js_1.pow2)(b220, _3n, P) * b3) % P;\n    const t1 = ((0, modular_js_1.pow2)(b223, _23n, P) * b22) % P;\n    const t2 = ((0, modular_js_1.pow2)(t1, _6n, P) * b2) % P;\n    const root = (0, modular_js_1.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 = (0, modular_js_1.Field)(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nexports.secp256k1 = (0, _shortw_utils_js_1.createCurve)({\n    a: BigInt(0),\n    b: BigInt(7),\n    Fp,\n    n: secp256k1N,\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1),\n    lowS: true,\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 = (0, modular_js_1.mod)(k - c1 * a1 - c2 * a2, n);\n            let k2 = (0, modular_js_1.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_1.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 = (0, sha256_1.sha256)(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n        tagP = (0, utils_js_1.concatBytes)(tagH, tagH);\n        TAGGED_HASH_PREFIXES[tag] = tagP;\n    }\n    return (0, sha256_1.sha256)((0, utils_js_1.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) => (0, utils_js_1.numberToBytesBE)(n, 32);\nconst modP = (x) => (0, modular_js_1.mod)(x, secp256k1P);\nconst modN = (x) => (0, modular_js_1.mod)(x, secp256k1N);\nconst Point = exports.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_ = exports.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((0, utils_js_1.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 = (0, utils_1.randomBytes)(32)) {\n    const m = (0, utils_js_1.ensureBytes)('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = (0, utils_js_1.ensureBytes)('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ (0, utils_js_1.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((0, utils_js_1.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 = (0, utils_js_1.ensureBytes)('signature', signature, 64);\n    const m = (0, utils_js_1.ensureBytes)('message', message);\n    const pub = (0, utils_js_1.ensureBytes)('publicKey', publicKey, 32);\n    try {\n        const P = lift_x((0, utils_js_1.bytesToNumberBE)(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = (0, utils_js_1.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 = (0, utils_js_1.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}\nexports.schnorr = (() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: exports.secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE: utils_js_1.numberToBytesBE,\n        bytesToNumberBE: utils_js_1.bytesToNumberBE,\n        taggedHash,\n        mod: modular_js_1.mod,\n    },\n}))();\nconst isoMap = /* @__PURE__ */ (() => (0, hash_to_curve_js_1.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__ */ (() => (0, weierstrass_js_1.mapToCurveSimpleSWU)(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => (0, hash_to_curve_js_1.createHasher)(exports.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_1.sha256,\n}))();\nexports.hashToCurve = (() => htf.hashToCurve)();\nexports.encodeToCurve = (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.output = exports.exists = exports.hash = exports.bytes = exports.bool = exports.number = void 0;\nfunction number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nexports.number = number;\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\nexports.bool = bool;\nfunction bytes(b, ...lengths) {\n    if (!(b instanceof Uint8Array))\n        throw new Error('Expected Uint8Array');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\nexports.bytes = bytes;\nfunction hash(hash) {\n    if (typeof hash !== 'function' || typeof hash.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(hash.outputLen);\n    number(hash.blockLen);\n}\nexports.hash = hash;\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}\nexports.exists = exists;\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}\nexports.output = output;\nconst assert = { number, bool, bytes, hash, exists, output };\nexports.default = assert;\n//# sourceMappingURL=_assert.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SHA2 = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./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// Base SHA2 class (RFC 6234)\nclass SHA2 extends utils_js_1.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 = (0, utils_js_1.createView)(this.buffer);\n    }\n    update(data) {\n        (0, _assert_js_1.exists)(this);\n        const { view, buffer, blockLen } = this;\n        data = (0, utils_js_1.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 = (0, utils_js_1.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        (0, _assert_js_1.exists)(this);\n        (0, _assert_js_1.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 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_1.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}\nexports.SHA2 = SHA2;\n//# sourceMappingURL=_sha2.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.add5L = exports.add5H = exports.add4H = exports.add4L = exports.add3H = exports.add3L = exports.add = exports.rotlBL = exports.rotlBH = exports.rotlSL = exports.rotlSH = exports.rotr32L = exports.rotr32H = exports.rotrBL = exports.rotrBH = exports.rotrSL = exports.rotrSH = exports.shrSL = exports.shrSH = exports.toBig = exports.split = exports.fromBig = void 0;\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}\nexports.fromBig = fromBig;\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}\nexports.split = split;\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\nexports.toBig = toBig;\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nexports.shrSH = shrSH;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\nexports.shrSL = shrSL;\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nexports.rotrSH = rotrSH;\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\nexports.rotrSL = rotrSL;\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nexports.rotrBH = rotrBH;\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\nexports.rotrBL = rotrBL;\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nexports.rotr32H = rotr32H;\nconst rotr32L = (h, _l) => h;\nexports.rotr32L = rotr32L;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nexports.rotlSH = rotlSH;\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\nexports.rotlSL = rotlSL;\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nexports.rotlBH = rotlBH;\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\nexports.rotlBL = rotlBL;\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}\nexports.add = add;\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nexports.add3L = add3L;\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nexports.add3H = add3H;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nexports.add4L = add4L;\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nexports.add4H = add4H;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nexports.add5L = add5L;\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\nexports.add5H = add5H;\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};\nexports.default = u64;\n//# sourceMappingURL=_u64.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.crypto = void 0;\nexports.crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hmac = exports.HMAC = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// HMAC (RFC 2104)\nclass HMAC extends utils_js_1.Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        (0, _assert_js_1.hash)(hash);\n        const key = (0, utils_js_1.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        (0, _assert_js_1.exists)(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        (0, _assert_js_1.exists)(this);\n        (0, _assert_js_1.bytes)(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}\nexports.HMAC = HMAC;\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();\nexports.hmac = hmac;\nexports.hmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pbkdf2Async = exports.pbkdf2 = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst hmac_js_1 = require(\"./hmac.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash, _password, _salt, _opts) {\n    (0, _assert_js_1.hash)(hash);\n    const opts = (0, utils_js_1.checkOpts)({ dkLen: 32, asyncTick: 10 }, _opts);\n    const { c, dkLen, asyncTick } = opts;\n    (0, _assert_js_1.number)(c);\n    (0, _assert_js_1.number)(dkLen);\n    (0, _assert_js_1.number)(asyncTick);\n    if (c < 1)\n        throw new Error('PBKDF2: iterations (c) should be >= 1');\n    const password = (0, utils_js_1.toBytes)(_password);\n    const salt = (0, utils_js_1.toBytes)(_salt);\n    // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n    const DK = new Uint8Array(dkLen);\n    // U1 = PRF(Password, Salt + INT_32_BE(i))\n    const PRF = hmac_js_1.hmac.create(hash, password);\n    const PRFSalt = PRF._cloneInto().update(salt);\n    return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\nfunction pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {\n    PRF.destroy();\n    PRFSalt.destroy();\n    if (prfW)\n        prfW.destroy();\n    u.fill(0);\n    return DK;\n}\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nfunction pbkdf2(hash, password, salt, opts) {\n    const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n    let prfW; // Working copy\n    const arr = new Uint8Array(4);\n    const view = (0, utils_js_1.createView)(arr);\n    const u = new Uint8Array(PRF.outputLen);\n    // DK = T1 + T2 + ⋯ + Tdklen/hlen\n    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n        // Ti = F(Password, Salt, c, i)\n        const Ti = DK.subarray(pos, pos + PRF.outputLen);\n        view.setInt32(0, ti, false);\n        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n        // U1 = PRF(Password, Salt + INT_32_BE(i))\n        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n        Ti.set(u.subarray(0, Ti.length));\n        for (let ui = 1; ui < c; ui++) {\n            // Uc = PRF(Password, Uc−1)\n            PRF._cloneInto(prfW).update(u).digestInto(u);\n            for (let i = 0; i < Ti.length; i++)\n                Ti[i] ^= u[i];\n        }\n    }\n    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexports.pbkdf2 = pbkdf2;\nasync function pbkdf2Async(hash, password, salt, opts) {\n    const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n    let prfW; // Working copy\n    const arr = new Uint8Array(4);\n    const view = (0, utils_js_1.createView)(arr);\n    const u = new Uint8Array(PRF.outputLen);\n    // DK = T1 + T2 + ⋯ + Tdklen/hlen\n    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n        // Ti = F(Password, Salt, c, i)\n        const Ti = DK.subarray(pos, pos + PRF.outputLen);\n        view.setInt32(0, ti, false);\n        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n        // U1 = PRF(Password, Salt + INT_32_BE(i))\n        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n        Ti.set(u.subarray(0, Ti.length));\n        await (0, utils_js_1.asyncLoop)(c - 1, asyncTick, () => {\n            // Uc = PRF(Password, Uc−1)\n            PRF._cloneInto(prfW).update(u).digestInto(u);\n            for (let i = 0; i < Ti.length; i++)\n                Ti[i] ^= u[i];\n        });\n    }\n    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexports.pbkdf2Async = pbkdf2Async;\n//# sourceMappingURL=pbkdf2.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ripemd160 = exports.RIPEMD160 = void 0;\nconst _sha2_js_1 = require(\"./_sha2.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ Uint8Array.from({ length: 16 }, (_, i) => i);\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = /* @__PURE__ */ new Uint32Array(16);\nclass RIPEMD160 extends _sha2_js_1.SHA2 {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\nexports.RIPEMD160 = RIPEMD160;\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexports.ripemd160 = (0, utils_js_1.wrapConstructor)(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.scryptAsync = exports.scrypt = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst sha256_js_1 = require(\"./sha256.js\");\nconst pbkdf2_js_1 = require(\"./pbkdf2.js\");\nconst utils_js_1 = require(\"./utils.js\");\n// RFC 7914 Scrypt KDF\n// Left rotate for uint32\nconst rotl = (a, b) => (a << b) | (a >>> (32 - b));\n// The main Scrypt loop: uses Salsa extensively.\n// Six versions of the function were tried, this is the fastest one.\n// prettier-ignore\nfunction XorAndSalsa(prev, pi, input, ii, out, oi) {\n    // Based on https://cr.yp.to/salsa20.html\n    // Xor blocks\n    let y00 = prev[pi++] ^ input[ii++], y01 = prev[pi++] ^ input[ii++];\n    let y02 = prev[pi++] ^ input[ii++], y03 = prev[pi++] ^ input[ii++];\n    let y04 = prev[pi++] ^ input[ii++], y05 = prev[pi++] ^ input[ii++];\n    let y06 = prev[pi++] ^ input[ii++], y07 = prev[pi++] ^ input[ii++];\n    let y08 = prev[pi++] ^ input[ii++], y09 = prev[pi++] ^ input[ii++];\n    let y10 = prev[pi++] ^ input[ii++], y11 = prev[pi++] ^ input[ii++];\n    let y12 = prev[pi++] ^ input[ii++], y13 = prev[pi++] ^ input[ii++];\n    let y14 = prev[pi++] ^ input[ii++], y15 = prev[pi++] ^ input[ii++];\n    // Save state to temporary variables (salsa)\n    let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n    // Main loop (salsa)\n    for (let i = 0; i < 8; i += 2) {\n        x04 ^= rotl(x00 + x12 | 0, 7);\n        x08 ^= rotl(x04 + x00 | 0, 9);\n        x12 ^= rotl(x08 + x04 | 0, 13);\n        x00 ^= rotl(x12 + x08 | 0, 18);\n        x09 ^= rotl(x05 + x01 | 0, 7);\n        x13 ^= rotl(x09 + x05 | 0, 9);\n        x01 ^= rotl(x13 + x09 | 0, 13);\n        x05 ^= rotl(x01 + x13 | 0, 18);\n        x14 ^= rotl(x10 + x06 | 0, 7);\n        x02 ^= rotl(x14 + x10 | 0, 9);\n        x06 ^= rotl(x02 + x14 | 0, 13);\n        x10 ^= rotl(x06 + x02 | 0, 18);\n        x03 ^= rotl(x15 + x11 | 0, 7);\n        x07 ^= rotl(x03 + x15 | 0, 9);\n        x11 ^= rotl(x07 + x03 | 0, 13);\n        x15 ^= rotl(x11 + x07 | 0, 18);\n        x01 ^= rotl(x00 + x03 | 0, 7);\n        x02 ^= rotl(x01 + x00 | 0, 9);\n        x03 ^= rotl(x02 + x01 | 0, 13);\n        x00 ^= rotl(x03 + x02 | 0, 18);\n        x06 ^= rotl(x05 + x04 | 0, 7);\n        x07 ^= rotl(x06 + x05 | 0, 9);\n        x04 ^= rotl(x07 + x06 | 0, 13);\n        x05 ^= rotl(x04 + x07 | 0, 18);\n        x11 ^= rotl(x10 + x09 | 0, 7);\n        x08 ^= rotl(x11 + x10 | 0, 9);\n        x09 ^= rotl(x08 + x11 | 0, 13);\n        x10 ^= rotl(x09 + x08 | 0, 18);\n        x12 ^= rotl(x15 + x14 | 0, 7);\n        x13 ^= rotl(x12 + x15 | 0, 9);\n        x14 ^= rotl(x13 + x12 | 0, 13);\n        x15 ^= rotl(x14 + x13 | 0, 18);\n    }\n    // Write output (salsa)\n    out[oi++] = (y00 + x00) | 0;\n    out[oi++] = (y01 + x01) | 0;\n    out[oi++] = (y02 + x02) | 0;\n    out[oi++] = (y03 + x03) | 0;\n    out[oi++] = (y04 + x04) | 0;\n    out[oi++] = (y05 + x05) | 0;\n    out[oi++] = (y06 + x06) | 0;\n    out[oi++] = (y07 + x07) | 0;\n    out[oi++] = (y08 + x08) | 0;\n    out[oi++] = (y09 + x09) | 0;\n    out[oi++] = (y10 + x10) | 0;\n    out[oi++] = (y11 + x11) | 0;\n    out[oi++] = (y12 + x12) | 0;\n    out[oi++] = (y13 + x13) | 0;\n    out[oi++] = (y14 + x14) | 0;\n    out[oi++] = (y15 + x15) | 0;\n}\nfunction BlockMix(input, ii, out, oi, r) {\n    // The block B is r 128-byte chunks (which is equivalent of 2r 64-byte chunks)\n    let head = oi + 0;\n    let tail = oi + 16 * r;\n    for (let i = 0; i < 16; i++)\n        out[tail + i] = input[ii + (2 * r - 1) * 16 + i]; // X ← B[2r−1]\n    for (let i = 0; i < r; i++, head += 16, ii += 16) {\n        // We write odd & even Yi at same time. Even: 0bXXXXX0 Odd:  0bXXXXX1\n        XorAndSalsa(out, tail, input, ii, out, head); // head[i] = Salsa(blockIn[2*i] ^ tail[i-1])\n        if (i > 0)\n            tail += 16; // First iteration overwrites tmp value in tail\n        XorAndSalsa(out, head, input, (ii += 16), out, tail); // tail[i] = Salsa(blockIn[2*i+1] ^ head[i])\n    }\n}\n// Common prologue and epilogue for sync/async functions\nfunction scryptInit(password, salt, _opts) {\n    // Maxmem - 1GB+1KB by default\n    const opts = (0, utils_js_1.checkOpts)({\n        dkLen: 32,\n        asyncTick: 10,\n        maxmem: 1024 ** 3 + 1024,\n    }, _opts);\n    const { N, r, p, dkLen, asyncTick, maxmem, onProgress } = opts;\n    (0, _assert_js_1.number)(N);\n    (0, _assert_js_1.number)(r);\n    (0, _assert_js_1.number)(p);\n    (0, _assert_js_1.number)(dkLen);\n    (0, _assert_js_1.number)(asyncTick);\n    (0, _assert_js_1.number)(maxmem);\n    if (onProgress !== undefined && typeof onProgress !== 'function')\n        throw new Error('progressCb should be function');\n    const blockSize = 128 * r;\n    const blockSize32 = blockSize / 4;\n    if (N <= 1 || (N & (N - 1)) !== 0 || N >= 2 ** (blockSize / 8) || N > 2 ** 32) {\n        // NOTE: we limit N to be less than 2**32 because of 32 bit variant of Integrify function\n        // There is no JS engines that allows alocate more than 4GB per single Uint8Array for now, but can change in future.\n        throw new Error('Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32');\n    }\n    if (p < 0 || p > ((2 ** 32 - 1) * 32) / blockSize) {\n        throw new Error('Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)');\n    }\n    if (dkLen < 0 || dkLen > (2 ** 32 - 1) * 32) {\n        throw new Error('Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32');\n    }\n    const memUsed = blockSize * (N + p);\n    if (memUsed > maxmem) {\n        throw new Error(`Scrypt: parameters too large, ${memUsed} (128 * r * (N + p)) > ${maxmem} (maxmem)`);\n    }\n    // [B0...Bp−1] ← PBKDF2HMAC-SHA256(Passphrase, Salt, 1, blockSize*ParallelizationFactor)\n    // Since it has only one iteration there is no reason to use async variant\n    const B = (0, pbkdf2_js_1.pbkdf2)(sha256_js_1.sha256, password, salt, { c: 1, dkLen: blockSize * p });\n    const B32 = (0, utils_js_1.u32)(B);\n    // Re-used between parallel iterations. Array(iterations) of B\n    const V = (0, utils_js_1.u32)(new Uint8Array(blockSize * N));\n    const tmp = (0, utils_js_1.u32)(new Uint8Array(blockSize));\n    let blockMixCb = () => { };\n    if (onProgress) {\n        const totalBlockMix = 2 * N * p;\n        // Invoke callback if progress changes from 10.01 to 10.02\n        // Allows to draw smooth progress bar on up to 8K screen\n        const callbackPer = Math.max(Math.floor(totalBlockMix / 10000), 1);\n        let blockMixCnt = 0;\n        blockMixCb = () => {\n            blockMixCnt++;\n            if (onProgress && (!(blockMixCnt % callbackPer) || blockMixCnt === totalBlockMix))\n                onProgress(blockMixCnt / totalBlockMix);\n        };\n    }\n    return { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick };\n}\nfunction scryptOutput(password, dkLen, B, V, tmp) {\n    const res = (0, pbkdf2_js_1.pbkdf2)(sha256_js_1.sha256, password, B, { c: 1, dkLen });\n    B.fill(0);\n    V.fill(0);\n    tmp.fill(0);\n    return res;\n}\n/**\n * Scrypt KDF from RFC 7914.\n * @param password - pass\n * @param salt - salt\n * @param opts - parameters\n * - `N` is cpu/mem work factor (power of 2 e.g. 2**18)\n * - `r` is block size (8 is common), fine-tunes sequential memory read size and performance\n * - `p` is parallelization factor (1 is common)\n * - `dkLen` is output key length in bytes e.g. 32.\n * - `asyncTick` - (default: 10) max time in ms for which async function can block execution\n * - `maxmem` - (default: `1024 ** 3 + 1024` aka 1GB+1KB). A limit that the app could use for scrypt\n * - `onProgress` - callback function that would be executed for progress report\n * @returns Derived key\n */\nfunction scrypt(password, salt, opts) {\n    const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb } = scryptInit(password, salt, opts);\n    for (let pi = 0; pi < p; pi++) {\n        const Pi = blockSize32 * pi;\n        for (let i = 0; i < blockSize32; i++)\n            V[i] = B32[Pi + i]; // V[0] = B[i]\n        for (let i = 0, pos = 0; i < N - 1; i++) {\n            BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n            blockMixCb();\n        }\n        BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n        blockMixCb();\n        for (let i = 0; i < N; i++) {\n            // First u32 of the last 64-byte block (u32 is LE)\n            const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n            for (let k = 0; k < blockSize32; k++)\n                tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n            BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n            blockMixCb();\n        }\n    }\n    return scryptOutput(password, dkLen, B, V, tmp);\n}\nexports.scrypt = scrypt;\n/**\n * Scrypt KDF from RFC 7914.\n */\nasync function scryptAsync(password, salt, opts) {\n    const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick } = scryptInit(password, salt, opts);\n    for (let pi = 0; pi < p; pi++) {\n        const Pi = blockSize32 * pi;\n        for (let i = 0; i < blockSize32; i++)\n            V[i] = B32[Pi + i]; // V[0] = B[i]\n        let pos = 0;\n        await (0, utils_js_1.asyncLoop)(N - 1, asyncTick, () => {\n            BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n            blockMixCb();\n        });\n        BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n        blockMixCb();\n        await (0, utils_js_1.asyncLoop)(N, asyncTick, () => {\n            // First u32 of the last 64-byte block (u32 is LE)\n            const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n            for (let k = 0; k < blockSize32; k++)\n                tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n            BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n            blockMixCb();\n        });\n    }\n    return scryptOutput(password, dkLen, B, V, tmp);\n}\nexports.scryptAsync = scryptAsync;\n//# sourceMappingURL=scrypt.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha224 = exports.sha256 = void 0;\nconst _sha2_js_1 = require(\"./_sha2.js\");\nconst utils_js_1 = require(\"./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// 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// 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 (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst 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 _sha2_js_1.SHA2 {\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 = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = 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_1.rotr)(W15, 7) ^ (0, utils_js_1.rotr)(W15, 18) ^ (W15 >>> 3);\n            const s1 = (0, utils_js_1.rotr)(W2, 17) ^ (0, utils_js_1.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 = (0, utils_js_1.rotr)(E, 6) ^ (0, utils_js_1.rotr)(E, 11) ^ (0, utils_js_1.rotr)(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = (0, utils_js_1.rotr)(A, 2) ^ (0, utils_js_1.rotr)(A, 13) ^ (0, utils_js_1.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 */\nexports.sha256 = (0, utils_js_1.wrapConstructor)(() => new SHA256());\nexports.sha224 = (0, utils_js_1.wrapConstructor)(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.shake256 = exports.shake128 = exports.keccak_512 = exports.keccak_384 = exports.keccak_256 = exports.keccak_224 = exports.sha3_512 = exports.sha3_384 = exports.sha3_256 = exports.sha3_224 = exports.Keccak = exports.keccakP = void 0;\nconst _assert_js_1 = require(\"./_assert.js\");\nconst _u64_js_1 = require(\"./_u64.js\");\nconst utils_js_1 = require(\"./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, SHA3_ROTL, _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__ */ (0, _u64_js_1.split)(_SHA3_IOTA, true);\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? (0, _u64_js_1.rotlBH)(h, l, s) : (0, _u64_js_1.rotlSH)(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? (0, _u64_js_1.rotlBL)(h, l, s) : (0, _u64_js_1.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}\nexports.keccakP = keccakP;\nclass Keccak extends utils_js_1.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        (0, _assert_js_1.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 = (0, utils_js_1.u32)(this.state);\n    }\n    keccak() {\n        keccakP(this.state32, this.rounds);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        (0, _assert_js_1.exists)(this);\n        const { blockLen, state } = this;\n        data = (0, utils_js_1.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        (0, _assert_js_1.exists)(this, false);\n        (0, _assert_js_1.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        (0, _assert_js_1.number)(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        (0, _assert_js_1.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}\nexports.Keccak = Keccak;\nconst gen = (suffix, blockLen, outputLen) => (0, utils_js_1.wrapConstructor)(() => new Keccak(blockLen, suffix, outputLen));\nexports.sha3_224 = gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexports.sha3_256 = gen(0x06, 136, 256 / 8);\nexports.sha3_384 = gen(0x06, 104, 384 / 8);\nexports.sha3_512 = gen(0x06, 72, 512 / 8);\nexports.keccak_224 = gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexports.keccak_256 = gen(0x01, 136, 256 / 8);\nexports.keccak_384 = gen(0x01, 104, 384 / 8);\nexports.keccak_512 = gen(0x01, 72, 512 / 8);\nconst genShake = (suffix, blockLen, outputLen) => (0, utils_js_1.wrapXOFConstructorWithOpts)((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexports.shake128 = genShake(0x1f, 168, 128 / 8);\nexports.shake256 = genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha384 = exports.sha512_256 = exports.sha512_224 = exports.sha512 = exports.SHA512 = void 0;\nconst _sha2_js_1 = require(\"./_sha2.js\");\nconst _u64_js_1 = require(\"./_u64.js\");\nconst utils_js_1 = require(\"./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_js_1.default.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 _sha2_js_1.SHA2 {\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_js_1.default.rotrSH(W15h, W15l, 1) ^ _u64_js_1.default.rotrSH(W15h, W15l, 8) ^ _u64_js_1.default.shrSH(W15h, W15l, 7);\n            const s0l = _u64_js_1.default.rotrSL(W15h, W15l, 1) ^ _u64_js_1.default.rotrSL(W15h, W15l, 8) ^ _u64_js_1.default.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_js_1.default.rotrSH(W2h, W2l, 19) ^ _u64_js_1.default.rotrBH(W2h, W2l, 61) ^ _u64_js_1.default.shrSH(W2h, W2l, 6);\n            const s1l = _u64_js_1.default.rotrSL(W2h, W2l, 19) ^ _u64_js_1.default.rotrBL(W2h, W2l, 61) ^ _u64_js_1.default.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = _u64_js_1.default.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = _u64_js_1.default.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_js_1.default.rotrSH(Eh, El, 14) ^ _u64_js_1.default.rotrSH(Eh, El, 18) ^ _u64_js_1.default.rotrBH(Eh, El, 41);\n            const sigma1l = _u64_js_1.default.rotrSL(Eh, El, 14) ^ _u64_js_1.default.rotrSL(Eh, El, 18) ^ _u64_js_1.default.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_js_1.default.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = _u64_js_1.default.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_js_1.default.rotrSH(Ah, Al, 28) ^ _u64_js_1.default.rotrBH(Ah, Al, 34) ^ _u64_js_1.default.rotrBH(Ah, Al, 39);\n            const sigma0l = _u64_js_1.default.rotrSL(Ah, Al, 28) ^ _u64_js_1.default.rotrBL(Ah, Al, 34) ^ _u64_js_1.default.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_js_1.default.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_js_1.default.add3L(T1l, sigma0l, MAJl);\n            Ah = _u64_js_1.default.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_js_1.default.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = _u64_js_1.default.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = _u64_js_1.default.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = _u64_js_1.default.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = _u64_js_1.default.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = _u64_js_1.default.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = _u64_js_1.default.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = _u64_js_1.default.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}\nexports.SHA512 = SHA512;\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}\nexports.sha512 = (0, utils_js_1.wrapConstructor)(() => new SHA512());\nexports.sha512_224 = (0, utils_js_1.wrapConstructor)(() => new SHA512_224());\nexports.sha512_256 = (0, utils_js_1.wrapConstructor)(() => new SHA512_256());\nexports.sha384 = (0, utils_js_1.wrapConstructor)(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","\"use strict\";\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = exports.wrapXOFConstructorWithOpts = exports.wrapConstructorWithOpts = exports.wrapConstructor = exports.checkOpts = exports.Hash = exports.concatBytes = exports.toBytes = exports.utf8ToBytes = exports.asyncLoop = exports.nextTick = exports.hexToBytes = exports.bytesToHex = exports.isLE = exports.rotr = exports.createView = exports.u32 = exports.u8 = void 0;\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, we can just drop the import.\nconst crypto_1 = require(\"@noble/hashes/crypto\");\nconst u8a = (a) => a instanceof Uint8Array;\n// Cast array to different type\nconst u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.u8 = u8;\nconst u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\nexports.u32 = u32;\n// Cast array to view\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\nexports.createView = createView;\n// The rotate right (circular right shift) operation for uint32\nconst rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\nexports.rotr = rotr;\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexports.isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!exports.isLE)\n    throw new Error('Non little-endian hardware is not supported');\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    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\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}\nexports.bytesToHex = bytesToHex;\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 len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\nexports.hexToBytes = hexToBytes;\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 () => { };\nexports.nextTick = nextTick;\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 (0, exports.nextTick)();\n        ts += diff;\n    }\n}\nexports.asyncLoop = asyncLoop;\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}\nexports.utf8ToBytes = utf8ToBytes;\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    if (!u8a(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\nexports.toBytes = toBytes;\n/**\n * Copies several Uint8Arrays into one.\n */\nfunction concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexports.concatBytes = concatBytes;\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}\nexports.Hash = Hash;\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}\nexports.checkOpts = checkOpts;\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}\nexports.wrapConstructor = wrapConstructor;\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}\nexports.wrapConstructorWithOpts = wrapConstructorWithOpts;\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}\nexports.wrapXOFConstructorWithOpts = wrapXOFConstructorWithOpts;\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nfunction randomBytes(bytesLength = 32) {\n    if (crypto_1.crypto && typeof crypto_1.crypto.getRandomValues === 'function') {\n        return crypto_1.crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\nexports.randomBytes = randomBytes;\n//# sourceMappingURL=utils.js.map","/******************************************************************************\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/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __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}\r\n\r\nexport function __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\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\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;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __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}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\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;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\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);\r\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); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\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\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\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\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\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.SiweMessage = void 0;\n// TODO: Figure out how to get types from this lib:\nconst siwe_parser_1 = require(\"@spruceid/siwe-parser\");\nconst uri = __importStar(require(\"valid-url\"));\nconst ethersCompat_1 = require(\"./ethersCompat\");\nconst types_1 = require(\"./types\");\nconst utils_1 = require(\"./utils\");\nclass SiweMessage {\n    /**\n     * Creates a parsed Sign-In with Ethereum Message (EIP-4361) object from a\n     * string or an object. If a string is used an ABNF parser is called to\n     * validate the parameter, otherwise the fields are attributed.\n     * @param param {string | SiweMessage} Sign message as a string or an object.\n     */\n    constructor(param) {\n        if (typeof param === 'string') {\n            const parsedMessage = new siwe_parser_1.ParsedMessage(param);\n            this.scheme = parsedMessage.scheme;\n            this.domain = parsedMessage.domain;\n            this.address = parsedMessage.address;\n            this.statement = parsedMessage.statement;\n            this.uri = parsedMessage.uri;\n            this.version = parsedMessage.version;\n            this.nonce = parsedMessage.nonce;\n            this.issuedAt = parsedMessage.issuedAt;\n            this.expirationTime = parsedMessage.expirationTime;\n            this.notBefore = parsedMessage.notBefore;\n            this.requestId = parsedMessage.requestId;\n            this.chainId = parsedMessage.chainId;\n            this.resources = parsedMessage.resources;\n        }\n        else {\n            this.scheme = param === null || param === void 0 ? void 0 : param.scheme;\n            this.domain = param.domain;\n            this.address = param.address;\n            this.statement = param === null || param === void 0 ? void 0 : param.statement;\n            this.uri = param.uri;\n            this.version = param.version;\n            this.chainId = param.chainId;\n            this.nonce = param.nonce;\n            this.issuedAt = param === null || param === void 0 ? void 0 : param.issuedAt;\n            this.expirationTime = param === null || param === void 0 ? void 0 : param.expirationTime;\n            this.notBefore = param === null || param === void 0 ? void 0 : param.notBefore;\n            this.requestId = param === null || param === void 0 ? void 0 : param.requestId;\n            this.resources = param === null || param === void 0 ? void 0 : param.resources;\n            if (typeof this.chainId === 'string') {\n                this.chainId = (0, siwe_parser_1.parseIntegerNumber)(this.chainId);\n            }\n        }\n        this.nonce = this.nonce || (0, utils_1.generateNonce)();\n        this.validateMessage();\n    }\n    /**\n     * This function can be used to retrieve an EIP-4361 formated message for\n     * signature, although you can call it directly it's advised to use\n     * [prepareMessage()] instead which will resolve to the correct method based\n     * on the [type] attribute of this object, in case of other formats being\n     * implemented.\n     * @returns {string} EIP-4361 formated message, ready for EIP-191 signing.\n     */\n    toMessage() {\n        /** Validates all fields of the object */\n        this.validateMessage();\n        const headerPrefx = this.scheme ? `${this.scheme}://${this.domain}` : this.domain;\n        const header = `${headerPrefx} wants you to sign in with your Ethereum account:`;\n        const uriField = `URI: ${this.uri}`;\n        let prefix = [header, this.address].join('\\n');\n        const versionField = `Version: ${this.version}`;\n        if (!this.nonce) {\n            this.nonce = (0, utils_1.generateNonce)();\n        }\n        const chainField = `Chain ID: ` + this.chainId || '1';\n        const nonceField = `Nonce: ${this.nonce}`;\n        const suffixArray = [uriField, versionField, chainField, nonceField];\n        this.issuedAt = this.issuedAt || new Date().toISOString();\n        suffixArray.push(`Issued At: ${this.issuedAt}`);\n        if (this.expirationTime) {\n            const expiryField = `Expiration Time: ${this.expirationTime}`;\n            suffixArray.push(expiryField);\n        }\n        if (this.notBefore) {\n            suffixArray.push(`Not Before: ${this.notBefore}`);\n        }\n        if (this.requestId) {\n            suffixArray.push(`Request ID: ${this.requestId}`);\n        }\n        if (this.resources) {\n            suffixArray.push([`Resources:`, ...this.resources.map(x => `- ${x}`)].join('\\n'));\n        }\n        const suffix = suffixArray.join('\\n');\n        prefix = [prefix, this.statement].join('\\n\\n');\n        if (this.statement) {\n            prefix += '\\n';\n        }\n        return [prefix, suffix].join('\\n');\n    }\n    /**\n     * This method parses all the fields in the object and creates a messaging for signing\n     * message according with the type defined.\n     * @returns {string} Returns a message ready to be signed according with the\n     * type defined in the object.\n     */\n    prepareMessage() {\n        let message;\n        switch (this.version) {\n            case '1': {\n                message = this.toMessage();\n                break;\n            }\n            default: {\n                message = this.toMessage();\n                break;\n            }\n        }\n        return message;\n    }\n    /**\n     * @deprecated\n     * Verifies the integrity of the object by matching its signature.\n     * @param signature Signature to match the address in the message.\n     * @param provider Ethers provider to be used for EIP-1271 validation\n     */\n    validate(signature, provider) {\n        return __awaiter(this, void 0, void 0, function* () {\n            console.warn('validate() has been deprecated, please update your code to use verify(). validate() may be removed in future versions.');\n            return this.verify({ signature }, { provider, suppressExceptions: false })\n                .then(({ data }) => data)\n                .catch(({ error }) => {\n                throw error;\n            });\n        });\n    }\n    /**\n     * Verifies the integrity of the object by matching its signature.\n     * @param params Parameters to verify the integrity of the message, signature is required.\n     * @returns {Promise<SiweMessage>} This object if valid.\n     */\n    verify(params, opts = { suppressExceptions: false }) {\n        return __awaiter(this, void 0, void 0, function* () {\n            return new Promise((resolve, reject) => {\n                var _a, _b, _c;\n                const fail = result => {\n                    if (opts.suppressExceptions) {\n                        return resolve(result);\n                    }\n                    else {\n                        return reject(result);\n                    }\n                };\n                const invalidParams = (0, utils_1.checkInvalidKeys)(params, types_1.VerifyParamsKeys);\n                if (invalidParams.length > 0) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: new Error(`${invalidParams.join(', ')} is/are not valid key(s) for VerifyParams.`),\n                    });\n                }\n                const invalidOpts = (0, utils_1.checkInvalidKeys)(opts, types_1.VerifyOptsKeys);\n                if (invalidParams.length > 0) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: new Error(`${invalidOpts.join(', ')} is/are not valid key(s) for VerifyOpts.`),\n                    });\n                }\n                const { signature, scheme, domain, nonce, time } = params;\n                /** Scheme for domain binding */\n                if (scheme && scheme !== this.scheme) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: new types_1.SiweError(types_1.SiweErrorType.SCHEME_MISMATCH, scheme, this.scheme),\n                    });\n                }\n                /** Domain binding */\n                if (domain && domain !== this.domain) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: new types_1.SiweError(types_1.SiweErrorType.DOMAIN_MISMATCH, domain, this.domain),\n                    });\n                }\n                /** Nonce binding */\n                if (nonce && nonce !== this.nonce) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: new types_1.SiweError(types_1.SiweErrorType.NONCE_MISMATCH, nonce, this.nonce),\n                    });\n                }\n                /** Check time or now */\n                const checkTime = new Date(time || new Date());\n                /** Message not expired */\n                if (this.expirationTime) {\n                    const expirationDate = new Date(this.expirationTime);\n                    if (checkTime.getTime() >= expirationDate.getTime()) {\n                        fail({\n                            success: false,\n                            data: this,\n                            error: new types_1.SiweError(types_1.SiweErrorType.EXPIRED_MESSAGE, `${checkTime.toISOString()} < ${expirationDate.toISOString()}`, `${checkTime.toISOString()} >= ${expirationDate.toISOString()}`),\n                        });\n                    }\n                }\n                /** Message is valid already */\n                if (this.notBefore) {\n                    const notBefore = new Date(this.notBefore);\n                    if (checkTime.getTime() < notBefore.getTime()) {\n                        fail({\n                            success: false,\n                            data: this,\n                            error: new types_1.SiweError(types_1.SiweErrorType.NOT_YET_VALID_MESSAGE, `${checkTime.toISOString()} >= ${notBefore.toISOString()}`, `${checkTime.toISOString()} < ${notBefore.toISOString()}`),\n                        });\n                    }\n                }\n                let EIP4361Message;\n                try {\n                    EIP4361Message = this.prepareMessage();\n                }\n                catch (e) {\n                    fail({\n                        success: false,\n                        data: this,\n                        error: e,\n                    });\n                }\n                /** Recover address from signature */\n                let addr;\n                try {\n                    addr = (0, ethersCompat_1.verifyMessage)(EIP4361Message, signature);\n                }\n                catch (e) {\n                    console.error(e);\n                }\n                /** Match signature with message's address */\n                if (addr === this.address) {\n                    return resolve({\n                        success: true,\n                        data: this,\n                    });\n                }\n                else {\n                    const EIP1271Promise = (0, utils_1.checkContractWalletSignature)(this, signature, opts.provider)\n                        .then(isValid => {\n                        if (!isValid) {\n                            return {\n                                success: false,\n                                data: this,\n                                error: new types_1.SiweError(types_1.SiweErrorType.INVALID_SIGNATURE, addr, `Resolved address to be ${this.address}`),\n                            };\n                        }\n                        return {\n                            success: true,\n                            data: this,\n                        };\n                    })\n                        .catch(error => {\n                        return {\n                            success: false,\n                            data: this,\n                            error,\n                        };\n                    });\n                    Promise.all([\n                        EIP1271Promise,\n                        (_c = (_b = (_a = opts === null || opts === void 0 ? void 0 : opts.verificationFallback) === null || _a === void 0 ? void 0 : _a.call(opts, params, opts, this, EIP1271Promise)) === null || _b === void 0 ? void 0 : _b.then(res => res)) === null || _c === void 0 ? void 0 : _c.catch((res) => res),\n                    ]).then(([EIP1271Response, fallbackResponse]) => {\n                        if (fallbackResponse) {\n                            if (fallbackResponse.success) {\n                                return resolve(fallbackResponse);\n                            }\n                            else {\n                                fail(fallbackResponse);\n                            }\n                        }\n                        else {\n                            if (EIP1271Response.success) {\n                                return resolve(EIP1271Response);\n                            }\n                            else {\n                                fail(EIP1271Response);\n                            }\n                        }\n                    });\n                }\n            });\n        });\n    }\n    /**\n     * Validates the values of this object fields.\n     * @throws Throws an {ErrorType} if a field is invalid.\n     */\n    validateMessage(...args) {\n        var _a;\n        /** Checks if the user might be using the function to verify instead of validate. */\n        if (args.length > 0) {\n            throw new types_1.SiweError(types_1.SiweErrorType.UNABLE_TO_PARSE, `Unexpected argument in the validateMessage function.`);\n        }\n        /** `domain` check. */\n        if (!this.domain ||\n            this.domain.length === 0 ||\n            !/[^#?]*/.test(this.domain)) {\n            throw new types_1.SiweError(types_1.SiweErrorType.INVALID_DOMAIN, `${this.domain} to be a valid domain.`);\n        }\n        /** EIP-55 `address` check. */\n        if (!(0, siwe_parser_1.isEIP55Address)(this.address)) {\n            throw new types_1.SiweError(types_1.SiweErrorType.INVALID_ADDRESS, (0, ethersCompat_1.getAddress)(this.address), this.address);\n        }\n        /** Check if the URI is valid. */\n        if (!uri.isUri(this.uri)) {\n            throw new types_1.SiweError(types_1.SiweErrorType.INVALID_URI, `${this.uri} to be a valid uri.`);\n        }\n        /** Check if the version is 1. */\n        if (this.version !== '1') {\n            throw new types_1.SiweError(types_1.SiweErrorType.INVALID_MESSAGE_VERSION, '1', this.version);\n        }\n        /** Check if the nonce is alphanumeric and bigger then 8 characters */\n        const nonce = (_a = this === null || this === void 0 ? void 0 : this.nonce) === null || _a === void 0 ? void 0 : _a.match(/[a-zA-Z0-9]{8,}/);\n        if (!nonce || this.nonce.length < 8 || nonce[0] !== this.nonce) {\n            throw new types_1.SiweError(types_1.SiweErrorType.INVALID_NONCE, `Length > 8 (${nonce.length}). Alphanumeric.`, this.nonce);\n        }\n        /** `issuedAt` conforms to ISO-8601 and is a valid date. */\n        if (this.issuedAt) {\n            if (!(0, utils_1.isValidISO8601Date)(this.issuedAt)) {\n                throw new Error(types_1.SiweErrorType.INVALID_TIME_FORMAT);\n            }\n        }\n        /** `expirationTime` conforms to ISO-8601 and is a valid date. */\n        if (this.expirationTime) {\n            if (!(0, utils_1.isValidISO8601Date)(this.expirationTime)) {\n                throw new Error(types_1.SiweErrorType.INVALID_TIME_FORMAT);\n            }\n        }\n        /** `notBefore` conforms to ISO-8601 and is a valid date. */\n        if (this.notBefore) {\n            if (!(0, utils_1.isValidISO8601Date)(this.notBefore)) {\n                throw new Error(types_1.SiweErrorType.INVALID_TIME_FORMAT);\n            }\n        }\n    }\n}\nexports.SiweMessage = SiweMessage;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getAddress = exports.hashMessage = exports.verifyMessage = void 0;\nconst ethers_1 = require(\"ethers\");\nlet ethersVerifyMessage = null;\nlet ethersHashMessage = null;\nlet ethersGetAddress = null;\ntry {\n    // @ts-expect-error -- v6 compatibility hack\n    ethersVerifyMessage = ethers_1.ethers.utils.verifyMessage;\n    // @ts-expect-error -- v6 compatibility hack\n    ethersHashMessage = ethers_1.ethers.utils.hashMessage;\n    // @ts-expect-error -- v6 compatibility hack\n    ethersGetAddress = ethers_1.ethers.utils.getAddress;\n}\ncatch (_a) {\n    ethersVerifyMessage = ethers_1.ethers.verifyMessage;\n    ethersHashMessage = ethers_1.ethers.hashMessage;\n    ethersGetAddress = ethers_1.ethers.getAddress;\n}\nexports.verifyMessage = ethersVerifyMessage;\nexports.hashMessage = ethersHashMessage;\nexports.getAddress = ethersGetAddress;\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(\"./client\"), exports);\n__exportStar(require(\"./types\"), exports);\n__exportStar(require(\"./utils\"), exports);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SiweErrorType = exports.SiweError = exports.VerifyOptsKeys = exports.VerifyParamsKeys = void 0;\nexports.VerifyParamsKeys = [\n    'signature',\n    'scheme',\n    'domain',\n    'nonce',\n    'time',\n];\nexports.VerifyOptsKeys = [\n    'provider',\n    'suppressExceptions',\n    'verificationFallback',\n];\n/**\n * Interface used to return errors in SiweResponses.\n */\nclass SiweError {\n    constructor(type, expected, received) {\n        this.type = type;\n        this.expected = expected;\n        this.received = received;\n    }\n}\nexports.SiweError = SiweError;\n/**\n * Possible message error types.\n */\nvar SiweErrorType;\n(function (SiweErrorType) {\n    /** `expirationTime` is present and in the past. */\n    SiweErrorType[\"EXPIRED_MESSAGE\"] = \"Expired message.\";\n    /** `domain` is not a valid authority or is empty. */\n    SiweErrorType[\"INVALID_DOMAIN\"] = \"Invalid domain.\";\n    /** `scheme` don't match the scheme provided for verification. */\n    SiweErrorType[\"SCHEME_MISMATCH\"] = \"Scheme does not match provided scheme for verification.\";\n    /** `domain` don't match the domain provided for verification. */\n    SiweErrorType[\"DOMAIN_MISMATCH\"] = \"Domain does not match provided domain for verification.\";\n    /** `nonce` don't match the nonce provided for verification. */\n    SiweErrorType[\"NONCE_MISMATCH\"] = \"Nonce does not match provided nonce for verification.\";\n    /** `address` does not conform to EIP-55 or is not a valid address. */\n    SiweErrorType[\"INVALID_ADDRESS\"] = \"Invalid address.\";\n    /** `uri` does not conform to RFC 3986. */\n    SiweErrorType[\"INVALID_URI\"] = \"URI does not conform to RFC 3986.\";\n    /** `nonce` is smaller then 8 characters or is not alphanumeric */\n    SiweErrorType[\"INVALID_NONCE\"] = \"Nonce size smaller then 8 characters or is not alphanumeric.\";\n    /** `notBefore` is present and in the future. */\n    SiweErrorType[\"NOT_YET_VALID_MESSAGE\"] = \"Message is not valid yet.\";\n    /** Signature doesn't match the address of the message. */\n    SiweErrorType[\"INVALID_SIGNATURE\"] = \"Signature does not match address of the message.\";\n    /** `expirationTime`, `notBefore` or `issuedAt` not complient to ISO-8601. */\n    SiweErrorType[\"INVALID_TIME_FORMAT\"] = \"Invalid time format.\";\n    /** `version` is not 1. */\n    SiweErrorType[\"INVALID_MESSAGE_VERSION\"] = \"Invalid message version.\";\n    /** Thrown when some required field is missing. */\n    SiweErrorType[\"UNABLE_TO_PARSE\"] = \"Unable to parse the message.\";\n})(SiweErrorType = exports.SiweErrorType || (exports.SiweErrorType = {}));\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.checkInvalidKeys = exports.isValidISO8601Date = exports.generateNonce = exports.checkContractWalletSignature = void 0;\nconst random_1 = require(\"@stablelib/random\");\n// @ts-expect-error -- ethers v6 compatibility hack\nconst ethers_1 = require(\"ethers\");\nconst ethersCompat_1 = require(\"./ethersCompat\");\nconst EIP1271_ABI = [\n    'function isValidSignature(bytes32 _message, bytes _signature) public view returns (bytes4)',\n];\nconst EIP1271_MAGICVALUE = '0x1626ba7e';\nconst ISO8601 = /^(?<date>[0-9]{4}-(0[1-9]|1[012])-(0[1-9]|[12][0-9]|3[01]))[Tt]([01][0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9]|60)(.[0-9]+)?(([Zz])|([+|-]([01][0-9]|2[0-3]):[0-5][0-9]))$/;\n/**\n * This method calls the EIP-1271 method for Smart Contract wallets\n * @param message The EIP-4361 parsed message\n * @param provider Web3 provider able to perform a contract check (Web3/EthersJS).\n * @returns {Promise<boolean>} Checks for the smart contract (if it exists) if\n * the signature is valid for given address.\n */\nconst checkContractWalletSignature = (message, signature, provider) => __awaiter(void 0, void 0, void 0, function* () {\n    if (!provider) {\n        return false;\n    }\n    const walletContract = new ethers_1.Contract(message.address, EIP1271_ABI, provider);\n    const hashedMessage = (0, ethersCompat_1.hashMessage)(message.prepareMessage());\n    const res = yield walletContract.isValidSignature(hashedMessage, signature);\n    return res === EIP1271_MAGICVALUE;\n});\nexports.checkContractWalletSignature = checkContractWalletSignature;\n/**\n * This method leverages a native CSPRNG with support for both browser and Node.js\n * environments in order generate a cryptographically secure nonce for use in the\n * SiweMessage in order to prevent replay attacks.\n *\n * 96 bits has been chosen as a number to sufficiently balance size and security considerations\n * relative to the lifespan of it's usage.\n *\n * @returns cryptographically generated random nonce with 96 bits of entropy encoded with\n * an alphanumeric character set.\n */\nconst generateNonce = () => {\n    const nonce = (0, random_1.randomStringForEntropy)(96);\n    if (!nonce || nonce.length < 8) {\n        throw new Error('Error during nonce creation.');\n    }\n    return nonce;\n};\nexports.generateNonce = generateNonce;\n/**\n * This method matches the given date string against the ISO-8601 regex and also\n * performs checks if it's a valid date.\n * @param inputDate any string to be validated against ISO-8601\n * @returns boolean indicating if the providade date is valid and conformant to ISO-8601\n */\nconst isValidISO8601Date = (inputDate) => {\n    /* Split groups and make sure inputDate is in ISO8601 format */\n    const inputMatch = ISO8601.exec(inputDate);\n    /* if inputMatch is null the date is not ISO-8601 */\n    if (!inputDate) {\n        return false;\n    }\n    /* Creates a date object with input date to parse for invalid days e.g. Feb, 30 -> Mar, 01 */\n    const inputDateParsed = new Date(inputMatch.groups.date).toISOString();\n    /* Get groups from new parsed date to compare with the original input */\n    const parsedInputMatch = ISO8601.exec(inputDateParsed);\n    /* Compare remaining fields */\n    return inputMatch.groups.date === parsedInputMatch.groups.date;\n};\nexports.isValidISO8601Date = isValidISO8601Date;\nconst checkInvalidKeys = (obj, keys) => {\n    const invalidKeys = [];\n    Object.keys(obj).forEach(key => {\n        if (!keys.includes(key)) {\n            invalidKeys.push(key);\n        }\n    });\n    return invalidKeys;\n};\nexports.checkInvalidKeys = checkInvalidKeys;\n","(function(module) {\n    'use strict';\n\n    module.exports.is_uri = is_iri;\n    module.exports.is_http_uri = is_http_iri;\n    module.exports.is_https_uri = is_https_iri;\n    module.exports.is_web_uri = is_web_iri;\n    // Create aliases\n    module.exports.isUri = is_iri;\n    module.exports.isHttpUri = is_http_iri;\n    module.exports.isHttpsUri = is_https_iri;\n    module.exports.isWebUri = is_web_iri;\n\n\n    // private function\n    // internal URI spitter method - direct from RFC 3986\n    var splitUri = function(uri) {\n        var splitted = uri.match(/(?:([^:\\/?#]+):)?(?:\\/\\/([^\\/?#]*))?([^?#]*)(?:\\?([^#]*))?(?:#(.*))?/);\n        return splitted;\n    };\n\n    function is_iri(value) {\n        if (!value) {\n            return;\n        }\n\n        // check for illegal characters\n        if (/[^a-z0-9\\:\\/\\?\\#\\[\\]\\@\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=\\.\\-\\_\\~\\%]/i.test(value)) return;\n\n        // check for hex escapes that aren't complete\n        if (/%[^0-9a-f]/i.test(value)) return;\n        if (/%[0-9a-f](:?[^0-9a-f]|$)/i.test(value)) return;\n\n        var splitted = [];\n        var scheme = '';\n        var authority = '';\n        var path = '';\n        var query = '';\n        var fragment = '';\n        var out = '';\n\n        // from RFC 3986\n        splitted = splitUri(value);\n        scheme = splitted[1]; \n        authority = splitted[2];\n        path = splitted[3];\n        query = splitted[4];\n        fragment = splitted[5];\n\n        // scheme and path are required, though the path can be empty\n        if (!(scheme && scheme.length && path.length >= 0)) return;\n\n        // if authority is present, the path must be empty or begin with a /\n        if (authority && authority.length) {\n            if (!(path.length === 0 || /^\\//.test(path))) return;\n        } else {\n            // if authority is not present, the path must not start with //\n            if (/^\\/\\//.test(path)) return;\n        }\n\n        // scheme must begin with a letter, then consist of letters, digits, +, ., or -\n        if (!/^[a-z][a-z0-9\\+\\-\\.]*$/.test(scheme.toLowerCase()))  return;\n\n        // re-assemble the URL per section 5.3 in RFC 3986\n        out += scheme + ':';\n        if (authority && authority.length) {\n            out += '//' + authority;\n        }\n\n        out += path;\n\n        if (query && query.length) {\n            out += '?' + query;\n        }\n\n        if (fragment && fragment.length) {\n            out += '#' + fragment;\n        }\n\n        return out;\n    }\n\n    function is_http_iri(value, allowHttps) {\n        if (!is_iri(value)) {\n            return;\n        }\n\n        var splitted = [];\n        var scheme = '';\n        var authority = '';\n        var path = '';\n        var port = '';\n        var query = '';\n        var fragment = '';\n        var out = '';\n\n        // from RFC 3986\n        splitted = splitUri(value);\n        scheme = splitted[1]; \n        authority = splitted[2];\n        path = splitted[3];\n        query = splitted[4];\n        fragment = splitted[5];\n\n        if (!scheme)  return;\n\n        if(allowHttps) {\n            if (scheme.toLowerCase() != 'https') return;\n        } else {\n            if (scheme.toLowerCase() != 'http') return;\n        }\n\n        // fully-qualified URIs must have an authority section that is\n        // a valid host\n        if (!authority) {\n            return;\n        }\n\n        // enable port component\n        if (/:(\\d+)$/.test(authority)) {\n            port = authority.match(/:(\\d+)$/)[0];\n            authority = authority.replace(/:\\d+$/, '');\n        }\n\n        out += scheme + ':';\n        out += '//' + authority;\n        \n        if (port) {\n            out += port;\n        }\n        \n        out += path;\n        \n        if(query && query.length){\n            out += '?' + query;\n        }\n\n        if(fragment && fragment.length){\n            out += '#' + fragment;\n        }\n        \n        return out;\n    }\n\n    function is_https_iri(value) {\n        return is_http_iri(value, true);\n    }\n\n    function is_web_iri(value) {\n        return (is_http_iri(value) || is_https_iri(value));\n    }\n\n})(module);\n","\"use strict\";\n/*! MIT License. Copyright 2015-2022 Richard Moore <me@ricmoo.com>. See LICENSE.txt. */\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 __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 _AES_key, _AES_Kd, _AES_Ke;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AES = void 0;\n// Number of rounds by keysize\nconst numberOfRounds = { 16: 10, 24: 12, 32: 14 };\n// Round constant words\nconst rcon = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91];\n// S-box and Inverse S-box (S is for Substitution)\nconst S = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16];\nconst Si = [0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d];\n// Transformations for encryption\nconst T1 = [0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d, 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554, 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d, 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a, 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87, 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b, 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea, 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b, 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a, 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4f, 0x6834345c, 0x51a5a5f4, 0xd1e5e534, 0xf9f1f108, 0xe2717193, 0xabd8d873, 0x62313153, 0x2a15153f, 0x0804040c, 0x95c7c752, 0x46232365, 0x9dc3c35e, 0x30181828, 0x379696a1, 0x0a05050f, 0x2f9a9ab5, 0x0e070709, 0x24121236, 0x1b80809b, 0xdfe2e23d, 0xcdebeb26, 0x4e272769, 0x7fb2b2cd, 0xea75759f, 0x1209091b, 0x1d83839e, 0x582c2c74, 0x341a1a2e, 0x361b1b2d, 0xdc6e6eb2, 0xb45a5aee, 0x5ba0a0fb, 0xa45252f6, 0x763b3b4d, 0xb7d6d661, 0x7db3b3ce, 0x5229297b, 0xdde3e33e, 0x5e2f2f71, 0x13848497, 0xa65353f5, 0xb9d1d168, 0x00000000, 0xc1eded2c, 0x40202060, 0xe3fcfc1f, 0x79b1b1c8, 0xb65b5bed, 0xd46a6abe, 0x8dcbcb46, 0x67bebed9, 0x7239394b, 0x944a4ade, 0x984c4cd4, 0xb05858e8, 0x85cfcf4a, 0xbbd0d06b, 0xc5efef2a, 0x4faaaae5, 0xedfbfb16, 0x864343c5, 0x9a4d4dd7, 0x66333355, 0x11858594, 0x8a4545cf, 0xe9f9f910, 0x04020206, 0xfe7f7f81, 0xa05050f0, 0x783c3c44, 0x259f9fba, 0x4ba8a8e3, 0xa25151f3, 0x5da3a3fe, 0x804040c0, 0x058f8f8a, 0x3f9292ad, 0x219d9dbc, 0x70383848, 0xf1f5f504, 0x63bcbcdf, 0x77b6b6c1, 0xafdada75, 0x42212163, 0x20101030, 0xe5ffff1a, 0xfdf3f30e, 0xbfd2d26d, 0x81cdcd4c, 0x180c0c14, 0x26131335, 0xc3ecec2f, 0xbe5f5fe1, 0x359797a2, 0x884444cc, 0x2e171739, 0x93c4c457, 0x55a7a7f2, 0xfc7e7e82, 0x7a3d3d47, 0xc86464ac, 0xba5d5de7, 0x3219192b, 0xe6737395, 0xc06060a0, 0x19818198, 0x9e4f4fd1, 0xa3dcdc7f, 0x44222266, 0x542a2a7e, 0x3b9090ab, 0x0b888883, 0x8c4646ca, 0xc7eeee29, 0x6bb8b8d3, 0x2814143c, 0xa7dede79, 0xbc5e5ee2, 0x160b0b1d, 0xaddbdb76, 0xdbe0e03b, 0x64323256, 0x743a3a4e, 0x140a0a1e, 0x924949db, 0x0c06060a, 0x4824246c, 0xb85c5ce4, 0x9fc2c25d, 0xbdd3d36e, 0x43acacef, 0xc46262a6, 0x399191a8, 0x319595a4, 0xd3e4e437, 0xf279798b, 0xd5e7e732, 0x8bc8c843, 0x6e373759, 0xda6d6db7, 0x018d8d8c, 0xb1d5d564, 0x9c4e4ed2, 0x49a9a9e0, 0xd86c6cb4, 0xac5656fa, 0xf3f4f407, 0xcfeaea25, 0xca6565af, 0xf47a7a8e, 0x47aeaee9, 0x10080818, 0x6fbabad5, 0xf0787888, 0x4a25256f, 0x5c2e2e72, 0x381c1c24, 0x57a6a6f1, 0x73b4b4c7, 0x97c6c651, 0xcbe8e823, 0xa1dddd7c, 0xe874749c, 0x3e1f1f21, 0x964b4bdd, 0x61bdbddc, 0x0d8b8b86, 0x0f8a8a85, 0xe0707090, 0x7c3e3e42, 0x71b5b5c4, 0xcc6666aa, 0x904848d8, 0x06030305, 0xf7f6f601, 0x1c0e0e12, 0xc26161a3, 0x6a35355f, 0xae5757f9, 0x69b9b9d0, 0x17868691, 0x99c1c158, 0x3a1d1d27, 0x279e9eb9, 0xd9e1e138, 0xebf8f813, 0x2b9898b3, 0x22111133, 0xd26969bb, 0xa9d9d970, 0x078e8e89, 0x339494a7, 0x2d9b9bb6, 0x3c1e1e22, 0x15878792, 0xc9e9e920, 0x87cece49, 0xaa5555ff, 0x50282878, 0xa5dfdf7a, 0x038c8c8f, 0x59a1a1f8, 0x09898980, 0x1a0d0d17, 0x65bfbfda, 0xd7e6e631, 0x844242c6, 0xd06868b8, 0x824141c3, 0x299999b0, 0x5a2d2d77, 0x1e0f0f11, 0x7bb0b0cb, 0xa85454fc, 0x6dbbbbd6, 0x2c16163a];\nconst T2 = [0xa5c66363, 0x84f87c7c, 0x99ee7777, 0x8df67b7b, 0x0dfff2f2, 0xbdd66b6b, 0xb1de6f6f, 0x5491c5c5, 0x50603030, 0x03020101, 0xa9ce6767, 0x7d562b2b, 0x19e7fefe, 0x62b5d7d7, 0xe64dabab, 0x9aec7676, 0x458fcaca, 0x9d1f8282, 0x4089c9c9, 0x87fa7d7d, 0x15effafa, 0xebb25959, 0xc98e4747, 0x0bfbf0f0, 0xec41adad, 0x67b3d4d4, 0xfd5fa2a2, 0xea45afaf, 0xbf239c9c, 0xf753a4a4, 0x96e47272, 0x5b9bc0c0, 0xc275b7b7, 0x1ce1fdfd, 0xae3d9393, 0x6a4c2626, 0x5a6c3636, 0x417e3f3f, 0x02f5f7f7, 0x4f83cccc, 0x5c683434, 0xf451a5a5, 0x34d1e5e5, 0x08f9f1f1, 0x93e27171, 0x73abd8d8, 0x53623131, 0x3f2a1515, 0x0c080404, 0x5295c7c7, 0x65462323, 0x5e9dc3c3, 0x28301818, 0xa1379696, 0x0f0a0505, 0xb52f9a9a, 0x090e0707, 0x36241212, 0x9b1b8080, 0x3ddfe2e2, 0x26cdebeb, 0x694e2727, 0xcd7fb2b2, 0x9fea7575, 0x1b120909, 0x9e1d8383, 0x74582c2c, 0x2e341a1a, 0x2d361b1b, 0xb2dc6e6e, 0xeeb45a5a, 0xfb5ba0a0, 0xf6a45252, 0x4d763b3b, 0x61b7d6d6, 0xce7db3b3, 0x7b522929, 0x3edde3e3, 0x715e2f2f, 0x97138484, 0xf5a65353, 0x68b9d1d1, 0x00000000, 0x2cc1eded, 0x60402020, 0x1fe3fcfc, 0xc879b1b1, 0xedb65b5b, 0xbed46a6a, 0x468dcbcb, 0xd967bebe, 0x4b723939, 0xde944a4a, 0xd4984c4c, 0xe8b05858, 0x4a85cfcf, 0x6bbbd0d0, 0x2ac5efef, 0xe54faaaa, 0x16edfbfb, 0xc5864343, 0xd79a4d4d, 0x55663333, 0x94118585, 0xcf8a4545, 0x10e9f9f9, 0x06040202, 0x81fe7f7f, 0xf0a05050, 0x44783c3c, 0xba259f9f, 0xe34ba8a8, 0xf3a25151, 0xfe5da3a3, 0xc0804040, 0x8a058f8f, 0xad3f9292, 0xbc219d9d, 0x48703838, 0x04f1f5f5, 0xdf63bcbc, 0xc177b6b6, 0x75afdada, 0x63422121, 0x30201010, 0x1ae5ffff, 0x0efdf3f3, 0x6dbfd2d2, 0x4c81cdcd, 0x14180c0c, 0x35261313, 0x2fc3ecec, 0xe1be5f5f, 0xa2359797, 0xcc884444, 0x392e1717, 0x5793c4c4, 0xf255a7a7, 0x82fc7e7e, 0x477a3d3d, 0xacc86464, 0xe7ba5d5d, 0x2b321919, 0x95e67373, 0xa0c06060, 0x98198181, 0xd19e4f4f, 0x7fa3dcdc, 0x66442222, 0x7e542a2a, 0xab3b9090, 0x830b8888, 0xca8c4646, 0x29c7eeee, 0xd36bb8b8, 0x3c281414, 0x79a7dede, 0xe2bc5e5e, 0x1d160b0b, 0x76addbdb, 0x3bdbe0e0, 0x56643232, 0x4e743a3a, 0x1e140a0a, 0xdb924949, 0x0a0c0606, 0x6c482424, 0xe4b85c5c, 0x5d9fc2c2, 0x6ebdd3d3, 0xef43acac, 0xa6c46262, 0xa8399191, 0xa4319595, 0x37d3e4e4, 0x8bf27979, 0x32d5e7e7, 0x438bc8c8, 0x596e3737, 0xb7da6d6d, 0x8c018d8d, 0x64b1d5d5, 0xd29c4e4e, 0xe049a9a9, 0xb4d86c6c, 0xfaac5656, 0x07f3f4f4, 0x25cfeaea, 0xafca6565, 0x8ef47a7a, 0xe947aeae, 0x18100808, 0xd56fbaba, 0x88f07878, 0x6f4a2525, 0x725c2e2e, 0x24381c1c, 0xf157a6a6, 0xc773b4b4, 0x5197c6c6, 0x23cbe8e8, 0x7ca1dddd, 0x9ce87474, 0x213e1f1f, 0xdd964b4b, 0xdc61bdbd, 0x860d8b8b, 0x850f8a8a, 0x90e07070, 0x427c3e3e, 0xc471b5b5, 0xaacc6666, 0xd8904848, 0x05060303, 0x01f7f6f6, 0x121c0e0e, 0xa3c26161, 0x5f6a3535, 0xf9ae5757, 0xd069b9b9, 0x91178686, 0x5899c1c1, 0x273a1d1d, 0xb9279e9e, 0x38d9e1e1, 0x13ebf8f8, 0xb32b9898, 0x33221111, 0xbbd26969, 0x70a9d9d9, 0x89078e8e, 0xa7339494, 0xb62d9b9b, 0x223c1e1e, 0x92158787, 0x20c9e9e9, 0x4987cece, 0xffaa5555, 0x78502828, 0x7aa5dfdf, 0x8f038c8c, 0xf859a1a1, 0x80098989, 0x171a0d0d, 0xda65bfbf, 0x31d7e6e6, 0xc6844242, 0xb8d06868, 0xc3824141, 0xb0299999, 0x775a2d2d, 0x111e0f0f, 0xcb7bb0b0, 0xfca85454, 0xd66dbbbb, 0x3a2c1616];\nconst T3 = [0x63a5c663, 0x7c84f87c, 0x7799ee77, 0x7b8df67b, 0xf20dfff2, 0x6bbdd66b, 0x6fb1de6f, 0xc55491c5, 0x30506030, 0x01030201, 0x67a9ce67, 0x2b7d562b, 0xfe19e7fe, 0xd762b5d7, 0xabe64dab, 0x769aec76, 0xca458fca, 0x829d1f82, 0xc94089c9, 0x7d87fa7d, 0xfa15effa, 0x59ebb259, 0x47c98e47, 0xf00bfbf0, 0xadec41ad, 0xd467b3d4, 0xa2fd5fa2, 0xafea45af, 0x9cbf239c, 0xa4f753a4, 0x7296e472, 0xc05b9bc0, 0xb7c275b7, 0xfd1ce1fd, 0x93ae3d93, 0x266a4c26, 0x365a6c36, 0x3f417e3f, 0xf702f5f7, 0xcc4f83cc, 0x345c6834, 0xa5f451a5, 0xe534d1e5, 0xf108f9f1, 0x7193e271, 0xd873abd8, 0x31536231, 0x153f2a15, 0x040c0804, 0xc75295c7, 0x23654623, 0xc35e9dc3, 0x18283018, 0x96a13796, 0x050f0a05, 0x9ab52f9a, 0x07090e07, 0x12362412, 0x809b1b80, 0xe23ddfe2, 0xeb26cdeb, 0x27694e27, 0xb2cd7fb2, 0x759fea75, 0x091b1209, 0x839e1d83, 0x2c74582c, 0x1a2e341a, 0x1b2d361b, 0x6eb2dc6e, 0x5aeeb45a, 0xa0fb5ba0, 0x52f6a452, 0x3b4d763b, 0xd661b7d6, 0xb3ce7db3, 0x297b5229, 0xe33edde3, 0x2f715e2f, 0x84971384, 0x53f5a653, 0xd168b9d1, 0x00000000, 0xed2cc1ed, 0x20604020, 0xfc1fe3fc, 0xb1c879b1, 0x5bedb65b, 0x6abed46a, 0xcb468dcb, 0xbed967be, 0x394b7239, 0x4ade944a, 0x4cd4984c, 0x58e8b058, 0xcf4a85cf, 0xd06bbbd0, 0xef2ac5ef, 0xaae54faa, 0xfb16edfb, 0x43c58643, 0x4dd79a4d, 0x33556633, 0x85941185, 0x45cf8a45, 0xf910e9f9, 0x02060402, 0x7f81fe7f, 0x50f0a050, 0x3c44783c, 0x9fba259f, 0xa8e34ba8, 0x51f3a251, 0xa3fe5da3, 0x40c08040, 0x8f8a058f, 0x92ad3f92, 0x9dbc219d, 0x38487038, 0xf504f1f5, 0xbcdf63bc, 0xb6c177b6, 0xda75afda, 0x21634221, 0x10302010, 0xff1ae5ff, 0xf30efdf3, 0xd26dbfd2, 0xcd4c81cd, 0x0c14180c, 0x13352613, 0xec2fc3ec, 0x5fe1be5f, 0x97a23597, 0x44cc8844, 0x17392e17, 0xc45793c4, 0xa7f255a7, 0x7e82fc7e, 0x3d477a3d, 0x64acc864, 0x5de7ba5d, 0x192b3219, 0x7395e673, 0x60a0c060, 0x81981981, 0x4fd19e4f, 0xdc7fa3dc, 0x22664422, 0x2a7e542a, 0x90ab3b90, 0x88830b88, 0x46ca8c46, 0xee29c7ee, 0xb8d36bb8, 0x143c2814, 0xde79a7de, 0x5ee2bc5e, 0x0b1d160b, 0xdb76addb, 0xe03bdbe0, 0x32566432, 0x3a4e743a, 0x0a1e140a, 0x49db9249, 0x060a0c06, 0x246c4824, 0x5ce4b85c, 0xc25d9fc2, 0xd36ebdd3, 0xacef43ac, 0x62a6c462, 0x91a83991, 0x95a43195, 0xe437d3e4, 0x798bf279, 0xe732d5e7, 0xc8438bc8, 0x37596e37, 0x6db7da6d, 0x8d8c018d, 0xd564b1d5, 0x4ed29c4e, 0xa9e049a9, 0x6cb4d86c, 0x56faac56, 0xf407f3f4, 0xea25cfea, 0x65afca65, 0x7a8ef47a, 0xaee947ae, 0x08181008, 0xbad56fba, 0x7888f078, 0x256f4a25, 0x2e725c2e, 0x1c24381c, 0xa6f157a6, 0xb4c773b4, 0xc65197c6, 0xe823cbe8, 0xdd7ca1dd, 0x749ce874, 0x1f213e1f, 0x4bdd964b, 0xbddc61bd, 0x8b860d8b, 0x8a850f8a, 0x7090e070, 0x3e427c3e, 0xb5c471b5, 0x66aacc66, 0x48d89048, 0x03050603, 0xf601f7f6, 0x0e121c0e, 0x61a3c261, 0x355f6a35, 0x57f9ae57, 0xb9d069b9, 0x86911786, 0xc15899c1, 0x1d273a1d, 0x9eb9279e, 0xe138d9e1, 0xf813ebf8, 0x98b32b98, 0x11332211, 0x69bbd269, 0xd970a9d9, 0x8e89078e, 0x94a73394, 0x9bb62d9b, 0x1e223c1e, 0x87921587, 0xe920c9e9, 0xce4987ce, 0x55ffaa55, 0x28785028, 0xdf7aa5df, 0x8c8f038c, 0xa1f859a1, 0x89800989, 0x0d171a0d, 0xbfda65bf, 0xe631d7e6, 0x42c68442, 0x68b8d068, 0x41c38241, 0x99b02999, 0x2d775a2d, 0x0f111e0f, 0xb0cb7bb0, 0x54fca854, 0xbbd66dbb, 0x163a2c16];\nconst T4 = [0x6363a5c6, 0x7c7c84f8, 0x777799ee, 0x7b7b8df6, 0xf2f20dff, 0x6b6bbdd6, 0x6f6fb1de, 0xc5c55491, 0x30305060, 0x01010302, 0x6767a9ce, 0x2b2b7d56, 0xfefe19e7, 0xd7d762b5, 0xababe64d, 0x76769aec, 0xcaca458f, 0x82829d1f, 0xc9c94089, 0x7d7d87fa, 0xfafa15ef, 0x5959ebb2, 0x4747c98e, 0xf0f00bfb, 0xadadec41, 0xd4d467b3, 0xa2a2fd5f, 0xafafea45, 0x9c9cbf23, 0xa4a4f753, 0x727296e4, 0xc0c05b9b, 0xb7b7c275, 0xfdfd1ce1, 0x9393ae3d, 0x26266a4c, 0x36365a6c, 0x3f3f417e, 0xf7f702f5, 0xcccc4f83, 0x34345c68, 0xa5a5f451, 0xe5e534d1, 0xf1f108f9, 0x717193e2, 0xd8d873ab, 0x31315362, 0x15153f2a, 0x04040c08, 0xc7c75295, 0x23236546, 0xc3c35e9d, 0x18182830, 0x9696a137, 0x05050f0a, 0x9a9ab52f, 0x0707090e, 0x12123624, 0x80809b1b, 0xe2e23ddf, 0xebeb26cd, 0x2727694e, 0xb2b2cd7f, 0x75759fea, 0x09091b12, 0x83839e1d, 0x2c2c7458, 0x1a1a2e34, 0x1b1b2d36, 0x6e6eb2dc, 0x5a5aeeb4, 0xa0a0fb5b, 0x5252f6a4, 0x3b3b4d76, 0xd6d661b7, 0xb3b3ce7d, 0x29297b52, 0xe3e33edd, 0x2f2f715e, 0x84849713, 0x5353f5a6, 0xd1d168b9, 0x00000000, 0xeded2cc1, 0x20206040, 0xfcfc1fe3, 0xb1b1c879, 0x5b5bedb6, 0x6a6abed4, 0xcbcb468d, 0xbebed967, 0x39394b72, 0x4a4ade94, 0x4c4cd498, 0x5858e8b0, 0xcfcf4a85, 0xd0d06bbb, 0xefef2ac5, 0xaaaae54f, 0xfbfb16ed, 0x4343c586, 0x4d4dd79a, 0x33335566, 0x85859411, 0x4545cf8a, 0xf9f910e9, 0x02020604, 0x7f7f81fe, 0x5050f0a0, 0x3c3c4478, 0x9f9fba25, 0xa8a8e34b, 0x5151f3a2, 0xa3a3fe5d, 0x4040c080, 0x8f8f8a05, 0x9292ad3f, 0x9d9dbc21, 0x38384870, 0xf5f504f1, 0xbcbcdf63, 0xb6b6c177, 0xdada75af, 0x21216342, 0x10103020, 0xffff1ae5, 0xf3f30efd, 0xd2d26dbf, 0xcdcd4c81, 0x0c0c1418, 0x13133526, 0xecec2fc3, 0x5f5fe1be, 0x9797a235, 0x4444cc88, 0x1717392e, 0xc4c45793, 0xa7a7f255, 0x7e7e82fc, 0x3d3d477a, 0x6464acc8, 0x5d5de7ba, 0x19192b32, 0x737395e6, 0x6060a0c0, 0x81819819, 0x4f4fd19e, 0xdcdc7fa3, 0x22226644, 0x2a2a7e54, 0x9090ab3b, 0x8888830b, 0x4646ca8c, 0xeeee29c7, 0xb8b8d36b, 0x14143c28, 0xdede79a7, 0x5e5ee2bc, 0x0b0b1d16, 0xdbdb76ad, 0xe0e03bdb, 0x32325664, 0x3a3a4e74, 0x0a0a1e14, 0x4949db92, 0x06060a0c, 0x24246c48, 0x5c5ce4b8, 0xc2c25d9f, 0xd3d36ebd, 0xacacef43, 0x6262a6c4, 0x9191a839, 0x9595a431, 0xe4e437d3, 0x79798bf2, 0xe7e732d5, 0xc8c8438b, 0x3737596e, 0x6d6db7da, 0x8d8d8c01, 0xd5d564b1, 0x4e4ed29c, 0xa9a9e049, 0x6c6cb4d8, 0x5656faac, 0xf4f407f3, 0xeaea25cf, 0x6565afca, 0x7a7a8ef4, 0xaeaee947, 0x08081810, 0xbabad56f, 0x787888f0, 0x25256f4a, 0x2e2e725c, 0x1c1c2438, 0xa6a6f157, 0xb4b4c773, 0xc6c65197, 0xe8e823cb, 0xdddd7ca1, 0x74749ce8, 0x1f1f213e, 0x4b4bdd96, 0xbdbddc61, 0x8b8b860d, 0x8a8a850f, 0x707090e0, 0x3e3e427c, 0xb5b5c471, 0x6666aacc, 0x4848d890, 0x03030506, 0xf6f601f7, 0x0e0e121c, 0x6161a3c2, 0x35355f6a, 0x5757f9ae, 0xb9b9d069, 0x86869117, 0xc1c15899, 0x1d1d273a, 0x9e9eb927, 0xe1e138d9, 0xf8f813eb, 0x9898b32b, 0x11113322, 0x6969bbd2, 0xd9d970a9, 0x8e8e8907, 0x9494a733, 0x9b9bb62d, 0x1e1e223c, 0x87879215, 0xe9e920c9, 0xcece4987, 0x5555ffaa, 0x28287850, 0xdfdf7aa5, 0x8c8c8f03, 0xa1a1f859, 0x89898009, 0x0d0d171a, 0xbfbfda65, 0xe6e631d7, 0x4242c684, 0x6868b8d0, 0x4141c382, 0x9999b029, 0x2d2d775a, 0x0f0f111e, 0xb0b0cb7b, 0x5454fca8, 0xbbbbd66d, 0x16163a2c];\n// Transformations for decryption\nconst T5 = [0x51f4a750, 0x7e416553, 0x1a17a4c3, 0x3a275e96, 0x3bab6bcb, 0x1f9d45f1, 0xacfa58ab, 0x4be30393, 0x2030fa55, 0xad766df6, 0x88cc7691, 0xf5024c25, 0x4fe5d7fc, 0xc52acbd7, 0x26354480, 0xb562a38f, 0xdeb15a49, 0x25ba1b67, 0x45ea0e98, 0x5dfec0e1, 0xc32f7502, 0x814cf012, 0x8d4697a3, 0x6bd3f9c6, 0x038f5fe7, 0x15929c95, 0xbf6d7aeb, 0x955259da, 0xd4be832d, 0x587421d3, 0x49e06929, 0x8ec9c844, 0x75c2896a, 0xf48e7978, 0x99583e6b, 0x27b971dd, 0xbee14fb6, 0xf088ad17, 0xc920ac66, 0x7dce3ab4, 0x63df4a18, 0xe51a3182, 0x97513360, 0x62537f45, 0xb16477e0, 0xbb6bae84, 0xfe81a01c, 0xf9082b94, 0x70486858, 0x8f45fd19, 0x94de6c87, 0x527bf8b7, 0xab73d323, 0x724b02e2, 0xe31f8f57, 0x6655ab2a, 0xb2eb2807, 0x2fb5c203, 0x86c57b9a, 0xd33708a5, 0x302887f2, 0x23bfa5b2, 0x02036aba, 0xed16825c, 0x8acf1c2b, 0xa779b492, 0xf307f2f0, 0x4e69e2a1, 0x65daf4cd, 0x0605bed5, 0xd134621f, 0xc4a6fe8a, 0x342e539d, 0xa2f355a0, 0x058ae132, 0xa4f6eb75, 0x0b83ec39, 0x4060efaa, 0x5e719f06, 0xbd6e1051, 0x3e218af9, 0x96dd063d, 0xdd3e05ae, 0x4de6bd46, 0x91548db5, 0x71c45d05, 0x0406d46f, 0x605015ff, 0x1998fb24, 0xd6bde997, 0x894043cc, 0x67d99e77, 0xb0e842bd, 0x07898b88, 0xe7195b38, 0x79c8eedb, 0xa17c0a47, 0x7c420fe9, 0xf8841ec9, 0x00000000, 0x09808683, 0x322bed48, 0x1e1170ac, 0x6c5a724e, 0xfd0efffb, 0x0f853856, 0x3daed51e, 0x362d3927, 0x0a0fd964, 0x685ca621, 0x9b5b54d1, 0x24362e3a, 0x0c0a67b1, 0x9357e70f, 0xb4ee96d2, 0x1b9b919e, 0x80c0c54f, 0x61dc20a2, 0x5a774b69, 0x1c121a16, 0xe293ba0a, 0xc0a02ae5, 0x3c22e043, 0x121b171d, 0x0e090d0b, 0xf28bc7ad, 0x2db6a8b9, 0x141ea9c8, 0x57f11985, 0xaf75074c, 0xee99ddbb, 0xa37f60fd, 0xf701269f, 0x5c72f5bc, 0x44663bc5, 0x5bfb7e34, 0x8b432976, 0xcb23c6dc, 0xb6edfc68, 0xb8e4f163, 0xd731dcca, 0x42638510, 0x13972240, 0x84c61120, 0x854a247d, 0xd2bb3df8, 0xaef93211, 0xc729a16d, 0x1d9e2f4b, 0xdcb230f3, 0x0d8652ec, 0x77c1e3d0, 0x2bb3166c, 0xa970b999, 0x119448fa, 0x47e96422, 0xa8fc8cc4, 0xa0f03f1a, 0x567d2cd8, 0x223390ef, 0x87494ec7, 0xd938d1c1, 0x8ccaa2fe, 0x98d40b36, 0xa6f581cf, 0xa57ade28, 0xdab78e26, 0x3fadbfa4, 0x2c3a9de4, 0x5078920d, 0x6a5fcc9b, 0x547e4662, 0xf68d13c2, 0x90d8b8e8, 0x2e39f75e, 0x82c3aff5, 0x9f5d80be, 0x69d0937c, 0x6fd52da9, 0xcf2512b3, 0xc8ac993b, 0x10187da7, 0xe89c636e, 0xdb3bbb7b, 0xcd267809, 0x6e5918f4, 0xec9ab701, 0x834f9aa8, 0xe6956e65, 0xaaffe67e, 0x21bccf08, 0xef15e8e6, 0xbae79bd9, 0x4a6f36ce, 0xea9f09d4, 0x29b07cd6, 0x31a4b2af, 0x2a3f2331, 0xc6a59430, 0x35a266c0, 0x744ebc37, 0xfc82caa6, 0xe090d0b0, 0x33a7d815, 0xf104984a, 0x41ecdaf7, 0x7fcd500e, 0x1791f62f, 0x764dd68d, 0x43efb04d, 0xccaa4d54, 0xe49604df, 0x9ed1b5e3, 0x4c6a881b, 0xc12c1fb8, 0x4665517f, 0x9d5eea04, 0x018c355d, 0xfa877473, 0xfb0b412e, 0xb3671d5a, 0x92dbd252, 0xe9105633, 0x6dd64713, 0x9ad7618c, 0x37a10c7a, 0x59f8148e, 0xeb133c89, 0xcea927ee, 0xb761c935, 0xe11ce5ed, 0x7a47b13c, 0x9cd2df59, 0x55f2733f, 0x1814ce79, 0x73c737bf, 0x53f7cdea, 0x5ffdaa5b, 0xdf3d6f14, 0x7844db86, 0xcaaff381, 0xb968c43e, 0x3824342c, 0xc2a3405f, 0x161dc372, 0xbce2250c, 0x283c498b, 0xff0d9541, 0x39a80171, 0x080cb3de, 0xd8b4e49c, 0x6456c190, 0x7bcb8461, 0xd532b670, 0x486c5c74, 0xd0b85742];\nconst T6 = [0x5051f4a7, 0x537e4165, 0xc31a17a4, 0x963a275e, 0xcb3bab6b, 0xf11f9d45, 0xabacfa58, 0x934be303, 0x552030fa, 0xf6ad766d, 0x9188cc76, 0x25f5024c, 0xfc4fe5d7, 0xd7c52acb, 0x80263544, 0x8fb562a3, 0x49deb15a, 0x6725ba1b, 0x9845ea0e, 0xe15dfec0, 0x02c32f75, 0x12814cf0, 0xa38d4697, 0xc66bd3f9, 0xe7038f5f, 0x9515929c, 0xebbf6d7a, 0xda955259, 0x2dd4be83, 0xd3587421, 0x2949e069, 0x448ec9c8, 0x6a75c289, 0x78f48e79, 0x6b99583e, 0xdd27b971, 0xb6bee14f, 0x17f088ad, 0x66c920ac, 0xb47dce3a, 0x1863df4a, 0x82e51a31, 0x60975133, 0x4562537f, 0xe0b16477, 0x84bb6bae, 0x1cfe81a0, 0x94f9082b, 0x58704868, 0x198f45fd, 0x8794de6c, 0xb7527bf8, 0x23ab73d3, 0xe2724b02, 0x57e31f8f, 0x2a6655ab, 0x07b2eb28, 0x032fb5c2, 0x9a86c57b, 0xa5d33708, 0xf2302887, 0xb223bfa5, 0xba02036a, 0x5ced1682, 0x2b8acf1c, 0x92a779b4, 0xf0f307f2, 0xa14e69e2, 0xcd65daf4, 0xd50605be, 0x1fd13462, 0x8ac4a6fe, 0x9d342e53, 0xa0a2f355, 0x32058ae1, 0x75a4f6eb, 0x390b83ec, 0xaa4060ef, 0x065e719f, 0x51bd6e10, 0xf93e218a, 0x3d96dd06, 0xaedd3e05, 0x464de6bd, 0xb591548d, 0x0571c45d, 0x6f0406d4, 0xff605015, 0x241998fb, 0x97d6bde9, 0xcc894043, 0x7767d99e, 0xbdb0e842, 0x8807898b, 0x38e7195b, 0xdb79c8ee, 0x47a17c0a, 0xe97c420f, 0xc9f8841e, 0x00000000, 0x83098086, 0x48322bed, 0xac1e1170, 0x4e6c5a72, 0xfbfd0eff, 0x560f8538, 0x1e3daed5, 0x27362d39, 0x640a0fd9, 0x21685ca6, 0xd19b5b54, 0x3a24362e, 0xb10c0a67, 0x0f9357e7, 0xd2b4ee96, 0x9e1b9b91, 0x4f80c0c5, 0xa261dc20, 0x695a774b, 0x161c121a, 0x0ae293ba, 0xe5c0a02a, 0x433c22e0, 0x1d121b17, 0x0b0e090d, 0xadf28bc7, 0xb92db6a8, 0xc8141ea9, 0x8557f119, 0x4caf7507, 0xbbee99dd, 0xfda37f60, 0x9ff70126, 0xbc5c72f5, 0xc544663b, 0x345bfb7e, 0x768b4329, 0xdccb23c6, 0x68b6edfc, 0x63b8e4f1, 0xcad731dc, 0x10426385, 0x40139722, 0x2084c611, 0x7d854a24, 0xf8d2bb3d, 0x11aef932, 0x6dc729a1, 0x4b1d9e2f, 0xf3dcb230, 0xec0d8652, 0xd077c1e3, 0x6c2bb316, 0x99a970b9, 0xfa119448, 0x2247e964, 0xc4a8fc8c, 0x1aa0f03f, 0xd8567d2c, 0xef223390, 0xc787494e, 0xc1d938d1, 0xfe8ccaa2, 0x3698d40b, 0xcfa6f581, 0x28a57ade, 0x26dab78e, 0xa43fadbf, 0xe42c3a9d, 0x0d507892, 0x9b6a5fcc, 0x62547e46, 0xc2f68d13, 0xe890d8b8, 0x5e2e39f7, 0xf582c3af, 0xbe9f5d80, 0x7c69d093, 0xa96fd52d, 0xb3cf2512, 0x3bc8ac99, 0xa710187d, 0x6ee89c63, 0x7bdb3bbb, 0x09cd2678, 0xf46e5918, 0x01ec9ab7, 0xa8834f9a, 0x65e6956e, 0x7eaaffe6, 0x0821bccf, 0xe6ef15e8, 0xd9bae79b, 0xce4a6f36, 0xd4ea9f09, 0xd629b07c, 0xaf31a4b2, 0x312a3f23, 0x30c6a594, 0xc035a266, 0x37744ebc, 0xa6fc82ca, 0xb0e090d0, 0x1533a7d8, 0x4af10498, 0xf741ecda, 0x0e7fcd50, 0x2f1791f6, 0x8d764dd6, 0x4d43efb0, 0x54ccaa4d, 0xdfe49604, 0xe39ed1b5, 0x1b4c6a88, 0xb8c12c1f, 0x7f466551, 0x049d5eea, 0x5d018c35, 0x73fa8774, 0x2efb0b41, 0x5ab3671d, 0x5292dbd2, 0x33e91056, 0x136dd647, 0x8c9ad761, 0x7a37a10c, 0x8e59f814, 0x89eb133c, 0xeecea927, 0x35b761c9, 0xede11ce5, 0x3c7a47b1, 0x599cd2df, 0x3f55f273, 0x791814ce, 0xbf73c737, 0xea53f7cd, 0x5b5ffdaa, 0x14df3d6f, 0x867844db, 0x81caaff3, 0x3eb968c4, 0x2c382434, 0x5fc2a340, 0x72161dc3, 0x0cbce225, 0x8b283c49, 0x41ff0d95, 0x7139a801, 0xde080cb3, 0x9cd8b4e4, 0x906456c1, 0x617bcb84, 0x70d532b6, 0x74486c5c, 0x42d0b857];\nconst T7 = [0xa75051f4, 0x65537e41, 0xa4c31a17, 0x5e963a27, 0x6bcb3bab, 0x45f11f9d, 0x58abacfa, 0x03934be3, 0xfa552030, 0x6df6ad76, 0x769188cc, 0x4c25f502, 0xd7fc4fe5, 0xcbd7c52a, 0x44802635, 0xa38fb562, 0x5a49deb1, 0x1b6725ba, 0x0e9845ea, 0xc0e15dfe, 0x7502c32f, 0xf012814c, 0x97a38d46, 0xf9c66bd3, 0x5fe7038f, 0x9c951592, 0x7aebbf6d, 0x59da9552, 0x832dd4be, 0x21d35874, 0x692949e0, 0xc8448ec9, 0x896a75c2, 0x7978f48e, 0x3e6b9958, 0x71dd27b9, 0x4fb6bee1, 0xad17f088, 0xac66c920, 0x3ab47dce, 0x4a1863df, 0x3182e51a, 0x33609751, 0x7f456253, 0x77e0b164, 0xae84bb6b, 0xa01cfe81, 0x2b94f908, 0x68587048, 0xfd198f45, 0x6c8794de, 0xf8b7527b, 0xd323ab73, 0x02e2724b, 0x8f57e31f, 0xab2a6655, 0x2807b2eb, 0xc2032fb5, 0x7b9a86c5, 0x08a5d337, 0x87f23028, 0xa5b223bf, 0x6aba0203, 0x825ced16, 0x1c2b8acf, 0xb492a779, 0xf2f0f307, 0xe2a14e69, 0xf4cd65da, 0xbed50605, 0x621fd134, 0xfe8ac4a6, 0x539d342e, 0x55a0a2f3, 0xe132058a, 0xeb75a4f6, 0xec390b83, 0xefaa4060, 0x9f065e71, 0x1051bd6e, 0x8af93e21, 0x063d96dd, 0x05aedd3e, 0xbd464de6, 0x8db59154, 0x5d0571c4, 0xd46f0406, 0x15ff6050, 0xfb241998, 0xe997d6bd, 0x43cc8940, 0x9e7767d9, 0x42bdb0e8, 0x8b880789, 0x5b38e719, 0xeedb79c8, 0x0a47a17c, 0x0fe97c42, 0x1ec9f884, 0x00000000, 0x86830980, 0xed48322b, 0x70ac1e11, 0x724e6c5a, 0xfffbfd0e, 0x38560f85, 0xd51e3dae, 0x3927362d, 0xd9640a0f, 0xa621685c, 0x54d19b5b, 0x2e3a2436, 0x67b10c0a, 0xe70f9357, 0x96d2b4ee, 0x919e1b9b, 0xc54f80c0, 0x20a261dc, 0x4b695a77, 0x1a161c12, 0xba0ae293, 0x2ae5c0a0, 0xe0433c22, 0x171d121b, 0x0d0b0e09, 0xc7adf28b, 0xa8b92db6, 0xa9c8141e, 0x198557f1, 0x074caf75, 0xddbbee99, 0x60fda37f, 0x269ff701, 0xf5bc5c72, 0x3bc54466, 0x7e345bfb, 0x29768b43, 0xc6dccb23, 0xfc68b6ed, 0xf163b8e4, 0xdccad731, 0x85104263, 0x22401397, 0x112084c6, 0x247d854a, 0x3df8d2bb, 0x3211aef9, 0xa16dc729, 0x2f4b1d9e, 0x30f3dcb2, 0x52ec0d86, 0xe3d077c1, 0x166c2bb3, 0xb999a970, 0x48fa1194, 0x642247e9, 0x8cc4a8fc, 0x3f1aa0f0, 0x2cd8567d, 0x90ef2233, 0x4ec78749, 0xd1c1d938, 0xa2fe8cca, 0x0b3698d4, 0x81cfa6f5, 0xde28a57a, 0x8e26dab7, 0xbfa43fad, 0x9de42c3a, 0x920d5078, 0xcc9b6a5f, 0x4662547e, 0x13c2f68d, 0xb8e890d8, 0xf75e2e39, 0xaff582c3, 0x80be9f5d, 0x937c69d0, 0x2da96fd5, 0x12b3cf25, 0x993bc8ac, 0x7da71018, 0x636ee89c, 0xbb7bdb3b, 0x7809cd26, 0x18f46e59, 0xb701ec9a, 0x9aa8834f, 0x6e65e695, 0xe67eaaff, 0xcf0821bc, 0xe8e6ef15, 0x9bd9bae7, 0x36ce4a6f, 0x09d4ea9f, 0x7cd629b0, 0xb2af31a4, 0x23312a3f, 0x9430c6a5, 0x66c035a2, 0xbc37744e, 0xcaa6fc82, 0xd0b0e090, 0xd81533a7, 0x984af104, 0xdaf741ec, 0x500e7fcd, 0xf62f1791, 0xd68d764d, 0xb04d43ef, 0x4d54ccaa, 0x04dfe496, 0xb5e39ed1, 0x881b4c6a, 0x1fb8c12c, 0x517f4665, 0xea049d5e, 0x355d018c, 0x7473fa87, 0x412efb0b, 0x1d5ab367, 0xd25292db, 0x5633e910, 0x47136dd6, 0x618c9ad7, 0x0c7a37a1, 0x148e59f8, 0x3c89eb13, 0x27eecea9, 0xc935b761, 0xe5ede11c, 0xb13c7a47, 0xdf599cd2, 0x733f55f2, 0xce791814, 0x37bf73c7, 0xcdea53f7, 0xaa5b5ffd, 0x6f14df3d, 0xdb867844, 0xf381caaf, 0xc43eb968, 0x342c3824, 0x405fc2a3, 0xc372161d, 0x250cbce2, 0x498b283c, 0x9541ff0d, 0x017139a8, 0xb3de080c, 0xe49cd8b4, 0xc1906456, 0x84617bcb, 0xb670d532, 0x5c74486c, 0x5742d0b8];\nconst T8 = [0xf4a75051, 0x4165537e, 0x17a4c31a, 0x275e963a, 0xab6bcb3b, 0x9d45f11f, 0xfa58abac, 0xe303934b, 0x30fa5520, 0x766df6ad, 0xcc769188, 0x024c25f5, 0xe5d7fc4f, 0x2acbd7c5, 0x35448026, 0x62a38fb5, 0xb15a49de, 0xba1b6725, 0xea0e9845, 0xfec0e15d, 0x2f7502c3, 0x4cf01281, 0x4697a38d, 0xd3f9c66b, 0x8f5fe703, 0x929c9515, 0x6d7aebbf, 0x5259da95, 0xbe832dd4, 0x7421d358, 0xe0692949, 0xc9c8448e, 0xc2896a75, 0x8e7978f4, 0x583e6b99, 0xb971dd27, 0xe14fb6be, 0x88ad17f0, 0x20ac66c9, 0xce3ab47d, 0xdf4a1863, 0x1a3182e5, 0x51336097, 0x537f4562, 0x6477e0b1, 0x6bae84bb, 0x81a01cfe, 0x082b94f9, 0x48685870, 0x45fd198f, 0xde6c8794, 0x7bf8b752, 0x73d323ab, 0x4b02e272, 0x1f8f57e3, 0x55ab2a66, 0xeb2807b2, 0xb5c2032f, 0xc57b9a86, 0x3708a5d3, 0x2887f230, 0xbfa5b223, 0x036aba02, 0x16825ced, 0xcf1c2b8a, 0x79b492a7, 0x07f2f0f3, 0x69e2a14e, 0xdaf4cd65, 0x05bed506, 0x34621fd1, 0xa6fe8ac4, 0x2e539d34, 0xf355a0a2, 0x8ae13205, 0xf6eb75a4, 0x83ec390b, 0x60efaa40, 0x719f065e, 0x6e1051bd, 0x218af93e, 0xdd063d96, 0x3e05aedd, 0xe6bd464d, 0x548db591, 0xc45d0571, 0x06d46f04, 0x5015ff60, 0x98fb2419, 0xbde997d6, 0x4043cc89, 0xd99e7767, 0xe842bdb0, 0x898b8807, 0x195b38e7, 0xc8eedb79, 0x7c0a47a1, 0x420fe97c, 0x841ec9f8, 0x00000000, 0x80868309, 0x2bed4832, 0x1170ac1e, 0x5a724e6c, 0x0efffbfd, 0x8538560f, 0xaed51e3d, 0x2d392736, 0x0fd9640a, 0x5ca62168, 0x5b54d19b, 0x362e3a24, 0x0a67b10c, 0x57e70f93, 0xee96d2b4, 0x9b919e1b, 0xc0c54f80, 0xdc20a261, 0x774b695a, 0x121a161c, 0x93ba0ae2, 0xa02ae5c0, 0x22e0433c, 0x1b171d12, 0x090d0b0e, 0x8bc7adf2, 0xb6a8b92d, 0x1ea9c814, 0xf1198557, 0x75074caf, 0x99ddbbee, 0x7f60fda3, 0x01269ff7, 0x72f5bc5c, 0x663bc544, 0xfb7e345b, 0x4329768b, 0x23c6dccb, 0xedfc68b6, 0xe4f163b8, 0x31dccad7, 0x63851042, 0x97224013, 0xc6112084, 0x4a247d85, 0xbb3df8d2, 0xf93211ae, 0x29a16dc7, 0x9e2f4b1d, 0xb230f3dc, 0x8652ec0d, 0xc1e3d077, 0xb3166c2b, 0x70b999a9, 0x9448fa11, 0xe9642247, 0xfc8cc4a8, 0xf03f1aa0, 0x7d2cd856, 0x3390ef22, 0x494ec787, 0x38d1c1d9, 0xcaa2fe8c, 0xd40b3698, 0xf581cfa6, 0x7ade28a5, 0xb78e26da, 0xadbfa43f, 0x3a9de42c, 0x78920d50, 0x5fcc9b6a, 0x7e466254, 0x8d13c2f6, 0xd8b8e890, 0x39f75e2e, 0xc3aff582, 0x5d80be9f, 0xd0937c69, 0xd52da96f, 0x2512b3cf, 0xac993bc8, 0x187da710, 0x9c636ee8, 0x3bbb7bdb, 0x267809cd, 0x5918f46e, 0x9ab701ec, 0x4f9aa883, 0x956e65e6, 0xffe67eaa, 0xbccf0821, 0x15e8e6ef, 0xe79bd9ba, 0x6f36ce4a, 0x9f09d4ea, 0xb07cd629, 0xa4b2af31, 0x3f23312a, 0xa59430c6, 0xa266c035, 0x4ebc3774, 0x82caa6fc, 0x90d0b0e0, 0xa7d81533, 0x04984af1, 0xecdaf741, 0xcd500e7f, 0x91f62f17, 0x4dd68d76, 0xefb04d43, 0xaa4d54cc, 0x9604dfe4, 0xd1b5e39e, 0x6a881b4c, 0x2c1fb8c1, 0x65517f46, 0x5eea049d, 0x8c355d01, 0x877473fa, 0x0b412efb, 0x671d5ab3, 0xdbd25292, 0x105633e9, 0xd647136d, 0xd7618c9a, 0xa10c7a37, 0xf8148e59, 0x133c89eb, 0xa927eece, 0x61c935b7, 0x1ce5ede1, 0x47b13c7a, 0xd2df599c, 0xf2733f55, 0x14ce7918, 0xc737bf73, 0xf7cdea53, 0xfdaa5b5f, 0x3d6f14df, 0x44db8678, 0xaff381ca, 0x68c43eb9, 0x24342c38, 0xa3405fc2, 0x1dc37216, 0xe2250cbc, 0x3c498b28, 0x0d9541ff, 0xa8017139, 0x0cb3de08, 0xb4e49cd8, 0x56c19064, 0xcb84617b, 0x32b670d5, 0x6c5c7448, 0xb85742d0];\n// Transformations for decryption key expansion\nconst U1 = [0x00000000, 0x0e090d0b, 0x1c121a16, 0x121b171d, 0x3824342c, 0x362d3927, 0x24362e3a, 0x2a3f2331, 0x70486858, 0x7e416553, 0x6c5a724e, 0x62537f45, 0x486c5c74, 0x4665517f, 0x547e4662, 0x5a774b69, 0xe090d0b0, 0xee99ddbb, 0xfc82caa6, 0xf28bc7ad, 0xd8b4e49c, 0xd6bde997, 0xc4a6fe8a, 0xcaaff381, 0x90d8b8e8, 0x9ed1b5e3, 0x8ccaa2fe, 0x82c3aff5, 0xa8fc8cc4, 0xa6f581cf, 0xb4ee96d2, 0xbae79bd9, 0xdb3bbb7b, 0xd532b670, 0xc729a16d, 0xc920ac66, 0xe31f8f57, 0xed16825c, 0xff0d9541, 0xf104984a, 0xab73d323, 0xa57ade28, 0xb761c935, 0xb968c43e, 0x9357e70f, 0x9d5eea04, 0x8f45fd19, 0x814cf012, 0x3bab6bcb, 0x35a266c0, 0x27b971dd, 0x29b07cd6, 0x038f5fe7, 0x0d8652ec, 0x1f9d45f1, 0x119448fa, 0x4be30393, 0x45ea0e98, 0x57f11985, 0x59f8148e, 0x73c737bf, 0x7dce3ab4, 0x6fd52da9, 0x61dc20a2, 0xad766df6, 0xa37f60fd, 0xb16477e0, 0xbf6d7aeb, 0x955259da, 0x9b5b54d1, 0x894043cc, 0x87494ec7, 0xdd3e05ae, 0xd33708a5, 0xc12c1fb8, 0xcf2512b3, 0xe51a3182, 0xeb133c89, 0xf9082b94, 0xf701269f, 0x4de6bd46, 0x43efb04d, 0x51f4a750, 0x5ffdaa5b, 0x75c2896a, 0x7bcb8461, 0x69d0937c, 0x67d99e77, 0x3daed51e, 0x33a7d815, 0x21bccf08, 0x2fb5c203, 0x058ae132, 0x0b83ec39, 0x1998fb24, 0x1791f62f, 0x764dd68d, 0x7844db86, 0x6a5fcc9b, 0x6456c190, 0x4e69e2a1, 0x4060efaa, 0x527bf8b7, 0x5c72f5bc, 0x0605bed5, 0x080cb3de, 0x1a17a4c3, 0x141ea9c8, 0x3e218af9, 0x302887f2, 0x223390ef, 0x2c3a9de4, 0x96dd063d, 0x98d40b36, 0x8acf1c2b, 0x84c61120, 0xaef93211, 0xa0f03f1a, 0xb2eb2807, 0xbce2250c, 0xe6956e65, 0xe89c636e, 0xfa877473, 0xf48e7978, 0xdeb15a49, 0xd0b85742, 0xc2a3405f, 0xccaa4d54, 0x41ecdaf7, 0x4fe5d7fc, 0x5dfec0e1, 0x53f7cdea, 0x79c8eedb, 0x77c1e3d0, 0x65daf4cd, 0x6bd3f9c6, 0x31a4b2af, 0x3fadbfa4, 0x2db6a8b9, 0x23bfa5b2, 0x09808683, 0x07898b88, 0x15929c95, 0x1b9b919e, 0xa17c0a47, 0xaf75074c, 0xbd6e1051, 0xb3671d5a, 0x99583e6b, 0x97513360, 0x854a247d, 0x8b432976, 0xd134621f, 0xdf3d6f14, 0xcd267809, 0xc32f7502, 0xe9105633, 0xe7195b38, 0xf5024c25, 0xfb0b412e, 0x9ad7618c, 0x94de6c87, 0x86c57b9a, 0x88cc7691, 0xa2f355a0, 0xacfa58ab, 0xbee14fb6, 0xb0e842bd, 0xea9f09d4, 0xe49604df, 0xf68d13c2, 0xf8841ec9, 0xd2bb3df8, 0xdcb230f3, 0xcea927ee, 0xc0a02ae5, 0x7a47b13c, 0x744ebc37, 0x6655ab2a, 0x685ca621, 0x42638510, 0x4c6a881b, 0x5e719f06, 0x5078920d, 0x0a0fd964, 0x0406d46f, 0x161dc372, 0x1814ce79, 0x322bed48, 0x3c22e043, 0x2e39f75e, 0x2030fa55, 0xec9ab701, 0xe293ba0a, 0xf088ad17, 0xfe81a01c, 0xd4be832d, 0xdab78e26, 0xc8ac993b, 0xc6a59430, 0x9cd2df59, 0x92dbd252, 0x80c0c54f, 0x8ec9c844, 0xa4f6eb75, 0xaaffe67e, 0xb8e4f163, 0xb6edfc68, 0x0c0a67b1, 0x02036aba, 0x10187da7, 0x1e1170ac, 0x342e539d, 0x3a275e96, 0x283c498b, 0x26354480, 0x7c420fe9, 0x724b02e2, 0x605015ff, 0x6e5918f4, 0x44663bc5, 0x4a6f36ce, 0x587421d3, 0x567d2cd8, 0x37a10c7a, 0x39a80171, 0x2bb3166c, 0x25ba1b67, 0x0f853856, 0x018c355d, 0x13972240, 0x1d9e2f4b, 0x47e96422, 0x49e06929, 0x5bfb7e34, 0x55f2733f, 0x7fcd500e, 0x71c45d05, 0x63df4a18, 0x6dd64713, 0xd731dcca, 0xd938d1c1, 0xcb23c6dc, 0xc52acbd7, 0xef15e8e6, 0xe11ce5ed, 0xf307f2f0, 0xfd0efffb, 0xa779b492, 0xa970b999, 0xbb6bae84, 0xb562a38f, 0x9f5d80be, 0x91548db5, 0x834f9aa8, 0x8d4697a3];\nconst U2 = [0x00000000, 0x0b0e090d, 0x161c121a, 0x1d121b17, 0x2c382434, 0x27362d39, 0x3a24362e, 0x312a3f23, 0x58704868, 0x537e4165, 0x4e6c5a72, 0x4562537f, 0x74486c5c, 0x7f466551, 0x62547e46, 0x695a774b, 0xb0e090d0, 0xbbee99dd, 0xa6fc82ca, 0xadf28bc7, 0x9cd8b4e4, 0x97d6bde9, 0x8ac4a6fe, 0x81caaff3, 0xe890d8b8, 0xe39ed1b5, 0xfe8ccaa2, 0xf582c3af, 0xc4a8fc8c, 0xcfa6f581, 0xd2b4ee96, 0xd9bae79b, 0x7bdb3bbb, 0x70d532b6, 0x6dc729a1, 0x66c920ac, 0x57e31f8f, 0x5ced1682, 0x41ff0d95, 0x4af10498, 0x23ab73d3, 0x28a57ade, 0x35b761c9, 0x3eb968c4, 0x0f9357e7, 0x049d5eea, 0x198f45fd, 0x12814cf0, 0xcb3bab6b, 0xc035a266, 0xdd27b971, 0xd629b07c, 0xe7038f5f, 0xec0d8652, 0xf11f9d45, 0xfa119448, 0x934be303, 0x9845ea0e, 0x8557f119, 0x8e59f814, 0xbf73c737, 0xb47dce3a, 0xa96fd52d, 0xa261dc20, 0xf6ad766d, 0xfda37f60, 0xe0b16477, 0xebbf6d7a, 0xda955259, 0xd19b5b54, 0xcc894043, 0xc787494e, 0xaedd3e05, 0xa5d33708, 0xb8c12c1f, 0xb3cf2512, 0x82e51a31, 0x89eb133c, 0x94f9082b, 0x9ff70126, 0x464de6bd, 0x4d43efb0, 0x5051f4a7, 0x5b5ffdaa, 0x6a75c289, 0x617bcb84, 0x7c69d093, 0x7767d99e, 0x1e3daed5, 0x1533a7d8, 0x0821bccf, 0x032fb5c2, 0x32058ae1, 0x390b83ec, 0x241998fb, 0x2f1791f6, 0x8d764dd6, 0x867844db, 0x9b6a5fcc, 0x906456c1, 0xa14e69e2, 0xaa4060ef, 0xb7527bf8, 0xbc5c72f5, 0xd50605be, 0xde080cb3, 0xc31a17a4, 0xc8141ea9, 0xf93e218a, 0xf2302887, 0xef223390, 0xe42c3a9d, 0x3d96dd06, 0x3698d40b, 0x2b8acf1c, 0x2084c611, 0x11aef932, 0x1aa0f03f, 0x07b2eb28, 0x0cbce225, 0x65e6956e, 0x6ee89c63, 0x73fa8774, 0x78f48e79, 0x49deb15a, 0x42d0b857, 0x5fc2a340, 0x54ccaa4d, 0xf741ecda, 0xfc4fe5d7, 0xe15dfec0, 0xea53f7cd, 0xdb79c8ee, 0xd077c1e3, 0xcd65daf4, 0xc66bd3f9, 0xaf31a4b2, 0xa43fadbf, 0xb92db6a8, 0xb223bfa5, 0x83098086, 0x8807898b, 0x9515929c, 0x9e1b9b91, 0x47a17c0a, 0x4caf7507, 0x51bd6e10, 0x5ab3671d, 0x6b99583e, 0x60975133, 0x7d854a24, 0x768b4329, 0x1fd13462, 0x14df3d6f, 0x09cd2678, 0x02c32f75, 0x33e91056, 0x38e7195b, 0x25f5024c, 0x2efb0b41, 0x8c9ad761, 0x8794de6c, 0x9a86c57b, 0x9188cc76, 0xa0a2f355, 0xabacfa58, 0xb6bee14f, 0xbdb0e842, 0xd4ea9f09, 0xdfe49604, 0xc2f68d13, 0xc9f8841e, 0xf8d2bb3d, 0xf3dcb230, 0xeecea927, 0xe5c0a02a, 0x3c7a47b1, 0x37744ebc, 0x2a6655ab, 0x21685ca6, 0x10426385, 0x1b4c6a88, 0x065e719f, 0x0d507892, 0x640a0fd9, 0x6f0406d4, 0x72161dc3, 0x791814ce, 0x48322bed, 0x433c22e0, 0x5e2e39f7, 0x552030fa, 0x01ec9ab7, 0x0ae293ba, 0x17f088ad, 0x1cfe81a0, 0x2dd4be83, 0x26dab78e, 0x3bc8ac99, 0x30c6a594, 0x599cd2df, 0x5292dbd2, 0x4f80c0c5, 0x448ec9c8, 0x75a4f6eb, 0x7eaaffe6, 0x63b8e4f1, 0x68b6edfc, 0xb10c0a67, 0xba02036a, 0xa710187d, 0xac1e1170, 0x9d342e53, 0x963a275e, 0x8b283c49, 0x80263544, 0xe97c420f, 0xe2724b02, 0xff605015, 0xf46e5918, 0xc544663b, 0xce4a6f36, 0xd3587421, 0xd8567d2c, 0x7a37a10c, 0x7139a801, 0x6c2bb316, 0x6725ba1b, 0x560f8538, 0x5d018c35, 0x40139722, 0x4b1d9e2f, 0x2247e964, 0x2949e069, 0x345bfb7e, 0x3f55f273, 0x0e7fcd50, 0x0571c45d, 0x1863df4a, 0x136dd647, 0xcad731dc, 0xc1d938d1, 0xdccb23c6, 0xd7c52acb, 0xe6ef15e8, 0xede11ce5, 0xf0f307f2, 0xfbfd0eff, 0x92a779b4, 0x99a970b9, 0x84bb6bae, 0x8fb562a3, 0xbe9f5d80, 0xb591548d, 0xa8834f9a, 0xa38d4697];\nconst U3 = [0x00000000, 0x0d0b0e09, 0x1a161c12, 0x171d121b, 0x342c3824, 0x3927362d, 0x2e3a2436, 0x23312a3f, 0x68587048, 0x65537e41, 0x724e6c5a, 0x7f456253, 0x5c74486c, 0x517f4665, 0x4662547e, 0x4b695a77, 0xd0b0e090, 0xddbbee99, 0xcaa6fc82, 0xc7adf28b, 0xe49cd8b4, 0xe997d6bd, 0xfe8ac4a6, 0xf381caaf, 0xb8e890d8, 0xb5e39ed1, 0xa2fe8cca, 0xaff582c3, 0x8cc4a8fc, 0x81cfa6f5, 0x96d2b4ee, 0x9bd9bae7, 0xbb7bdb3b, 0xb670d532, 0xa16dc729, 0xac66c920, 0x8f57e31f, 0x825ced16, 0x9541ff0d, 0x984af104, 0xd323ab73, 0xde28a57a, 0xc935b761, 0xc43eb968, 0xe70f9357, 0xea049d5e, 0xfd198f45, 0xf012814c, 0x6bcb3bab, 0x66c035a2, 0x71dd27b9, 0x7cd629b0, 0x5fe7038f, 0x52ec0d86, 0x45f11f9d, 0x48fa1194, 0x03934be3, 0x0e9845ea, 0x198557f1, 0x148e59f8, 0x37bf73c7, 0x3ab47dce, 0x2da96fd5, 0x20a261dc, 0x6df6ad76, 0x60fda37f, 0x77e0b164, 0x7aebbf6d, 0x59da9552, 0x54d19b5b, 0x43cc8940, 0x4ec78749, 0x05aedd3e, 0x08a5d337, 0x1fb8c12c, 0x12b3cf25, 0x3182e51a, 0x3c89eb13, 0x2b94f908, 0x269ff701, 0xbd464de6, 0xb04d43ef, 0xa75051f4, 0xaa5b5ffd, 0x896a75c2, 0x84617bcb, 0x937c69d0, 0x9e7767d9, 0xd51e3dae, 0xd81533a7, 0xcf0821bc, 0xc2032fb5, 0xe132058a, 0xec390b83, 0xfb241998, 0xf62f1791, 0xd68d764d, 0xdb867844, 0xcc9b6a5f, 0xc1906456, 0xe2a14e69, 0xefaa4060, 0xf8b7527b, 0xf5bc5c72, 0xbed50605, 0xb3de080c, 0xa4c31a17, 0xa9c8141e, 0x8af93e21, 0x87f23028, 0x90ef2233, 0x9de42c3a, 0x063d96dd, 0x0b3698d4, 0x1c2b8acf, 0x112084c6, 0x3211aef9, 0x3f1aa0f0, 0x2807b2eb, 0x250cbce2, 0x6e65e695, 0x636ee89c, 0x7473fa87, 0x7978f48e, 0x5a49deb1, 0x5742d0b8, 0x405fc2a3, 0x4d54ccaa, 0xdaf741ec, 0xd7fc4fe5, 0xc0e15dfe, 0xcdea53f7, 0xeedb79c8, 0xe3d077c1, 0xf4cd65da, 0xf9c66bd3, 0xb2af31a4, 0xbfa43fad, 0xa8b92db6, 0xa5b223bf, 0x86830980, 0x8b880789, 0x9c951592, 0x919e1b9b, 0x0a47a17c, 0x074caf75, 0x1051bd6e, 0x1d5ab367, 0x3e6b9958, 0x33609751, 0x247d854a, 0x29768b43, 0x621fd134, 0x6f14df3d, 0x7809cd26, 0x7502c32f, 0x5633e910, 0x5b38e719, 0x4c25f502, 0x412efb0b, 0x618c9ad7, 0x6c8794de, 0x7b9a86c5, 0x769188cc, 0x55a0a2f3, 0x58abacfa, 0x4fb6bee1, 0x42bdb0e8, 0x09d4ea9f, 0x04dfe496, 0x13c2f68d, 0x1ec9f884, 0x3df8d2bb, 0x30f3dcb2, 0x27eecea9, 0x2ae5c0a0, 0xb13c7a47, 0xbc37744e, 0xab2a6655, 0xa621685c, 0x85104263, 0x881b4c6a, 0x9f065e71, 0x920d5078, 0xd9640a0f, 0xd46f0406, 0xc372161d, 0xce791814, 0xed48322b, 0xe0433c22, 0xf75e2e39, 0xfa552030, 0xb701ec9a, 0xba0ae293, 0xad17f088, 0xa01cfe81, 0x832dd4be, 0x8e26dab7, 0x993bc8ac, 0x9430c6a5, 0xdf599cd2, 0xd25292db, 0xc54f80c0, 0xc8448ec9, 0xeb75a4f6, 0xe67eaaff, 0xf163b8e4, 0xfc68b6ed, 0x67b10c0a, 0x6aba0203, 0x7da71018, 0x70ac1e11, 0x539d342e, 0x5e963a27, 0x498b283c, 0x44802635, 0x0fe97c42, 0x02e2724b, 0x15ff6050, 0x18f46e59, 0x3bc54466, 0x36ce4a6f, 0x21d35874, 0x2cd8567d, 0x0c7a37a1, 0x017139a8, 0x166c2bb3, 0x1b6725ba, 0x38560f85, 0x355d018c, 0x22401397, 0x2f4b1d9e, 0x642247e9, 0x692949e0, 0x7e345bfb, 0x733f55f2, 0x500e7fcd, 0x5d0571c4, 0x4a1863df, 0x47136dd6, 0xdccad731, 0xd1c1d938, 0xc6dccb23, 0xcbd7c52a, 0xe8e6ef15, 0xe5ede11c, 0xf2f0f307, 0xfffbfd0e, 0xb492a779, 0xb999a970, 0xae84bb6b, 0xa38fb562, 0x80be9f5d, 0x8db59154, 0x9aa8834f, 0x97a38d46];\nconst U4 = [0x00000000, 0x090d0b0e, 0x121a161c, 0x1b171d12, 0x24342c38, 0x2d392736, 0x362e3a24, 0x3f23312a, 0x48685870, 0x4165537e, 0x5a724e6c, 0x537f4562, 0x6c5c7448, 0x65517f46, 0x7e466254, 0x774b695a, 0x90d0b0e0, 0x99ddbbee, 0x82caa6fc, 0x8bc7adf2, 0xb4e49cd8, 0xbde997d6, 0xa6fe8ac4, 0xaff381ca, 0xd8b8e890, 0xd1b5e39e, 0xcaa2fe8c, 0xc3aff582, 0xfc8cc4a8, 0xf581cfa6, 0xee96d2b4, 0xe79bd9ba, 0x3bbb7bdb, 0x32b670d5, 0x29a16dc7, 0x20ac66c9, 0x1f8f57e3, 0x16825ced, 0x0d9541ff, 0x04984af1, 0x73d323ab, 0x7ade28a5, 0x61c935b7, 0x68c43eb9, 0x57e70f93, 0x5eea049d, 0x45fd198f, 0x4cf01281, 0xab6bcb3b, 0xa266c035, 0xb971dd27, 0xb07cd629, 0x8f5fe703, 0x8652ec0d, 0x9d45f11f, 0x9448fa11, 0xe303934b, 0xea0e9845, 0xf1198557, 0xf8148e59, 0xc737bf73, 0xce3ab47d, 0xd52da96f, 0xdc20a261, 0x766df6ad, 0x7f60fda3, 0x6477e0b1, 0x6d7aebbf, 0x5259da95, 0x5b54d19b, 0x4043cc89, 0x494ec787, 0x3e05aedd, 0x3708a5d3, 0x2c1fb8c1, 0x2512b3cf, 0x1a3182e5, 0x133c89eb, 0x082b94f9, 0x01269ff7, 0xe6bd464d, 0xefb04d43, 0xf4a75051, 0xfdaa5b5f, 0xc2896a75, 0xcb84617b, 0xd0937c69, 0xd99e7767, 0xaed51e3d, 0xa7d81533, 0xbccf0821, 0xb5c2032f, 0x8ae13205, 0x83ec390b, 0x98fb2419, 0x91f62f17, 0x4dd68d76, 0x44db8678, 0x5fcc9b6a, 0x56c19064, 0x69e2a14e, 0x60efaa40, 0x7bf8b752, 0x72f5bc5c, 0x05bed506, 0x0cb3de08, 0x17a4c31a, 0x1ea9c814, 0x218af93e, 0x2887f230, 0x3390ef22, 0x3a9de42c, 0xdd063d96, 0xd40b3698, 0xcf1c2b8a, 0xc6112084, 0xf93211ae, 0xf03f1aa0, 0xeb2807b2, 0xe2250cbc, 0x956e65e6, 0x9c636ee8, 0x877473fa, 0x8e7978f4, 0xb15a49de, 0xb85742d0, 0xa3405fc2, 0xaa4d54cc, 0xecdaf741, 0xe5d7fc4f, 0xfec0e15d, 0xf7cdea53, 0xc8eedb79, 0xc1e3d077, 0xdaf4cd65, 0xd3f9c66b, 0xa4b2af31, 0xadbfa43f, 0xb6a8b92d, 0xbfa5b223, 0x80868309, 0x898b8807, 0x929c9515, 0x9b919e1b, 0x7c0a47a1, 0x75074caf, 0x6e1051bd, 0x671d5ab3, 0x583e6b99, 0x51336097, 0x4a247d85, 0x4329768b, 0x34621fd1, 0x3d6f14df, 0x267809cd, 0x2f7502c3, 0x105633e9, 0x195b38e7, 0x024c25f5, 0x0b412efb, 0xd7618c9a, 0xde6c8794, 0xc57b9a86, 0xcc769188, 0xf355a0a2, 0xfa58abac, 0xe14fb6be, 0xe842bdb0, 0x9f09d4ea, 0x9604dfe4, 0x8d13c2f6, 0x841ec9f8, 0xbb3df8d2, 0xb230f3dc, 0xa927eece, 0xa02ae5c0, 0x47b13c7a, 0x4ebc3774, 0x55ab2a66, 0x5ca62168, 0x63851042, 0x6a881b4c, 0x719f065e, 0x78920d50, 0x0fd9640a, 0x06d46f04, 0x1dc37216, 0x14ce7918, 0x2bed4832, 0x22e0433c, 0x39f75e2e, 0x30fa5520, 0x9ab701ec, 0x93ba0ae2, 0x88ad17f0, 0x81a01cfe, 0xbe832dd4, 0xb78e26da, 0xac993bc8, 0xa59430c6, 0xd2df599c, 0xdbd25292, 0xc0c54f80, 0xc9c8448e, 0xf6eb75a4, 0xffe67eaa, 0xe4f163b8, 0xedfc68b6, 0x0a67b10c, 0x036aba02, 0x187da710, 0x1170ac1e, 0x2e539d34, 0x275e963a, 0x3c498b28, 0x35448026, 0x420fe97c, 0x4b02e272, 0x5015ff60, 0x5918f46e, 0x663bc544, 0x6f36ce4a, 0x7421d358, 0x7d2cd856, 0xa10c7a37, 0xa8017139, 0xb3166c2b, 0xba1b6725, 0x8538560f, 0x8c355d01, 0x97224013, 0x9e2f4b1d, 0xe9642247, 0xe0692949, 0xfb7e345b, 0xf2733f55, 0xcd500e7f, 0xc45d0571, 0xdf4a1863, 0xd647136d, 0x31dccad7, 0x38d1c1d9, 0x23c6dccb, 0x2acbd7c5, 0x15e8e6ef, 0x1ce5ede1, 0x07f2f0f3, 0x0efffbfd, 0x79b492a7, 0x70b999a9, 0x6bae84bb, 0x62a38fb5, 0x5d80be9f, 0x548db591, 0x4f9aa883, 0x4697a38d];\nfunction convertToInt32(bytes) {\n    const result = [];\n    for (let i = 0; i < bytes.length; i += 4) {\n        result.push((bytes[i] << 24) | (bytes[i + 1] << 16) | (bytes[i + 2] << 8) | bytes[i + 3]);\n    }\n    return result;\n}\nclass AES {\n    get key() { return __classPrivateFieldGet(this, _AES_key, \"f\").slice(); }\n    constructor(key) {\n        _AES_key.set(this, void 0);\n        _AES_Kd.set(this, void 0);\n        _AES_Ke.set(this, void 0);\n        if (!(this instanceof AES)) {\n            throw Error('AES must be instanitated with `new`');\n        }\n        __classPrivateFieldSet(this, _AES_key, new Uint8Array(key), \"f\");\n        const rounds = numberOfRounds[this.key.length];\n        if (rounds == null) {\n            throw new TypeError('invalid key size (must be 16, 24 or 32 bytes)');\n        }\n        // encryption round keys\n        __classPrivateFieldSet(this, _AES_Ke, [], \"f\");\n        // decryption round keys\n        __classPrivateFieldSet(this, _AES_Kd, [], \"f\");\n        for (let i = 0; i <= rounds; i++) {\n            __classPrivateFieldGet(this, _AES_Ke, \"f\").push([0, 0, 0, 0]);\n            __classPrivateFieldGet(this, _AES_Kd, \"f\").push([0, 0, 0, 0]);\n        }\n        const roundKeyCount = (rounds + 1) * 4;\n        const KC = this.key.length / 4;\n        // convert the key into ints\n        const tk = convertToInt32(this.key);\n        // copy values into round key arrays\n        let index;\n        for (let i = 0; i < KC; i++) {\n            index = i >> 2;\n            __classPrivateFieldGet(this, _AES_Ke, \"f\")[index][i % 4] = tk[i];\n            __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds - index][i % 4] = tk[i];\n        }\n        // key expansion (fips-197 section 5.2)\n        let rconpointer = 0;\n        let t = KC, tt;\n        while (t < roundKeyCount) {\n            tt = tk[KC - 1];\n            tk[0] ^= ((S[(tt >> 16) & 0xFF] << 24) ^\n                (S[(tt >> 8) & 0xFF] << 16) ^\n                (S[tt & 0xFF] << 8) ^\n                S[(tt >> 24) & 0xFF] ^\n                (rcon[rconpointer] << 24));\n            rconpointer += 1;\n            // key expansion (for non-256 bit)\n            if (KC != 8) {\n                for (let i = 1; i < KC; i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n                // key expansion for 256-bit keys is \"slightly different\" (fips-197)\n            }\n            else {\n                for (let i = 1; i < (KC / 2); i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n                tt = tk[(KC / 2) - 1];\n                tk[KC / 2] ^= (S[tt & 0xFF] ^\n                    (S[(tt >> 8) & 0xFF] << 8) ^\n                    (S[(tt >> 16) & 0xFF] << 16) ^\n                    (S[(tt >> 24) & 0xFF] << 24));\n                for (let i = (KC / 2) + 1; i < KC; i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n            }\n            // copy values into round key arrays\n            let i = 0, r, c;\n            while (i < KC && t < roundKeyCount) {\n                r = t >> 2;\n                c = t % 4;\n                __classPrivateFieldGet(this, _AES_Ke, \"f\")[r][c] = tk[i];\n                __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds - r][c] = tk[i++];\n                t++;\n            }\n        }\n        // inverse-cipher-ify the decryption round key (fips-197 section 5.3)\n        for (let r = 1; r < rounds; r++) {\n            for (let c = 0; c < 4; c++) {\n                tt = __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][c];\n                __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][c] = (U1[(tt >> 24) & 0xFF] ^\n                    U2[(tt >> 16) & 0xFF] ^\n                    U3[(tt >> 8) & 0xFF] ^\n                    U4[tt & 0xFF]);\n            }\n        }\n    }\n    encrypt(plaintext) {\n        if (plaintext.length != 16) {\n            throw new TypeError('invalid plaintext size (must be 16 bytes)');\n        }\n        const rounds = __classPrivateFieldGet(this, _AES_Ke, \"f\").length - 1;\n        const a = [0, 0, 0, 0];\n        // convert plaintext to (ints ^ key)\n        let t = convertToInt32(plaintext);\n        for (let i = 0; i < 4; i++) {\n            t[i] ^= __classPrivateFieldGet(this, _AES_Ke, \"f\")[0][i];\n        }\n        // apply round transforms\n        for (let r = 1; r < rounds; r++) {\n            for (let i = 0; i < 4; i++) {\n                a[i] = (T1[(t[i] >> 24) & 0xff] ^\n                    T2[(t[(i + 1) % 4] >> 16) & 0xff] ^\n                    T3[(t[(i + 2) % 4] >> 8) & 0xff] ^\n                    T4[t[(i + 3) % 4] & 0xff] ^\n                    __classPrivateFieldGet(this, _AES_Ke, \"f\")[r][i]);\n            }\n            t = a.slice();\n        }\n        // the last round is special\n        const result = new Uint8Array(16);\n        let tt = 0;\n        for (let i = 0; i < 4; i++) {\n            tt = __classPrivateFieldGet(this, _AES_Ke, \"f\")[rounds][i];\n            result[4 * i] = (S[(t[i] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;\n            result[4 * i + 1] = (S[(t[(i + 1) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;\n            result[4 * i + 2] = (S[(t[(i + 2) % 4] >> 8) & 0xff] ^ (tt >> 8)) & 0xff;\n            result[4 * i + 3] = (S[t[(i + 3) % 4] & 0xff] ^ tt) & 0xff;\n        }\n        return result;\n    }\n    decrypt(ciphertext) {\n        if (ciphertext.length != 16) {\n            throw new TypeError('invalid ciphertext size (must be 16 bytes)');\n        }\n        const rounds = __classPrivateFieldGet(this, _AES_Kd, \"f\").length - 1;\n        const a = [0, 0, 0, 0];\n        // convert plaintext to (ints ^ key)\n        let t = convertToInt32(ciphertext);\n        for (let i = 0; i < 4; i++) {\n            t[i] ^= __classPrivateFieldGet(this, _AES_Kd, \"f\")[0][i];\n        }\n        // apply round transforms\n        for (let r = 1; r < rounds; r++) {\n            for (let i = 0; i < 4; i++) {\n                a[i] = (T5[(t[i] >> 24) & 0xff] ^\n                    T6[(t[(i + 3) % 4] >> 16) & 0xff] ^\n                    T7[(t[(i + 2) % 4] >> 8) & 0xff] ^\n                    T8[t[(i + 1) % 4] & 0xff] ^\n                    __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][i]);\n            }\n            t = a.slice();\n        }\n        // the last round is special\n        const result = new Uint8Array(16);\n        let tt = 0;\n        for (let i = 0; i < 4; i++) {\n            tt = __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds][i];\n            result[4 * i] = (Si[(t[i] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;\n            result[4 * i + 1] = (Si[(t[(i + 3) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;\n            result[4 * i + 2] = (Si[(t[(i + 2) % 4] >> 8) & 0xff] ^ (tt >> 8)) & 0xff;\n            result[4 * i + 3] = (Si[t[(i + 1) % 4] & 0xff] ^ tt) & 0xff;\n        }\n        return result;\n    }\n}\nexports.AES = AES;\n_AES_key = new WeakMap(), _AES_Kd = new WeakMap(), _AES_Ke = new WeakMap();\n//# sourceMappingURL=aes.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pkcs7Strip = exports.pkcs7Pad = exports.OFB = exports.ECB = exports.CTR = exports.CFB = exports.CBC = exports.ModeOfOperation = exports.AES = void 0;\nvar aes_js_1 = require(\"./aes.js\");\nObject.defineProperty(exports, \"AES\", { enumerable: true, get: function () { return aes_js_1.AES; } });\nvar mode_js_1 = require(\"./mode.js\");\nObject.defineProperty(exports, \"ModeOfOperation\", { enumerable: true, get: function () { return mode_js_1.ModeOfOperation; } });\nvar mode_cbc_js_1 = require(\"./mode-cbc.js\");\nObject.defineProperty(exports, \"CBC\", { enumerable: true, get: function () { return mode_cbc_js_1.CBC; } });\nvar mode_cfb_js_1 = require(\"./mode-cfb.js\");\nObject.defineProperty(exports, \"CFB\", { enumerable: true, get: function () { return mode_cfb_js_1.CFB; } });\nvar mode_ctr_js_1 = require(\"./mode-ctr.js\");\nObject.defineProperty(exports, \"CTR\", { enumerable: true, get: function () { return mode_ctr_js_1.CTR; } });\nvar mode_ecb_js_1 = require(\"./mode-ecb.js\");\nObject.defineProperty(exports, \"ECB\", { enumerable: true, get: function () { return mode_ecb_js_1.ECB; } });\nvar mode_ofb_js_1 = require(\"./mode-ofb.js\");\nObject.defineProperty(exports, \"OFB\", { enumerable: true, get: function () { return mode_ofb_js_1.OFB; } });\nvar padding_js_1 = require(\"./padding.js\");\nObject.defineProperty(exports, \"pkcs7Pad\", { enumerable: true, get: function () { return padding_js_1.pkcs7Pad; } });\nObject.defineProperty(exports, \"pkcs7Strip\", { enumerable: true, get: function () { return padding_js_1.pkcs7Strip; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\n// Cipher Block Chaining\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 __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 _CBC_iv, _CBC_lastBlock;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CBC = void 0;\nconst mode_js_1 = require(\"./mode.js\");\nclass CBC extends mode_js_1.ModeOfOperation {\n    constructor(key, iv) {\n        super(\"ECC\", key, CBC);\n        _CBC_iv.set(this, void 0);\n        _CBC_lastBlock.set(this, void 0);\n        if (iv) {\n            if (iv.length % 16) {\n                throw new TypeError(\"invalid iv size (must be 16 bytes)\");\n            }\n            __classPrivateFieldSet(this, _CBC_iv, new Uint8Array(iv), \"f\");\n        }\n        else {\n            __classPrivateFieldSet(this, _CBC_iv, new Uint8Array(16), \"f\");\n        }\n        __classPrivateFieldSet(this, _CBC_lastBlock, this.iv, \"f\");\n    }\n    get iv() { return new Uint8Array(__classPrivateFieldGet(this, _CBC_iv, \"f\")); }\n    encrypt(plaintext) {\n        if (plaintext.length % 16) {\n            throw new TypeError(\"invalid plaintext size (must be multiple of 16 bytes)\");\n        }\n        const ciphertext = new Uint8Array(plaintext.length);\n        for (let i = 0; i < plaintext.length; i += 16) {\n            for (let j = 0; j < 16; j++) {\n                __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j] ^= plaintext[i + j];\n            }\n            __classPrivateFieldSet(this, _CBC_lastBlock, this.aes.encrypt(__classPrivateFieldGet(this, _CBC_lastBlock, \"f\")), \"f\");\n            ciphertext.set(__classPrivateFieldGet(this, _CBC_lastBlock, \"f\"), i);\n        }\n        return ciphertext;\n    }\n    decrypt(ciphertext) {\n        if (ciphertext.length % 16) {\n            throw new TypeError(\"invalid ciphertext size (must be multiple of 16 bytes)\");\n        }\n        const plaintext = new Uint8Array(ciphertext.length);\n        for (let i = 0; i < ciphertext.length; i += 16) {\n            const block = this.aes.decrypt(ciphertext.subarray(i, i + 16));\n            for (let j = 0; j < 16; j++) {\n                plaintext[i + j] = block[j] ^ __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j];\n                __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j] = ciphertext[i + j];\n            }\n        }\n        return plaintext;\n    }\n}\nexports.CBC = CBC;\n_CBC_iv = new WeakMap(), _CBC_lastBlock = new WeakMap();\n//# sourceMappingURL=mode-cbc.js.map","\"use strict\";\n// Cipher Feedback\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 __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 _CFB_instances, _CFB_iv, _CFB_shiftRegister, _CFB_shift;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CFB = void 0;\nconst mode_js_1 = require(\"./mode.js\");\nclass CFB extends mode_js_1.ModeOfOperation {\n    constructor(key, iv, segmentSize = 8) {\n        super(\"CFB\", key, CFB);\n        _CFB_instances.add(this);\n        _CFB_iv.set(this, void 0);\n        _CFB_shiftRegister.set(this, void 0);\n        // This library currently only handles byte-aligned segmentSize\n        if (!Number.isInteger(segmentSize) || (segmentSize % 8)) {\n            throw new TypeError(\"invalid segmentSize\");\n        }\n        Object.defineProperties(this, {\n            segmentSize: { enumerable: true, value: segmentSize }\n        });\n        if (iv) {\n            if (iv.length % 16) {\n                throw new TypeError(\"invalid iv size (must be 16 bytes)\");\n            }\n            __classPrivateFieldSet(this, _CFB_iv, new Uint8Array(iv), \"f\");\n        }\n        else {\n            __classPrivateFieldSet(this, _CFB_iv, new Uint8Array(16), \"f\");\n        }\n        __classPrivateFieldSet(this, _CFB_shiftRegister, this.iv, \"f\");\n    }\n    get iv() { return new Uint8Array(__classPrivateFieldGet(this, _CFB_iv, \"f\")); }\n    encrypt(plaintext) {\n        if (8 * plaintext.length % this.segmentSize) {\n            throw new TypeError(\"invalid plaintext size (must be multiple of segmentSize bytes)\");\n        }\n        const segmentSize = this.segmentSize / 8;\n        const ciphertext = new Uint8Array(plaintext);\n        for (let i = 0; i < ciphertext.length; i += segmentSize) {\n            const xorSegment = this.aes.encrypt(__classPrivateFieldGet(this, _CFB_shiftRegister, \"f\"));\n            for (let j = 0; j < segmentSize; j++) {\n                ciphertext[i + j] ^= xorSegment[j];\n            }\n            __classPrivateFieldGet(this, _CFB_instances, \"m\", _CFB_shift).call(this, ciphertext.subarray(i));\n        }\n        return ciphertext;\n    }\n    decrypt(ciphertext) {\n        if (8 * ciphertext.length % this.segmentSize) {\n            throw new TypeError(\"invalid ciphertext size (must be multiple of segmentSize bytes)\");\n        }\n        const segmentSize = this.segmentSize / 8;\n        const plaintext = new Uint8Array(ciphertext);\n        for (let i = 0; i < plaintext.length; i += segmentSize) {\n            const xorSegment = this.aes.encrypt(__classPrivateFieldGet(this, _CFB_shiftRegister, \"f\"));\n            for (let j = 0; j < segmentSize; j++) {\n                plaintext[i + j] ^= xorSegment[j];\n            }\n            __classPrivateFieldGet(this, _CFB_instances, \"m\", _CFB_shift).call(this, ciphertext.subarray(i));\n        }\n        return plaintext;\n    }\n}\nexports.CFB = CFB;\n_CFB_iv = new WeakMap(), _CFB_shiftRegister = new WeakMap(), _CFB_instances = new WeakSet(), _CFB_shift = function _CFB_shift(data) {\n    const segmentSize = this.segmentSize / 8;\n    // Shift the register\n    __classPrivateFieldGet(this, _CFB_shiftRegister, \"f\").set(__classPrivateFieldGet(this, _CFB_shiftRegister, \"f\").subarray(segmentSize));\n    __classPrivateFieldGet(this, _CFB_shiftRegister, \"f\").set(data.subarray(0, segmentSize), 16 - segmentSize);\n};\n//# sourceMappingURL=mode-cfb.js.map","\"use strict\";\n// Counter Mode\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 __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 _CTR_remaining, _CTR_remainingIndex, _CTR_counter;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CTR = void 0;\nconst mode_js_1 = require(\"./mode.js\");\nclass CTR extends mode_js_1.ModeOfOperation {\n    constructor(key, initialValue) {\n        super(\"CTR\", key, CTR);\n        // Remaining bytes for the one-time pad\n        _CTR_remaining.set(this, void 0);\n        _CTR_remainingIndex.set(this, void 0);\n        // The current counter\n        _CTR_counter.set(this, void 0);\n        __classPrivateFieldSet(this, _CTR_counter, new Uint8Array(16), \"f\");\n        __classPrivateFieldGet(this, _CTR_counter, \"f\").fill(0);\n        __classPrivateFieldSet(this, _CTR_remaining, __classPrivateFieldGet(this, _CTR_counter, \"f\"), \"f\"); // This will be discarded immediately\n        __classPrivateFieldSet(this, _CTR_remainingIndex, 16, \"f\");\n        if (initialValue == null) {\n            initialValue = 1;\n        }\n        if (typeof (initialValue) === \"number\") {\n            this.setCounterValue(initialValue);\n        }\n        else {\n            this.setCounterBytes(initialValue);\n        }\n    }\n    get counter() { return new Uint8Array(__classPrivateFieldGet(this, _CTR_counter, \"f\")); }\n    setCounterValue(value) {\n        if (!Number.isInteger(value) || value < 0 || value > Number.MAX_SAFE_INTEGER) {\n            throw new TypeError(\"invalid counter initial integer value\");\n        }\n        for (let index = 15; index >= 0; --index) {\n            __classPrivateFieldGet(this, _CTR_counter, \"f\")[index] = value % 256;\n            value = Math.floor(value / 256);\n        }\n    }\n    setCounterBytes(value) {\n        if (value.length !== 16) {\n            throw new TypeError(\"invalid counter initial Uint8Array value length\");\n        }\n        __classPrivateFieldGet(this, _CTR_counter, \"f\").set(value);\n    }\n    increment() {\n        for (let i = 15; i >= 0; i--) {\n            if (__classPrivateFieldGet(this, _CTR_counter, \"f\")[i] === 255) {\n                __classPrivateFieldGet(this, _CTR_counter, \"f\")[i] = 0;\n            }\n            else {\n                __classPrivateFieldGet(this, _CTR_counter, \"f\")[i]++;\n                break;\n            }\n        }\n    }\n    encrypt(plaintext) {\n        var _a, _b;\n        const crypttext = new Uint8Array(plaintext);\n        for (let i = 0; i < crypttext.length; i++) {\n            if (__classPrivateFieldGet(this, _CTR_remainingIndex, \"f\") === 16) {\n                __classPrivateFieldSet(this, _CTR_remaining, this.aes.encrypt(__classPrivateFieldGet(this, _CTR_counter, \"f\")), \"f\");\n                __classPrivateFieldSet(this, _CTR_remainingIndex, 0, \"f\");\n                this.increment();\n            }\n            crypttext[i] ^= __classPrivateFieldGet(this, _CTR_remaining, \"f\")[__classPrivateFieldSet(this, _CTR_remainingIndex, (_b = __classPrivateFieldGet(this, _CTR_remainingIndex, \"f\"), _a = _b++, _b), \"f\"), _a];\n        }\n        return crypttext;\n    }\n    decrypt(ciphertext) {\n        return this.encrypt(ciphertext);\n    }\n}\nexports.CTR = CTR;\n_CTR_remaining = new WeakMap(), _CTR_remainingIndex = new WeakMap(), _CTR_counter = new WeakMap();\n//# sourceMappingURL=mode-ctr.js.map","\"use strict\";\n// Electronic Code Book\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ECB = void 0;\nconst mode_js_1 = require(\"./mode.js\");\nclass ECB extends mode_js_1.ModeOfOperation {\n    constructor(key) {\n        super(\"ECB\", key, ECB);\n    }\n    encrypt(plaintext) {\n        if (plaintext.length % 16) {\n            throw new TypeError(\"invalid plaintext size (must be multiple of 16 bytes)\");\n        }\n        const crypttext = new Uint8Array(plaintext.length);\n        for (let i = 0; i < plaintext.length; i += 16) {\n            crypttext.set(this.aes.encrypt(plaintext.subarray(i, i + 16)), i);\n        }\n        return crypttext;\n    }\n    decrypt(crypttext) {\n        if (crypttext.length % 16) {\n            throw new TypeError(\"invalid ciphertext size (must be multiple of 16 bytes)\");\n        }\n        const plaintext = new Uint8Array(crypttext.length);\n        for (let i = 0; i < crypttext.length; i += 16) {\n            plaintext.set(this.aes.decrypt(crypttext.subarray(i, i + 16)), i);\n        }\n        return plaintext;\n    }\n}\nexports.ECB = ECB;\n//# sourceMappingURL=mode-ecb.js.map","\"use strict\";\n// Output Feedback\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 __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 _OFB_iv, _OFB_lastPrecipher, _OFB_lastPrecipherIndex;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.OFB = void 0;\nconst mode_js_1 = require(\"./mode.js\");\nclass OFB extends mode_js_1.ModeOfOperation {\n    constructor(key, iv) {\n        super(\"OFB\", key, OFB);\n        _OFB_iv.set(this, void 0);\n        _OFB_lastPrecipher.set(this, void 0);\n        _OFB_lastPrecipherIndex.set(this, void 0);\n        if (iv) {\n            if (iv.length % 16) {\n                throw new TypeError(\"invalid iv size (must be 16 bytes)\");\n            }\n            __classPrivateFieldSet(this, _OFB_iv, new Uint8Array(iv), \"f\");\n        }\n        else {\n            __classPrivateFieldSet(this, _OFB_iv, new Uint8Array(16), \"f\");\n        }\n        __classPrivateFieldSet(this, _OFB_lastPrecipher, this.iv, \"f\");\n        __classPrivateFieldSet(this, _OFB_lastPrecipherIndex, 16, \"f\");\n    }\n    get iv() { return new Uint8Array(__classPrivateFieldGet(this, _OFB_iv, \"f\")); }\n    encrypt(plaintext) {\n        var _a, _b;\n        if (plaintext.length % 16) {\n            throw new TypeError(\"invalid plaintext size (must be multiple of 16 bytes)\");\n        }\n        const ciphertext = new Uint8Array(plaintext);\n        for (let i = 0; i < ciphertext.length; i++) {\n            if (__classPrivateFieldGet(this, _OFB_lastPrecipherIndex, \"f\") === 16) {\n                __classPrivateFieldSet(this, _OFB_lastPrecipher, this.aes.encrypt(__classPrivateFieldGet(this, _OFB_lastPrecipher, \"f\")), \"f\");\n                __classPrivateFieldSet(this, _OFB_lastPrecipherIndex, 0, \"f\");\n            }\n            ciphertext[i] ^= __classPrivateFieldGet(this, _OFB_lastPrecipher, \"f\")[__classPrivateFieldSet(this, _OFB_lastPrecipherIndex, (_b = __classPrivateFieldGet(this, _OFB_lastPrecipherIndex, \"f\"), _a = _b++, _b), \"f\"), _a];\n        }\n        return ciphertext;\n    }\n    decrypt(ciphertext) {\n        if (ciphertext.length % 16) {\n            throw new TypeError(\"invalid ciphertext size (must be multiple of 16 bytes)\");\n        }\n        return this.encrypt(ciphertext);\n    }\n}\nexports.OFB = OFB;\n_OFB_iv = new WeakMap(), _OFB_lastPrecipher = new WeakMap(), _OFB_lastPrecipherIndex = new WeakMap();\n//# sourceMappingURL=mode-ofb.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ModeOfOperation = void 0;\nconst aes_js_1 = require(\"./aes.js\");\nclass ModeOfOperation {\n    constructor(name, key, cls) {\n        if (cls && !(this instanceof cls)) {\n            throw new Error(`${name} must be instantiated with \"new\"`);\n        }\n        Object.defineProperties(this, {\n            aes: { enumerable: true, value: new aes_js_1.AES(key) },\n            name: { enumerable: true, value: name }\n        });\n    }\n}\nexports.ModeOfOperation = ModeOfOperation;\n//# sourceMappingURL=mode.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pkcs7Strip = exports.pkcs7Pad = void 0;\nfunction pkcs7Pad(data) {\n    const padder = 16 - (data.length % 16);\n    const result = new Uint8Array(data.length + padder);\n    result.set(data);\n    for (let i = data.length; i < result.length; i++) {\n        result[i] = padder;\n    }\n    return result;\n}\nexports.pkcs7Pad = pkcs7Pad;\nfunction pkcs7Strip(data) {\n    if (data.length < 16) {\n        throw new TypeError('PKCS#7 invalid length');\n    }\n    const padder = data[data.length - 1];\n    if (padder > 16) {\n        throw new TypeError('PKCS#7 padding byte out of range');\n    }\n    const length = data.length - padder;\n    for (let i = 0; i < padder; i++) {\n        if (data[length + i] !== padder) {\n            throw new TypeError('PKCS#7 invalid padding byte');\n        }\n    }\n    return new Uint8Array(data.subarray(0, length));\n}\nexports.pkcs7Strip = pkcs7Strip;\n//# sourceMappingURL=padding.js.map","\"use strict\";\n/* Do NOT modify this file; see /src.ts/_admin/update-version.ts */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.version = void 0;\n/**\n *  The current version of Ethers.\n */\nexports.version = \"6.13.1\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\n/**\n *  When sending values to or receiving values from a [[Contract]], the\n *  data is generally encoded using the [ABI standard](link-solc-abi).\n *\n *  The AbiCoder provides a utility to encode values to ABI data and\n *  decode values from ABI data.\n *\n *  Most of the time, developers should favour the [[Contract]] class,\n *  which further abstracts a lot of the finer details of ABI data.\n *\n *  @_section api/abi/abi-coder:ABI Encoding\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AbiCoder = void 0;\n// See: https://github.com/ethereum/wiki/wiki/Ethereum-Contract-ABI\nconst index_js_1 = require(\"../utils/index.js\");\nconst abstract_coder_js_1 = require(\"./coders/abstract-coder.js\");\nconst address_js_1 = require(\"./coders/address.js\");\nconst array_js_1 = require(\"./coders/array.js\");\nconst boolean_js_1 = require(\"./coders/boolean.js\");\nconst bytes_js_1 = require(\"./coders/bytes.js\");\nconst fixed_bytes_js_1 = require(\"./coders/fixed-bytes.js\");\nconst null_js_1 = require(\"./coders/null.js\");\nconst number_js_1 = require(\"./coders/number.js\");\nconst string_js_1 = require(\"./coders/string.js\");\nconst tuple_js_1 = require(\"./coders/tuple.js\");\nconst fragments_js_1 = require(\"./fragments.js\");\nconst index_js_2 = require(\"../address/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\n// https://docs.soliditylang.org/en/v0.8.17/control-structures.html\nconst PanicReasons = new Map();\nPanicReasons.set(0x00, \"GENERIC_PANIC\");\nPanicReasons.set(0x01, \"ASSERT_FALSE\");\nPanicReasons.set(0x11, \"OVERFLOW\");\nPanicReasons.set(0x12, \"DIVIDE_BY_ZERO\");\nPanicReasons.set(0x21, \"ENUM_RANGE_ERROR\");\nPanicReasons.set(0x22, \"BAD_STORAGE_DATA\");\nPanicReasons.set(0x31, \"STACK_UNDERFLOW\");\nPanicReasons.set(0x32, \"ARRAY_RANGE_ERROR\");\nPanicReasons.set(0x41, \"OUT_OF_MEMORY\");\nPanicReasons.set(0x51, \"UNINITIALIZED_FUNCTION_CALL\");\nconst paramTypeBytes = new RegExp(/^bytes([0-9]*)$/);\nconst paramTypeNumber = new RegExp(/^(u?int)([0-9]*)$/);\nlet defaultCoder = null;\nlet defaultMaxInflation = 1024;\nfunction getBuiltinCallException(action, tx, data, abiCoder) {\n    let message = \"missing revert data\";\n    let reason = null;\n    const invocation = null;\n    let revert = null;\n    if (data) {\n        message = \"execution reverted\";\n        const bytes = (0, index_js_3.getBytes)(data);\n        data = (0, index_js_3.hexlify)(data);\n        if (bytes.length === 0) {\n            message += \" (no data present; likely require(false) occurred\";\n            reason = \"require(false)\";\n        }\n        else if (bytes.length % 32 !== 4) {\n            message += \" (could not decode reason; invalid data length)\";\n        }\n        else if ((0, index_js_3.hexlify)(bytes.slice(0, 4)) === \"0x08c379a0\") {\n            // Error(string)\n            try {\n                reason = abiCoder.decode([\"string\"], bytes.slice(4))[0];\n                revert = {\n                    signature: \"Error(string)\",\n                    name: \"Error\",\n                    args: [reason]\n                };\n                message += `: ${JSON.stringify(reason)}`;\n            }\n            catch (error) {\n                message += \" (could not decode reason; invalid string data)\";\n            }\n        }\n        else if ((0, index_js_3.hexlify)(bytes.slice(0, 4)) === \"0x4e487b71\") {\n            // Panic(uint256)\n            try {\n                const code = Number(abiCoder.decode([\"uint256\"], bytes.slice(4))[0]);\n                revert = {\n                    signature: \"Panic(uint256)\",\n                    name: \"Panic\",\n                    args: [code]\n                };\n                reason = `Panic due to ${PanicReasons.get(code) || \"UNKNOWN\"}(${code})`;\n                message += `: ${reason}`;\n            }\n            catch (error) {\n                message += \" (could not decode panic code)\";\n            }\n        }\n        else {\n            message += \" (unknown custom error)\";\n        }\n    }\n    const transaction = {\n        to: (tx.to ? (0, index_js_2.getAddress)(tx.to) : null),\n        data: (tx.data || \"0x\")\n    };\n    if (tx.from) {\n        transaction.from = (0, index_js_2.getAddress)(tx.from);\n    }\n    return (0, index_js_3.makeError)(message, \"CALL_EXCEPTION\", {\n        action, data, reason, transaction, invocation, revert\n    });\n}\n/**\n *  The **AbiCoder** is a low-level class responsible for encoding JavaScript\n *  values into binary data and decoding binary data into JavaScript values.\n */\nclass AbiCoder {\n    #getCoder(param) {\n        if (param.isArray()) {\n            return new array_js_1.ArrayCoder(this.#getCoder(param.arrayChildren), param.arrayLength, param.name);\n        }\n        if (param.isTuple()) {\n            return new tuple_js_1.TupleCoder(param.components.map((c) => this.#getCoder(c)), param.name);\n        }\n        switch (param.baseType) {\n            case \"address\":\n                return new address_js_1.AddressCoder(param.name);\n            case \"bool\":\n                return new boolean_js_1.BooleanCoder(param.name);\n            case \"string\":\n                return new string_js_1.StringCoder(param.name);\n            case \"bytes\":\n                return new bytes_js_1.BytesCoder(param.name);\n            case \"\":\n                return new null_js_1.NullCoder(param.name);\n        }\n        // u?int[0-9]*\n        let match = param.type.match(paramTypeNumber);\n        if (match) {\n            let size = parseInt(match[2] || \"256\");\n            (0, index_js_1.assertArgument)(size !== 0 && size <= 256 && (size % 8) === 0, \"invalid \" + match[1] + \" bit length\", \"param\", param);\n            return new number_js_1.NumberCoder(size / 8, (match[1] === \"int\"), param.name);\n        }\n        // bytes[0-9]+\n        match = param.type.match(paramTypeBytes);\n        if (match) {\n            let size = parseInt(match[1]);\n            (0, index_js_1.assertArgument)(size !== 0 && size <= 32, \"invalid bytes length\", \"param\", param);\n            return new fixed_bytes_js_1.FixedBytesCoder(size, param.name);\n        }\n        (0, index_js_1.assertArgument)(false, \"invalid type\", \"type\", param.type);\n    }\n    /**\n     *  Get the default values for the given %%types%%.\n     *\n     *  For example, a ``uint`` is by default ``0`` and ``bool``\n     *  is by default ``false``.\n     */\n    getDefaultValue(types) {\n        const coders = types.map((type) => this.#getCoder(fragments_js_1.ParamType.from(type)));\n        const coder = new tuple_js_1.TupleCoder(coders, \"_\");\n        return coder.defaultValue();\n    }\n    /**\n     *  Encode the %%values%% as the %%types%% into ABI data.\n     *\n     *  @returns DataHexstring\n     */\n    encode(types, values) {\n        (0, index_js_1.assertArgumentCount)(values.length, types.length, \"types/values length mismatch\");\n        const coders = types.map((type) => this.#getCoder(fragments_js_1.ParamType.from(type)));\n        const coder = (new tuple_js_1.TupleCoder(coders, \"_\"));\n        const writer = new abstract_coder_js_1.Writer();\n        coder.encode(writer, values);\n        return writer.data;\n    }\n    /**\n     *  Decode the ABI %%data%% as the %%types%% into values.\n     *\n     *  If %%loose%% decoding is enabled, then strict padding is\n     *  not enforced. Some older versions of Solidity incorrectly\n     *  padded event data emitted from ``external`` functions.\n     */\n    decode(types, data, loose) {\n        const coders = types.map((type) => this.#getCoder(fragments_js_1.ParamType.from(type)));\n        const coder = new tuple_js_1.TupleCoder(coders, \"_\");\n        return coder.decode(new abstract_coder_js_1.Reader(data, loose, defaultMaxInflation));\n    }\n    static _setDefaultMaxInflation(value) {\n        (0, index_js_1.assertArgument)(typeof (value) === \"number\" && Number.isInteger(value), \"invalid defaultMaxInflation factor\", \"value\", value);\n        defaultMaxInflation = value;\n    }\n    /**\n     *  Returns the shared singleton instance of a default [[AbiCoder]].\n     *\n     *  On the first call, the instance is created internally.\n     */\n    static defaultAbiCoder() {\n        if (defaultCoder == null) {\n            defaultCoder = new AbiCoder();\n        }\n        return defaultCoder;\n    }\n    /**\n     *  Returns an ethers-compatible [[CallExceptionError]] Error for the given\n     *  result %%data%% for the [[CallExceptionAction]] %%action%% against\n     *  the Transaction %%tx%%.\n     */\n    static getBuiltinCallException(action, tx, data) {\n        return getBuiltinCallException(action, tx, data, AbiCoder.defaultAbiCoder());\n    }\n}\nexports.AbiCoder = AbiCoder;\n//# sourceMappingURL=abi-coder.js.map","\"use strict\";\n/**\n *  About bytes32 strings...\n *\n *  @_docloc: api/utils:Bytes32 Strings\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeBytes32String = exports.encodeBytes32String = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\n/**\n *  Encodes %%text%% as a Bytes32 string.\n */\nfunction encodeBytes32String(text) {\n    // Get the bytes\n    const bytes = (0, index_js_1.toUtf8Bytes)(text);\n    // Check we have room for null-termination\n    if (bytes.length > 31) {\n        throw new Error(\"bytes32 string must be less than 32 bytes\");\n    }\n    // Zero-pad (implicitly null-terminates)\n    return (0, index_js_1.zeroPadBytes)(bytes, 32);\n}\nexports.encodeBytes32String = encodeBytes32String;\n/**\n *  Encodes the Bytes32-encoded %%bytes%% into a string.\n */\nfunction decodeBytes32String(_bytes) {\n    const data = (0, index_js_1.getBytes)(_bytes, \"bytes\");\n    // Must be 32 bytes with a null-termination\n    if (data.length !== 32) {\n        throw new Error(\"invalid bytes32 - not 32 bytes long\");\n    }\n    if (data[31] !== 0) {\n        throw new Error(\"invalid bytes32 string - no null terminator\");\n    }\n    // Find the null termination\n    let length = 31;\n    while (data[length - 1] === 0) {\n        length--;\n    }\n    // Determine the string value\n    return (0, index_js_1.toUtf8String)(data.slice(0, length));\n}\nexports.decodeBytes32String = decodeBytes32String;\n//# sourceMappingURL=bytes32.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Reader = exports.Writer = exports.Coder = exports.checkResultErrors = exports.Result = exports.WordSize = void 0;\nconst index_js_1 = require(\"../../utils/index.js\");\n/**\n * @_ignore:\n */\nexports.WordSize = 32;\nconst Padding = new Uint8Array(exports.WordSize);\n// Properties used to immediate pass through to the underlying object\n// - `then` is used to detect if an object is a Promise for await\nconst passProperties = [\"then\"];\nconst _guard = {};\nconst resultNames = new WeakMap();\nfunction getNames(result) {\n    return resultNames.get(result);\n}\nfunction setNames(result, names) {\n    resultNames.set(result, names);\n}\nfunction throwError(name, error) {\n    const wrapped = new Error(`deferred error during ABI decoding triggered accessing ${name}`);\n    wrapped.error = error;\n    throw wrapped;\n}\nfunction toObject(names, items, deep) {\n    if (names.indexOf(null) >= 0) {\n        return items.map((item, index) => {\n            if (item instanceof Result) {\n                return toObject(getNames(item), item, deep);\n            }\n            return item;\n        });\n    }\n    return names.reduce((accum, name, index) => {\n        let item = items.getValue(name);\n        if (!(name in accum)) {\n            if (deep && item instanceof Result) {\n                item = toObject(getNames(item), item, deep);\n            }\n            accum[name] = item;\n        }\n        return accum;\n    }, {});\n}\n/**\n *  A [[Result]] is a sub-class of Array, which allows accessing any\n *  of its values either positionally by its index or, if keys are\n *  provided by its name.\n *\n *  @_docloc: api/abi\n */\nclass Result extends Array {\n    // No longer used; but cannot be removed as it will remove the\n    // #private field from the .d.ts which may break backwards\n    // compatibility\n    #names;\n    /**\n     *  @private\n     */\n    constructor(...args) {\n        // To properly sub-class Array so the other built-in\n        // functions work, the constructor has to behave fairly\n        // well. So, in the event we are created via fromItems()\n        // we build the read-only Result object we want, but on\n        // any other input, we use the default constructor\n        // constructor(guard: any, items: Array<any>, keys?: Array<null | string>);\n        const guard = args[0];\n        let items = args[1];\n        let names = (args[2] || []).slice();\n        let wrap = true;\n        if (guard !== _guard) {\n            items = args;\n            names = [];\n            wrap = false;\n        }\n        // Can't just pass in ...items since an array of length 1\n        // is a special case in the super.\n        super(items.length);\n        items.forEach((item, index) => { this[index] = item; });\n        // Find all unique keys\n        const nameCounts = names.reduce((accum, name) => {\n            if (typeof (name) === \"string\") {\n                accum.set(name, (accum.get(name) || 0) + 1);\n            }\n            return accum;\n        }, (new Map()));\n        // Remove any key thats not unique\n        setNames(this, Object.freeze(items.map((item, index) => {\n            const name = names[index];\n            if (name != null && nameCounts.get(name) === 1) {\n                return name;\n            }\n            return null;\n        })));\n        // Dummy operations to prevent TypeScript from complaining\n        this.#names = [];\n        if (this.#names == null) {\n            void (this.#names);\n        }\n        if (!wrap) {\n            return;\n        }\n        // A wrapped Result is immutable\n        Object.freeze(this);\n        // Proxy indices and names so we can trap deferred errors\n        const proxy = new Proxy(this, {\n            get: (target, prop, receiver) => {\n                if (typeof (prop) === \"string\") {\n                    // Index accessor\n                    if (prop.match(/^[0-9]+$/)) {\n                        const index = (0, index_js_1.getNumber)(prop, \"%index\");\n                        if (index < 0 || index >= this.length) {\n                            throw new RangeError(\"out of result range\");\n                        }\n                        const item = target[index];\n                        if (item instanceof Error) {\n                            throwError(`index ${index}`, item);\n                        }\n                        return item;\n                    }\n                    // Pass important checks (like `then` for Promise) through\n                    if (passProperties.indexOf(prop) >= 0) {\n                        return Reflect.get(target, prop, receiver);\n                    }\n                    const value = target[prop];\n                    if (value instanceof Function) {\n                        // Make sure functions work with private variables\n                        // See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Proxy#no_private_property_forwarding\n                        return function (...args) {\n                            return value.apply((this === receiver) ? target : this, args);\n                        };\n                    }\n                    else if (!(prop in target)) {\n                        // Possible name accessor\n                        return target.getValue.apply((this === receiver) ? target : this, [prop]);\n                    }\n                }\n                return Reflect.get(target, prop, receiver);\n            }\n        });\n        setNames(proxy, getNames(this));\n        return proxy;\n    }\n    /**\n     *  Returns the Result as a normal Array. If %%deep%%, any children\n     *  which are Result objects are also converted to a normal Array.\n     *\n     *  This will throw if there are any outstanding deferred\n     *  errors.\n     */\n    toArray(deep) {\n        const result = [];\n        this.forEach((item, index) => {\n            if (item instanceof Error) {\n                throwError(`index ${index}`, item);\n            }\n            if (deep && item instanceof Result) {\n                item = item.toArray(deep);\n            }\n            result.push(item);\n        });\n        return result;\n    }\n    /**\n     *  Returns the Result as an Object with each name-value pair. If\n     *  %%deep%%, any children which are Result objects are also\n     *  converted to an Object.\n     *\n     *  This will throw if any value is unnamed, or if there are\n     *  any outstanding deferred errors.\n     */\n    toObject(deep) {\n        const names = getNames(this);\n        return names.reduce((accum, name, index) => {\n            (0, index_js_1.assert)(name != null, `value at index ${index} unnamed`, \"UNSUPPORTED_OPERATION\", {\n                operation: \"toObject()\"\n            });\n            return toObject(names, this, deep);\n        }, {});\n    }\n    /**\n     *  @_ignore\n     */\n    slice(start, end) {\n        if (start == null) {\n            start = 0;\n        }\n        if (start < 0) {\n            start += this.length;\n            if (start < 0) {\n                start = 0;\n            }\n        }\n        if (end == null) {\n            end = this.length;\n        }\n        if (end < 0) {\n            end += this.length;\n            if (end < 0) {\n                end = 0;\n            }\n        }\n        if (end > this.length) {\n            end = this.length;\n        }\n        const _names = getNames(this);\n        const result = [], names = [];\n        for (let i = start; i < end; i++) {\n            result.push(this[i]);\n            names.push(_names[i]);\n        }\n        return new Result(_guard, result, names);\n    }\n    /**\n     *  @_ignore\n     */\n    filter(callback, thisArg) {\n        const _names = getNames(this);\n        const result = [], names = [];\n        for (let i = 0; i < this.length; i++) {\n            const item = this[i];\n            if (item instanceof Error) {\n                throwError(`index ${i}`, item);\n            }\n            if (callback.call(thisArg, item, i, this)) {\n                result.push(item);\n                names.push(_names[i]);\n            }\n        }\n        return new Result(_guard, result, names);\n    }\n    /**\n     *  @_ignore\n     */\n    map(callback, thisArg) {\n        const result = [];\n        for (let i = 0; i < this.length; i++) {\n            const item = this[i];\n            if (item instanceof Error) {\n                throwError(`index ${i}`, item);\n            }\n            result.push(callback.call(thisArg, item, i, this));\n        }\n        return result;\n    }\n    /**\n     *  Returns the value for %%name%%.\n     *\n     *  Since it is possible to have a key whose name conflicts with\n     *  a method on a [[Result]] or its superclass Array, or any\n     *  JavaScript keyword, this ensures all named values are still\n     *  accessible by name.\n     */\n    getValue(name) {\n        const index = getNames(this).indexOf(name);\n        if (index === -1) {\n            return undefined;\n        }\n        const value = this[index];\n        if (value instanceof Error) {\n            throwError(`property ${JSON.stringify(name)}`, value.error);\n        }\n        return value;\n    }\n    /**\n     *  Creates a new [[Result]] for %%items%% with each entry\n     *  also accessible by its corresponding name in %%keys%%.\n     */\n    static fromItems(items, keys) {\n        return new Result(_guard, items, keys);\n    }\n}\nexports.Result = Result;\n/**\n *  Returns all errors found in a [[Result]].\n *\n *  Since certain errors encountered when creating a [[Result]] do\n *  not impact the ability to continue parsing data, they are\n *  deferred until they are actually accessed. Hence a faulty string\n *  in an Event that is never used does not impact the program flow.\n *\n *  However, sometimes it may be useful to access, identify or\n *  validate correctness of a [[Result]].\n *\n *  @_docloc api/abi\n */\nfunction checkResultErrors(result) {\n    // Find the first error (if any)\n    const errors = [];\n    const checkErrors = function (path, object) {\n        if (!Array.isArray(object)) {\n            return;\n        }\n        for (let key in object) {\n            const childPath = path.slice();\n            childPath.push(key);\n            try {\n                checkErrors(childPath, object[key]);\n            }\n            catch (error) {\n                errors.push({ path: childPath, error: error });\n            }\n        }\n    };\n    checkErrors([], result);\n    return errors;\n}\nexports.checkResultErrors = checkResultErrors;\nfunction getValue(value) {\n    let bytes = (0, index_js_1.toBeArray)(value);\n    (0, index_js_1.assert)(bytes.length <= exports.WordSize, \"value out-of-bounds\", \"BUFFER_OVERRUN\", { buffer: bytes, length: exports.WordSize, offset: bytes.length });\n    if (bytes.length !== exports.WordSize) {\n        bytes = (0, index_js_1.getBytesCopy)((0, index_js_1.concat)([Padding.slice(bytes.length % exports.WordSize), bytes]));\n    }\n    return bytes;\n}\n/**\n *  @_ignore\n */\nclass Coder {\n    // The coder name:\n    //   - address, uint256, tuple, array, etc.\n    name;\n    // The fully expanded type, including composite types:\n    //   - address, uint256, tuple(address,bytes), uint256[3][4][],  etc.\n    type;\n    // The localName bound in the signature, in this example it is \"baz\":\n    //   - tuple(address foo, uint bar) baz\n    localName;\n    // Whether this type is dynamic:\n    //  - Dynamic: bytes, string, address[], tuple(boolean[]), etc.\n    //  - Not Dynamic: address, uint256, boolean[3], tuple(address, uint8)\n    dynamic;\n    constructor(name, type, localName, dynamic) {\n        (0, index_js_1.defineProperties)(this, { name, type, localName, dynamic }, {\n            name: \"string\", type: \"string\", localName: \"string\", dynamic: \"boolean\"\n        });\n    }\n    _throwError(message, value) {\n        (0, index_js_1.assertArgument)(false, message, this.localName, value);\n    }\n}\nexports.Coder = Coder;\n/**\n *  @_ignore\n */\nclass Writer {\n    // An array of WordSize lengthed objects to concatenation\n    #data;\n    #dataLength;\n    constructor() {\n        this.#data = [];\n        this.#dataLength = 0;\n    }\n    get data() {\n        return (0, index_js_1.concat)(this.#data);\n    }\n    get length() { return this.#dataLength; }\n    #writeData(data) {\n        this.#data.push(data);\n        this.#dataLength += data.length;\n        return data.length;\n    }\n    appendWriter(writer) {\n        return this.#writeData((0, index_js_1.getBytesCopy)(writer.data));\n    }\n    // Arrayish item; pad on the right to *nearest* WordSize\n    writeBytes(value) {\n        let bytes = (0, index_js_1.getBytesCopy)(value);\n        const paddingOffset = bytes.length % exports.WordSize;\n        if (paddingOffset) {\n            bytes = (0, index_js_1.getBytesCopy)((0, index_js_1.concat)([bytes, Padding.slice(paddingOffset)]));\n        }\n        return this.#writeData(bytes);\n    }\n    // Numeric item; pad on the left *to* WordSize\n    writeValue(value) {\n        return this.#writeData(getValue(value));\n    }\n    // Inserts a numeric place-holder, returning a callback that can\n    // be used to asjust the value later\n    writeUpdatableValue() {\n        const offset = this.#data.length;\n        this.#data.push(Padding);\n        this.#dataLength += exports.WordSize;\n        return (value) => {\n            this.#data[offset] = getValue(value);\n        };\n    }\n}\nexports.Writer = Writer;\n/**\n *  @_ignore\n */\nclass Reader {\n    // Allows incomplete unpadded data to be read; otherwise an error\n    // is raised if attempting to overrun the buffer. This is required\n    // to deal with an old Solidity bug, in which event data for\n    // external (not public thoguh) was tightly packed.\n    allowLoose;\n    #data;\n    #offset;\n    #bytesRead;\n    #parent;\n    #maxInflation;\n    constructor(data, allowLoose, maxInflation) {\n        (0, index_js_1.defineProperties)(this, { allowLoose: !!allowLoose });\n        this.#data = (0, index_js_1.getBytesCopy)(data);\n        this.#bytesRead = 0;\n        this.#parent = null;\n        this.#maxInflation = (maxInflation != null) ? maxInflation : 1024;\n        this.#offset = 0;\n    }\n    get data() { return (0, index_js_1.hexlify)(this.#data); }\n    get dataLength() { return this.#data.length; }\n    get consumed() { return this.#offset; }\n    get bytes() { return new Uint8Array(this.#data); }\n    #incrementBytesRead(count) {\n        if (this.#parent) {\n            return this.#parent.#incrementBytesRead(count);\n        }\n        this.#bytesRead += count;\n        // Check for excessive inflation (see: #4537)\n        (0, index_js_1.assert)(this.#maxInflation < 1 || this.#bytesRead <= this.#maxInflation * this.dataLength, `compressed ABI data exceeds inflation ratio of ${this.#maxInflation} ( see: https:/\\/github.com/ethers-io/ethers.js/issues/4537 )`, \"BUFFER_OVERRUN\", {\n            buffer: (0, index_js_1.getBytesCopy)(this.#data), offset: this.#offset,\n            length: count, info: {\n                bytesRead: this.#bytesRead,\n                dataLength: this.dataLength\n            }\n        });\n    }\n    #peekBytes(offset, length, loose) {\n        let alignedLength = Math.ceil(length / exports.WordSize) * exports.WordSize;\n        if (this.#offset + alignedLength > this.#data.length) {\n            if (this.allowLoose && loose && this.#offset + length <= this.#data.length) {\n                alignedLength = length;\n            }\n            else {\n                (0, index_js_1.assert)(false, \"data out-of-bounds\", \"BUFFER_OVERRUN\", {\n                    buffer: (0, index_js_1.getBytesCopy)(this.#data),\n                    length: this.#data.length,\n                    offset: this.#offset + alignedLength\n                });\n            }\n        }\n        return this.#data.slice(this.#offset, this.#offset + alignedLength);\n    }\n    // Create a sub-reader with the same underlying data, but offset\n    subReader(offset) {\n        const reader = new Reader(this.#data.slice(this.#offset + offset), this.allowLoose, this.#maxInflation);\n        reader.#parent = this;\n        return reader;\n    }\n    // Read bytes\n    readBytes(length, loose) {\n        let bytes = this.#peekBytes(0, length, !!loose);\n        this.#incrementBytesRead(length);\n        this.#offset += bytes.length;\n        // @TODO: Make sure the length..end bytes are all 0?\n        return bytes.slice(0, length);\n    }\n    // Read a numeric values\n    readValue() {\n        return (0, index_js_1.toBigInt)(this.readBytes(exports.WordSize));\n    }\n    readIndex() {\n        return (0, index_js_1.toNumber)(this.readBytes(exports.WordSize));\n    }\n}\nexports.Reader = Reader;\n//# sourceMappingURL=abstract-coder.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AddressCoder = void 0;\nconst index_js_1 = require(\"../../address/index.js\");\nconst maths_js_1 = require(\"../../utils/maths.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\n/**\n *  @_ignore\n */\nclass AddressCoder extends abstract_coder_js_1.Coder {\n    constructor(localName) {\n        super(\"address\", \"address\", localName, false);\n    }\n    defaultValue() {\n        return \"0x0000000000000000000000000000000000000000\";\n    }\n    encode(writer, _value) {\n        let value = typed_js_1.Typed.dereference(_value, \"string\");\n        try {\n            value = (0, index_js_1.getAddress)(value);\n        }\n        catch (error) {\n            return this._throwError(error.message, _value);\n        }\n        return writer.writeValue(value);\n    }\n    decode(reader) {\n        return (0, index_js_1.getAddress)((0, maths_js_1.toBeHex)(reader.readValue(), 20));\n    }\n}\nexports.AddressCoder = AddressCoder;\n//# sourceMappingURL=address.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AnonymousCoder = void 0;\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\n/**\n *  Clones the functionality of an existing Coder, but without a localName\n *\n *  @_ignore\n */\nclass AnonymousCoder extends abstract_coder_js_1.Coder {\n    coder;\n    constructor(coder) {\n        super(coder.name, coder.type, \"_\", coder.dynamic);\n        this.coder = coder;\n    }\n    defaultValue() {\n        return this.coder.defaultValue();\n    }\n    encode(writer, value) {\n        return this.coder.encode(writer, value);\n    }\n    decode(reader) {\n        return this.coder.decode(reader);\n    }\n}\nexports.AnonymousCoder = AnonymousCoder;\n//# sourceMappingURL=anonymous.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ArrayCoder = exports.unpack = exports.pack = void 0;\nconst index_js_1 = require(\"../../utils/index.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\nconst anonymous_js_1 = require(\"./anonymous.js\");\n/**\n *  @_ignore\n */\nfunction pack(writer, coders, values) {\n    let arrayValues = [];\n    if (Array.isArray(values)) {\n        arrayValues = values;\n    }\n    else if (values && typeof (values) === \"object\") {\n        let unique = {};\n        arrayValues = coders.map((coder) => {\n            const name = coder.localName;\n            (0, index_js_1.assert)(name, \"cannot encode object for signature with missing names\", \"INVALID_ARGUMENT\", { argument: \"values\", info: { coder }, value: values });\n            (0, index_js_1.assert)(!unique[name], \"cannot encode object for signature with duplicate names\", \"INVALID_ARGUMENT\", { argument: \"values\", info: { coder }, value: values });\n            unique[name] = true;\n            return values[name];\n        });\n    }\n    else {\n        (0, index_js_1.assertArgument)(false, \"invalid tuple value\", \"tuple\", values);\n    }\n    (0, index_js_1.assertArgument)(coders.length === arrayValues.length, \"types/value length mismatch\", \"tuple\", values);\n    let staticWriter = new abstract_coder_js_1.Writer();\n    let dynamicWriter = new abstract_coder_js_1.Writer();\n    let updateFuncs = [];\n    coders.forEach((coder, index) => {\n        let value = arrayValues[index];\n        if (coder.dynamic) {\n            // Get current dynamic offset (for the future pointer)\n            let dynamicOffset = dynamicWriter.length;\n            // Encode the dynamic value into the dynamicWriter\n            coder.encode(dynamicWriter, value);\n            // Prepare to populate the correct offset once we are done\n            let updateFunc = staticWriter.writeUpdatableValue();\n            updateFuncs.push((baseOffset) => {\n                updateFunc(baseOffset + dynamicOffset);\n            });\n        }\n        else {\n            coder.encode(staticWriter, value);\n        }\n    });\n    // Backfill all the dynamic offsets, now that we know the static length\n    updateFuncs.forEach((func) => { func(staticWriter.length); });\n    let length = writer.appendWriter(staticWriter);\n    length += writer.appendWriter(dynamicWriter);\n    return length;\n}\nexports.pack = pack;\n/**\n *  @_ignore\n */\nfunction unpack(reader, coders) {\n    let values = [];\n    let keys = [];\n    // A reader anchored to this base\n    let baseReader = reader.subReader(0);\n    coders.forEach((coder) => {\n        let value = null;\n        if (coder.dynamic) {\n            let offset = reader.readIndex();\n            let offsetReader = baseReader.subReader(offset);\n            try {\n                value = coder.decode(offsetReader);\n            }\n            catch (error) {\n                // Cannot recover from this\n                if ((0, index_js_1.isError)(error, \"BUFFER_OVERRUN\")) {\n                    throw error;\n                }\n                value = error;\n                value.baseType = coder.name;\n                value.name = coder.localName;\n                value.type = coder.type;\n            }\n        }\n        else {\n            try {\n                value = coder.decode(reader);\n            }\n            catch (error) {\n                // Cannot recover from this\n                if ((0, index_js_1.isError)(error, \"BUFFER_OVERRUN\")) {\n                    throw error;\n                }\n                value = error;\n                value.baseType = coder.name;\n                value.name = coder.localName;\n                value.type = coder.type;\n            }\n        }\n        if (value == undefined) {\n            throw new Error(\"investigate\");\n        }\n        values.push(value);\n        keys.push(coder.localName || null);\n    });\n    return abstract_coder_js_1.Result.fromItems(values, keys);\n}\nexports.unpack = unpack;\n/**\n *  @_ignore\n */\nclass ArrayCoder extends abstract_coder_js_1.Coder {\n    coder;\n    length;\n    constructor(coder, length, localName) {\n        const type = (coder.type + \"[\" + (length >= 0 ? length : \"\") + \"]\");\n        const dynamic = (length === -1 || coder.dynamic);\n        super(\"array\", type, localName, dynamic);\n        (0, index_js_1.defineProperties)(this, { coder, length });\n    }\n    defaultValue() {\n        // Verifies the child coder is valid (even if the array is dynamic or 0-length)\n        const defaultChild = this.coder.defaultValue();\n        const result = [];\n        for (let i = 0; i < this.length; i++) {\n            result.push(defaultChild);\n        }\n        return result;\n    }\n    encode(writer, _value) {\n        const value = typed_js_1.Typed.dereference(_value, \"array\");\n        if (!Array.isArray(value)) {\n            this._throwError(\"expected array value\", value);\n        }\n        let count = this.length;\n        if (count === -1) {\n            count = value.length;\n            writer.writeValue(value.length);\n        }\n        (0, index_js_1.assertArgumentCount)(value.length, count, \"coder array\" + (this.localName ? (\" \" + this.localName) : \"\"));\n        let coders = [];\n        for (let i = 0; i < value.length; i++) {\n            coders.push(this.coder);\n        }\n        return pack(writer, coders, value);\n    }\n    decode(reader) {\n        let count = this.length;\n        if (count === -1) {\n            count = reader.readIndex();\n            // Check that there is *roughly* enough data to ensure\n            // stray random data is not being read as a length. Each\n            // slot requires at least 32 bytes for their value (or 32\n            // bytes as a link to the data). This could use a much\n            // tighter bound, but we are erroring on the side of safety.\n            (0, index_js_1.assert)(count * abstract_coder_js_1.WordSize <= reader.dataLength, \"insufficient data length\", \"BUFFER_OVERRUN\", { buffer: reader.bytes, offset: count * abstract_coder_js_1.WordSize, length: reader.dataLength });\n        }\n        let coders = [];\n        for (let i = 0; i < count; i++) {\n            coders.push(new anonymous_js_1.AnonymousCoder(this.coder));\n        }\n        return unpack(reader, coders);\n    }\n}\nexports.ArrayCoder = ArrayCoder;\n//# sourceMappingURL=array.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BooleanCoder = void 0;\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\n/**\n *  @_ignore\n */\nclass BooleanCoder extends abstract_coder_js_1.Coder {\n    constructor(localName) {\n        super(\"bool\", \"bool\", localName, false);\n    }\n    defaultValue() {\n        return false;\n    }\n    encode(writer, _value) {\n        const value = typed_js_1.Typed.dereference(_value, \"bool\");\n        return writer.writeValue(value ? 1 : 0);\n    }\n    decode(reader) {\n        return !!reader.readValue();\n    }\n}\nexports.BooleanCoder = BooleanCoder;\n//# sourceMappingURL=boolean.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BytesCoder = exports.DynamicBytesCoder = void 0;\nconst index_js_1 = require(\"../../utils/index.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\n/**\n *  @_ignore\n */\nclass DynamicBytesCoder extends abstract_coder_js_1.Coder {\n    constructor(type, localName) {\n        super(type, type, localName, true);\n    }\n    defaultValue() {\n        return \"0x\";\n    }\n    encode(writer, value) {\n        value = (0, index_js_1.getBytesCopy)(value);\n        let length = writer.writeValue(value.length);\n        length += writer.writeBytes(value);\n        return length;\n    }\n    decode(reader) {\n        return reader.readBytes(reader.readIndex(), true);\n    }\n}\nexports.DynamicBytesCoder = DynamicBytesCoder;\n/**\n *  @_ignore\n */\nclass BytesCoder extends DynamicBytesCoder {\n    constructor(localName) {\n        super(\"bytes\", localName);\n    }\n    decode(reader) {\n        return (0, index_js_1.hexlify)(super.decode(reader));\n    }\n}\nexports.BytesCoder = BytesCoder;\n//# sourceMappingURL=bytes.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FixedBytesCoder = void 0;\nconst index_js_1 = require(\"../../utils/index.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\n/**\n *  @_ignore\n */\nclass FixedBytesCoder extends abstract_coder_js_1.Coder {\n    size;\n    constructor(size, localName) {\n        let name = \"bytes\" + String(size);\n        super(name, name, localName, false);\n        (0, index_js_1.defineProperties)(this, { size }, { size: \"number\" });\n    }\n    defaultValue() {\n        return (\"0x0000000000000000000000000000000000000000000000000000000000000000\").substring(0, 2 + this.size * 2);\n    }\n    encode(writer, _value) {\n        let data = (0, index_js_1.getBytesCopy)(typed_js_1.Typed.dereference(_value, this.type));\n        if (data.length !== this.size) {\n            this._throwError(\"incorrect data length\", _value);\n        }\n        return writer.writeBytes(data);\n    }\n    decode(reader) {\n        return (0, index_js_1.hexlify)(reader.readBytes(this.size));\n    }\n}\nexports.FixedBytesCoder = FixedBytesCoder;\n//# sourceMappingURL=fixed-bytes.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NullCoder = void 0;\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\nconst Empty = new Uint8Array([]);\n/**\n *  @_ignore\n */\nclass NullCoder extends abstract_coder_js_1.Coder {\n    constructor(localName) {\n        super(\"null\", \"\", localName, false);\n    }\n    defaultValue() {\n        return null;\n    }\n    encode(writer, value) {\n        if (value != null) {\n            this._throwError(\"not null\", value);\n        }\n        return writer.writeBytes(Empty);\n    }\n    decode(reader) {\n        reader.readBytes(0);\n        return null;\n    }\n}\nexports.NullCoder = NullCoder;\n//# sourceMappingURL=null.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NumberCoder = void 0;\nconst index_js_1 = require(\"../../utils/index.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_MAX_UINT256 = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n/**\n *  @_ignore\n */\nclass NumberCoder extends abstract_coder_js_1.Coder {\n    size;\n    signed;\n    constructor(size, signed, localName) {\n        const name = ((signed ? \"int\" : \"uint\") + (size * 8));\n        super(name, name, localName, false);\n        (0, index_js_1.defineProperties)(this, { size, signed }, { size: \"number\", signed: \"boolean\" });\n    }\n    defaultValue() {\n        return 0;\n    }\n    encode(writer, _value) {\n        let value = (0, index_js_1.getBigInt)(typed_js_1.Typed.dereference(_value, this.type));\n        // Check bounds are safe for encoding\n        let maxUintValue = (0, index_js_1.mask)(BN_MAX_UINT256, abstract_coder_js_1.WordSize * 8);\n        if (this.signed) {\n            let bounds = (0, index_js_1.mask)(maxUintValue, (this.size * 8) - 1);\n            if (value > bounds || value < -(bounds + BN_1)) {\n                this._throwError(\"value out-of-bounds\", _value);\n            }\n            value = (0, index_js_1.toTwos)(value, 8 * abstract_coder_js_1.WordSize);\n        }\n        else if (value < BN_0 || value > (0, index_js_1.mask)(maxUintValue, this.size * 8)) {\n            this._throwError(\"value out-of-bounds\", _value);\n        }\n        return writer.writeValue(value);\n    }\n    decode(reader) {\n        let value = (0, index_js_1.mask)(reader.readValue(), this.size * 8);\n        if (this.signed) {\n            value = (0, index_js_1.fromTwos)(value, this.size * 8);\n        }\n        return value;\n    }\n}\nexports.NumberCoder = NumberCoder;\n//# sourceMappingURL=number.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.StringCoder = void 0;\nconst utf8_js_1 = require(\"../../utils/utf8.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst bytes_js_1 = require(\"./bytes.js\");\n/**\n *  @_ignore\n */\nclass StringCoder extends bytes_js_1.DynamicBytesCoder {\n    constructor(localName) {\n        super(\"string\", localName);\n    }\n    defaultValue() {\n        return \"\";\n    }\n    encode(writer, _value) {\n        return super.encode(writer, (0, utf8_js_1.toUtf8Bytes)(typed_js_1.Typed.dereference(_value, \"string\")));\n    }\n    decode(reader) {\n        return (0, utf8_js_1.toUtf8String)(super.decode(reader));\n    }\n}\nexports.StringCoder = StringCoder;\n//# sourceMappingURL=string.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TupleCoder = void 0;\nconst properties_js_1 = require(\"../../utils/properties.js\");\nconst typed_js_1 = require(\"../typed.js\");\nconst abstract_coder_js_1 = require(\"./abstract-coder.js\");\nconst array_js_1 = require(\"./array.js\");\n/**\n *  @_ignore\n */\nclass TupleCoder extends abstract_coder_js_1.Coder {\n    coders;\n    constructor(coders, localName) {\n        let dynamic = false;\n        const types = [];\n        coders.forEach((coder) => {\n            if (coder.dynamic) {\n                dynamic = true;\n            }\n            types.push(coder.type);\n        });\n        const type = (\"tuple(\" + types.join(\",\") + \")\");\n        super(\"tuple\", type, localName, dynamic);\n        (0, properties_js_1.defineProperties)(this, { coders: Object.freeze(coders.slice()) });\n    }\n    defaultValue() {\n        const values = [];\n        this.coders.forEach((coder) => {\n            values.push(coder.defaultValue());\n        });\n        // We only output named properties for uniquely named coders\n        const uniqueNames = this.coders.reduce((accum, coder) => {\n            const name = coder.localName;\n            if (name) {\n                if (!accum[name]) {\n                    accum[name] = 0;\n                }\n                accum[name]++;\n            }\n            return accum;\n        }, {});\n        // Add named values\n        this.coders.forEach((coder, index) => {\n            let name = coder.localName;\n            if (!name || uniqueNames[name] !== 1) {\n                return;\n            }\n            if (name === \"length\") {\n                name = \"_length\";\n            }\n            if (values[name] != null) {\n                return;\n            }\n            values[name] = values[index];\n        });\n        return Object.freeze(values);\n    }\n    encode(writer, _value) {\n        const value = typed_js_1.Typed.dereference(_value, \"tuple\");\n        return (0, array_js_1.pack)(writer, this.coders, value);\n    }\n    decode(reader) {\n        return (0, array_js_1.unpack)(reader, this.coders);\n    }\n}\nexports.TupleCoder = TupleCoder;\n//# sourceMappingURL=tuple.js.map","\"use strict\";\n/**\n *  A fragment is a single item from an ABI, which may represent any of:\n *\n *  - [Functions](FunctionFragment)\n *  - [Events](EventFragment)\n *  - [Constructors](ConstructorFragment)\n *  - Custom [Errors](ErrorFragment)\n *  - [Fallback or Receive](FallbackFragment) functions\n *\n *  @_subsection api/abi/abi-coder:Fragments  [about-fragments]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.StructFragment = exports.FunctionFragment = exports.FallbackFragment = exports.ConstructorFragment = exports.EventFragment = exports.ErrorFragment = exports.NamedFragment = exports.Fragment = exports.ParamType = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst index_js_2 = require(\"../hash/index.js\");\n;\n// [ \"a\", \"b\" ] => { \"a\": 1, \"b\": 1 }\nfunction setify(items) {\n    const result = new Set();\n    items.forEach((k) => result.add(k));\n    return Object.freeze(result);\n}\nconst _kwVisibDeploy = \"external public payable override\";\nconst KwVisibDeploy = setify(_kwVisibDeploy.split(\" \"));\n// Visibility Keywords\nconst _kwVisib = \"constant external internal payable private public pure view override\";\nconst KwVisib = setify(_kwVisib.split(\" \"));\nconst _kwTypes = \"constructor error event fallback function receive struct\";\nconst KwTypes = setify(_kwTypes.split(\" \"));\nconst _kwModifiers = \"calldata memory storage payable indexed\";\nconst KwModifiers = setify(_kwModifiers.split(\" \"));\nconst _kwOther = \"tuple returns\";\n// All Keywords\nconst _keywords = [_kwTypes, _kwModifiers, _kwOther, _kwVisib].join(\" \");\nconst Keywords = setify(_keywords.split(\" \"));\n// Single character tokens\nconst SimpleTokens = {\n    \"(\": \"OPEN_PAREN\", \")\": \"CLOSE_PAREN\",\n    \"[\": \"OPEN_BRACKET\", \"]\": \"CLOSE_BRACKET\",\n    \",\": \"COMMA\", \"@\": \"AT\"\n};\n// Parser regexes to consume the next token\nconst regexWhitespacePrefix = new RegExp(\"^(\\\\s*)\");\nconst regexNumberPrefix = new RegExp(\"^([0-9]+)\");\nconst regexIdPrefix = new RegExp(\"^([a-zA-Z$_][a-zA-Z0-9$_]*)\");\n// Parser regexs to check validity\nconst regexId = new RegExp(\"^([a-zA-Z$_][a-zA-Z0-9$_]*)$\");\nconst regexType = new RegExp(\"^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$\");\nclass TokenString {\n    #offset;\n    #tokens;\n    get offset() { return this.#offset; }\n    get length() { return this.#tokens.length - this.#offset; }\n    constructor(tokens) {\n        this.#offset = 0;\n        this.#tokens = tokens.slice();\n    }\n    clone() { return new TokenString(this.#tokens); }\n    reset() { this.#offset = 0; }\n    #subTokenString(from = 0, to = 0) {\n        return new TokenString(this.#tokens.slice(from, to).map((t) => {\n            return Object.freeze(Object.assign({}, t, {\n                match: (t.match - from),\n                linkBack: (t.linkBack - from),\n                linkNext: (t.linkNext - from),\n            }));\n        }));\n    }\n    // Pops and returns the value of the next token, if it is a keyword in allowed; throws if out of tokens\n    popKeyword(allowed) {\n        const top = this.peek();\n        if (top.type !== \"KEYWORD\" || !allowed.has(top.text)) {\n            throw new Error(`expected keyword ${top.text}`);\n        }\n        return this.pop().text;\n    }\n    // Pops and returns the value of the next token if it is `type`; throws if out of tokens\n    popType(type) {\n        if (this.peek().type !== type) {\n            const top = this.peek();\n            throw new Error(`expected ${type}; got ${top.type} ${JSON.stringify(top.text)}`);\n        }\n        return this.pop().text;\n    }\n    // Pops and returns a \"(\" TOKENS \")\"\n    popParen() {\n        const top = this.peek();\n        if (top.type !== \"OPEN_PAREN\") {\n            throw new Error(\"bad start\");\n        }\n        const result = this.#subTokenString(this.#offset + 1, top.match + 1);\n        this.#offset = top.match + 1;\n        return result;\n    }\n    // Pops and returns the items within \"(\" ITEM1 \",\" ITEM2 \",\" ... \")\"\n    popParams() {\n        const top = this.peek();\n        if (top.type !== \"OPEN_PAREN\") {\n            throw new Error(\"bad start\");\n        }\n        const result = [];\n        while (this.#offset < top.match - 1) {\n            const link = this.peek().linkNext;\n            result.push(this.#subTokenString(this.#offset + 1, link));\n            this.#offset = link;\n        }\n        this.#offset = top.match + 1;\n        return result;\n    }\n    // Returns the top Token, throwing if out of tokens\n    peek() {\n        if (this.#offset >= this.#tokens.length) {\n            throw new Error(\"out-of-bounds\");\n        }\n        return this.#tokens[this.#offset];\n    }\n    // Returns the next value, if it is a keyword in `allowed`\n    peekKeyword(allowed) {\n        const top = this.peekType(\"KEYWORD\");\n        return (top != null && allowed.has(top)) ? top : null;\n    }\n    // Returns the value of the next token if it is `type`\n    peekType(type) {\n        if (this.length === 0) {\n            return null;\n        }\n        const top = this.peek();\n        return (top.type === type) ? top.text : null;\n    }\n    // Returns the next token; throws if out of tokens\n    pop() {\n        const result = this.peek();\n        this.#offset++;\n        return result;\n    }\n    toString() {\n        const tokens = [];\n        for (let i = this.#offset; i < this.#tokens.length; i++) {\n            const token = this.#tokens[i];\n            tokens.push(`${token.type}:${token.text}`);\n        }\n        return `<TokenString ${tokens.join(\" \")}>`;\n    }\n}\nfunction lex(text) {\n    const tokens = [];\n    const throwError = (message) => {\n        const token = (offset < text.length) ? JSON.stringify(text[offset]) : \"$EOI\";\n        throw new Error(`invalid token ${token} at ${offset}: ${message}`);\n    };\n    let brackets = [];\n    let commas = [];\n    let offset = 0;\n    while (offset < text.length) {\n        // Strip off any leading whitespace\n        let cur = text.substring(offset);\n        let match = cur.match(regexWhitespacePrefix);\n        if (match) {\n            offset += match[1].length;\n            cur = text.substring(offset);\n        }\n        const token = { depth: brackets.length, linkBack: -1, linkNext: -1, match: -1, type: \"\", text: \"\", offset, value: -1 };\n        tokens.push(token);\n        let type = (SimpleTokens[cur[0]] || \"\");\n        if (type) {\n            token.type = type;\n            token.text = cur[0];\n            offset++;\n            if (type === \"OPEN_PAREN\") {\n                brackets.push(tokens.length - 1);\n                commas.push(tokens.length - 1);\n            }\n            else if (type == \"CLOSE_PAREN\") {\n                if (brackets.length === 0) {\n                    throwError(\"no matching open bracket\");\n                }\n                token.match = brackets.pop();\n                (tokens[token.match]).match = tokens.length - 1;\n                token.depth--;\n                token.linkBack = commas.pop();\n                (tokens[token.linkBack]).linkNext = tokens.length - 1;\n            }\n            else if (type === \"COMMA\") {\n                token.linkBack = commas.pop();\n                (tokens[token.linkBack]).linkNext = tokens.length - 1;\n                commas.push(tokens.length - 1);\n            }\n            else if (type === \"OPEN_BRACKET\") {\n                token.type = \"BRACKET\";\n            }\n            else if (type === \"CLOSE_BRACKET\") {\n                // Remove the CLOSE_BRACKET\n                let suffix = tokens.pop().text;\n                if (tokens.length > 0 && tokens[tokens.length - 1].type === \"NUMBER\") {\n                    const value = tokens.pop().text;\n                    suffix = value + suffix;\n                    (tokens[tokens.length - 1]).value = (0, index_js_1.getNumber)(value);\n                }\n                if (tokens.length === 0 || tokens[tokens.length - 1].type !== \"BRACKET\") {\n                    throw new Error(\"missing opening bracket\");\n                }\n                (tokens[tokens.length - 1]).text += suffix;\n            }\n            continue;\n        }\n        match = cur.match(regexIdPrefix);\n        if (match) {\n            token.text = match[1];\n            offset += token.text.length;\n            if (Keywords.has(token.text)) {\n                token.type = \"KEYWORD\";\n                continue;\n            }\n            if (token.text.match(regexType)) {\n                token.type = \"TYPE\";\n                continue;\n            }\n            token.type = \"ID\";\n            continue;\n        }\n        match = cur.match(regexNumberPrefix);\n        if (match) {\n            token.text = match[1];\n            token.type = \"NUMBER\";\n            offset += token.text.length;\n            continue;\n        }\n        throw new Error(`unexpected token ${JSON.stringify(cur[0])} at position ${offset}`);\n    }\n    return new TokenString(tokens.map((t) => Object.freeze(t)));\n}\n// Check only one of `allowed` is in `set`\nfunction allowSingle(set, allowed) {\n    let included = [];\n    for (const key in allowed.keys()) {\n        if (set.has(key)) {\n            included.push(key);\n        }\n    }\n    if (included.length > 1) {\n        throw new Error(`conflicting types: ${included.join(\", \")}`);\n    }\n}\n// Functions to process a Solidity Signature TokenString from left-to-right for...\n// ...the name with an optional type, returning the name\nfunction consumeName(type, tokens) {\n    if (tokens.peekKeyword(KwTypes)) {\n        const keyword = tokens.pop().text;\n        if (keyword !== type) {\n            throw new Error(`expected ${type}, got ${keyword}`);\n        }\n    }\n    return tokens.popType(\"ID\");\n}\n// ...all keywords matching allowed, returning the keywords\nfunction consumeKeywords(tokens, allowed) {\n    const keywords = new Set();\n    while (true) {\n        const keyword = tokens.peekType(\"KEYWORD\");\n        if (keyword == null || (allowed && !allowed.has(keyword))) {\n            break;\n        }\n        tokens.pop();\n        if (keywords.has(keyword)) {\n            throw new Error(`duplicate keywords: ${JSON.stringify(keyword)}`);\n        }\n        keywords.add(keyword);\n    }\n    return Object.freeze(keywords);\n}\n// ...all visibility keywords, returning the coalesced mutability\nfunction consumeMutability(tokens) {\n    let modifiers = consumeKeywords(tokens, KwVisib);\n    // Detect conflicting modifiers\n    allowSingle(modifiers, setify(\"constant payable nonpayable\".split(\" \")));\n    allowSingle(modifiers, setify(\"pure view payable nonpayable\".split(\" \")));\n    // Process mutability states\n    if (modifiers.has(\"view\")) {\n        return \"view\";\n    }\n    if (modifiers.has(\"pure\")) {\n        return \"pure\";\n    }\n    if (modifiers.has(\"payable\")) {\n        return \"payable\";\n    }\n    if (modifiers.has(\"nonpayable\")) {\n        return \"nonpayable\";\n    }\n    // Process legacy `constant` last\n    if (modifiers.has(\"constant\")) {\n        return \"view\";\n    }\n    return \"nonpayable\";\n}\n// ...a parameter list, returning the ParamType list\nfunction consumeParams(tokens, allowIndexed) {\n    return tokens.popParams().map((t) => ParamType.from(t, allowIndexed));\n}\n// ...a gas limit, returning a BigNumber or null if none\nfunction consumeGas(tokens) {\n    if (tokens.peekType(\"AT\")) {\n        tokens.pop();\n        if (tokens.peekType(\"NUMBER\")) {\n            return (0, index_js_1.getBigInt)(tokens.pop().text);\n        }\n        throw new Error(\"invalid gas\");\n    }\n    return null;\n}\nfunction consumeEoi(tokens) {\n    if (tokens.length) {\n        throw new Error(`unexpected tokens at offset ${tokens.offset}: ${tokens.toString()}`);\n    }\n}\nconst regexArrayType = new RegExp(/^(.*)\\[([0-9]*)\\]$/);\nfunction verifyBasicType(type) {\n    const match = type.match(regexType);\n    (0, index_js_1.assertArgument)(match, \"invalid type\", \"type\", type);\n    if (type === \"uint\") {\n        return \"uint256\";\n    }\n    if (type === \"int\") {\n        return \"int256\";\n    }\n    if (match[2]) {\n        // bytesXX\n        const length = parseInt(match[2]);\n        (0, index_js_1.assertArgument)(length !== 0 && length <= 32, \"invalid bytes length\", \"type\", type);\n    }\n    else if (match[3]) {\n        // intXX or uintXX\n        const size = parseInt(match[3]);\n        (0, index_js_1.assertArgument)(size !== 0 && size <= 256 && (size % 8) === 0, \"invalid numeric width\", \"type\", type);\n    }\n    return type;\n}\n// Make the Fragment constructors effectively private\nconst _guard = {};\nconst internal = Symbol.for(\"_ethers_internal\");\nconst ParamTypeInternal = \"_ParamTypeInternal\";\nconst ErrorFragmentInternal = \"_ErrorInternal\";\nconst EventFragmentInternal = \"_EventInternal\";\nconst ConstructorFragmentInternal = \"_ConstructorInternal\";\nconst FallbackFragmentInternal = \"_FallbackInternal\";\nconst FunctionFragmentInternal = \"_FunctionInternal\";\nconst StructFragmentInternal = \"_StructInternal\";\n/**\n *  Each input and output of a [[Fragment]] is an Array of **ParamType**.\n */\nclass ParamType {\n    /**\n     *  The local name of the parameter (or ``\"\"`` if unbound)\n     */\n    name;\n    /**\n     *  The fully qualified type (e.g. ``\"address\"``, ``\"tuple(address)\"``,\n     *  ``\"uint256[3][]\"``)\n     */\n    type;\n    /**\n     *  The base type (e.g. ``\"address\"``, ``\"tuple\"``, ``\"array\"``)\n     */\n    baseType;\n    /**\n     *  True if the parameters is indexed.\n     *\n     *  For non-indexable types this is ``null``.\n     */\n    indexed;\n    /**\n     *  The components for the tuple.\n     *\n     *  For non-tuple types this is ``null``.\n     */\n    components;\n    /**\n     *  The array length, or ``-1`` for dynamic-lengthed arrays.\n     *\n     *  For non-array types this is ``null``.\n     */\n    arrayLength;\n    /**\n     *  The type of each child in the array.\n     *\n     *  For non-array types this is ``null``.\n     */\n    arrayChildren;\n    /**\n     *  @private\n     */\n    constructor(guard, name, type, baseType, indexed, components, arrayLength, arrayChildren) {\n        (0, index_js_1.assertPrivate)(guard, _guard, \"ParamType\");\n        Object.defineProperty(this, internal, { value: ParamTypeInternal });\n        if (components) {\n            components = Object.freeze(components.slice());\n        }\n        if (baseType === \"array\") {\n            if (arrayLength == null || arrayChildren == null) {\n                throw new Error(\"\");\n            }\n        }\n        else if (arrayLength != null || arrayChildren != null) {\n            throw new Error(\"\");\n        }\n        if (baseType === \"tuple\") {\n            if (components == null) {\n                throw new Error(\"\");\n            }\n        }\n        else if (components != null) {\n            throw new Error(\"\");\n        }\n        (0, index_js_1.defineProperties)(this, {\n            name, type, baseType, indexed, components, arrayLength, arrayChildren\n        });\n    }\n    /**\n     *  Return a string representation of this type.\n     *\n     *  For example,\n     *\n     *  ``sighash\" => \"(uint256,address)\"``\n     *\n     *  ``\"minimal\" => \"tuple(uint256,address) indexed\"``\n     *\n     *  ``\"full\" => \"tuple(uint256 foo, address bar) indexed baz\"``\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            const name = this.name || \"\";\n            if (this.isArray()) {\n                const result = JSON.parse(this.arrayChildren.format(\"json\"));\n                result.name = name;\n                result.type += `[${(this.arrayLength < 0 ? \"\" : String(this.arrayLength))}]`;\n                return JSON.stringify(result);\n            }\n            const result = {\n                type: ((this.baseType === \"tuple\") ? \"tuple\" : this.type),\n                name\n            };\n            if (typeof (this.indexed) === \"boolean\") {\n                result.indexed = this.indexed;\n            }\n            if (this.isTuple()) {\n                result.components = this.components.map((c) => JSON.parse(c.format(format)));\n            }\n            return JSON.stringify(result);\n        }\n        let result = \"\";\n        // Array\n        if (this.isArray()) {\n            result += this.arrayChildren.format(format);\n            result += `[${(this.arrayLength < 0 ? \"\" : String(this.arrayLength))}]`;\n        }\n        else {\n            if (this.isTuple()) {\n                result += \"(\" + this.components.map((comp) => comp.format(format)).join((format === \"full\") ? \", \" : \",\") + \")\";\n            }\n            else {\n                result += this.type;\n            }\n        }\n        if (format !== \"sighash\") {\n            if (this.indexed === true) {\n                result += \" indexed\";\n            }\n            if (format === \"full\" && this.name) {\n                result += \" \" + this.name;\n            }\n        }\n        return result;\n    }\n    /**\n     *  Returns true if %%this%% is an Array type.\n     *\n     *  This provides a type gaurd ensuring that [[arrayChildren]]\n     *  and [[arrayLength]] are non-null.\n     */\n    isArray() {\n        return (this.baseType === \"array\");\n    }\n    /**\n     *  Returns true if %%this%% is a Tuple type.\n     *\n     *  This provides a type gaurd ensuring that [[components]]\n     *  is non-null.\n     */\n    isTuple() {\n        return (this.baseType === \"tuple\");\n    }\n    /**\n     *  Returns true if %%this%% is an Indexable type.\n     *\n     *  This provides a type gaurd ensuring that [[indexed]]\n     *  is non-null.\n     */\n    isIndexable() {\n        return (this.indexed != null);\n    }\n    /**\n     *  Walks the **ParamType** with %%value%%, calling %%process%%\n     *  on each type, destructing the %%value%% recursively.\n     */\n    walk(value, process) {\n        if (this.isArray()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid array value\");\n            }\n            if (this.arrayLength !== -1 && value.length !== this.arrayLength) {\n                throw new Error(\"array is wrong length\");\n            }\n            const _this = this;\n            return value.map((v) => (_this.arrayChildren.walk(v, process)));\n        }\n        if (this.isTuple()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid tuple value\");\n            }\n            if (value.length !== this.components.length) {\n                throw new Error(\"array is wrong length\");\n            }\n            const _this = this;\n            return value.map((v, i) => (_this.components[i].walk(v, process)));\n        }\n        return process(this.type, value);\n    }\n    #walkAsync(promises, value, process, setValue) {\n        if (this.isArray()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid array value\");\n            }\n            if (this.arrayLength !== -1 && value.length !== this.arrayLength) {\n                throw new Error(\"array is wrong length\");\n            }\n            const childType = this.arrayChildren;\n            const result = value.slice();\n            result.forEach((value, index) => {\n                childType.#walkAsync(promises, value, process, (value) => {\n                    result[index] = value;\n                });\n            });\n            setValue(result);\n            return;\n        }\n        if (this.isTuple()) {\n            const components = this.components;\n            // Convert the object into an array\n            let result;\n            if (Array.isArray(value)) {\n                result = value.slice();\n            }\n            else {\n                if (value == null || typeof (value) !== \"object\") {\n                    throw new Error(\"invalid tuple value\");\n                }\n                result = components.map((param) => {\n                    if (!param.name) {\n                        throw new Error(\"cannot use object value with unnamed components\");\n                    }\n                    if (!(param.name in value)) {\n                        throw new Error(`missing value for component ${param.name}`);\n                    }\n                    return value[param.name];\n                });\n            }\n            if (result.length !== this.components.length) {\n                throw new Error(\"array is wrong length\");\n            }\n            result.forEach((value, index) => {\n                components[index].#walkAsync(promises, value, process, (value) => {\n                    result[index] = value;\n                });\n            });\n            setValue(result);\n            return;\n        }\n        const result = process(this.type, value);\n        if (result.then) {\n            promises.push((async function () { setValue(await result); })());\n        }\n        else {\n            setValue(result);\n        }\n    }\n    /**\n     *  Walks the **ParamType** with %%value%%, asynchronously calling\n     *  %%process%% on each type, destructing the %%value%% recursively.\n     *\n     *  This can be used to resolve ENS names by walking and resolving each\n     *  ``\"address\"`` type.\n     */\n    async walkAsync(value, process) {\n        const promises = [];\n        const result = [value];\n        this.#walkAsync(promises, value, process, (value) => {\n            result[0] = value;\n        });\n        if (promises.length) {\n            await Promise.all(promises);\n        }\n        return result[0];\n    }\n    /**\n     *  Creates a new **ParamType** for %%obj%%.\n     *\n     *  If %%allowIndexed%% then the ``indexed`` keyword is permitted,\n     *  otherwise the ``indexed`` keyword will throw an error.\n     */\n    static from(obj, allowIndexed) {\n        if (ParamType.isParamType(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return ParamType.from(lex(obj), allowIndexed);\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid param type\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            let type = \"\", baseType = \"\";\n            let comps = null;\n            if (consumeKeywords(obj, setify([\"tuple\"])).has(\"tuple\") || obj.peekType(\"OPEN_PAREN\")) {\n                // Tuple\n                baseType = \"tuple\";\n                comps = obj.popParams().map((t) => ParamType.from(t));\n                type = `tuple(${comps.map((c) => c.format()).join(\",\")})`;\n            }\n            else {\n                // Normal\n                type = verifyBasicType(obj.popType(\"TYPE\"));\n                baseType = type;\n            }\n            // Check for Array\n            let arrayChildren = null;\n            let arrayLength = null;\n            while (obj.length && obj.peekType(\"BRACKET\")) {\n                const bracket = obj.pop(); //arrays[i];\n                arrayChildren = new ParamType(_guard, \"\", type, baseType, null, comps, arrayLength, arrayChildren);\n                arrayLength = bracket.value;\n                type += bracket.text;\n                baseType = \"array\";\n                comps = null;\n            }\n            let indexed = null;\n            const keywords = consumeKeywords(obj, KwModifiers);\n            if (keywords.has(\"indexed\")) {\n                if (!allowIndexed) {\n                    throw new Error(\"\");\n                }\n                indexed = true;\n            }\n            const name = (obj.peekType(\"ID\") ? obj.pop().text : \"\");\n            if (obj.length) {\n                throw new Error(\"leftover tokens\");\n            }\n            return new ParamType(_guard, name, type, baseType, indexed, comps, arrayLength, arrayChildren);\n        }\n        const name = obj.name;\n        (0, index_js_1.assertArgument)(!name || (typeof (name) === \"string\" && name.match(regexId)), \"invalid name\", \"obj.name\", name);\n        let indexed = obj.indexed;\n        if (indexed != null) {\n            (0, index_js_1.assertArgument)(allowIndexed, \"parameter cannot be indexed\", \"obj.indexed\", obj.indexed);\n            indexed = !!indexed;\n        }\n        let type = obj.type;\n        let arrayMatch = type.match(regexArrayType);\n        if (arrayMatch) {\n            const arrayLength = parseInt(arrayMatch[2] || \"-1\");\n            const arrayChildren = ParamType.from({\n                type: arrayMatch[1],\n                components: obj.components\n            });\n            return new ParamType(_guard, name || \"\", type, \"array\", indexed, null, arrayLength, arrayChildren);\n        }\n        if (type === \"tuple\" || type.startsWith(\"tuple(\" /* fix: ) */) || type.startsWith(\"(\" /* fix: ) */)) {\n            const comps = (obj.components != null) ? obj.components.map((c) => ParamType.from(c)) : null;\n            const tuple = new ParamType(_guard, name || \"\", type, \"tuple\", indexed, comps, null, null);\n            // @TODO: use lexer to validate and normalize type\n            return tuple;\n        }\n        type = verifyBasicType(obj.type);\n        return new ParamType(_guard, name || \"\", type, type, indexed, null, null, null);\n    }\n    /**\n     *  Returns true if %%value%% is a **ParamType**.\n     */\n    static isParamType(value) {\n        return (value && value[internal] === ParamTypeInternal);\n    }\n}\nexports.ParamType = ParamType;\n/**\n *  An abstract class to represent An individual fragment from a parse ABI.\n */\nclass Fragment {\n    /**\n     *  The type of the fragment.\n     */\n    type;\n    /**\n     *  The inputs for the fragment.\n     */\n    inputs;\n    /**\n     *  @private\n     */\n    constructor(guard, type, inputs) {\n        (0, index_js_1.assertPrivate)(guard, _guard, \"Fragment\");\n        inputs = Object.freeze(inputs.slice());\n        (0, index_js_1.defineProperties)(this, { type, inputs });\n    }\n    /**\n     *  Creates a new **Fragment** for %%obj%%, wich can be any supported\n     *  ABI frgament type.\n     */\n    static from(obj) {\n        if (typeof (obj) === \"string\") {\n            // Try parsing JSON...\n            try {\n                Fragment.from(JSON.parse(obj));\n            }\n            catch (e) { }\n            // ...otherwise, use the human-readable lexer\n            return Fragment.from(lex(obj));\n        }\n        if (obj instanceof TokenString) {\n            // Human-readable ABI (already lexed)\n            const type = obj.peekKeyword(KwTypes);\n            switch (type) {\n                case \"constructor\": return ConstructorFragment.from(obj);\n                case \"error\": return ErrorFragment.from(obj);\n                case \"event\": return EventFragment.from(obj);\n                case \"fallback\":\n                case \"receive\":\n                    return FallbackFragment.from(obj);\n                case \"function\": return FunctionFragment.from(obj);\n                case \"struct\": return StructFragment.from(obj);\n            }\n        }\n        else if (typeof (obj) === \"object\") {\n            // JSON ABI\n            switch (obj.type) {\n                case \"constructor\": return ConstructorFragment.from(obj);\n                case \"error\": return ErrorFragment.from(obj);\n                case \"event\": return EventFragment.from(obj);\n                case \"fallback\":\n                case \"receive\":\n                    return FallbackFragment.from(obj);\n                case \"function\": return FunctionFragment.from(obj);\n                case \"struct\": return StructFragment.from(obj);\n            }\n            (0, index_js_1.assert)(false, `unsupported type: ${obj.type}`, \"UNSUPPORTED_OPERATION\", {\n                operation: \"Fragment.from\"\n            });\n        }\n        (0, index_js_1.assertArgument)(false, \"unsupported frgament object\", \"obj\", obj);\n    }\n    /**\n     *  Returns true if %%value%% is a [[ConstructorFragment]].\n     */\n    static isConstructor(value) {\n        return ConstructorFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is an [[ErrorFragment]].\n     */\n    static isError(value) {\n        return ErrorFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is an [[EventFragment]].\n     */\n    static isEvent(value) {\n        return EventFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is a [[FunctionFragment]].\n     */\n    static isFunction(value) {\n        return FunctionFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is a [[StructFragment]].\n     */\n    static isStruct(value) {\n        return StructFragment.isFragment(value);\n    }\n}\nexports.Fragment = Fragment;\n/**\n *  An abstract class to represent An individual fragment\n *  which has a name from a parse ABI.\n */\nclass NamedFragment extends Fragment {\n    /**\n     *  The name of the fragment.\n     */\n    name;\n    /**\n     *  @private\n     */\n    constructor(guard, type, name, inputs) {\n        super(guard, type, inputs);\n        (0, index_js_1.assertArgument)(typeof (name) === \"string\" && name.match(regexId), \"invalid identifier\", \"name\", name);\n        inputs = Object.freeze(inputs.slice());\n        (0, index_js_1.defineProperties)(this, { name });\n    }\n}\nexports.NamedFragment = NamedFragment;\nfunction joinParams(format, params) {\n    return \"(\" + params.map((p) => p.format(format)).join((format === \"full\") ? \", \" : \",\") + \")\";\n}\n/**\n *  A Fragment which represents a //Custom Error//.\n */\nclass ErrorFragment extends NamedFragment {\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs) {\n        super(guard, \"error\", name, inputs);\n        Object.defineProperty(this, internal, { value: ErrorFragmentInternal });\n    }\n    /**\n     *  The Custom Error selector.\n     */\n    get selector() {\n        return (0, index_js_2.id)(this.format(\"sighash\")).substring(0, 10);\n    }\n    /**\n     *  Returns a string representation of this fragment as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"error\",\n                name: this.name,\n                inputs: this.inputs.map((input) => JSON.parse(input.format(format))),\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"error\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        return result.join(\" \");\n    }\n    /**\n     *  Returns a new **ErrorFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (ErrorFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            return ErrorFragment.from(lex(obj));\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"error\", obj);\n            const inputs = consumeParams(obj);\n            consumeEoi(obj);\n            return new ErrorFragment(_guard, name, inputs);\n        }\n        return new ErrorFragment(_guard, obj.name, obj.inputs ? obj.inputs.map(ParamType.from) : []);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is an\n     *  **ErrorFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === ErrorFragmentInternal);\n    }\n}\nexports.ErrorFragment = ErrorFragment;\n/**\n *  A Fragment which represents an Event.\n */\nclass EventFragment extends NamedFragment {\n    /**\n     *  Whether this event is anonymous.\n     */\n    anonymous;\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs, anonymous) {\n        super(guard, \"event\", name, inputs);\n        Object.defineProperty(this, internal, { value: EventFragmentInternal });\n        (0, index_js_1.defineProperties)(this, { anonymous });\n    }\n    /**\n     *  The Event topic hash.\n     */\n    get topicHash() {\n        return (0, index_js_2.id)(this.format(\"sighash\"));\n    }\n    /**\n     *  Returns a string representation of this event as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"event\",\n                anonymous: this.anonymous,\n                name: this.name,\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format)))\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"event\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        if (format !== \"sighash\" && this.anonymous) {\n            result.push(\"anonymous\");\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Return the topic hash for an event with %%name%% and %%params%%.\n     */\n    static getTopicHash(name, params) {\n        params = (params || []).map((p) => ParamType.from(p));\n        const fragment = new EventFragment(_guard, name, params, false);\n        return fragment.topicHash;\n    }\n    /**\n     *  Returns a new **EventFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (EventFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return EventFragment.from(lex(obj));\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid event fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"event\", obj);\n            const inputs = consumeParams(obj, true);\n            const anonymous = !!consumeKeywords(obj, setify([\"anonymous\"])).has(\"anonymous\");\n            consumeEoi(obj);\n            return new EventFragment(_guard, name, inputs, anonymous);\n        }\n        return new EventFragment(_guard, obj.name, obj.inputs ? obj.inputs.map((p) => ParamType.from(p, true)) : [], !!obj.anonymous);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is an\n     *  **EventFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === EventFragmentInternal);\n    }\n}\nexports.EventFragment = EventFragment;\n/**\n *  A Fragment which represents a constructor.\n */\nclass ConstructorFragment extends Fragment {\n    /**\n     *  Whether the constructor can receive an endowment.\n     */\n    payable;\n    /**\n     *  The recommended gas limit for deployment or ``null``.\n     */\n    gas;\n    /**\n     *  @private\n     */\n    constructor(guard, type, inputs, payable, gas) {\n        super(guard, type, inputs);\n        Object.defineProperty(this, internal, { value: ConstructorFragmentInternal });\n        (0, index_js_1.defineProperties)(this, { payable, gas });\n    }\n    /**\n     *  Returns a string representation of this constructor as %%format%%.\n     */\n    format(format) {\n        (0, index_js_1.assert)(format != null && format !== \"sighash\", \"cannot format a constructor for sighash\", \"UNSUPPORTED_OPERATION\", { operation: \"format(sighash)\" });\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"constructor\",\n                stateMutability: (this.payable ? \"payable\" : \"undefined\"),\n                payable: this.payable,\n                gas: ((this.gas != null) ? this.gas : undefined),\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format)))\n            });\n        }\n        const result = [`constructor${joinParams(format, this.inputs)}`];\n        if (this.payable) {\n            result.push(\"payable\");\n        }\n        if (this.gas != null) {\n            result.push(`@${this.gas.toString()}`);\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Returns a new **ConstructorFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (ConstructorFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return ConstructorFragment.from(lex(obj));\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid constuctor fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            consumeKeywords(obj, setify([\"constructor\"]));\n            const inputs = consumeParams(obj);\n            const payable = !!consumeKeywords(obj, KwVisibDeploy).has(\"payable\");\n            const gas = consumeGas(obj);\n            consumeEoi(obj);\n            return new ConstructorFragment(_guard, \"constructor\", inputs, payable, gas);\n        }\n        return new ConstructorFragment(_guard, \"constructor\", obj.inputs ? obj.inputs.map(ParamType.from) : [], !!obj.payable, (obj.gas != null) ? obj.gas : null);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **ConstructorFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === ConstructorFragmentInternal);\n    }\n}\nexports.ConstructorFragment = ConstructorFragment;\n/**\n *  A Fragment which represents a method.\n */\nclass FallbackFragment extends Fragment {\n    /**\n     *  If the function can be sent value during invocation.\n     */\n    payable;\n    constructor(guard, inputs, payable) {\n        super(guard, \"fallback\", inputs);\n        Object.defineProperty(this, internal, { value: FallbackFragmentInternal });\n        (0, index_js_1.defineProperties)(this, { payable });\n    }\n    /**\n     *  Returns a string representation of this fallback as %%format%%.\n     */\n    format(format) {\n        const type = ((this.inputs.length === 0) ? \"receive\" : \"fallback\");\n        if (format === \"json\") {\n            const stateMutability = (this.payable ? \"payable\" : \"nonpayable\");\n            return JSON.stringify({ type, stateMutability });\n        }\n        return `${type}()${this.payable ? \" payable\" : \"\"}`;\n    }\n    /**\n     *  Returns a new **FallbackFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (FallbackFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return FallbackFragment.from(lex(obj));\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid fallback fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const errorObj = obj.toString();\n            const topIsValid = obj.peekKeyword(setify([\"fallback\", \"receive\"]));\n            (0, index_js_1.assertArgument)(topIsValid, \"type must be fallback or receive\", \"obj\", errorObj);\n            const type = obj.popKeyword(setify([\"fallback\", \"receive\"]));\n            // receive()\n            if (type === \"receive\") {\n                const inputs = consumeParams(obj);\n                (0, index_js_1.assertArgument)(inputs.length === 0, `receive cannot have arguments`, \"obj.inputs\", inputs);\n                consumeKeywords(obj, setify([\"payable\"]));\n                consumeEoi(obj);\n                return new FallbackFragment(_guard, [], true);\n            }\n            // fallback() [payable]\n            // fallback(bytes) [payable] returns (bytes)\n            let inputs = consumeParams(obj);\n            if (inputs.length) {\n                (0, index_js_1.assertArgument)(inputs.length === 1 && inputs[0].type === \"bytes\", \"invalid fallback inputs\", \"obj.inputs\", inputs.map((i) => i.format(\"minimal\")).join(\", \"));\n            }\n            else {\n                inputs = [ParamType.from(\"bytes\")];\n            }\n            const mutability = consumeMutability(obj);\n            (0, index_js_1.assertArgument)(mutability === \"nonpayable\" || mutability === \"payable\", \"fallback cannot be constants\", \"obj.stateMutability\", mutability);\n            if (consumeKeywords(obj, setify([\"returns\"])).has(\"returns\")) {\n                const outputs = consumeParams(obj);\n                (0, index_js_1.assertArgument)(outputs.length === 1 && outputs[0].type === \"bytes\", \"invalid fallback outputs\", \"obj.outputs\", outputs.map((i) => i.format(\"minimal\")).join(\", \"));\n            }\n            consumeEoi(obj);\n            return new FallbackFragment(_guard, inputs, mutability === \"payable\");\n        }\n        if (obj.type === \"receive\") {\n            return new FallbackFragment(_guard, [], true);\n        }\n        if (obj.type === \"fallback\") {\n            const inputs = [ParamType.from(\"bytes\")];\n            const payable = (obj.stateMutability === \"payable\");\n            return new FallbackFragment(_guard, inputs, payable);\n        }\n        (0, index_js_1.assertArgument)(false, \"invalid fallback description\", \"obj\", obj);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **FallbackFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === FallbackFragmentInternal);\n    }\n}\nexports.FallbackFragment = FallbackFragment;\n/**\n *  A Fragment which represents a method.\n */\nclass FunctionFragment extends NamedFragment {\n    /**\n     *  If the function is constant (e.g. ``pure`` or ``view`` functions).\n     */\n    constant;\n    /**\n     *  The returned types for the result of calling this function.\n     */\n    outputs;\n    /**\n     *  The state mutability (e.g. ``payable``, ``nonpayable``, ``view``\n     *  or ``pure``)\n     */\n    stateMutability;\n    /**\n     *  If the function can be sent value during invocation.\n     */\n    payable;\n    /**\n     *  The recommended gas limit to send when calling this function.\n     */\n    gas;\n    /**\n     *  @private\n     */\n    constructor(guard, name, stateMutability, inputs, outputs, gas) {\n        super(guard, \"function\", name, inputs);\n        Object.defineProperty(this, internal, { value: FunctionFragmentInternal });\n        outputs = Object.freeze(outputs.slice());\n        const constant = (stateMutability === \"view\" || stateMutability === \"pure\");\n        const payable = (stateMutability === \"payable\");\n        (0, index_js_1.defineProperties)(this, { constant, gas, outputs, payable, stateMutability });\n    }\n    /**\n     *  The Function selector.\n     */\n    get selector() {\n        return (0, index_js_2.id)(this.format(\"sighash\")).substring(0, 10);\n    }\n    /**\n     *  Returns a string representation of this function as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"function\",\n                name: this.name,\n                constant: this.constant,\n                stateMutability: ((this.stateMutability !== \"nonpayable\") ? this.stateMutability : undefined),\n                payable: this.payable,\n                gas: ((this.gas != null) ? this.gas : undefined),\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format))),\n                outputs: this.outputs.map((o) => JSON.parse(o.format(format))),\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"function\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        if (format !== \"sighash\") {\n            if (this.stateMutability !== \"nonpayable\") {\n                result.push(this.stateMutability);\n            }\n            if (this.outputs && this.outputs.length) {\n                result.push(\"returns\");\n                result.push(joinParams(format, this.outputs));\n            }\n            if (this.gas != null) {\n                result.push(`@${this.gas.toString()}`);\n            }\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Return the selector for a function with %%name%% and %%params%%.\n     */\n    static getSelector(name, params) {\n        params = (params || []).map((p) => ParamType.from(p));\n        const fragment = new FunctionFragment(_guard, name, \"view\", params, [], null);\n        return fragment.selector;\n    }\n    /**\n     *  Returns a new **FunctionFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (FunctionFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return FunctionFragment.from(lex(obj));\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid function fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"function\", obj);\n            const inputs = consumeParams(obj);\n            const mutability = consumeMutability(obj);\n            let outputs = [];\n            if (consumeKeywords(obj, setify([\"returns\"])).has(\"returns\")) {\n                outputs = consumeParams(obj);\n            }\n            const gas = consumeGas(obj);\n            consumeEoi(obj);\n            return new FunctionFragment(_guard, name, mutability, inputs, outputs, gas);\n        }\n        let stateMutability = obj.stateMutability;\n        // Use legacy Solidity ABI logic if stateMutability is missing\n        if (stateMutability == null) {\n            stateMutability = \"payable\";\n            if (typeof (obj.constant) === \"boolean\") {\n                stateMutability = \"view\";\n                if (!obj.constant) {\n                    stateMutability = \"payable\";\n                    if (typeof (obj.payable) === \"boolean\" && !obj.payable) {\n                        stateMutability = \"nonpayable\";\n                    }\n                }\n            }\n            else if (typeof (obj.payable) === \"boolean\" && !obj.payable) {\n                stateMutability = \"nonpayable\";\n            }\n        }\n        // @TODO: verifyState for stateMutability (e.g. throw if\n        //        payable: false but stateMutability is \"nonpayable\")\n        return new FunctionFragment(_guard, obj.name, stateMutability, obj.inputs ? obj.inputs.map(ParamType.from) : [], obj.outputs ? obj.outputs.map(ParamType.from) : [], (obj.gas != null) ? obj.gas : null);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **FunctionFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === FunctionFragmentInternal);\n    }\n}\nexports.FunctionFragment = FunctionFragment;\n/**\n *  A Fragment which represents a structure.\n */\nclass StructFragment extends NamedFragment {\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs) {\n        super(guard, \"struct\", name, inputs);\n        Object.defineProperty(this, internal, { value: StructFragmentInternal });\n    }\n    /**\n     *  Returns a string representation of this struct as %%format%%.\n     */\n    format() {\n        throw new Error(\"@TODO\");\n    }\n    /**\n     *  Returns a new **StructFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (typeof (obj) === \"string\") {\n            try {\n                return StructFragment.from(lex(obj));\n            }\n            catch (error) {\n                (0, index_js_1.assertArgument)(false, \"invalid struct fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"struct\", obj);\n            const inputs = consumeParams(obj);\n            consumeEoi(obj);\n            return new StructFragment(_guard, name, inputs);\n        }\n        return new StructFragment(_guard, obj.name, obj.inputs ? obj.inputs.map(ParamType.from) : []);\n    }\n    // @TODO: fix this return type\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **StructFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === StructFragmentInternal);\n    }\n}\nexports.StructFragment = StructFragment;\n//# sourceMappingURL=fragments.js.map","\"use strict\";\n/**\n *  The Application Binary Interface (ABI) describes how method input\n *  parameters should be encoded, their results decoded, and how to\n *  decode events and errors.\n *\n *  See [About ABIs](docs-abi) for more details how they are used.\n *\n *  @_section api/abi:Application Binary Interface  [about-abi]\n *  @_navTitle: ABI\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Typed = exports.Result = exports.TransactionDescription = exports.LogDescription = exports.ErrorDescription = exports.Interface = exports.Indexed = exports.checkResultErrors = exports.StructFragment = exports.ParamType = exports.NamedFragment = exports.FunctionFragment = exports.Fragment = exports.FallbackFragment = exports.EventFragment = exports.ErrorFragment = exports.ConstructorFragment = exports.encodeBytes32String = exports.decodeBytes32String = exports.AbiCoder = void 0;\n//////\nvar abi_coder_js_1 = require(\"./abi-coder.js\");\nObject.defineProperty(exports, \"AbiCoder\", { enumerable: true, get: function () { return abi_coder_js_1.AbiCoder; } });\nvar bytes32_js_1 = require(\"./bytes32.js\");\nObject.defineProperty(exports, \"decodeBytes32String\", { enumerable: true, get: function () { return bytes32_js_1.decodeBytes32String; } });\nObject.defineProperty(exports, \"encodeBytes32String\", { enumerable: true, get: function () { return bytes32_js_1.encodeBytes32String; } });\nvar fragments_js_1 = require(\"./fragments.js\");\nObject.defineProperty(exports, \"ConstructorFragment\", { enumerable: true, get: function () { return fragments_js_1.ConstructorFragment; } });\nObject.defineProperty(exports, \"ErrorFragment\", { enumerable: true, get: function () { return fragments_js_1.ErrorFragment; } });\nObject.defineProperty(exports, \"EventFragment\", { enumerable: true, get: function () { return fragments_js_1.EventFragment; } });\nObject.defineProperty(exports, \"FallbackFragment\", { enumerable: true, get: function () { return fragments_js_1.FallbackFragment; } });\nObject.defineProperty(exports, \"Fragment\", { enumerable: true, get: function () { return fragments_js_1.Fragment; } });\nObject.defineProperty(exports, \"FunctionFragment\", { enumerable: true, get: function () { return fragments_js_1.FunctionFragment; } });\nObject.defineProperty(exports, \"NamedFragment\", { enumerable: true, get: function () { return fragments_js_1.NamedFragment; } });\nObject.defineProperty(exports, \"ParamType\", { enumerable: true, get: function () { return fragments_js_1.ParamType; } });\nObject.defineProperty(exports, \"StructFragment\", { enumerable: true, get: function () { return fragments_js_1.StructFragment; } });\nvar interface_js_1 = require(\"./interface.js\");\nObject.defineProperty(exports, \"checkResultErrors\", { enumerable: true, get: function () { return interface_js_1.checkResultErrors; } });\nObject.defineProperty(exports, \"Indexed\", { enumerable: true, get: function () { return interface_js_1.Indexed; } });\nObject.defineProperty(exports, \"Interface\", { enumerable: true, get: function () { return interface_js_1.Interface; } });\nObject.defineProperty(exports, \"ErrorDescription\", { enumerable: true, get: function () { return interface_js_1.ErrorDescription; } });\nObject.defineProperty(exports, \"LogDescription\", { enumerable: true, get: function () { return interface_js_1.LogDescription; } });\nObject.defineProperty(exports, \"TransactionDescription\", { enumerable: true, get: function () { return interface_js_1.TransactionDescription; } });\nObject.defineProperty(exports, \"Result\", { enumerable: true, get: function () { return interface_js_1.Result; } });\nvar typed_js_1 = require(\"./typed.js\");\nObject.defineProperty(exports, \"Typed\", { enumerable: true, get: function () { return typed_js_1.Typed; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n *  The Interface class is a low-level class that accepts an\n *  ABI and provides all the necessary functionality to encode\n *  and decode paramaters to and results from methods, events\n *  and errors.\n *\n *  It also provides several convenience methods to automatically\n *  search and find matching transactions and events to parse them.\n *\n *  @_subsection api/abi:Interfaces  [interfaces]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Interface = exports.Indexed = exports.ErrorDescription = exports.TransactionDescription = exports.LogDescription = exports.Result = exports.checkResultErrors = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../hash/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst abi_coder_js_1 = require(\"./abi-coder.js\");\nconst abstract_coder_js_1 = require(\"./coders/abstract-coder.js\");\nObject.defineProperty(exports, \"checkResultErrors\", { enumerable: true, get: function () { return abstract_coder_js_1.checkResultErrors; } });\nObject.defineProperty(exports, \"Result\", { enumerable: true, get: function () { return abstract_coder_js_1.Result; } });\nconst fragments_js_1 = require(\"./fragments.js\");\nconst typed_js_1 = require(\"./typed.js\");\n/**\n *  When using the [[Interface-parseLog]] to automatically match a Log to its event\n *  for parsing, a **LogDescription** is returned.\n */\nclass LogDescription {\n    /**\n     *  The matching fragment for the ``topic0``.\n     */\n    fragment;\n    /**\n     *  The name of the Event.\n     */\n    name;\n    /**\n     *  The full Event signature.\n     */\n    signature;\n    /**\n     *  The topic hash for the Event.\n     */\n    topic;\n    /**\n     *  The arguments passed into the Event with ``emit``.\n     */\n    args;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, topic, args) {\n        const name = fragment.name, signature = fragment.format();\n        (0, index_js_3.defineProperties)(this, {\n            fragment, name, signature, topic, args\n        });\n    }\n}\nexports.LogDescription = LogDescription;\n/**\n *  When using the [[Interface-parseTransaction]] to automatically match\n *  a transaction data to its function for parsing,\n *  a **TransactionDescription** is returned.\n */\nclass TransactionDescription {\n    /**\n     *  The matching fragment from the transaction ``data``.\n     */\n    fragment;\n    /**\n     *  The name of the Function from the transaction ``data``.\n     */\n    name;\n    /**\n     *  The arguments passed to the Function from the transaction ``data``.\n     */\n    args;\n    /**\n     *  The full Function signature from the transaction ``data``.\n     */\n    signature;\n    /**\n     *  The selector for the Function from the transaction ``data``.\n     */\n    selector;\n    /**\n     *  The ``value`` (in wei) from the transaction.\n     */\n    value;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, selector, args, value) {\n        const name = fragment.name, signature = fragment.format();\n        (0, index_js_3.defineProperties)(this, {\n            fragment, name, args, signature, selector, value\n        });\n    }\n}\nexports.TransactionDescription = TransactionDescription;\n/**\n *  When using the [[Interface-parseError]] to automatically match an\n *  error for a call result for parsing, an **ErrorDescription** is returned.\n */\nclass ErrorDescription {\n    /**\n     *  The matching fragment.\n     */\n    fragment;\n    /**\n     *  The name of the Error.\n     */\n    name;\n    /**\n     *  The arguments passed to the Error with ``revert``.\n     */\n    args;\n    /**\n     *  The full Error signature.\n     */\n    signature;\n    /**\n     *  The selector for the Error.\n     */\n    selector;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, selector, args) {\n        const name = fragment.name, signature = fragment.format();\n        (0, index_js_3.defineProperties)(this, {\n            fragment, name, args, signature, selector\n        });\n    }\n}\nexports.ErrorDescription = ErrorDescription;\n/**\n *  An **Indexed** is used as a value when a value that does not\n *  fit within a topic (i.e. not a fixed-length, 32-byte type). It\n *  is the ``keccak256`` of the value, and used for types such as\n *  arrays, tuples, bytes and strings.\n */\nclass Indexed {\n    /**\n     *  The ``keccak256`` of the value logged.\n     */\n    hash;\n    /**\n     *  @_ignore:\n     */\n    _isIndexed;\n    /**\n     *  Returns ``true`` if %%value%% is an **Indexed**.\n     *\n     *  This provides a Type Guard for property access.\n     */\n    static isIndexed(value) {\n        return !!(value && value._isIndexed);\n    }\n    /**\n     *  @_ignore:\n     */\n    constructor(hash) {\n        (0, index_js_3.defineProperties)(this, { hash, _isIndexed: true });\n    }\n}\nexports.Indexed = Indexed;\n// https://docs.soliditylang.org/en/v0.8.13/control-structures.html?highlight=panic#panic-via-assert-and-error-via-require\nconst PanicReasons = {\n    \"0\": \"generic panic\",\n    \"1\": \"assert(false)\",\n    \"17\": \"arithmetic overflow\",\n    \"18\": \"division or modulo by zero\",\n    \"33\": \"enum overflow\",\n    \"34\": \"invalid encoded storage byte array accessed\",\n    \"49\": \"out-of-bounds array access; popping on an empty array\",\n    \"50\": \"out-of-bounds access of an array or bytesN\",\n    \"65\": \"out of memory\",\n    \"81\": \"uninitialized function\",\n};\nconst BuiltinErrors = {\n    \"0x08c379a0\": {\n        signature: \"Error(string)\",\n        name: \"Error\",\n        inputs: [\"string\"],\n        reason: (message) => {\n            return `reverted with reason string ${JSON.stringify(message)}`;\n        }\n    },\n    \"0x4e487b71\": {\n        signature: \"Panic(uint256)\",\n        name: \"Panic\",\n        inputs: [\"uint256\"],\n        reason: (code) => {\n            let reason = \"unknown panic code\";\n            if (code >= 0 && code <= 0xff && PanicReasons[code.toString()]) {\n                reason = PanicReasons[code.toString()];\n            }\n            return `reverted with panic code 0x${code.toString(16)} (${reason})`;\n        }\n    }\n};\n/**\n *  An Interface abstracts many of the low-level details for\n *  encoding and decoding the data on the blockchain.\n *\n *  An ABI provides information on how to encode data to send to\n *  a Contract, how to decode the results and events and how to\n *  interpret revert errors.\n *\n *  The ABI can be specified by [any supported format](InterfaceAbi).\n */\nclass Interface {\n    /**\n     *  All the Contract ABI members (i.e. methods, events, errors, etc).\n     */\n    fragments;\n    /**\n     *  The Contract constructor.\n     */\n    deploy;\n    /**\n     *  The Fallback method, if any.\n     */\n    fallback;\n    /**\n     *  If receiving ether is supported.\n     */\n    receive;\n    #errors;\n    #events;\n    #functions;\n    //    #structs: Map<string, StructFragment>;\n    #abiCoder;\n    /**\n     *  Create a new Interface for the %%fragments%%.\n     */\n    constructor(fragments) {\n        let abi = [];\n        if (typeof (fragments) === \"string\") {\n            abi = JSON.parse(fragments);\n        }\n        else {\n            abi = fragments;\n        }\n        this.#functions = new Map();\n        this.#errors = new Map();\n        this.#events = new Map();\n        //        this.#structs = new Map();\n        const frags = [];\n        for (const a of abi) {\n            try {\n                frags.push(fragments_js_1.Fragment.from(a));\n            }\n            catch (error) {\n                console.log(`[Warning] Invalid Fragment ${JSON.stringify(a)}:`, error.message);\n            }\n        }\n        (0, index_js_3.defineProperties)(this, {\n            fragments: Object.freeze(frags)\n        });\n        let fallback = null;\n        let receive = false;\n        this.#abiCoder = this.getAbiCoder();\n        // Add all fragments by their signature\n        this.fragments.forEach((fragment, index) => {\n            let bucket;\n            switch (fragment.type) {\n                case \"constructor\":\n                    if (this.deploy) {\n                        console.log(\"duplicate definition - constructor\");\n                        return;\n                    }\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    (0, index_js_3.defineProperties)(this, { deploy: fragment });\n                    return;\n                case \"fallback\":\n                    if (fragment.inputs.length === 0) {\n                        receive = true;\n                    }\n                    else {\n                        (0, index_js_3.assertArgument)(!fallback || fragment.payable !== fallback.payable, \"conflicting fallback fragments\", `fragments[${index}]`, fragment);\n                        fallback = fragment;\n                        receive = fallback.payable;\n                    }\n                    return;\n                case \"function\":\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    //checkNames(fragment, \"output\", (<FunctionFragment>fragment).outputs);\n                    bucket = this.#functions;\n                    break;\n                case \"event\":\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    bucket = this.#events;\n                    break;\n                case \"error\":\n                    bucket = this.#errors;\n                    break;\n                default:\n                    return;\n            }\n            // Two identical entries; ignore it\n            const signature = fragment.format();\n            if (bucket.has(signature)) {\n                return;\n            }\n            bucket.set(signature, fragment);\n        });\n        // If we do not have a constructor add a default\n        if (!this.deploy) {\n            (0, index_js_3.defineProperties)(this, {\n                deploy: fragments_js_1.ConstructorFragment.from(\"constructor()\")\n            });\n        }\n        (0, index_js_3.defineProperties)(this, { fallback, receive });\n    }\n    /**\n     *  Returns the entire Human-Readable ABI, as an array of\n     *  signatures, optionally as %%minimal%% strings, which\n     *  removes parameter names and unneceesary spaces.\n     */\n    format(minimal) {\n        const format = (minimal ? \"minimal\" : \"full\");\n        const abi = this.fragments.map((f) => f.format(format));\n        return abi;\n    }\n    /**\n     *  Return the JSON-encoded ABI. This is the format Solidiy\n     *  returns.\n     */\n    formatJson() {\n        const abi = this.fragments.map((f) => f.format(\"json\"));\n        // We need to re-bundle the JSON fragments a bit\n        return JSON.stringify(abi.map((j) => JSON.parse(j)));\n    }\n    /**\n     *  The ABI coder that will be used to encode and decode binary\n     *  data.\n     */\n    getAbiCoder() {\n        return abi_coder_js_1.AbiCoder.defaultAbiCoder();\n    }\n    // Find a function definition by any means necessary (unless it is ambiguous)\n    #getFunction(key, values, forceUnique) {\n        // Selector\n        if ((0, index_js_3.isHexString)(key)) {\n            const selector = key.toLowerCase();\n            for (const fragment of this.#functions.values()) {\n                if (selector === fragment.selector) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#functions) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (values) {\n                const lastValue = (values.length > 0) ? values[values.length - 1] : null;\n                let valueLength = values.length;\n                let allowOptions = true;\n                if (typed_js_1.Typed.isTyped(lastValue) && lastValue.type === \"overrides\") {\n                    allowOptions = false;\n                    valueLength--;\n                }\n                // Remove all matches that don't have a compatible length. The args\n                // may contain an overrides, so the match may have n or n - 1 parameters\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs.length;\n                    if (inputs !== valueLength && (!allowOptions || inputs !== valueLength - 1)) {\n                        matching.splice(i, 1);\n                    }\n                }\n                // Remove all matches that don't match the Typed signature\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs;\n                    for (let j = 0; j < values.length; j++) {\n                        // Not a typed value\n                        if (!typed_js_1.Typed.isTyped(values[j])) {\n                            continue;\n                        }\n                        // We are past the inputs\n                        if (j >= inputs.length) {\n                            if (values[j].type === \"overrides\") {\n                                continue;\n                            }\n                            matching.splice(i, 1);\n                            break;\n                        }\n                        // Make sure the value type matches the input type\n                        if (values[j].type !== inputs[j].baseType) {\n                            matching.splice(i, 1);\n                            break;\n                        }\n                    }\n                }\n            }\n            // We found a single matching signature with an overrides, but the\n            // last value is something that cannot possibly be an options\n            if (matching.length === 1 && values && values.length !== matching[0].inputs.length) {\n                const lastArg = values[values.length - 1];\n                if (lastArg == null || Array.isArray(lastArg) || typeof (lastArg) !== \"object\") {\n                    matching.splice(0, 1);\n                }\n            }\n            if (matching.length === 0) {\n                return null;\n            }\n            if (matching.length > 1 && forceUnique) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                (0, index_js_3.assertArgument)(false, `ambiguous function description (i.e. matches ${matchStr})`, \"key\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        const result = this.#functions.get(fragments_js_1.FunctionFragment.from(key).format());\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Get the function name for %%key%%, which may be a function selector,\n     *  function name or function signature that belongs to the ABI.\n     */\n    getFunctionName(key) {\n        const fragment = this.#getFunction(key, null, false);\n        (0, index_js_3.assertArgument)(fragment, \"no matching function\", \"key\", key);\n        return fragment.name;\n    }\n    /**\n     *  Returns true if %%key%% (a function selector, function name or\n     *  function signature) is present in the ABI.\n     *\n     *  In the case of a function name, the name may be ambiguous, so\n     *  accessing the [[FunctionFragment]] may require refinement.\n     */\n    hasFunction(key) {\n        return !!this.#getFunction(key, null, false);\n    }\n    /**\n     *  Get the [[FunctionFragment]] for %%key%%, which may be a function\n     *  selector, function name or function signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple functions match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single function in\n     *  the ABI, this will throw.\n     */\n    getFunction(key, values) {\n        return this.#getFunction(key, values || null, true);\n    }\n    /**\n     *  Iterate over all functions, calling %%callback%%, sorted by their name.\n     */\n    forEachFunction(callback) {\n        const names = Array.from(this.#functions.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#functions.get(name)), i);\n        }\n    }\n    // Find an event definition by any means necessary (unless it is ambiguous)\n    #getEvent(key, values, forceUnique) {\n        // EventTopic\n        if ((0, index_js_3.isHexString)(key)) {\n            const eventTopic = key.toLowerCase();\n            for (const fragment of this.#events.values()) {\n                if (eventTopic === fragment.topicHash) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#events) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (values) {\n                // Remove all matches that don't have a compatible length.\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    if (matching[i].inputs.length < values.length) {\n                        matching.splice(i, 1);\n                    }\n                }\n                // Remove all matches that don't match the Typed signature\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs;\n                    for (let j = 0; j < values.length; j++) {\n                        // Not a typed value\n                        if (!typed_js_1.Typed.isTyped(values[j])) {\n                            continue;\n                        }\n                        // Make sure the value type matches the input type\n                        if (values[j].type !== inputs[j].baseType) {\n                            matching.splice(i, 1);\n                            break;\n                        }\n                    }\n                }\n            }\n            if (matching.length === 0) {\n                return null;\n            }\n            if (matching.length > 1 && forceUnique) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                (0, index_js_3.assertArgument)(false, `ambiguous event description (i.e. matches ${matchStr})`, \"key\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        const result = this.#events.get(fragments_js_1.EventFragment.from(key).format());\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Get the event name for %%key%%, which may be a topic hash,\n     *  event name or event signature that belongs to the ABI.\n     */\n    getEventName(key) {\n        const fragment = this.#getEvent(key, null, false);\n        (0, index_js_3.assertArgument)(fragment, \"no matching event\", \"key\", key);\n        return fragment.name;\n    }\n    /**\n     *  Returns true if %%key%% (an event topic hash, event name or\n     *  event signature) is present in the ABI.\n     *\n     *  In the case of an event name, the name may be ambiguous, so\n     *  accessing the [[EventFragment]] may require refinement.\n     */\n    hasEvent(key) {\n        return !!this.#getEvent(key, null, false);\n    }\n    /**\n     *  Get the [[EventFragment]] for %%key%%, which may be a topic hash,\n     *  event name or event signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple events match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single event in\n     *  the ABI, this will throw.\n     */\n    getEvent(key, values) {\n        return this.#getEvent(key, values || null, true);\n    }\n    /**\n     *  Iterate over all events, calling %%callback%%, sorted by their name.\n     */\n    forEachEvent(callback) {\n        const names = Array.from(this.#events.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#events.get(name)), i);\n        }\n    }\n    /**\n     *  Get the [[ErrorFragment]] for %%key%%, which may be an error\n     *  selector, error name or error signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple errors match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single error in\n     *  the ABI, this will throw.\n     */\n    getError(key, values) {\n        if ((0, index_js_3.isHexString)(key)) {\n            const selector = key.toLowerCase();\n            if (BuiltinErrors[selector]) {\n                return fragments_js_1.ErrorFragment.from(BuiltinErrors[selector].signature);\n            }\n            for (const fragment of this.#errors.values()) {\n                if (selector === fragment.selector) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#errors) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (matching.length === 0) {\n                if (key === \"Error\") {\n                    return fragments_js_1.ErrorFragment.from(\"error Error(string)\");\n                }\n                if (key === \"Panic\") {\n                    return fragments_js_1.ErrorFragment.from(\"error Panic(uint256)\");\n                }\n                return null;\n            }\n            else if (matching.length > 1) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                (0, index_js_3.assertArgument)(false, `ambiguous error description (i.e. ${matchStr})`, \"name\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        key = fragments_js_1.ErrorFragment.from(key).format();\n        if (key === \"Error(string)\") {\n            return fragments_js_1.ErrorFragment.from(\"error Error(string)\");\n        }\n        if (key === \"Panic(uint256)\") {\n            return fragments_js_1.ErrorFragment.from(\"error Panic(uint256)\");\n        }\n        const result = this.#errors.get(key);\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Iterate over all errors, calling %%callback%%, sorted by their name.\n     */\n    forEachError(callback) {\n        const names = Array.from(this.#errors.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#errors.get(name)), i);\n        }\n    }\n    // Get the 4-byte selector used by Solidity to identify a function\n    /*\ngetSelector(fragment: ErrorFragment | FunctionFragment): string {\n    if (typeof(fragment) === \"string\") {\n        const matches: Array<Fragment> = [ ];\n\n        try { matches.push(this.getFunction(fragment)); } catch (error) { }\n        try { matches.push(this.getError(<string>fragment)); } catch (_) { }\n\n        if (matches.length === 0) {\n            logger.throwArgumentError(\"unknown fragment\", \"key\", fragment);\n        } else if (matches.length > 1) {\n            logger.throwArgumentError(\"ambiguous fragment matches function and error\", \"key\", fragment);\n        }\n\n        fragment = matches[0];\n    }\n\n    return dataSlice(id(fragment.format()), 0, 4);\n}\n    */\n    // Get the 32-byte topic hash used by Solidity to identify an event\n    /*\n    getEventTopic(fragment: EventFragment): string {\n        //if (typeof(fragment) === \"string\") { fragment = this.getEvent(eventFragment); }\n        return id(fragment.format());\n    }\n    */\n    _decodeParams(params, data) {\n        return this.#abiCoder.decode(params, data);\n    }\n    _encodeParams(params, values) {\n        return this.#abiCoder.encode(params, values);\n    }\n    /**\n     *  Encodes a ``tx.data`` object for deploying the Contract with\n     *  the %%values%% as the constructor arguments.\n     */\n    encodeDeploy(values) {\n        return this._encodeParams(this.deploy.inputs, values || []);\n    }\n    /**\n     *  Decodes the result %%data%% (e.g. from an ``eth_call``) for the\n     *  specified error (see [[getError]] for valid values for\n     *  %%key%%).\n     *\n     *  Most developers should prefer the [[parseCallResult]] method instead,\n     *  which will automatically detect a ``CALL_EXCEPTION`` and throw the\n     *  corresponding error.\n     */\n    decodeErrorResult(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getError(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown error\", \"fragment\", fragment);\n            fragment = f;\n        }\n        (0, index_js_3.assertArgument)((0, index_js_3.dataSlice)(data, 0, 4) === fragment.selector, `data signature does not match error ${fragment.name}.`, \"data\", data);\n        return this._decodeParams(fragment.inputs, (0, index_js_3.dataSlice)(data, 4));\n    }\n    /**\n     *  Encodes the transaction revert data for a call result that\n     *  reverted from the the Contract with the sepcified %%error%%\n     *  (see [[getError]] for valid values for %%fragment%%) with the %%values%%.\n     *\n     *  This is generally not used by most developers, unless trying to mock\n     *  a result from a Contract.\n     */\n    encodeErrorResult(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getError(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown error\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return (0, index_js_3.concat)([\n            fragment.selector,\n            this._encodeParams(fragment.inputs, values || [])\n        ]);\n    }\n    /**\n     *  Decodes the %%data%% from a transaction ``tx.data`` for\n     *  the function specified (see [[getFunction]] for valid values\n     *  for %%fragment%%).\n     *\n     *  Most developers should prefer the [[parseTransaction]] method\n     *  instead, which will automatically detect the fragment.\n     */\n    decodeFunctionData(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        (0, index_js_3.assertArgument)((0, index_js_3.dataSlice)(data, 0, 4) === fragment.selector, `data signature does not match function ${fragment.name}.`, \"data\", data);\n        return this._decodeParams(fragment.inputs, (0, index_js_3.dataSlice)(data, 4));\n    }\n    /**\n     *  Encodes the ``tx.data`` for a transaction that calls the function\n     *  specified (see [[getFunction]] for valid values for %%fragment%%) with\n     *  the %%values%%.\n     */\n    encodeFunctionData(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return (0, index_js_3.concat)([\n            fragment.selector,\n            this._encodeParams(fragment.inputs, values || [])\n        ]);\n    }\n    /**\n     *  Decodes the result %%data%% (e.g. from an ``eth_call``) for the\n     *  specified function (see [[getFunction]] for valid values for\n     *  %%key%%).\n     *\n     *  Most developers should prefer the [[parseCallResult]] method instead,\n     *  which will automatically detect a ``CALL_EXCEPTION`` and throw the\n     *  corresponding error.\n     */\n    decodeFunctionResult(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        let message = \"invalid length for result data\";\n        const bytes = (0, index_js_3.getBytesCopy)(data);\n        if ((bytes.length % 32) === 0) {\n            try {\n                return this.#abiCoder.decode(fragment.outputs, bytes);\n            }\n            catch (error) {\n                message = \"could not decode result data\";\n            }\n        }\n        // Call returned data with no error, but the data is junk\n        (0, index_js_3.assert)(false, message, \"BAD_DATA\", {\n            value: (0, index_js_3.hexlify)(bytes),\n            info: { method: fragment.name, signature: fragment.format() }\n        });\n    }\n    makeError(_data, tx) {\n        const data = (0, index_js_3.getBytes)(_data, \"data\");\n        const error = abi_coder_js_1.AbiCoder.getBuiltinCallException(\"call\", tx, data);\n        // Not a built-in error; try finding a custom error\n        const customPrefix = \"execution reverted (unknown custom error)\";\n        if (error.message.startsWith(customPrefix)) {\n            const selector = (0, index_js_3.hexlify)(data.slice(0, 4));\n            const ef = this.getError(selector);\n            if (ef) {\n                try {\n                    const args = this.#abiCoder.decode(ef.inputs, data.slice(4));\n                    error.revert = {\n                        name: ef.name, signature: ef.format(), args\n                    };\n                    error.reason = error.revert.signature;\n                    error.message = `execution reverted: ${error.reason}`;\n                }\n                catch (e) {\n                    error.message = `execution reverted (coult not decode custom error)`;\n                }\n            }\n        }\n        // Add the invocation, if available\n        const parsed = this.parseTransaction(tx);\n        if (parsed) {\n            error.invocation = {\n                method: parsed.name,\n                signature: parsed.signature,\n                args: parsed.args\n            };\n        }\n        return error;\n    }\n    /**\n     *  Encodes the result data (e.g. from an ``eth_call``) for the\n     *  specified function (see [[getFunction]] for valid values\n     *  for %%fragment%%) with %%values%%.\n     *\n     *  This is generally not used by most developers, unless trying to mock\n     *  a result from a Contract.\n     */\n    encodeFunctionResult(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return (0, index_js_3.hexlify)(this.#abiCoder.encode(fragment.outputs, values || []));\n    }\n    /*\n        spelunk(inputs: Array<ParamType>, values: ReadonlyArray<any>, processfunc: (type: string, value: any) => Promise<any>): Promise<Array<any>> {\n            const promises: Array<Promise<>> = [ ];\n            const process = function(type: ParamType, value: any): any {\n                if (type.baseType === \"array\") {\n                    return descend(type.child\n                }\n                if (type. === \"address\") {\n                }\n            };\n    \n            const descend = function (inputs: Array<ParamType>, values: ReadonlyArray<any>) {\n                if (inputs.length !== values.length) { throw new Error(\"length mismatch\"); }\n                \n            };\n    \n            const result: Array<any> = [ ];\n            values.forEach((value, index) => {\n                if (value == null) {\n                    topics.push(null);\n                } else if (param.baseType === \"array\" || param.baseType === \"tuple\") {\n                    logger.throwArgumentError(\"filtering with tuples or arrays not supported\", (\"contract.\" + param.name), value);\n                } else if (Array.isArray(value)) {\n                    topics.push(value.map((value) => encodeTopic(param, value)));\n                } else {\n                    topics.push(encodeTopic(param, value));\n                }\n            });\n        }\n    */\n    // Create the filter for the event with search criteria (e.g. for eth_filterLog)\n    encodeFilterTopics(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        (0, index_js_3.assert)(values.length <= fragment.inputs.length, `too many arguments for ${fragment.format()}`, \"UNEXPECTED_ARGUMENT\", { count: values.length, expectedCount: fragment.inputs.length });\n        const topics = [];\n        if (!fragment.anonymous) {\n            topics.push(fragment.topicHash);\n        }\n        // @TODO: Use the coders for this; to properly support tuples, etc.\n        const encodeTopic = (param, value) => {\n            if (param.type === \"string\") {\n                return (0, index_js_2.id)(value);\n            }\n            else if (param.type === \"bytes\") {\n                return (0, index_js_1.keccak256)((0, index_js_3.hexlify)(value));\n            }\n            if (param.type === \"bool\" && typeof (value) === \"boolean\") {\n                value = (value ? \"0x01\" : \"0x00\");\n            }\n            else if (param.type.match(/^u?int/)) {\n                value = (0, index_js_3.toBeHex)(value); // @TODO: Should this toTwos??\n            }\n            else if (param.type.match(/^bytes/)) {\n                value = (0, index_js_3.zeroPadBytes)(value, 32);\n            }\n            else if (param.type === \"address\") {\n                // Check addresses are valid\n                this.#abiCoder.encode([\"address\"], [value]);\n            }\n            return (0, index_js_3.zeroPadValue)((0, index_js_3.hexlify)(value), 32);\n        };\n        values.forEach((value, index) => {\n            const param = fragment.inputs[index];\n            if (!param.indexed) {\n                (0, index_js_3.assertArgument)(value == null, \"cannot filter non-indexed parameters; must be null\", (\"contract.\" + param.name), value);\n                return;\n            }\n            if (value == null) {\n                topics.push(null);\n            }\n            else if (param.baseType === \"array\" || param.baseType === \"tuple\") {\n                (0, index_js_3.assertArgument)(false, \"filtering with tuples or arrays not supported\", (\"contract.\" + param.name), value);\n            }\n            else if (Array.isArray(value)) {\n                topics.push(value.map((value) => encodeTopic(param, value)));\n            }\n            else {\n                topics.push(encodeTopic(param, value));\n            }\n        });\n        // Trim off trailing nulls\n        while (topics.length && topics[topics.length - 1] === null) {\n            topics.pop();\n        }\n        return topics;\n    }\n    encodeEventLog(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        const topics = [];\n        const dataTypes = [];\n        const dataValues = [];\n        if (!fragment.anonymous) {\n            topics.push(fragment.topicHash);\n        }\n        (0, index_js_3.assertArgument)(values.length === fragment.inputs.length, \"event arguments/values mismatch\", \"values\", values);\n        fragment.inputs.forEach((param, index) => {\n            const value = values[index];\n            if (param.indexed) {\n                if (param.type === \"string\") {\n                    topics.push((0, index_js_2.id)(value));\n                }\n                else if (param.type === \"bytes\") {\n                    topics.push((0, index_js_1.keccak256)(value));\n                }\n                else if (param.baseType === \"tuple\" || param.baseType === \"array\") {\n                    // @TODO\n                    throw new Error(\"not implemented\");\n                }\n                else {\n                    topics.push(this.#abiCoder.encode([param.type], [value]));\n                }\n            }\n            else {\n                dataTypes.push(param);\n                dataValues.push(value);\n            }\n        });\n        return {\n            data: this.#abiCoder.encode(dataTypes, dataValues),\n            topics: topics\n        };\n    }\n    // Decode a filter for the event and the search criteria\n    decodeEventLog(fragment, data, topics) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            (0, index_js_3.assertArgument)(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        if (topics != null && !fragment.anonymous) {\n            const eventTopic = fragment.topicHash;\n            (0, index_js_3.assertArgument)((0, index_js_3.isHexString)(topics[0], 32) && topics[0].toLowerCase() === eventTopic, \"fragment/topic mismatch\", \"topics[0]\", topics[0]);\n            topics = topics.slice(1);\n        }\n        const indexed = [];\n        const nonIndexed = [];\n        const dynamic = [];\n        fragment.inputs.forEach((param, index) => {\n            if (param.indexed) {\n                if (param.type === \"string\" || param.type === \"bytes\" || param.baseType === \"tuple\" || param.baseType === \"array\") {\n                    indexed.push(fragments_js_1.ParamType.from({ type: \"bytes32\", name: param.name }));\n                    dynamic.push(true);\n                }\n                else {\n                    indexed.push(param);\n                    dynamic.push(false);\n                }\n            }\n            else {\n                nonIndexed.push(param);\n                dynamic.push(false);\n            }\n        });\n        const resultIndexed = (topics != null) ? this.#abiCoder.decode(indexed, (0, index_js_3.concat)(topics)) : null;\n        const resultNonIndexed = this.#abiCoder.decode(nonIndexed, data, true);\n        //const result: (Array<any> & { [ key: string ]: any }) = [ ];\n        const values = [];\n        const keys = [];\n        let nonIndexedIndex = 0, indexedIndex = 0;\n        fragment.inputs.forEach((param, index) => {\n            let value = null;\n            if (param.indexed) {\n                if (resultIndexed == null) {\n                    value = new Indexed(null);\n                }\n                else if (dynamic[index]) {\n                    value = new Indexed(resultIndexed[indexedIndex++]);\n                }\n                else {\n                    try {\n                        value = resultIndexed[indexedIndex++];\n                    }\n                    catch (error) {\n                        value = error;\n                    }\n                }\n            }\n            else {\n                try {\n                    value = resultNonIndexed[nonIndexedIndex++];\n                }\n                catch (error) {\n                    value = error;\n                }\n            }\n            values.push(value);\n            keys.push(param.name || null);\n        });\n        return abstract_coder_js_1.Result.fromItems(values, keys);\n    }\n    /**\n     *  Parses a transaction, finding the matching function and extracts\n     *  the parameter values along with other useful function details.\n     *\n     *  If the matching function cannot be found, return null.\n     */\n    parseTransaction(tx) {\n        const data = (0, index_js_3.getBytes)(tx.data, \"tx.data\");\n        const value = (0, index_js_3.getBigInt)((tx.value != null) ? tx.value : 0, \"tx.value\");\n        const fragment = this.getFunction((0, index_js_3.hexlify)(data.slice(0, 4)));\n        if (!fragment) {\n            return null;\n        }\n        const args = this.#abiCoder.decode(fragment.inputs, data.slice(4));\n        return new TransactionDescription(fragment, fragment.selector, args, value);\n    }\n    parseCallResult(data) {\n        throw new Error(\"@TODO\");\n    }\n    /**\n     *  Parses a receipt log, finding the matching event and extracts\n     *  the parameter values along with other useful event details.\n     *\n     *  If the matching event cannot be found, returns null.\n     */\n    parseLog(log) {\n        const fragment = this.getEvent(log.topics[0]);\n        if (!fragment || fragment.anonymous) {\n            return null;\n        }\n        // @TODO: If anonymous, and the only method, and the input count matches, should we parse?\n        //        Probably not, because just because it is the only event in the ABI does\n        //        not mean we have the full ABI; maybe just a fragment?\n        return new LogDescription(fragment, fragment.topicHash, this.decodeEventLog(fragment, log.data, log.topics));\n    }\n    /**\n     *  Parses a revert data, finding the matching error and extracts\n     *  the parameter values along with other useful error details.\n     *\n     *  If the matching error cannot be found, returns null.\n     */\n    parseError(data) {\n        const hexData = (0, index_js_3.hexlify)(data);\n        const fragment = this.getError((0, index_js_3.dataSlice)(hexData, 0, 4));\n        if (!fragment) {\n            return null;\n        }\n        const args = this.#abiCoder.decode(fragment.inputs, (0, index_js_3.dataSlice)(hexData, 4));\n        return new ErrorDescription(fragment, fragment.selector, args);\n    }\n    /**\n     *  Creates a new [[Interface]] from the ABI %%value%%.\n     *\n     *  The %%value%% may be provided as an existing [[Interface]] object,\n     *  a JSON-encoded ABI or any Human-Readable ABI format.\n     */\n    static from(value) {\n        // Already an Interface, which is immutable\n        if (value instanceof Interface) {\n            return value;\n        }\n        // JSON\n        if (typeof (value) === \"string\") {\n            return new Interface(JSON.parse(value));\n        }\n        // An Interface; possibly from another v6 instance\n        if (typeof (value.formatJson) === \"function\") {\n            return new Interface(value.formatJson());\n        }\n        // A legacy Interface; from an older version\n        if (typeof (value.format) === \"function\") {\n            return new Interface(value.format(\"json\"));\n        }\n        // Array of fragments\n        return new Interface(value);\n    }\n}\nexports.Interface = Interface;\n//# sourceMappingURL=interface.js.map","\"use strict\";\n/**\n *  A Typed object allows a value to have its type explicitly\n *  specified.\n *\n *  For example, in Solidity, the value ``45`` could represent a\n *  ``uint8`` or a ``uint256``. The value ``0x1234`` could represent\n *  a ``bytes2`` or ``bytes``.\n *\n *  Since JavaScript has no meaningful way to explicitly inform any\n *  APIs which what the type is, this allows transparent interoperation\n *  with Soldity.\n *\n *  @_subsection: api/abi:Typed Values\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Typed = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst _gaurd = {};\nfunction n(value, width) {\n    let signed = false;\n    if (width < 0) {\n        signed = true;\n        width *= -1;\n    }\n    // @TODO: Check range is valid for value\n    return new Typed(_gaurd, `${signed ? \"\" : \"u\"}int${width}`, value, { signed, width });\n}\nfunction b(value, size) {\n    // @TODO: Check range is valid for value\n    return new Typed(_gaurd, `bytes${(size) ? size : \"\"}`, value, { size });\n}\nconst _typedSymbol = Symbol.for(\"_ethers_typed\");\n/**\n *  The **Typed** class to wrap values providing explicit type information.\n */\nclass Typed {\n    /**\n     *  The type, as a Solidity-compatible type.\n     */\n    type;\n    /**\n     *  The actual value.\n     */\n    value;\n    #options;\n    /**\n     *  @_ignore:\n     */\n    _typedSymbol;\n    /**\n     *  @_ignore:\n     */\n    constructor(gaurd, type, value, options) {\n        if (options == null) {\n            options = null;\n        }\n        (0, index_js_1.assertPrivate)(_gaurd, gaurd, \"Typed\");\n        (0, index_js_1.defineProperties)(this, { _typedSymbol, type, value });\n        this.#options = options;\n        // Check the value is valid\n        this.format();\n    }\n    /**\n     *  Format the type as a Human-Readable type.\n     */\n    format() {\n        if (this.type === \"array\") {\n            throw new Error(\"\");\n        }\n        else if (this.type === \"dynamicArray\") {\n            throw new Error(\"\");\n        }\n        else if (this.type === \"tuple\") {\n            return `tuple(${this.value.map((v) => v.format()).join(\",\")})`;\n        }\n        return this.type;\n    }\n    /**\n     *  The default value returned by this type.\n     */\n    defaultValue() {\n        return 0;\n    }\n    /**\n     *  The minimum value for numeric types.\n     */\n    minValue() {\n        return 0;\n    }\n    /**\n     *  The maximum value for numeric types.\n     */\n    maxValue() {\n        return 0;\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedBigInt]].\n     */\n    isBigInt() {\n        return !!(this.type.match(/^u?int[0-9]+$/));\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedData]].\n     */\n    isData() {\n        return this.type.startsWith(\"bytes\");\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedString]].\n     */\n    isString() {\n        return (this.type === \"string\");\n    }\n    /**\n     *  Returns the tuple name, if this is a tuple. Throws otherwise.\n     */\n    get tupleName() {\n        if (this.type !== \"tuple\") {\n            throw TypeError(\"not a tuple\");\n        }\n        return this.#options;\n    }\n    // Returns the length of this type as an array\n    // - `null` indicates the length is unforced, it could be dynamic\n    // - `-1` indicates the length is dynamic\n    // - any other value indicates it is a static array and is its length\n    /**\n     *  Returns the length of the array type or ``-1`` if it is dynamic.\n     *\n     *  Throws if the type is not an array.\n     */\n    get arrayLength() {\n        if (this.type !== \"array\") {\n            throw TypeError(\"not an array\");\n        }\n        if (this.#options === true) {\n            return -1;\n        }\n        if (this.#options === false) {\n            return (this.value).length;\n        }\n        return null;\n    }\n    /**\n     *  Returns a new **Typed** of %%type%% with the %%value%%.\n     */\n    static from(type, value) {\n        return new Typed(_gaurd, type, value);\n    }\n    /**\n     *  Return a new ``uint8`` type for %%v%%.\n     */\n    static uint8(v) { return n(v, 8); }\n    /**\n     *  Return a new ``uint16`` type for %%v%%.\n     */\n    static uint16(v) { return n(v, 16); }\n    /**\n     *  Return a new ``uint24`` type for %%v%%.\n     */\n    static uint24(v) { return n(v, 24); }\n    /**\n     *  Return a new ``uint32`` type for %%v%%.\n     */\n    static uint32(v) { return n(v, 32); }\n    /**\n     *  Return a new ``uint40`` type for %%v%%.\n     */\n    static uint40(v) { return n(v, 40); }\n    /**\n     *  Return a new ``uint48`` type for %%v%%.\n     */\n    static uint48(v) { return n(v, 48); }\n    /**\n     *  Return a new ``uint56`` type for %%v%%.\n     */\n    static uint56(v) { return n(v, 56); }\n    /**\n     *  Return a new ``uint64`` type for %%v%%.\n     */\n    static uint64(v) { return n(v, 64); }\n    /**\n     *  Return a new ``uint72`` type for %%v%%.\n     */\n    static uint72(v) { return n(v, 72); }\n    /**\n     *  Return a new ``uint80`` type for %%v%%.\n     */\n    static uint80(v) { return n(v, 80); }\n    /**\n     *  Return a new ``uint88`` type for %%v%%.\n     */\n    static uint88(v) { return n(v, 88); }\n    /**\n     *  Return a new ``uint96`` type for %%v%%.\n     */\n    static uint96(v) { return n(v, 96); }\n    /**\n     *  Return a new ``uint104`` type for %%v%%.\n     */\n    static uint104(v) { return n(v, 104); }\n    /**\n     *  Return a new ``uint112`` type for %%v%%.\n     */\n    static uint112(v) { return n(v, 112); }\n    /**\n     *  Return a new ``uint120`` type for %%v%%.\n     */\n    static uint120(v) { return n(v, 120); }\n    /**\n     *  Return a new ``uint128`` type for %%v%%.\n     */\n    static uint128(v) { return n(v, 128); }\n    /**\n     *  Return a new ``uint136`` type for %%v%%.\n     */\n    static uint136(v) { return n(v, 136); }\n    /**\n     *  Return a new ``uint144`` type for %%v%%.\n     */\n    static uint144(v) { return n(v, 144); }\n    /**\n     *  Return a new ``uint152`` type for %%v%%.\n     */\n    static uint152(v) { return n(v, 152); }\n    /**\n     *  Return a new ``uint160`` type for %%v%%.\n     */\n    static uint160(v) { return n(v, 160); }\n    /**\n     *  Return a new ``uint168`` type for %%v%%.\n     */\n    static uint168(v) { return n(v, 168); }\n    /**\n     *  Return a new ``uint176`` type for %%v%%.\n     */\n    static uint176(v) { return n(v, 176); }\n    /**\n     *  Return a new ``uint184`` type for %%v%%.\n     */\n    static uint184(v) { return n(v, 184); }\n    /**\n     *  Return a new ``uint192`` type for %%v%%.\n     */\n    static uint192(v) { return n(v, 192); }\n    /**\n     *  Return a new ``uint200`` type for %%v%%.\n     */\n    static uint200(v) { return n(v, 200); }\n    /**\n     *  Return a new ``uint208`` type for %%v%%.\n     */\n    static uint208(v) { return n(v, 208); }\n    /**\n     *  Return a new ``uint216`` type for %%v%%.\n     */\n    static uint216(v) { return n(v, 216); }\n    /**\n     *  Return a new ``uint224`` type for %%v%%.\n     */\n    static uint224(v) { return n(v, 224); }\n    /**\n     *  Return a new ``uint232`` type for %%v%%.\n     */\n    static uint232(v) { return n(v, 232); }\n    /**\n     *  Return a new ``uint240`` type for %%v%%.\n     */\n    static uint240(v) { return n(v, 240); }\n    /**\n     *  Return a new ``uint248`` type for %%v%%.\n     */\n    static uint248(v) { return n(v, 248); }\n    /**\n     *  Return a new ``uint256`` type for %%v%%.\n     */\n    static uint256(v) { return n(v, 256); }\n    /**\n     *  Return a new ``uint256`` type for %%v%%.\n     */\n    static uint(v) { return n(v, 256); }\n    /**\n     *  Return a new ``int8`` type for %%v%%.\n     */\n    static int8(v) { return n(v, -8); }\n    /**\n     *  Return a new ``int16`` type for %%v%%.\n     */\n    static int16(v) { return n(v, -16); }\n    /**\n     *  Return a new ``int24`` type for %%v%%.\n     */\n    static int24(v) { return n(v, -24); }\n    /**\n     *  Return a new ``int32`` type for %%v%%.\n     */\n    static int32(v) { return n(v, -32); }\n    /**\n     *  Return a new ``int40`` type for %%v%%.\n     */\n    static int40(v) { return n(v, -40); }\n    /**\n     *  Return a new ``int48`` type for %%v%%.\n     */\n    static int48(v) { return n(v, -48); }\n    /**\n     *  Return a new ``int56`` type for %%v%%.\n     */\n    static int56(v) { return n(v, -56); }\n    /**\n     *  Return a new ``int64`` type for %%v%%.\n     */\n    static int64(v) { return n(v, -64); }\n    /**\n     *  Return a new ``int72`` type for %%v%%.\n     */\n    static int72(v) { return n(v, -72); }\n    /**\n     *  Return a new ``int80`` type for %%v%%.\n     */\n    static int80(v) { return n(v, -80); }\n    /**\n     *  Return a new ``int88`` type for %%v%%.\n     */\n    static int88(v) { return n(v, -88); }\n    /**\n     *  Return a new ``int96`` type for %%v%%.\n     */\n    static int96(v) { return n(v, -96); }\n    /**\n     *  Return a new ``int104`` type for %%v%%.\n     */\n    static int104(v) { return n(v, -104); }\n    /**\n     *  Return a new ``int112`` type for %%v%%.\n     */\n    static int112(v) { return n(v, -112); }\n    /**\n     *  Return a new ``int120`` type for %%v%%.\n     */\n    static int120(v) { return n(v, -120); }\n    /**\n     *  Return a new ``int128`` type for %%v%%.\n     */\n    static int128(v) { return n(v, -128); }\n    /**\n     *  Return a new ``int136`` type for %%v%%.\n     */\n    static int136(v) { return n(v, -136); }\n    /**\n     *  Return a new ``int144`` type for %%v%%.\n     */\n    static int144(v) { return n(v, -144); }\n    /**\n     *  Return a new ``int52`` type for %%v%%.\n     */\n    static int152(v) { return n(v, -152); }\n    /**\n     *  Return a new ``int160`` type for %%v%%.\n     */\n    static int160(v) { return n(v, -160); }\n    /**\n     *  Return a new ``int168`` type for %%v%%.\n     */\n    static int168(v) { return n(v, -168); }\n    /**\n     *  Return a new ``int176`` type for %%v%%.\n     */\n    static int176(v) { return n(v, -176); }\n    /**\n     *  Return a new ``int184`` type for %%v%%.\n     */\n    static int184(v) { return n(v, -184); }\n    /**\n     *  Return a new ``int92`` type for %%v%%.\n     */\n    static int192(v) { return n(v, -192); }\n    /**\n     *  Return a new ``int200`` type for %%v%%.\n     */\n    static int200(v) { return n(v, -200); }\n    /**\n     *  Return a new ``int208`` type for %%v%%.\n     */\n    static int208(v) { return n(v, -208); }\n    /**\n     *  Return a new ``int216`` type for %%v%%.\n     */\n    static int216(v) { return n(v, -216); }\n    /**\n     *  Return a new ``int224`` type for %%v%%.\n     */\n    static int224(v) { return n(v, -224); }\n    /**\n     *  Return a new ``int232`` type for %%v%%.\n     */\n    static int232(v) { return n(v, -232); }\n    /**\n     *  Return a new ``int240`` type for %%v%%.\n     */\n    static int240(v) { return n(v, -240); }\n    /**\n     *  Return a new ``int248`` type for %%v%%.\n     */\n    static int248(v) { return n(v, -248); }\n    /**\n     *  Return a new ``int256`` type for %%v%%.\n     */\n    static int256(v) { return n(v, -256); }\n    /**\n     *  Return a new ``int256`` type for %%v%%.\n     */\n    static int(v) { return n(v, -256); }\n    /**\n     *  Return a new ``bytes1`` type for %%v%%.\n     */\n    static bytes1(v) { return b(v, 1); }\n    /**\n     *  Return a new ``bytes2`` type for %%v%%.\n     */\n    static bytes2(v) { return b(v, 2); }\n    /**\n     *  Return a new ``bytes3`` type for %%v%%.\n     */\n    static bytes3(v) { return b(v, 3); }\n    /**\n     *  Return a new ``bytes4`` type for %%v%%.\n     */\n    static bytes4(v) { return b(v, 4); }\n    /**\n     *  Return a new ``bytes5`` type for %%v%%.\n     */\n    static bytes5(v) { return b(v, 5); }\n    /**\n     *  Return a new ``bytes6`` type for %%v%%.\n     */\n    static bytes6(v) { return b(v, 6); }\n    /**\n     *  Return a new ``bytes7`` type for %%v%%.\n     */\n    static bytes7(v) { return b(v, 7); }\n    /**\n     *  Return a new ``bytes8`` type for %%v%%.\n     */\n    static bytes8(v) { return b(v, 8); }\n    /**\n     *  Return a new ``bytes9`` type for %%v%%.\n     */\n    static bytes9(v) { return b(v, 9); }\n    /**\n     *  Return a new ``bytes10`` type for %%v%%.\n     */\n    static bytes10(v) { return b(v, 10); }\n    /**\n     *  Return a new ``bytes11`` type for %%v%%.\n     */\n    static bytes11(v) { return b(v, 11); }\n    /**\n     *  Return a new ``bytes12`` type for %%v%%.\n     */\n    static bytes12(v) { return b(v, 12); }\n    /**\n     *  Return a new ``bytes13`` type for %%v%%.\n     */\n    static bytes13(v) { return b(v, 13); }\n    /**\n     *  Return a new ``bytes14`` type for %%v%%.\n     */\n    static bytes14(v) { return b(v, 14); }\n    /**\n     *  Return a new ``bytes15`` type for %%v%%.\n     */\n    static bytes15(v) { return b(v, 15); }\n    /**\n     *  Return a new ``bytes16`` type for %%v%%.\n     */\n    static bytes16(v) { return b(v, 16); }\n    /**\n     *  Return a new ``bytes17`` type for %%v%%.\n     */\n    static bytes17(v) { return b(v, 17); }\n    /**\n     *  Return a new ``bytes18`` type for %%v%%.\n     */\n    static bytes18(v) { return b(v, 18); }\n    /**\n     *  Return a new ``bytes19`` type for %%v%%.\n     */\n    static bytes19(v) { return b(v, 19); }\n    /**\n     *  Return a new ``bytes20`` type for %%v%%.\n     */\n    static bytes20(v) { return b(v, 20); }\n    /**\n     *  Return a new ``bytes21`` type for %%v%%.\n     */\n    static bytes21(v) { return b(v, 21); }\n    /**\n     *  Return a new ``bytes22`` type for %%v%%.\n     */\n    static bytes22(v) { return b(v, 22); }\n    /**\n     *  Return a new ``bytes23`` type for %%v%%.\n     */\n    static bytes23(v) { return b(v, 23); }\n    /**\n     *  Return a new ``bytes24`` type for %%v%%.\n     */\n    static bytes24(v) { return b(v, 24); }\n    /**\n     *  Return a new ``bytes25`` type for %%v%%.\n     */\n    static bytes25(v) { return b(v, 25); }\n    /**\n     *  Return a new ``bytes26`` type for %%v%%.\n     */\n    static bytes26(v) { return b(v, 26); }\n    /**\n     *  Return a new ``bytes27`` type for %%v%%.\n     */\n    static bytes27(v) { return b(v, 27); }\n    /**\n     *  Return a new ``bytes28`` type for %%v%%.\n     */\n    static bytes28(v) { return b(v, 28); }\n    /**\n     *  Return a new ``bytes29`` type for %%v%%.\n     */\n    static bytes29(v) { return b(v, 29); }\n    /**\n     *  Return a new ``bytes30`` type for %%v%%.\n     */\n    static bytes30(v) { return b(v, 30); }\n    /**\n     *  Return a new ``bytes31`` type for %%v%%.\n     */\n    static bytes31(v) { return b(v, 31); }\n    /**\n     *  Return a new ``bytes32`` type for %%v%%.\n     */\n    static bytes32(v) { return b(v, 32); }\n    /**\n     *  Return a new ``address`` type for %%v%%.\n     */\n    static address(v) { return new Typed(_gaurd, \"address\", v); }\n    /**\n     *  Return a new ``bool`` type for %%v%%.\n     */\n    static bool(v) { return new Typed(_gaurd, \"bool\", !!v); }\n    /**\n     *  Return a new ``bytes`` type for %%v%%.\n     */\n    static bytes(v) { return new Typed(_gaurd, \"bytes\", v); }\n    /**\n     *  Return a new ``string`` type for %%v%%.\n     */\n    static string(v) { return new Typed(_gaurd, \"string\", v); }\n    /**\n     *  Return a new ``array`` type for %%v%%, allowing %%dynamic%% length.\n     */\n    static array(v, dynamic) {\n        throw new Error(\"not implemented yet\");\n        return new Typed(_gaurd, \"array\", v, dynamic);\n    }\n    /**\n     *  Return a new ``tuple`` type for %%v%%, with the optional %%name%%.\n     */\n    static tuple(v, name) {\n        throw new Error(\"not implemented yet\");\n        return new Typed(_gaurd, \"tuple\", v, name);\n    }\n    /**\n     *  Return a new ``uint8`` type for %%v%%.\n     */\n    static overrides(v) {\n        return new Typed(_gaurd, \"overrides\", Object.assign({}, v));\n    }\n    /**\n     *  Returns true only if %%value%% is a [[Typed]] instance.\n     */\n    static isTyped(value) {\n        return (value\n            && typeof (value) === \"object\"\n            && \"_typedSymbol\" in value\n            && value._typedSymbol === _typedSymbol);\n    }\n    /**\n     *  If the value is a [[Typed]] instance, validates the underlying value\n     *  and returns it, otherwise returns value directly.\n     *\n     *  This is useful for functions that with to accept either a [[Typed]]\n     *  object or values.\n     */\n    static dereference(value, type) {\n        if (Typed.isTyped(value)) {\n            if (value.type !== type) {\n                throw new Error(`invalid type: expecetd ${type}, got ${value.type}`);\n            }\n            return value.value;\n        }\n        return value;\n    }\n}\nexports.Typed = Typed;\n//# sourceMappingURL=typed.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getIcapAddress = exports.getAddress = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst BN_0 = BigInt(0);\nconst BN_36 = BigInt(36);\nfunction getChecksumAddress(address) {\n    //    if (!isHexString(address, 20)) {\n    //        logger.throwArgumentError(\"invalid address\", \"address\", address);\n    //    }\n    address = address.toLowerCase();\n    const chars = address.substring(2).split(\"\");\n    const expanded = new Uint8Array(40);\n    for (let i = 0; i < 40; i++) {\n        expanded[i] = chars[i].charCodeAt(0);\n    }\n    const hashed = (0, index_js_2.getBytes)((0, index_js_1.keccak256)(expanded));\n    for (let i = 0; i < 40; i += 2) {\n        if ((hashed[i >> 1] >> 4) >= 8) {\n            chars[i] = chars[i].toUpperCase();\n        }\n        if ((hashed[i >> 1] & 0x0f) >= 8) {\n            chars[i + 1] = chars[i + 1].toUpperCase();\n        }\n    }\n    return \"0x\" + chars.join(\"\");\n}\n// See: https://en.wikipedia.org/wiki/International_Bank_Account_Number\n// Create lookup table\nconst ibanLookup = {};\nfor (let i = 0; i < 10; i++) {\n    ibanLookup[String(i)] = String(i);\n}\nfor (let i = 0; i < 26; i++) {\n    ibanLookup[String.fromCharCode(65 + i)] = String(10 + i);\n}\n// How many decimal digits can we process? (for 64-bit float, this is 15)\n// i.e. Math.floor(Math.log10(Number.MAX_SAFE_INTEGER));\nconst safeDigits = 15;\nfunction ibanChecksum(address) {\n    address = address.toUpperCase();\n    address = address.substring(4) + address.substring(0, 2) + \"00\";\n    let expanded = address.split(\"\").map((c) => { return ibanLookup[c]; }).join(\"\");\n    // Javascript can handle integers safely up to 15 (decimal) digits\n    while (expanded.length >= safeDigits) {\n        let block = expanded.substring(0, safeDigits);\n        expanded = parseInt(block, 10) % 97 + expanded.substring(block.length);\n    }\n    let checksum = String(98 - (parseInt(expanded, 10) % 97));\n    while (checksum.length < 2) {\n        checksum = \"0\" + checksum;\n    }\n    return checksum;\n}\n;\nconst Base36 = (function () {\n    ;\n    const result = {};\n    for (let i = 0; i < 36; i++) {\n        const key = \"0123456789abcdefghijklmnopqrstuvwxyz\"[i];\n        result[key] = BigInt(i);\n    }\n    return result;\n})();\nfunction fromBase36(value) {\n    value = value.toLowerCase();\n    let result = BN_0;\n    for (let i = 0; i < value.length; i++) {\n        result = result * BN_36 + Base36[value[i]];\n    }\n    return result;\n}\n/**\n *  Returns a normalized and checksumed address for %%address%%.\n *  This accepts non-checksum addresses, checksum addresses and\n *  [[getIcapAddress]] formats.\n *\n *  The checksum in Ethereum uses the capitalization (upper-case\n *  vs lower-case) of the characters within an address to encode\n *  its checksum, which offers, on average, a checksum of 15-bits.\n *\n *  If %%address%% contains both upper-case and lower-case, it is\n *  assumed to already be a checksum address and its checksum is\n *  validated, and if the address fails its expected checksum an\n *  error is thrown.\n *\n *  If you wish the checksum of %%address%% to be ignore, it should\n *  be converted to lower-case (i.e. ``.toLowercase()``) before\n *  being passed in. This should be a very rare situation though,\n *  that you wish to bypass the safegaurds in place to protect\n *  against an address that has been incorrectly copied from another\n *  source.\n *\n *  @example:\n *    // Adds the checksum (via upper-casing specific letters)\n *    getAddress(\"0x8ba1f109551bd432803012645ac136ddd64dba72\")\n *    //_result:\n *\n *    // Converts ICAP address and adds checksum\n *    getAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\");\n *    //_result:\n *\n *    // Throws an error if an address contains mixed case,\n *    // but the checksum fails\n *    getAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_error:\n */\nfunction getAddress(address) {\n    (0, index_js_2.assertArgument)(typeof (address) === \"string\", \"invalid address\", \"address\", address);\n    if (address.match(/^(0x)?[0-9a-fA-F]{40}$/)) {\n        // Missing the 0x prefix\n        if (!address.startsWith(\"0x\")) {\n            address = \"0x\" + address;\n        }\n        const result = getChecksumAddress(address);\n        // It is a checksummed address with a bad checksum\n        (0, index_js_2.assertArgument)(!address.match(/([A-F].*[a-f])|([a-f].*[A-F])/) || result === address, \"bad address checksum\", \"address\", address);\n        return result;\n    }\n    // Maybe ICAP? (we only support direct mode)\n    if (address.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {\n        // It is an ICAP address with a bad checksum\n        (0, index_js_2.assertArgument)(address.substring(2, 4) === ibanChecksum(address), \"bad icap checksum\", \"address\", address);\n        let result = fromBase36(address.substring(4)).toString(16);\n        while (result.length < 40) {\n            result = \"0\" + result;\n        }\n        return getChecksumAddress(\"0x\" + result);\n    }\n    (0, index_js_2.assertArgument)(false, \"invalid address\", \"address\", address);\n}\nexports.getAddress = getAddress;\n/**\n *  The [ICAP Address format](link-icap) format is an early checksum\n *  format which attempts to be compatible with the banking\n *  industry [IBAN format](link-wiki-iban) for bank accounts.\n *\n *  It is no longer common or a recommended format.\n *\n *  @example:\n *    getIcapAddress(\"0x8ba1f109551bd432803012645ac136ddd64dba72\");\n *    //_result:\n *\n *    getIcapAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\");\n *    //_result:\n *\n *    // Throws an error if the ICAP checksum is wrong\n *    getIcapAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK37\");\n *    //_error:\n */\nfunction getIcapAddress(address) {\n    //let base36 = _base16To36(getAddress(address).substring(2)).toUpperCase();\n    let base36 = BigInt(getAddress(address)).toString(36).toUpperCase();\n    while (base36.length < 30) {\n        base36 = \"0\" + base36;\n    }\n    return \"XE\" + ibanChecksum(\"XE00\" + base36) + base36;\n}\nexports.getIcapAddress = getIcapAddress;\n//# sourceMappingURL=address.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.resolveAddress = exports.isAddress = exports.isAddressable = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst address_js_1 = require(\"./address.js\");\n/**\n *  Returns true if %%value%% is an object which implements the\n *  [[Addressable]] interface.\n *\n *  @example:\n *    // Wallets and AbstractSigner sub-classes\n *    isAddressable(Wallet.createRandom())\n *    //_result:\n *\n *    // Contracts\n *    contract = new Contract(\"dai.tokens.ethers.eth\", [ ], provider)\n *    isAddressable(contract)\n *    //_result:\n */\nfunction isAddressable(value) {\n    return (value && typeof (value.getAddress) === \"function\");\n}\nexports.isAddressable = isAddressable;\n/**\n *  Returns true if %%value%% is a valid address.\n *\n *  @example:\n *    // Valid address\n *    isAddress(\"0x8ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_result:\n *\n *    // Valid ICAP address\n *    isAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\")\n *    //_result:\n *\n *    // Invalid checksum\n *    isAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBa72\")\n *    //_result:\n *\n *    // Invalid ICAP checksum\n *    isAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_result:\n *\n *    // Not an address (an ENS name requires a provided and an\n *    // asynchronous API to access)\n *    isAddress(\"ricmoo.eth\")\n *    //_result:\n */\nfunction isAddress(value) {\n    try {\n        (0, address_js_1.getAddress)(value);\n        return true;\n    }\n    catch (error) { }\n    return false;\n}\nexports.isAddress = isAddress;\nasync function checkAddress(target, promise) {\n    const result = await promise;\n    if (result == null || result === \"0x0000000000000000000000000000000000000000\") {\n        (0, index_js_1.assert)(typeof (target) !== \"string\", \"unconfigured name\", \"UNCONFIGURED_NAME\", { value: target });\n        (0, index_js_1.assertArgument)(false, \"invalid AddressLike value; did not resolve to a value address\", \"target\", target);\n    }\n    return (0, address_js_1.getAddress)(result);\n}\n/**\n *  Resolves to an address for the %%target%%, which may be any\n *  supported address type, an [[Addressable]] or a Promise which\n *  resolves to an address.\n *\n *  If an ENS name is provided, but that name has not been correctly\n *  configured a [[UnconfiguredNameError]] is thrown.\n *\n *  @example:\n *    addr = \"0x6B175474E89094C44Da98b954EedeAC495271d0F\"\n *\n *    // Addresses are return synchronously\n *    resolveAddress(addr, provider)\n *    //_result:\n *\n *    // Address promises are resolved asynchronously\n *    resolveAddress(Promise.resolve(addr))\n *    //_result:\n *\n *    // ENS names are resolved asynchronously\n *    resolveAddress(\"dai.tokens.ethers.eth\", provider)\n *    //_result:\n *\n *    // Addressable objects are resolved asynchronously\n *    contract = new Contract(addr, [ ])\n *    resolveAddress(contract, provider)\n *    //_result:\n *\n *    // Unconfigured ENS names reject\n *    resolveAddress(\"nothing-here.ricmoo.eth\", provider)\n *    //_error:\n *\n *    // ENS names require a NameResolver object passed in\n *    // (notice the provider was omitted)\n *    resolveAddress(\"nothing-here.ricmoo.eth\")\n *    //_error:\n */\nfunction resolveAddress(target, resolver) {\n    if (typeof (target) === \"string\") {\n        if (target.match(/^0x[0-9a-f]{40}$/i)) {\n            return (0, address_js_1.getAddress)(target);\n        }\n        (0, index_js_1.assert)(resolver != null, \"ENS resolution requires a provider\", \"UNSUPPORTED_OPERATION\", { operation: \"resolveName\" });\n        return checkAddress(target, resolver.resolveName(target));\n    }\n    else if (isAddressable(target)) {\n        return checkAddress(target, target.getAddress());\n    }\n    else if (target && typeof (target.then) === \"function\") {\n        return checkAddress(target, target);\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported addressable value\", \"target\", target);\n}\nexports.resolveAddress = resolveAddress;\n//# sourceMappingURL=checks.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getCreate2Address = exports.getCreateAddress = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst address_js_1 = require(\"./address.js\");\n// http://ethereum.stackexchange.com/questions/760/how-is-the-address-of-an-ethereum-contract-computed\n/**\n *  Returns the address that would result from a ``CREATE`` for %%tx%%.\n *\n *  This can be used to compute the address a contract will be\n *  deployed to by an EOA when sending a deployment transaction (i.e.\n *  when the ``to`` address is ``null``).\n *\n *  This can also be used to compute the address a contract will be\n *  deployed to by a contract, by using the contract's address as the\n *  ``to`` and the contract's nonce.\n *\n *  @example\n *    from = \"0x8ba1f109551bD432803012645Ac136ddd64DBA72\";\n *    nonce = 5;\n *\n *    getCreateAddress({ from, nonce });\n *    //_result:\n */\nfunction getCreateAddress(tx) {\n    const from = (0, address_js_1.getAddress)(tx.from);\n    const nonce = (0, index_js_2.getBigInt)(tx.nonce, \"tx.nonce\");\n    let nonceHex = nonce.toString(16);\n    if (nonceHex === \"0\") {\n        nonceHex = \"0x\";\n    }\n    else if (nonceHex.length % 2) {\n        nonceHex = \"0x0\" + nonceHex;\n    }\n    else {\n        nonceHex = \"0x\" + nonceHex;\n    }\n    return (0, address_js_1.getAddress)((0, index_js_2.dataSlice)((0, index_js_1.keccak256)((0, index_js_2.encodeRlp)([from, nonceHex])), 12));\n}\nexports.getCreateAddress = getCreateAddress;\n/**\n *  Returns the address that would result from a ``CREATE2`` operation\n *  with the given %%from%%, %%salt%% and %%initCodeHash%%.\n *\n *  To compute the %%initCodeHash%% from a contract's init code, use\n *  the [[keccak256]] function.\n *\n *  For a quick overview and example of ``CREATE2``, see [[link-ricmoo-wisps]].\n *\n *  @example\n *    // The address of the contract\n *    from = \"0x8ba1f109551bD432803012645Ac136ddd64DBA72\"\n *\n *    // The salt\n *    salt = id(\"HelloWorld\")\n *\n *    // The hash of the initCode\n *    initCode = \"0x6394198df16000526103ff60206004601c335afa6040516060f3\";\n *    initCodeHash = keccak256(initCode)\n *\n *    getCreate2Address(from, salt, initCodeHash)\n *    //_result:\n */\nfunction getCreate2Address(_from, _salt, _initCodeHash) {\n    const from = (0, address_js_1.getAddress)(_from);\n    const salt = (0, index_js_2.getBytes)(_salt, \"salt\");\n    const initCodeHash = (0, index_js_2.getBytes)(_initCodeHash, \"initCodeHash\");\n    (0, index_js_2.assertArgument)(salt.length === 32, \"salt must be 32 bytes\", \"salt\", _salt);\n    (0, index_js_2.assertArgument)(initCodeHash.length === 32, \"initCodeHash must be 32 bytes\", \"initCodeHash\", _initCodeHash);\n    return (0, address_js_1.getAddress)((0, index_js_2.dataSlice)((0, index_js_1.keccak256)((0, index_js_2.concat)([\"0xff\", from, salt, initCodeHash])), 12));\n}\nexports.getCreate2Address = getCreate2Address;\n//# sourceMappingURL=contract-address.js.map","\"use strict\";\n/**\n *  Addresses are a fundamental part of interacting with Ethereum. They\n *  represent the gloabal identity of Externally Owned Accounts (accounts\n *  backed by a private key) and contracts.\n *\n *  The Ethereum Naming Service (ENS) provides an interconnected ecosystem\n *  of contracts, standards and libraries which enable looking up an\n *  address for an ENS name.\n *\n *  These functions help convert between various formats, validate\n *  addresses and safely resolve ENS names.\n *\n *  @_section: api/address:Addresses  [about-addresses]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.resolveAddress = exports.isAddress = exports.isAddressable = exports.getCreate2Address = exports.getCreateAddress = exports.getIcapAddress = exports.getAddress = void 0;\nnull;\nvar address_js_1 = require(\"./address.js\");\nObject.defineProperty(exports, \"getAddress\", { enumerable: true, get: function () { return address_js_1.getAddress; } });\nObject.defineProperty(exports, \"getIcapAddress\", { enumerable: true, get: function () { return address_js_1.getIcapAddress; } });\nvar contract_address_js_1 = require(\"./contract-address.js\");\nObject.defineProperty(exports, \"getCreateAddress\", { enumerable: true, get: function () { return contract_address_js_1.getCreateAddress; } });\nObject.defineProperty(exports, \"getCreate2Address\", { enumerable: true, get: function () { return contract_address_js_1.getCreate2Address; } });\nvar checks_js_1 = require(\"./checks.js\");\nObject.defineProperty(exports, \"isAddressable\", { enumerable: true, get: function () { return checks_js_1.isAddressable; } });\nObject.defineProperty(exports, \"isAddress\", { enumerable: true, get: function () { return checks_js_1.isAddress; } });\nObject.defineProperty(exports, \"resolveAddress\", { enumerable: true, get: function () { return checks_js_1.resolveAddress; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ZeroAddress = void 0;\n/**\n *  A constant for the zero address.\n *\n *  (**i.e.** ``\"0x0000000000000000000000000000000000000000\"``)\n */\nexports.ZeroAddress = \"0x0000000000000000000000000000000000000000\";\n//# sourceMappingURL=addresses.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ZeroHash = void 0;\n/**\n *  A constant for the zero hash.\n *\n *  (**i.e.** ``\"0x0000000000000000000000000000000000000000000000000000000000000000\"``)\n */\nexports.ZeroHash = \"0x0000000000000000000000000000000000000000000000000000000000000000\";\n//# sourceMappingURL=hashes.js.map","\"use strict\";\n/**\n *  Some common constants useful for Ethereum.\n *\n *  @_section: api/constants: Constants  [about-constants]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MessagePrefix = exports.EtherSymbol = exports.MaxInt256 = exports.MinInt256 = exports.MaxUint256 = exports.WeiPerEther = exports.N = exports.ZeroHash = exports.ZeroAddress = void 0;\nvar addresses_js_1 = require(\"./addresses.js\");\nObject.defineProperty(exports, \"ZeroAddress\", { enumerable: true, get: function () { return addresses_js_1.ZeroAddress; } });\nvar hashes_js_1 = require(\"./hashes.js\");\nObject.defineProperty(exports, \"ZeroHash\", { enumerable: true, get: function () { return hashes_js_1.ZeroHash; } });\nvar numbers_js_1 = require(\"./numbers.js\");\nObject.defineProperty(exports, \"N\", { enumerable: true, get: function () { return numbers_js_1.N; } });\nObject.defineProperty(exports, \"WeiPerEther\", { enumerable: true, get: function () { return numbers_js_1.WeiPerEther; } });\nObject.defineProperty(exports, \"MaxUint256\", { enumerable: true, get: function () { return numbers_js_1.MaxUint256; } });\nObject.defineProperty(exports, \"MinInt256\", { enumerable: true, get: function () { return numbers_js_1.MinInt256; } });\nObject.defineProperty(exports, \"MaxInt256\", { enumerable: true, get: function () { return numbers_js_1.MaxInt256; } });\nvar strings_js_1 = require(\"./strings.js\");\nObject.defineProperty(exports, \"EtherSymbol\", { enumerable: true, get: function () { return strings_js_1.EtherSymbol; } });\nObject.defineProperty(exports, \"MessagePrefix\", { enumerable: true, get: function () { return strings_js_1.MessagePrefix; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MaxInt256 = exports.MinInt256 = exports.MaxUint256 = exports.WeiPerEther = exports.N = void 0;\n/**\n *  A constant for the order N for the secp256k1 curve.\n *\n *  (**i.e.** ``0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n``)\n */\nexports.N = BigInt(\"0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141\");\n/**\n *  A constant for the number of wei in a single ether.\n *\n *  (**i.e.** ``1000000000000000000n``)\n */\nexports.WeiPerEther = BigInt(\"1000000000000000000\");\n/**\n *  A constant for the maximum value for a ``uint256``.\n *\n *  (**i.e.** ``0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffn``)\n */\nexports.MaxUint256 = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n/**\n *  A constant for the minimum value for an ``int256``.\n *\n *  (**i.e.** ``-8000000000000000000000000000000000000000000000000000000000000000n``)\n */\nexports.MinInt256 = BigInt(\"0x8000000000000000000000000000000000000000000000000000000000000000\") * BigInt(-1);\n/**\n *  A constant for the maximum value for an ``int256``.\n *\n *  (**i.e.** ``0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffn``)\n */\nexports.MaxInt256 = BigInt(\"0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n//# sourceMappingURL=numbers.js.map","\"use strict\";\n// NFKC (composed)             // (decomposed)\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MessagePrefix = exports.EtherSymbol = void 0;\n/**\n *  A constant for the ether symbol (normalized using NFKC).\n *\n *  (**i.e.** ``\"\\\\u039e\"``)\n */\nexports.EtherSymbol = \"\\u039e\"; // \"\\uD835\\uDF63\";\n/**\n *  A constant for the [[link-eip-191]] personal message prefix.\n *\n *  (**i.e.** ``\"\\\\x19Ethereum Signed Message:\\\\n\"``)\n */\nexports.MessagePrefix = \"\\x19Ethereum Signed Message:\\n\";\n//# sourceMappingURL=strings.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Contract = exports.BaseContract = exports.resolveArgs = exports.copyOverrides = void 0;\nconst index_js_1 = require(\"../abi/index.js\");\nconst index_js_2 = require(\"../address/index.js\");\n// import from provider.ts instead of index.ts to prevent circular dep\n// from EtherscanProvider\nconst provider_js_1 = require(\"../providers/provider.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst wrappers_js_1 = require(\"./wrappers.js\");\nconst BN_0 = BigInt(0);\nfunction canCall(value) {\n    return (value && typeof (value.call) === \"function\");\n}\nfunction canEstimate(value) {\n    return (value && typeof (value.estimateGas) === \"function\");\n}\nfunction canResolve(value) {\n    return (value && typeof (value.resolveName) === \"function\");\n}\nfunction canSend(value) {\n    return (value && typeof (value.sendTransaction) === \"function\");\n}\nfunction getResolver(value) {\n    if (value != null) {\n        if (canResolve(value)) {\n            return value;\n        }\n        if (value.provider) {\n            return value.provider;\n        }\n    }\n    return undefined;\n}\nclass PreparedTopicFilter {\n    #filter;\n    fragment;\n    constructor(contract, fragment, args) {\n        (0, index_js_3.defineProperties)(this, { fragment });\n        if (fragment.inputs.length < args.length) {\n            throw new Error(\"too many arguments\");\n        }\n        // Recursively descend into args and resolve any addresses\n        const runner = getRunner(contract.runner, \"resolveName\");\n        const resolver = canResolve(runner) ? runner : null;\n        this.#filter = (async function () {\n            const resolvedArgs = await Promise.all(fragment.inputs.map((param, index) => {\n                const arg = args[index];\n                if (arg == null) {\n                    return null;\n                }\n                return param.walkAsync(args[index], (type, value) => {\n                    if (type === \"address\") {\n                        if (Array.isArray(value)) {\n                            return Promise.all(value.map((v) => (0, index_js_2.resolveAddress)(v, resolver)));\n                        }\n                        return (0, index_js_2.resolveAddress)(value, resolver);\n                    }\n                    return value;\n                });\n            }));\n            return contract.interface.encodeFilterTopics(fragment, resolvedArgs);\n        })();\n    }\n    getTopicFilter() {\n        return this.#filter;\n    }\n}\n// A = Arguments passed in as a tuple\n// R = The result type of the call (i.e. if only one return type,\n//     the qualified type, otherwise Result)\n// D = The type the default call will return (i.e. R for view/pure,\n//     TransactionResponse otherwise)\n//export interface ContractMethod<A extends Array<any> = Array<any>, R = any, D extends R | ContractTransactionResponse = ContractTransactionResponse> {\nfunction getRunner(value, feature) {\n    if (value == null) {\n        return null;\n    }\n    if (typeof (value[feature]) === \"function\") {\n        return value;\n    }\n    if (value.provider && typeof (value.provider[feature]) === \"function\") {\n        return value.provider;\n    }\n    return null;\n}\nfunction getProvider(value) {\n    if (value == null) {\n        return null;\n    }\n    return value.provider || null;\n}\n/**\n *  @_ignore:\n */\nasync function copyOverrides(arg, allowed) {\n    // Make sure the overrides passed in are a valid overrides object\n    const _overrides = index_js_1.Typed.dereference(arg, \"overrides\");\n    (0, index_js_3.assertArgument)(typeof (_overrides) === \"object\", \"invalid overrides parameter\", \"overrides\", arg);\n    // Create a shallow copy (we'll deep-ify anything needed during normalizing)\n    const overrides = (0, provider_js_1.copyRequest)(_overrides);\n    (0, index_js_3.assertArgument)(overrides.to == null || (allowed || []).indexOf(\"to\") >= 0, \"cannot override to\", \"overrides.to\", overrides.to);\n    (0, index_js_3.assertArgument)(overrides.data == null || (allowed || []).indexOf(\"data\") >= 0, \"cannot override data\", \"overrides.data\", overrides.data);\n    // Resolve any from\n    if (overrides.from) {\n        overrides.from = overrides.from;\n    }\n    return overrides;\n}\nexports.copyOverrides = copyOverrides;\n/**\n *  @_ignore:\n */\nasync function resolveArgs(_runner, inputs, args) {\n    // Recursively descend into args and resolve any addresses\n    const runner = getRunner(_runner, \"resolveName\");\n    const resolver = canResolve(runner) ? runner : null;\n    return await Promise.all(inputs.map((param, index) => {\n        return param.walkAsync(args[index], (type, value) => {\n            value = index_js_1.Typed.dereference(value, type);\n            if (type === \"address\") {\n                return (0, index_js_2.resolveAddress)(value, resolver);\n            }\n            return value;\n        });\n    }));\n}\nexports.resolveArgs = resolveArgs;\nfunction buildWrappedFallback(contract) {\n    const populateTransaction = async function (overrides) {\n        // If an overrides was passed in, copy it and normalize the values\n        const tx = (await copyOverrides(overrides, [\"data\"]));\n        tx.to = await contract.getAddress();\n        if (tx.from) {\n            tx.from = await (0, index_js_2.resolveAddress)(tx.from, getResolver(contract.runner));\n        }\n        const iface = contract.interface;\n        const noValue = ((0, index_js_3.getBigInt)((tx.value || BN_0), \"overrides.value\") === BN_0);\n        const noData = ((tx.data || \"0x\") === \"0x\");\n        if (iface.fallback && !iface.fallback.payable && iface.receive && !noData && !noValue) {\n            (0, index_js_3.assertArgument)(false, \"cannot send data to receive or send value to non-payable fallback\", \"overrides\", overrides);\n        }\n        (0, index_js_3.assertArgument)(iface.fallback || noData, \"cannot send data to receive-only contract\", \"overrides.data\", tx.data);\n        // Only allow payable contracts to set non-zero value\n        const payable = iface.receive || (iface.fallback && iface.fallback.payable);\n        (0, index_js_3.assertArgument)(payable || noValue, \"cannot send value to non-payable fallback\", \"overrides.value\", tx.value);\n        // Only allow fallback contracts to set non-empty data\n        (0, index_js_3.assertArgument)(iface.fallback || noData, \"cannot send data to receive-only contract\", \"overrides.data\", tx.data);\n        return tx;\n    };\n    const staticCall = async function (overrides) {\n        const runner = getRunner(contract.runner, \"call\");\n        (0, index_js_3.assert)(canCall(runner), \"contract runner does not support calling\", \"UNSUPPORTED_OPERATION\", { operation: \"call\" });\n        const tx = await populateTransaction(overrides);\n        try {\n            return await runner.call(tx);\n        }\n        catch (error) {\n            if ((0, index_js_3.isCallException)(error) && error.data) {\n                throw contract.interface.makeError(error.data, tx);\n            }\n            throw error;\n        }\n    };\n    const send = async function (overrides) {\n        const runner = contract.runner;\n        (0, index_js_3.assert)(canSend(runner), \"contract runner does not support sending transactions\", \"UNSUPPORTED_OPERATION\", { operation: \"sendTransaction\" });\n        const tx = await runner.sendTransaction(await populateTransaction(overrides));\n        const provider = getProvider(contract.runner);\n        // @TODO: the provider can be null; make a custom dummy provider that will throw a\n        // meaningful error\n        return new wrappers_js_1.ContractTransactionResponse(contract.interface, provider, tx);\n    };\n    const estimateGas = async function (overrides) {\n        const runner = getRunner(contract.runner, \"estimateGas\");\n        (0, index_js_3.assert)(canEstimate(runner), \"contract runner does not support gas estimation\", \"UNSUPPORTED_OPERATION\", { operation: \"estimateGas\" });\n        return await runner.estimateGas(await populateTransaction(overrides));\n    };\n    const method = async (overrides) => {\n        return await send(overrides);\n    };\n    (0, index_js_3.defineProperties)(method, {\n        _contract: contract,\n        estimateGas,\n        populateTransaction,\n        send, staticCall\n    });\n    return method;\n}\nfunction buildWrappedMethod(contract, key) {\n    const getFragment = function (...args) {\n        const fragment = contract.interface.getFunction(key, args);\n        (0, index_js_3.assert)(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fragment\",\n            info: { key, args }\n        });\n        return fragment;\n    };\n    const populateTransaction = async function (...args) {\n        const fragment = getFragment(...args);\n        // If an overrides was passed in, copy it and normalize the values\n        let overrides = {};\n        if (fragment.inputs.length + 1 === args.length) {\n            overrides = await copyOverrides(args.pop());\n            if (overrides.from) {\n                overrides.from = await (0, index_js_2.resolveAddress)(overrides.from, getResolver(contract.runner));\n            }\n        }\n        if (fragment.inputs.length !== args.length) {\n            throw new Error(\"internal error: fragment inputs doesn't match arguments; should not happen\");\n        }\n        const resolvedArgs = await resolveArgs(contract.runner, fragment.inputs, args);\n        return Object.assign({}, overrides, await (0, index_js_3.resolveProperties)({\n            to: contract.getAddress(),\n            data: contract.interface.encodeFunctionData(fragment, resolvedArgs)\n        }));\n    };\n    const staticCall = async function (...args) {\n        const result = await staticCallResult(...args);\n        if (result.length === 1) {\n            return result[0];\n        }\n        return result;\n    };\n    const send = async function (...args) {\n        const runner = contract.runner;\n        (0, index_js_3.assert)(canSend(runner), \"contract runner does not support sending transactions\", \"UNSUPPORTED_OPERATION\", { operation: \"sendTransaction\" });\n        const tx = await runner.sendTransaction(await populateTransaction(...args));\n        const provider = getProvider(contract.runner);\n        // @TODO: the provider can be null; make a custom dummy provider that will throw a\n        // meaningful error\n        return new wrappers_js_1.ContractTransactionResponse(contract.interface, provider, tx);\n    };\n    const estimateGas = async function (...args) {\n        const runner = getRunner(contract.runner, \"estimateGas\");\n        (0, index_js_3.assert)(canEstimate(runner), \"contract runner does not support gas estimation\", \"UNSUPPORTED_OPERATION\", { operation: \"estimateGas\" });\n        return await runner.estimateGas(await populateTransaction(...args));\n    };\n    const staticCallResult = async function (...args) {\n        const runner = getRunner(contract.runner, \"call\");\n        (0, index_js_3.assert)(canCall(runner), \"contract runner does not support calling\", \"UNSUPPORTED_OPERATION\", { operation: \"call\" });\n        const tx = await populateTransaction(...args);\n        let result = \"0x\";\n        try {\n            result = await runner.call(tx);\n        }\n        catch (error) {\n            if ((0, index_js_3.isCallException)(error) && error.data) {\n                throw contract.interface.makeError(error.data, tx);\n            }\n            throw error;\n        }\n        const fragment = getFragment(...args);\n        return contract.interface.decodeFunctionResult(fragment, result);\n    };\n    const method = async (...args) => {\n        const fragment = getFragment(...args);\n        if (fragment.constant) {\n            return await staticCall(...args);\n        }\n        return await send(...args);\n    };\n    (0, index_js_3.defineProperties)(method, {\n        name: contract.interface.getFunctionName(key),\n        _contract: contract, _key: key,\n        getFragment,\n        estimateGas,\n        populateTransaction,\n        send, staticCall, staticCallResult,\n    });\n    // Only works on non-ambiguous keys (refined fragment is always non-ambiguous)\n    Object.defineProperty(method, \"fragment\", {\n        configurable: false,\n        enumerable: true,\n        get: () => {\n            const fragment = contract.interface.getFunction(key);\n            (0, index_js_3.assert)(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"fragment\",\n                info: { key }\n            });\n            return fragment;\n        }\n    });\n    return method;\n}\nfunction buildWrappedEvent(contract, key) {\n    const getFragment = function (...args) {\n        const fragment = contract.interface.getEvent(key, args);\n        (0, index_js_3.assert)(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fragment\",\n            info: { key, args }\n        });\n        return fragment;\n    };\n    const method = function (...args) {\n        return new PreparedTopicFilter(contract, getFragment(...args), args);\n    };\n    (0, index_js_3.defineProperties)(method, {\n        name: contract.interface.getEventName(key),\n        _contract: contract, _key: key,\n        getFragment\n    });\n    // Only works on non-ambiguous keys (refined fragment is always non-ambiguous)\n    Object.defineProperty(method, \"fragment\", {\n        configurable: false,\n        enumerable: true,\n        get: () => {\n            const fragment = contract.interface.getEvent(key);\n            (0, index_js_3.assert)(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"fragment\",\n                info: { key }\n            });\n            return fragment;\n        }\n    });\n    return method;\n}\n// The combination of TypeScrype, Private Fields and Proxies makes\n// the world go boom; so we hide variables with some trickery keeping\n// a symbol attached to each BaseContract which its sub-class (even\n// via a Proxy) can reach and use to look up its internal values.\nconst internal = Symbol.for(\"_ethersInternal_contract\");\nconst internalValues = new WeakMap();\nfunction setInternal(contract, values) {\n    internalValues.set(contract[internal], values);\n}\nfunction getInternal(contract) {\n    return internalValues.get(contract[internal]);\n}\nfunction isDeferred(value) {\n    return (value && typeof (value) === \"object\" && (\"getTopicFilter\" in value) &&\n        (typeof (value.getTopicFilter) === \"function\") && value.fragment);\n}\nasync function getSubInfo(contract, event) {\n    let topics;\n    let fragment = null;\n    // Convert named events to topicHash and get the fragment for\n    // events which need deconstructing.\n    if (Array.isArray(event)) {\n        const topicHashify = function (name) {\n            if ((0, index_js_3.isHexString)(name, 32)) {\n                return name;\n            }\n            const fragment = contract.interface.getEvent(name);\n            (0, index_js_3.assertArgument)(fragment, \"unknown fragment\", \"name\", name);\n            return fragment.topicHash;\n        };\n        // Array of Topics and Names; e.g. `[ \"0x1234...89ab\", \"Transfer(address)\" ]`\n        topics = event.map((e) => {\n            if (e == null) {\n                return null;\n            }\n            if (Array.isArray(e)) {\n                return e.map(topicHashify);\n            }\n            return topicHashify(e);\n        });\n    }\n    else if (event === \"*\") {\n        topics = [null];\n    }\n    else if (typeof (event) === \"string\") {\n        if ((0, index_js_3.isHexString)(event, 32)) {\n            // Topic Hash\n            topics = [event];\n        }\n        else {\n            // Name or Signature; e.g. `\"Transfer\", `\"Transfer(address)\"`\n            fragment = contract.interface.getEvent(event);\n            (0, index_js_3.assertArgument)(fragment, \"unknown fragment\", \"event\", event);\n            topics = [fragment.topicHash];\n        }\n    }\n    else if (isDeferred(event)) {\n        // Deferred Topic Filter; e.g. `contract.filter.Transfer(from)`\n        topics = await event.getTopicFilter();\n    }\n    else if (\"fragment\" in event) {\n        // ContractEvent; e.g. `contract.filter.Transfer`\n        fragment = event.fragment;\n        topics = [fragment.topicHash];\n    }\n    else {\n        (0, index_js_3.assertArgument)(false, \"unknown event name\", \"event\", event);\n    }\n    // Normalize topics and sort TopicSets\n    topics = topics.map((t) => {\n        if (t == null) {\n            return null;\n        }\n        if (Array.isArray(t)) {\n            const items = Array.from(new Set(t.map((t) => t.toLowerCase())).values());\n            if (items.length === 1) {\n                return items[0];\n            }\n            items.sort();\n            return items;\n        }\n        return t.toLowerCase();\n    });\n    const tag = topics.map((t) => {\n        if (t == null) {\n            return \"null\";\n        }\n        if (Array.isArray(t)) {\n            return t.join(\"|\");\n        }\n        return t;\n    }).join(\"&\");\n    return { fragment, tag, topics };\n}\nasync function hasSub(contract, event) {\n    const { subs } = getInternal(contract);\n    return subs.get((await getSubInfo(contract, event)).tag) || null;\n}\nasync function getSub(contract, operation, event) {\n    // Make sure our runner can actually subscribe to events\n    const provider = getProvider(contract.runner);\n    (0, index_js_3.assert)(provider, \"contract runner does not support subscribing\", \"UNSUPPORTED_OPERATION\", { operation });\n    const { fragment, tag, topics } = await getSubInfo(contract, event);\n    const { addr, subs } = getInternal(contract);\n    let sub = subs.get(tag);\n    if (!sub) {\n        const address = (addr ? addr : contract);\n        const filter = { address, topics };\n        const listener = (log) => {\n            let foundFragment = fragment;\n            if (foundFragment == null) {\n                try {\n                    foundFragment = contract.interface.getEvent(log.topics[0]);\n                }\n                catch (error) { }\n            }\n            // If fragment is null, we do not deconstruct the args to emit\n            if (foundFragment) {\n                const _foundFragment = foundFragment;\n                const args = fragment ? contract.interface.decodeEventLog(fragment, log.data, log.topics) : [];\n                emit(contract, event, args, (listener) => {\n                    return new wrappers_js_1.ContractEventPayload(contract, listener, event, _foundFragment, log);\n                });\n            }\n            else {\n                emit(contract, event, [], (listener) => {\n                    return new wrappers_js_1.ContractUnknownEventPayload(contract, listener, event, log);\n                });\n            }\n        };\n        let starting = [];\n        const start = () => {\n            if (starting.length) {\n                return;\n            }\n            starting.push(provider.on(filter, listener));\n        };\n        const stop = async () => {\n            if (starting.length == 0) {\n                return;\n            }\n            let started = starting;\n            starting = [];\n            await Promise.all(started);\n            provider.off(filter, listener);\n        };\n        sub = { tag, listeners: [], start, stop };\n        subs.set(tag, sub);\n    }\n    return sub;\n}\n// We use this to ensure one emit resolves before firing the next to\n// ensure correct ordering (note this cannot throw and just adds the\n// notice to the event queu using setTimeout).\nlet lastEmit = Promise.resolve();\nasync function _emit(contract, event, args, payloadFunc) {\n    await lastEmit;\n    const sub = await hasSub(contract, event);\n    if (!sub) {\n        return false;\n    }\n    const count = sub.listeners.length;\n    sub.listeners = sub.listeners.filter(({ listener, once }) => {\n        const passArgs = Array.from(args);\n        if (payloadFunc) {\n            passArgs.push(payloadFunc(once ? null : listener));\n        }\n        try {\n            listener.call(contract, ...passArgs);\n        }\n        catch (error) { }\n        return !once;\n    });\n    if (sub.listeners.length === 0) {\n        sub.stop();\n        getInternal(contract).subs.delete(sub.tag);\n    }\n    return (count > 0);\n}\nasync function emit(contract, event, args, payloadFunc) {\n    try {\n        await lastEmit;\n    }\n    catch (error) { }\n    const resultPromise = _emit(contract, event, args, payloadFunc);\n    lastEmit = resultPromise;\n    return await resultPromise;\n}\nconst passProperties = [\"then\"];\nclass BaseContract {\n    /**\n     *  The target to connect to.\n     *\n     *  This can be an address, ENS name or any [[Addressable]], such as\n     *  another contract. To get the resovled address, use the ``getAddress``\n     *  method.\n     */\n    target;\n    /**\n     *  The contract Interface.\n     */\n    interface;\n    /**\n     *  The connected runner. This is generally a [[Provider]] or a\n     *  [[Signer]], which dictates what operations are supported.\n     *\n     *  For example, a **Contract** connected to a [[Provider]] may\n     *  only execute read-only operations.\n     */\n    runner;\n    /**\n     *  All the Events available on this contract.\n     */\n    filters;\n    /**\n     *  @_ignore:\n     */\n    [internal];\n    /**\n     *  The fallback or receive function if any.\n     */\n    fallback;\n    /**\n     *  Creates a new contract connected to %%target%% with the %%abi%% and\n     *  optionally connected to a %%runner%% to perform operations on behalf\n     *  of.\n     */\n    constructor(target, abi, runner, _deployTx) {\n        (0, index_js_3.assertArgument)(typeof (target) === \"string\" || (0, index_js_2.isAddressable)(target), \"invalid value for Contract target\", \"target\", target);\n        if (runner == null) {\n            runner = null;\n        }\n        const iface = index_js_1.Interface.from(abi);\n        (0, index_js_3.defineProperties)(this, { target, runner, interface: iface });\n        Object.defineProperty(this, internal, { value: {} });\n        let addrPromise;\n        let addr = null;\n        let deployTx = null;\n        if (_deployTx) {\n            const provider = getProvider(runner);\n            // @TODO: the provider can be null; make a custom dummy provider that will throw a\n            // meaningful error\n            deployTx = new wrappers_js_1.ContractTransactionResponse(this.interface, provider, _deployTx);\n        }\n        let subs = new Map();\n        // Resolve the target as the address\n        if (typeof (target) === \"string\") {\n            if ((0, index_js_3.isHexString)(target)) {\n                addr = target;\n                addrPromise = Promise.resolve(target);\n            }\n            else {\n                const resolver = getRunner(runner, \"resolveName\");\n                if (!canResolve(resolver)) {\n                    throw (0, index_js_3.makeError)(\"contract runner does not support name resolution\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"resolveName\"\n                    });\n                }\n                addrPromise = resolver.resolveName(target).then((addr) => {\n                    if (addr == null) {\n                        throw (0, index_js_3.makeError)(\"an ENS name used for a contract target must be correctly configured\", \"UNCONFIGURED_NAME\", {\n                            value: target\n                        });\n                    }\n                    getInternal(this).addr = addr;\n                    return addr;\n                });\n            }\n        }\n        else {\n            addrPromise = target.getAddress().then((addr) => {\n                if (addr == null) {\n                    throw new Error(\"TODO\");\n                }\n                getInternal(this).addr = addr;\n                return addr;\n            });\n        }\n        // Set our private values\n        setInternal(this, { addrPromise, addr, deployTx, subs });\n        // Add the event filters\n        const filters = new Proxy({}, {\n            get: (target, prop, receiver) => {\n                // Pass important checks (like `then` for Promise) through\n                if (typeof (prop) === \"symbol\" || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.get(target, prop, receiver);\n                }\n                try {\n                    return this.getEvent(prop);\n                }\n                catch (error) {\n                    if (!(0, index_js_3.isError)(error, \"INVALID_ARGUMENT\") || error.argument !== \"key\") {\n                        throw error;\n                    }\n                }\n                return undefined;\n            },\n            has: (target, prop) => {\n                // Pass important checks (like `then` for Promise) through\n                if (passProperties.indexOf(prop) >= 0) {\n                    return Reflect.has(target, prop);\n                }\n                return Reflect.has(target, prop) || this.interface.hasEvent(String(prop));\n            }\n        });\n        (0, index_js_3.defineProperties)(this, { filters });\n        (0, index_js_3.defineProperties)(this, {\n            fallback: ((iface.receive || iface.fallback) ? (buildWrappedFallback(this)) : null)\n        });\n        // Return a Proxy that will respond to functions\n        return new Proxy(this, {\n            get: (target, prop, receiver) => {\n                if (typeof (prop) === \"symbol\" || prop in target || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.get(target, prop, receiver);\n                }\n                // Undefined properties should return undefined\n                try {\n                    return target.getFunction(prop);\n                }\n                catch (error) {\n                    if (!(0, index_js_3.isError)(error, \"INVALID_ARGUMENT\") || error.argument !== \"key\") {\n                        throw error;\n                    }\n                }\n                return undefined;\n            },\n            has: (target, prop) => {\n                if (typeof (prop) === \"symbol\" || prop in target || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.has(target, prop);\n                }\n                return target.interface.hasFunction(prop);\n            }\n        });\n    }\n    /**\n     *  Return a new Contract instance with the same target and ABI, but\n     *  a different %%runner%%.\n     */\n    connect(runner) {\n        return new BaseContract(this.target, this.interface, runner);\n    }\n    /**\n     *  Return a new Contract instance with the same ABI and runner, but\n     *  a different %%target%%.\n     */\n    attach(target) {\n        return new BaseContract(target, this.interface, this.runner);\n    }\n    /**\n     *  Return the resolved address of this Contract.\n     */\n    async getAddress() { return await getInternal(this).addrPromise; }\n    /**\n     *  Return the deployed bytecode or null if no bytecode is found.\n     */\n    async getDeployedCode() {\n        const provider = getProvider(this.runner);\n        (0, index_js_3.assert)(provider, \"runner does not support .provider\", \"UNSUPPORTED_OPERATION\", { operation: \"getDeployedCode\" });\n        const code = await provider.getCode(await this.getAddress());\n        if (code === \"0x\") {\n            return null;\n        }\n        return code;\n    }\n    /**\n     *  Resolve to this Contract once the bytecode has been deployed, or\n     *  resolve immediately if already deployed.\n     */\n    async waitForDeployment() {\n        // We have the deployement transaction; just use that (throws if deployement fails)\n        const deployTx = this.deploymentTransaction();\n        if (deployTx) {\n            await deployTx.wait();\n            return this;\n        }\n        // Check for code\n        const code = await this.getDeployedCode();\n        if (code != null) {\n            return this;\n        }\n        // Make sure we can subscribe to a provider event\n        const provider = getProvider(this.runner);\n        (0, index_js_3.assert)(provider != null, \"contract runner does not support .provider\", \"UNSUPPORTED_OPERATION\", { operation: \"waitForDeployment\" });\n        return new Promise((resolve, reject) => {\n            const checkCode = async () => {\n                try {\n                    const code = await this.getDeployedCode();\n                    if (code != null) {\n                        return resolve(this);\n                    }\n                    provider.once(\"block\", checkCode);\n                }\n                catch (error) {\n                    reject(error);\n                }\n            };\n            checkCode();\n        });\n    }\n    /**\n     *  Return the transaction used to deploy this contract.\n     *\n     *  This is only available if this instance was returned from a\n     *  [[ContractFactory]].\n     */\n    deploymentTransaction() {\n        return getInternal(this).deployTx;\n    }\n    /**\n     *  Return the function for a given name. This is useful when a contract\n     *  method name conflicts with a JavaScript name such as ``prototype`` or\n     *  when using a Contract programatically.\n     */\n    getFunction(key) {\n        if (typeof (key) !== \"string\") {\n            key = key.format();\n        }\n        const func = buildWrappedMethod(this, key);\n        return func;\n    }\n    /**\n     *  Return the event for a given name. This is useful when a contract\n     *  event name conflicts with a JavaScript name such as ``prototype`` or\n     *  when using a Contract programatically.\n     */\n    getEvent(key) {\n        if (typeof (key) !== \"string\") {\n            key = key.format();\n        }\n        return buildWrappedEvent(this, key);\n    }\n    /**\n     *  @_ignore:\n     */\n    async queryTransaction(hash) {\n        throw new Error(\"@TODO\");\n    }\n    /*\n    // @TODO: this is a non-backwards compatible change, but will be added\n    //        in v7 and in a potential SmartContract class in an upcoming\n    //        v6 release\n    async getTransactionReceipt(hash: string): Promise<null | ContractTransactionReceipt> {\n        const provider = getProvider(this.runner);\n        assert(provider, \"contract runner does not have a provider\",\n            \"UNSUPPORTED_OPERATION\", { operation: \"queryTransaction\" });\n\n        const receipt = await provider.getTransactionReceipt(hash);\n        if (receipt == null) { return null; }\n\n        return new ContractTransactionReceipt(this.interface, provider, receipt);\n    }\n    */\n    /**\n     *  Provide historic access to event data for %%event%% in the range\n     *  %%fromBlock%% (default: ``0``) to %%toBlock%% (default: ``\"latest\"``)\n     *  inclusive.\n     */\n    async queryFilter(event, fromBlock, toBlock) {\n        if (fromBlock == null) {\n            fromBlock = 0;\n        }\n        if (toBlock == null) {\n            toBlock = \"latest\";\n        }\n        const { addr, addrPromise } = getInternal(this);\n        const address = (addr ? addr : (await addrPromise));\n        const { fragment, topics } = await getSubInfo(this, event);\n        const filter = { address, topics, fromBlock, toBlock };\n        const provider = getProvider(this.runner);\n        (0, index_js_3.assert)(provider, \"contract runner does not have a provider\", \"UNSUPPORTED_OPERATION\", { operation: \"queryFilter\" });\n        return (await provider.getLogs(filter)).map((log) => {\n            let foundFragment = fragment;\n            if (foundFragment == null) {\n                try {\n                    foundFragment = this.interface.getEvent(log.topics[0]);\n                }\n                catch (error) { }\n            }\n            if (foundFragment) {\n                try {\n                    return new wrappers_js_1.EventLog(log, this.interface, foundFragment);\n                }\n                catch (error) {\n                    return new wrappers_js_1.UndecodedEventLog(log, error);\n                }\n            }\n            return new provider_js_1.Log(log, provider);\n        });\n    }\n    /**\n     *  Add an event %%listener%% for the %%event%%.\n     */\n    async on(event, listener) {\n        const sub = await getSub(this, \"on\", event);\n        sub.listeners.push({ listener, once: false });\n        sub.start();\n        return this;\n    }\n    /**\n     *  Add an event %%listener%% for the %%event%%, but remove the listener\n     *  after it is fired once.\n     */\n    async once(event, listener) {\n        const sub = await getSub(this, \"once\", event);\n        sub.listeners.push({ listener, once: true });\n        sub.start();\n        return this;\n    }\n    /**\n     *  Emit an %%event%% calling all listeners with %%args%%.\n     *\n     *  Resolves to ``true`` if any listeners were called.\n     */\n    async emit(event, ...args) {\n        return await emit(this, event, args, null);\n    }\n    /**\n     *  Resolves to the number of listeners of %%event%% or the total number\n     *  of listeners if unspecified.\n     */\n    async listenerCount(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return 0;\n            }\n            return sub.listeners.length;\n        }\n        const { subs } = getInternal(this);\n        let total = 0;\n        for (const { listeners } of subs.values()) {\n            total += listeners.length;\n        }\n        return total;\n    }\n    /**\n     *  Resolves to the listeners subscribed to %%event%% or all listeners\n     *  if unspecified.\n     */\n    async listeners(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return [];\n            }\n            return sub.listeners.map(({ listener }) => listener);\n        }\n        const { subs } = getInternal(this);\n        let result = [];\n        for (const { listeners } of subs.values()) {\n            result = result.concat(listeners.map(({ listener }) => listener));\n        }\n        return result;\n    }\n    /**\n     *  Remove the %%listener%% from the listeners for %%event%% or remove\n     *  all listeners if unspecified.\n     */\n    async off(event, listener) {\n        const sub = await hasSub(this, event);\n        if (!sub) {\n            return this;\n        }\n        if (listener) {\n            const index = sub.listeners.map(({ listener }) => listener).indexOf(listener);\n            if (index >= 0) {\n                sub.listeners.splice(index, 1);\n            }\n        }\n        if (listener == null || sub.listeners.length === 0) {\n            sub.stop();\n            getInternal(this).subs.delete(sub.tag);\n        }\n        return this;\n    }\n    /**\n     *  Remove all the listeners for %%event%% or remove all listeners if\n     *  unspecified.\n     */\n    async removeAllListeners(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return this;\n            }\n            sub.stop();\n            getInternal(this).subs.delete(sub.tag);\n        }\n        else {\n            const { subs } = getInternal(this);\n            for (const { tag, stop } of subs.values()) {\n                stop();\n                subs.delete(tag);\n            }\n        }\n        return this;\n    }\n    /**\n     *  Alias for [on].\n     */\n    async addListener(event, listener) {\n        return await this.on(event, listener);\n    }\n    /**\n     *  Alias for [off].\n     */\n    async removeListener(event, listener) {\n        return await this.off(event, listener);\n    }\n    /**\n     *  Create a new Class for the %%abi%%.\n     */\n    static buildClass(abi) {\n        class CustomContract extends BaseContract {\n            constructor(address, runner = null) {\n                super(address, abi, runner);\n            }\n        }\n        return CustomContract;\n    }\n    ;\n    /**\n     *  Create a new BaseContract with a specified Interface.\n     */\n    static from(target, abi, runner) {\n        if (runner == null) {\n            runner = null;\n        }\n        const contract = new this(target, abi, runner);\n        return contract;\n    }\n}\nexports.BaseContract = BaseContract;\nfunction _ContractBase() {\n    return BaseContract;\n}\n/**\n *  A [[BaseContract]] with no type guards on its methods or events.\n */\nclass Contract extends _ContractBase() {\n}\nexports.Contract = Contract;\n//# sourceMappingURL=contract.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ContractFactory = void 0;\nconst index_js_1 = require(\"../abi/index.js\");\nconst index_js_2 = require(\"../address/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst contract_js_1 = require(\"./contract.js\");\n// A = Arguments to the constructor\n// I = Interface of deployed contracts\n/**\n *  A **ContractFactory** is used to deploy a Contract to the blockchain.\n */\nclass ContractFactory {\n    /**\n     *  The Contract Interface.\n     */\n    interface;\n    /**\n     *  The Contract deployment bytecode. Often called the initcode.\n     */\n    bytecode;\n    /**\n     *  The ContractRunner to deploy the Contract as.\n     */\n    runner;\n    /**\n     *  Create a new **ContractFactory** with %%abi%% and %%bytecode%%,\n     *  optionally connected to %%runner%%.\n     *\n     *  The %%bytecode%% may be the ``bytecode`` property within the\n     *  standard Solidity JSON output.\n     */\n    constructor(abi, bytecode, runner) {\n        const iface = index_js_1.Interface.from(abi);\n        // Dereference Solidity bytecode objects and allow a missing `0x`-prefix\n        if (bytecode instanceof Uint8Array) {\n            bytecode = (0, index_js_3.hexlify)((0, index_js_3.getBytes)(bytecode));\n        }\n        else {\n            if (typeof (bytecode) === \"object\") {\n                bytecode = bytecode.object;\n            }\n            if (!bytecode.startsWith(\"0x\")) {\n                bytecode = \"0x\" + bytecode;\n            }\n            bytecode = (0, index_js_3.hexlify)((0, index_js_3.getBytes)(bytecode));\n        }\n        (0, index_js_3.defineProperties)(this, {\n            bytecode, interface: iface, runner: (runner || null)\n        });\n    }\n    attach(target) {\n        return new contract_js_1.BaseContract(target, this.interface, this.runner);\n    }\n    /**\n     *  Resolves to the transaction to deploy the contract, passing %%args%%\n     *  into the constructor.\n     */\n    async getDeployTransaction(...args) {\n        let overrides = {};\n        const fragment = this.interface.deploy;\n        if (fragment.inputs.length + 1 === args.length) {\n            overrides = await (0, contract_js_1.copyOverrides)(args.pop());\n        }\n        if (fragment.inputs.length !== args.length) {\n            throw new Error(\"incorrect number of arguments to constructor\");\n        }\n        const resolvedArgs = await (0, contract_js_1.resolveArgs)(this.runner, fragment.inputs, args);\n        const data = (0, index_js_3.concat)([this.bytecode, this.interface.encodeDeploy(resolvedArgs)]);\n        return Object.assign({}, overrides, { data });\n    }\n    /**\n     *  Resolves to the Contract deployed by passing %%args%% into the\n     *  constructor.\n     *\n     *  This will resolve to the Contract before it has been deployed to the\n     *  network, so the [[BaseContract-waitForDeployment]] should be used before\n     *  sending any transactions to it.\n     */\n    async deploy(...args) {\n        const tx = await this.getDeployTransaction(...args);\n        (0, index_js_3.assert)(this.runner && typeof (this.runner.sendTransaction) === \"function\", \"factory runner does not support sending transactions\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"sendTransaction\"\n        });\n        const sentTx = await this.runner.sendTransaction(tx);\n        const address = (0, index_js_2.getCreateAddress)(sentTx);\n        return new contract_js_1.BaseContract(address, this.interface, this.runner, sentTx);\n    }\n    /**\n     *  Return a new **ContractFactory** with the same ABI and bytecode,\n     *  but connected to %%runner%%.\n     */\n    connect(runner) {\n        return new ContractFactory(this.interface, this.bytecode, runner);\n    }\n    /**\n     *  Create a new **ContractFactory** from the standard Solidity JSON output.\n     */\n    static fromSolidity(output, runner) {\n        (0, index_js_3.assertArgument)(output != null, \"bad compiler output\", \"output\", output);\n        if (typeof (output) === \"string\") {\n            output = JSON.parse(output);\n        }\n        const abi = output.abi;\n        let bytecode = \"\";\n        if (output.bytecode) {\n            bytecode = output.bytecode;\n        }\n        else if (output.evm && output.evm.bytecode) {\n            bytecode = output.evm.bytecode;\n        }\n        return new this(abi, bytecode, runner);\n    }\n}\nexports.ContractFactory = ContractFactory;\n//# sourceMappingURL=factory.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.UndecodedEventLog = exports.EventLog = exports.ContractTransactionResponse = exports.ContractTransactionReceipt = exports.ContractUnknownEventPayload = exports.ContractEventPayload = exports.ContractFactory = exports.Contract = exports.BaseContract = void 0;\n/**\n *  A **Contract** object is a meta-class (a class whose definition is\n *  defined at runtime), which communicates with a deployed smart contract\n *  on the blockchain and provides a simple JavaScript interface to call\n *  methods, send transaction, query historic logs and listen for its events.\n *\n *  @_section: api/contract:Contracts  [about-contracts]\n */\nvar contract_js_1 = require(\"./contract.js\");\nObject.defineProperty(exports, \"BaseContract\", { enumerable: true, get: function () { return contract_js_1.BaseContract; } });\nObject.defineProperty(exports, \"Contract\", { enumerable: true, get: function () { return contract_js_1.Contract; } });\nvar factory_js_1 = require(\"./factory.js\");\nObject.defineProperty(exports, \"ContractFactory\", { enumerable: true, get: function () { return factory_js_1.ContractFactory; } });\nvar wrappers_js_1 = require(\"./wrappers.js\");\nObject.defineProperty(exports, \"ContractEventPayload\", { enumerable: true, get: function () { return wrappers_js_1.ContractEventPayload; } });\nObject.defineProperty(exports, \"ContractUnknownEventPayload\", { enumerable: true, get: function () { return wrappers_js_1.ContractUnknownEventPayload; } });\nObject.defineProperty(exports, \"ContractTransactionReceipt\", { enumerable: true, get: function () { return wrappers_js_1.ContractTransactionReceipt; } });\nObject.defineProperty(exports, \"ContractTransactionResponse\", { enumerable: true, get: function () { return wrappers_js_1.ContractTransactionResponse; } });\nObject.defineProperty(exports, \"EventLog\", { enumerable: true, get: function () { return wrappers_js_1.EventLog; } });\nObject.defineProperty(exports, \"UndecodedEventLog\", { enumerable: true, get: function () { return wrappers_js_1.UndecodedEventLog; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ContractEventPayload = exports.ContractUnknownEventPayload = exports.ContractTransactionResponse = exports.ContractTransactionReceipt = exports.UndecodedEventLog = exports.EventLog = void 0;\n// import from provider.ts instead of index.ts to prevent circular dep\n// from EtherscanProvider\nconst provider_js_1 = require(\"../providers/provider.js\");\nconst index_js_1 = require(\"../utils/index.js\");\n/**\n *  An **EventLog** contains additional properties parsed from the [[Log]].\n */\nclass EventLog extends provider_js_1.Log {\n    /**\n     *  The Contract Interface.\n     */\n    interface;\n    /**\n     *  The matching event.\n     */\n    fragment;\n    /**\n     *  The parsed arguments passed to the event by ``emit``.\n     */\n    args;\n    /**\n     * @_ignore:\n     */\n    constructor(log, iface, fragment) {\n        super(log, log.provider);\n        const args = iface.decodeEventLog(fragment, log.data, log.topics);\n        (0, index_js_1.defineProperties)(this, { args, fragment, interface: iface });\n    }\n    /**\n     *  The name of the event.\n     */\n    get eventName() { return this.fragment.name; }\n    /**\n     *  The signature of the event.\n     */\n    get eventSignature() { return this.fragment.format(); }\n}\nexports.EventLog = EventLog;\n/**\n *  An **EventLog** contains additional properties parsed from the [[Log]].\n */\nclass UndecodedEventLog extends provider_js_1.Log {\n    /**\n     *  The error encounted when trying to decode the log.\n     */\n    error;\n    /**\n     * @_ignore:\n     */\n    constructor(log, error) {\n        super(log, log.provider);\n        (0, index_js_1.defineProperties)(this, { error });\n    }\n}\nexports.UndecodedEventLog = UndecodedEventLog;\n/**\n *  A **ContractTransactionReceipt** includes the parsed logs from a\n *  [[TransactionReceipt]].\n */\nclass ContractTransactionReceipt extends provider_js_1.TransactionReceipt {\n    #iface;\n    /**\n     *  @_ignore:\n     */\n    constructor(iface, provider, tx) {\n        super(tx, provider);\n        this.#iface = iface;\n    }\n    /**\n     *  The parsed logs for any [[Log]] which has a matching event in the\n     *  Contract ABI.\n     */\n    get logs() {\n        return super.logs.map((log) => {\n            const fragment = log.topics.length ? this.#iface.getEvent(log.topics[0]) : null;\n            if (fragment) {\n                try {\n                    return new EventLog(log, this.#iface, fragment);\n                }\n                catch (error) {\n                    return new UndecodedEventLog(log, error);\n                }\n            }\n            return log;\n        });\n    }\n}\nexports.ContractTransactionReceipt = ContractTransactionReceipt;\n/**\n *  A **ContractTransactionResponse** will return a\n *  [[ContractTransactionReceipt]] when waited on.\n */\nclass ContractTransactionResponse extends provider_js_1.TransactionResponse {\n    #iface;\n    /**\n     *  @_ignore:\n     */\n    constructor(iface, provider, tx) {\n        super(tx, provider);\n        this.#iface = iface;\n    }\n    /**\n     *  Resolves once this transaction has been mined and has\n     *  %%confirms%% blocks including it (default: ``1``) with an\n     *  optional %%timeout%%.\n     *\n     *  This can resolve to ``null`` only if %%confirms%% is ``0``\n     *  and the transaction has not been mined, otherwise this will\n     *  wait until enough confirmations have completed.\n     */\n    async wait(confirms, timeout) {\n        const receipt = await super.wait(confirms, timeout);\n        if (receipt == null) {\n            return null;\n        }\n        return new ContractTransactionReceipt(this.#iface, this.provider, receipt);\n    }\n}\nexports.ContractTransactionResponse = ContractTransactionResponse;\n/**\n *  A **ContractUnknownEventPayload** is included as the last parameter to\n *  Contract Events when the event does not match any events in the ABI.\n */\nclass ContractUnknownEventPayload extends index_js_1.EventPayload {\n    /**\n     *  The log with no matching events.\n     */\n    log;\n    /**\n     *  @_event:\n     */\n    constructor(contract, listener, filter, log) {\n        super(contract, listener, filter);\n        (0, index_js_1.defineProperties)(this, { log });\n    }\n    /**\n     *  Resolves to the block the event occured in.\n     */\n    async getBlock() {\n        return await this.log.getBlock();\n    }\n    /**\n     *  Resolves to the transaction the event occured in.\n     */\n    async getTransaction() {\n        return await this.log.getTransaction();\n    }\n    /**\n     *  Resolves to the transaction receipt the event occured in.\n     */\n    async getTransactionReceipt() {\n        return await this.log.getTransactionReceipt();\n    }\n}\nexports.ContractUnknownEventPayload = ContractUnknownEventPayload;\n/**\n *  A **ContractEventPayload** is included as the last parameter to\n *  Contract Events when the event is known.\n */\nclass ContractEventPayload extends ContractUnknownEventPayload {\n    /**\n     *  @_ignore:\n     */\n    constructor(contract, listener, filter, fragment, _log) {\n        super(contract, listener, filter, new EventLog(_log, contract.interface, fragment));\n        const args = contract.interface.decodeEventLog(fragment, this.log.data, this.log.topics);\n        (0, index_js_1.defineProperties)(this, { args, fragment });\n    }\n    /**\n     *  The event name.\n     */\n    get eventName() {\n        return this.fragment.name;\n    }\n    /**\n     *  The event signature.\n     */\n    get eventSignature() {\n        return this.fragment.format();\n    }\n}\nexports.ContractEventPayload = ContractEventPayload;\n//# sourceMappingURL=wrappers.js.map","\"use strict\";\n/* Browser Crypto Shims */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = exports.pbkdf2Sync = exports.createHmac = exports.createHash = void 0;\nconst hmac_1 = require(\"@noble/hashes/hmac\");\nconst pbkdf2_1 = require(\"@noble/hashes/pbkdf2\");\nconst sha256_1 = require(\"@noble/hashes/sha256\");\nconst sha512_1 = require(\"@noble/hashes/sha512\");\nconst index_js_1 = require(\"../utils/index.js\");\nfunction getGlobal() {\n    if (typeof self !== 'undefined') {\n        return self;\n    }\n    if (typeof window !== 'undefined') {\n        return window;\n    }\n    if (typeof global !== 'undefined') {\n        return global;\n    }\n    throw new Error('unable to locate global object');\n}\n;\nconst anyGlobal = getGlobal();\nconst crypto = anyGlobal.crypto || anyGlobal.msCrypto;\nfunction createHash(algo) {\n    switch (algo) {\n        case \"sha256\": return sha256_1.sha256.create();\n        case \"sha512\": return sha512_1.sha512.create();\n    }\n    (0, index_js_1.assertArgument)(false, \"invalid hashing algorithm name\", \"algorithm\", algo);\n}\nexports.createHash = createHash;\nfunction createHmac(_algo, key) {\n    const algo = ({ sha256: sha256_1.sha256, sha512: sha512_1.sha512 }[_algo]);\n    (0, index_js_1.assertArgument)(algo != null, \"invalid hmac algorithm\", \"algorithm\", _algo);\n    return hmac_1.hmac.create(algo, key);\n}\nexports.createHmac = createHmac;\nfunction pbkdf2Sync(password, salt, iterations, keylen, _algo) {\n    const algo = ({ sha256: sha256_1.sha256, sha512: sha512_1.sha512 }[_algo]);\n    (0, index_js_1.assertArgument)(algo != null, \"invalid pbkdf2 algorithm\", \"algorithm\", _algo);\n    return (0, pbkdf2_1.pbkdf2)(algo, password, salt, { c: iterations, dkLen: keylen });\n}\nexports.pbkdf2Sync = pbkdf2Sync;\nfunction randomBytes(length) {\n    (0, index_js_1.assert)(crypto != null, \"platform does not support secure random numbers\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"randomBytes\"\n    });\n    (0, index_js_1.assertArgument)(Number.isInteger(length) && length > 0 && length <= 1024, \"invalid length\", \"length\", length);\n    const result = new Uint8Array(length);\n    crypto.getRandomValues(result);\n    return result;\n}\nexports.randomBytes = randomBytes;\n//# sourceMappingURL=crypto-browser.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.computeHmac = void 0;\n/**\n *  An **HMAC** enables verification that a given key was used\n *  to authenticate a payload.\n *\n *  See: [[link-wiki-hmac]]\n *\n *  @_subsection: api/crypto:HMAC  [about-hmac]\n */\nconst crypto_js_1 = require(\"./crypto.js\");\nconst index_js_1 = require(\"../utils/index.js\");\nlet locked = false;\nconst _computeHmac = function (algorithm, key, data) {\n    return (0, crypto_js_1.createHmac)(algorithm, key).update(data).digest();\n};\nlet __computeHmac = _computeHmac;\n/**\n *  Return the HMAC for %%data%% using the %%key%% key with the underlying\n *  %%algo%% used for compression.\n *\n *  @example:\n *    key = id(\"some-secret\")\n *\n *    // Compute the HMAC\n *    computeHmac(\"sha256\", key, \"0x1337\")\n *    //_result:\n *\n *    // To compute the HMAC of UTF-8 data, the data must be\n *    // converted to UTF-8 bytes\n *    computeHmac(\"sha256\", key, toUtf8Bytes(\"Hello World\"))\n *    //_result:\n *\n */\nfunction computeHmac(algorithm, _key, _data) {\n    const key = (0, index_js_1.getBytes)(_key, \"key\");\n    const data = (0, index_js_1.getBytes)(_data, \"data\");\n    return (0, index_js_1.hexlify)(__computeHmac(algorithm, key, data));\n}\nexports.computeHmac = computeHmac;\ncomputeHmac._ = _computeHmac;\ncomputeHmac.lock = function () { locked = true; };\ncomputeHmac.register = function (func) {\n    if (locked) {\n        throw new Error(\"computeHmac is locked\");\n    }\n    __computeHmac = func;\n};\nObject.freeze(computeHmac);\n//# sourceMappingURL=hmac.js.map","\"use strict\";\n/**\n *  A fundamental building block of Ethereum is the underlying\n *  cryptographic primitives.\n *\n *  @_section: api/crypto:Cryptographic Functions   [about-crypto]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.lock = exports.Signature = exports.SigningKey = exports.scryptSync = exports.scrypt = exports.pbkdf2 = exports.sha512 = exports.sha256 = exports.ripemd160 = exports.keccak256 = exports.randomBytes = exports.computeHmac = void 0;\nnull;\n// We import all these so we can export lock()\nconst hmac_js_1 = require(\"./hmac.js\");\nObject.defineProperty(exports, \"computeHmac\", { enumerable: true, get: function () { return hmac_js_1.computeHmac; } });\nconst keccak_js_1 = require(\"./keccak.js\");\nObject.defineProperty(exports, \"keccak256\", { enumerable: true, get: function () { return keccak_js_1.keccak256; } });\nconst ripemd160_js_1 = require(\"./ripemd160.js\");\nObject.defineProperty(exports, \"ripemd160\", { enumerable: true, get: function () { return ripemd160_js_1.ripemd160; } });\nconst pbkdf2_js_1 = require(\"./pbkdf2.js\");\nObject.defineProperty(exports, \"pbkdf2\", { enumerable: true, get: function () { return pbkdf2_js_1.pbkdf2; } });\nconst random_js_1 = require(\"./random.js\");\nObject.defineProperty(exports, \"randomBytes\", { enumerable: true, get: function () { return random_js_1.randomBytes; } });\nconst scrypt_js_1 = require(\"./scrypt.js\");\nObject.defineProperty(exports, \"scrypt\", { enumerable: true, get: function () { return scrypt_js_1.scrypt; } });\nObject.defineProperty(exports, \"scryptSync\", { enumerable: true, get: function () { return scrypt_js_1.scryptSync; } });\nconst sha2_js_1 = require(\"./sha2.js\");\nObject.defineProperty(exports, \"sha256\", { enumerable: true, get: function () { return sha2_js_1.sha256; } });\nObject.defineProperty(exports, \"sha512\", { enumerable: true, get: function () { return sha2_js_1.sha512; } });\nvar signing_key_js_1 = require(\"./signing-key.js\");\nObject.defineProperty(exports, \"SigningKey\", { enumerable: true, get: function () { return signing_key_js_1.SigningKey; } });\nvar signature_js_1 = require(\"./signature.js\");\nObject.defineProperty(exports, \"Signature\", { enumerable: true, get: function () { return signature_js_1.Signature; } });\n/**\n *  Once called, prevents any future change to the underlying cryptographic\n *  primitives using the ``.register`` feature for hooks.\n */\nfunction lock() {\n    hmac_js_1.computeHmac.lock();\n    keccak_js_1.keccak256.lock();\n    pbkdf2_js_1.pbkdf2.lock();\n    random_js_1.randomBytes.lock();\n    ripemd160_js_1.ripemd160.lock();\n    scrypt_js_1.scrypt.lock();\n    scrypt_js_1.scryptSync.lock();\n    sha2_js_1.sha256.lock();\n    sha2_js_1.sha512.lock();\n    random_js_1.randomBytes.lock();\n}\nexports.lock = lock;\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n *  Cryptographic hashing functions\n *\n *  @_subsection: api/crypto:Hash Functions [about-crypto-hashing]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.keccak256 = void 0;\nconst sha3_1 = require(\"@noble/hashes/sha3\");\nconst index_js_1 = require(\"../utils/index.js\");\nlet locked = false;\nconst _keccak256 = function (data) {\n    return (0, sha3_1.keccak_256)(data);\n};\nlet __keccak256 = _keccak256;\n/**\n *  Compute the cryptographic KECCAK256 hash of %%data%%.\n *\n *  The %%data%% **must** be a data representation, to compute the\n *  hash of UTF-8 data use the [[id]] function.\n *\n *  @returns DataHexstring\n *  @example:\n *    keccak256(\"0x\")\n *    //_result:\n *\n *    keccak256(\"0x1337\")\n *    //_result:\n *\n *    keccak256(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n *    // Strings are assumed to be DataHexString, otherwise it will\n *    // throw. To hash UTF-8 data, see the note above.\n *    keccak256(\"Hello World\")\n *    //_error:\n */\nfunction keccak256(_data) {\n    const data = (0, index_js_1.getBytes)(_data, \"data\");\n    return (0, index_js_1.hexlify)(__keccak256(data));\n}\nexports.keccak256 = keccak256;\nkeccak256._ = _keccak256;\nkeccak256.lock = function () { locked = true; };\nkeccak256.register = function (func) {\n    if (locked) {\n        throw new TypeError(\"keccak256 is locked\");\n    }\n    __keccak256 = func;\n};\nObject.freeze(keccak256);\n//# sourceMappingURL=keccak.js.map","\"use strict\";\n/**\n *  A **Password-Based Key-Derivation Function** is designed to create\n *  a sequence of bytes suitible as a **key** from a human-rememberable\n *  password.\n *\n *  @_subsection: api/crypto:Passwords  [about-pbkdf]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pbkdf2 = void 0;\nconst crypto_js_1 = require(\"./crypto.js\");\nconst index_js_1 = require(\"../utils/index.js\");\nlet locked = false;\nconst _pbkdf2 = function (password, salt, iterations, keylen, algo) {\n    return (0, crypto_js_1.pbkdf2Sync)(password, salt, iterations, keylen, algo);\n};\nlet __pbkdf2 = _pbkdf2;\n/**\n *  Return the [[link-pbkdf2]] for %%keylen%% bytes for %%password%% using\n *  the %%salt%% and using %%iterations%% of %%algo%%.\n *\n *  This PBKDF is outdated and should not be used in new projects, but is\n *  required to decrypt older files.\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the PBKDF2\n *    pbkdf2(passwordBytes, salt, 1024, 16, \"sha256\")\n *    //_result:\n */\nfunction pbkdf2(_password, _salt, iterations, keylen, algo) {\n    const password = (0, index_js_1.getBytes)(_password, \"password\");\n    const salt = (0, index_js_1.getBytes)(_salt, \"salt\");\n    return (0, index_js_1.hexlify)(__pbkdf2(password, salt, iterations, keylen, algo));\n}\nexports.pbkdf2 = pbkdf2;\npbkdf2._ = _pbkdf2;\npbkdf2.lock = function () { locked = true; };\npbkdf2.register = function (func) {\n    if (locked) {\n        throw new Error(\"pbkdf2 is locked\");\n    }\n    __pbkdf2 = func;\n};\nObject.freeze(pbkdf2);\n//# sourceMappingURL=pbkdf2.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.randomBytes = void 0;\n/**\n *  A **Cryptographically Secure Random Value** is one that has been\n *  generated with additional care take to prevent side-channels\n *  from allowing others to detect it and prevent others from through\n *  coincidence generate the same values.\n *\n *  @_subsection: api/crypto:Random Values  [about-crypto-random]\n */\nconst crypto_js_1 = require(\"./crypto.js\");\nlet locked = false;\nconst _randomBytes = function (length) {\n    return new Uint8Array((0, crypto_js_1.randomBytes)(length));\n};\nlet __randomBytes = _randomBytes;\n/**\n *  Return %%length%% bytes of cryptographically secure random data.\n *\n *  @example:\n *    randomBytes(8)\n *    //_result:\n */\nfunction randomBytes(length) {\n    return __randomBytes(length);\n}\nexports.randomBytes = randomBytes;\nrandomBytes._ = _randomBytes;\nrandomBytes.lock = function () { locked = true; };\nrandomBytes.register = function (func) {\n    if (locked) {\n        throw new Error(\"randomBytes is locked\");\n    }\n    __randomBytes = func;\n};\nObject.freeze(randomBytes);\n//# sourceMappingURL=random.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ripemd160 = void 0;\nconst ripemd160_1 = require(\"@noble/hashes/ripemd160\");\nconst index_js_1 = require(\"../utils/index.js\");\nlet locked = false;\nconst _ripemd160 = function (data) {\n    return (0, ripemd160_1.ripemd160)(data);\n};\nlet __ripemd160 = _ripemd160;\n/**\n *  Compute the cryptographic RIPEMD-160 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    ripemd160(\"0x\")\n *    //_result:\n *\n *    ripemd160(\"0x1337\")\n *    //_result:\n *\n *    ripemd160(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n */\nfunction ripemd160(_data) {\n    const data = (0, index_js_1.getBytes)(_data, \"data\");\n    return (0, index_js_1.hexlify)(__ripemd160(data));\n}\nexports.ripemd160 = ripemd160;\nripemd160._ = _ripemd160;\nripemd160.lock = function () { locked = true; };\nripemd160.register = function (func) {\n    if (locked) {\n        throw new TypeError(\"ripemd160 is locked\");\n    }\n    __ripemd160 = func;\n};\nObject.freeze(ripemd160);\n//# sourceMappingURL=ripemd160.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.scryptSync = exports.scrypt = void 0;\nconst scrypt_1 = require(\"@noble/hashes/scrypt\");\nconst index_js_1 = require(\"../utils/index.js\");\nlet lockedSync = false, lockedAsync = false;\nconst _scryptAsync = async function (passwd, salt, N, r, p, dkLen, onProgress) {\n    return await (0, scrypt_1.scryptAsync)(passwd, salt, { N, r, p, dkLen, onProgress });\n};\nconst _scryptSync = function (passwd, salt, N, r, p, dkLen) {\n    return (0, scrypt_1.scrypt)(passwd, salt, { N, r, p, dkLen });\n};\nlet __scryptAsync = _scryptAsync;\nlet __scryptSync = _scryptSync;\n/**\n *  The [[link-wiki-scrypt]] uses a memory and cpu hard method of\n *  derivation to increase the resource cost to brute-force a password\n *  for a given key.\n *\n *  This means this algorithm is intentionally slow, and can be tuned to\n *  become slower. As computation and memory speed improve over time,\n *  increasing the difficulty maintains the cost of an attacker.\n *\n *  For example, if a target time of 5 seconds is used, a legitimate user\n *  which knows their password requires only 5 seconds to unlock their\n *  account. A 6 character password has 68 billion possibilities, which\n *  would require an attacker to invest over 10,000 years of CPU time. This\n *  is of course a crude example (as password generally aren't random),\n *  but demonstrates to value of imposing large costs to decryption.\n *\n *  For this reason, if building a UI which involved decrypting or\n *  encrypting datsa using scrypt, it is recommended to use a\n *  [[ProgressCallback]] (as event short periods can seem lik an eternity\n *  if the UI freezes). Including the phrase //\"decrypting\"// in the UI\n *  can also help, assuring the user their waiting is for a good reason.\n *\n *  @_docloc: api/crypto:Passwords\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the scrypt\n *    scrypt(passwordBytes, salt, 1024, 8, 1, 16)\n *    //_result:\n */\nasync function scrypt(_passwd, _salt, N, r, p, dkLen, progress) {\n    const passwd = (0, index_js_1.getBytes)(_passwd, \"passwd\");\n    const salt = (0, index_js_1.getBytes)(_salt, \"salt\");\n    return (0, index_js_1.hexlify)(await __scryptAsync(passwd, salt, N, r, p, dkLen, progress));\n}\nexports.scrypt = scrypt;\nscrypt._ = _scryptAsync;\nscrypt.lock = function () { lockedAsync = true; };\nscrypt.register = function (func) {\n    if (lockedAsync) {\n        throw new Error(\"scrypt is locked\");\n    }\n    __scryptAsync = func;\n};\nObject.freeze(scrypt);\n/**\n *  Provides a synchronous variant of [[scrypt]].\n *\n *  This will completely lock up and freeze the UI in a browser and will\n *  prevent any event loop from progressing. For this reason, it is\n *  preferred to use the [async variant](scrypt).\n *\n *  @_docloc: api/crypto:Passwords\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the scrypt\n *    scryptSync(passwordBytes, salt, 1024, 8, 1, 16)\n *    //_result:\n */\nfunction scryptSync(_passwd, _salt, N, r, p, dkLen) {\n    const passwd = (0, index_js_1.getBytes)(_passwd, \"passwd\");\n    const salt = (0, index_js_1.getBytes)(_salt, \"salt\");\n    return (0, index_js_1.hexlify)(__scryptSync(passwd, salt, N, r, p, dkLen));\n}\nexports.scryptSync = scryptSync;\nscryptSync._ = _scryptSync;\nscryptSync.lock = function () { lockedSync = true; };\nscryptSync.register = function (func) {\n    if (lockedSync) {\n        throw new Error(\"scryptSync is locked\");\n    }\n    __scryptSync = func;\n};\nObject.freeze(scryptSync);\n//# sourceMappingURL=scrypt.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sha512 = exports.sha256 = void 0;\nconst crypto_js_1 = require(\"./crypto.js\");\nconst index_js_1 = require(\"../utils/index.js\");\nconst _sha256 = function (data) {\n    return (0, crypto_js_1.createHash)(\"sha256\").update(data).digest();\n};\nconst _sha512 = function (data) {\n    return (0, crypto_js_1.createHash)(\"sha512\").update(data).digest();\n};\nlet __sha256 = _sha256;\nlet __sha512 = _sha512;\nlet locked256 = false, locked512 = false;\n/**\n *  Compute the cryptographic SHA2-256 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    sha256(\"0x\")\n *    //_result:\n *\n *    sha256(\"0x1337\")\n *    //_result:\n *\n *    sha256(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n */\nfunction sha256(_data) {\n    const data = (0, index_js_1.getBytes)(_data, \"data\");\n    return (0, index_js_1.hexlify)(__sha256(data));\n}\nexports.sha256 = sha256;\nsha256._ = _sha256;\nsha256.lock = function () { locked256 = true; };\nsha256.register = function (func) {\n    if (locked256) {\n        throw new Error(\"sha256 is locked\");\n    }\n    __sha256 = func;\n};\nObject.freeze(sha256);\n/**\n *  Compute the cryptographic SHA2-512 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    sha512(\"0x\")\n *    //_result:\n *\n *    sha512(\"0x1337\")\n *    //_result:\n *\n *    sha512(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n */\nfunction sha512(_data) {\n    const data = (0, index_js_1.getBytes)(_data, \"data\");\n    return (0, index_js_1.hexlify)(__sha512(data));\n}\nexports.sha512 = sha512;\nsha512._ = _sha512;\nsha512.lock = function () { locked512 = true; };\nsha512.register = function (func) {\n    if (locked512) {\n        throw new Error(\"sha512 is locked\");\n    }\n    __sha512 = func;\n};\nObject.freeze(sha256);\n//# sourceMappingURL=sha2.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Signature = void 0;\nconst index_js_1 = require(\"../constants/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\n// Constants\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_2 = BigInt(2);\nconst BN_27 = BigInt(27);\nconst BN_28 = BigInt(28);\nconst BN_35 = BigInt(35);\nconst _guard = {};\nfunction toUint256(value) {\n    return (0, index_js_2.zeroPadValue)((0, index_js_2.toBeArray)(value), 32);\n}\n/**\n *  A Signature  @TODO\n *\n *\n *  @_docloc: api/crypto:Signing\n */\nclass Signature {\n    #r;\n    #s;\n    #v;\n    #networkV;\n    /**\n     *  The ``r`` value for a signautre.\n     *\n     *  This represents the ``x`` coordinate of a \"reference\" or\n     *  challenge point, from which the ``y`` can be computed.\n     */\n    get r() { return this.#r; }\n    set r(value) {\n        (0, index_js_2.assertArgument)((0, index_js_2.dataLength)(value) === 32, \"invalid r\", \"value\", value);\n        this.#r = (0, index_js_2.hexlify)(value);\n    }\n    /**\n     *  The ``s`` value for a signature.\n     */\n    get s() { return this.#s; }\n    set s(_value) {\n        (0, index_js_2.assertArgument)((0, index_js_2.dataLength)(_value) === 32, \"invalid s\", \"value\", _value);\n        const value = (0, index_js_2.hexlify)(_value);\n        (0, index_js_2.assertArgument)(parseInt(value.substring(0, 3)) < 8, \"non-canonical s\", \"value\", value);\n        this.#s = value;\n    }\n    /**\n     *  The ``v`` value for a signature.\n     *\n     *  Since a given ``x`` value for ``r`` has two possible values for\n     *  its correspondin ``y``, the ``v`` indicates which of the two ``y``\n     *  values to use.\n     *\n     *  It is normalized to the values ``27`` or ``28`` for legacy\n     *  purposes.\n     */\n    get v() { return this.#v; }\n    set v(value) {\n        const v = (0, index_js_2.getNumber)(value, \"value\");\n        (0, index_js_2.assertArgument)(v === 27 || v === 28, \"invalid v\", \"v\", value);\n        this.#v = v;\n    }\n    /**\n     *  The EIP-155 ``v`` for legacy transactions. For non-legacy\n     *  transactions, this value is ``null``.\n     */\n    get networkV() { return this.#networkV; }\n    /**\n     *  The chain ID for EIP-155 legacy transactions. For non-legacy\n     *  transactions, this value is ``null``.\n     */\n    get legacyChainId() {\n        const v = this.networkV;\n        if (v == null) {\n            return null;\n        }\n        return Signature.getChainId(v);\n    }\n    /**\n     *  The ``yParity`` for the signature.\n     *\n     *  See ``v`` for more details on how this value is used.\n     */\n    get yParity() {\n        return (this.v === 27) ? 0 : 1;\n    }\n    /**\n     *  The [[link-eip-2098]] compact representation of the ``yParity``\n     *  and ``s`` compacted into a single ``bytes32``.\n     */\n    get yParityAndS() {\n        // The EIP-2098 compact representation\n        const yParityAndS = (0, index_js_2.getBytes)(this.s);\n        if (this.yParity) {\n            yParityAndS[0] |= 0x80;\n        }\n        return (0, index_js_2.hexlify)(yParityAndS);\n    }\n    /**\n     *  The [[link-eip-2098]] compact representation.\n     */\n    get compactSerialized() {\n        return (0, index_js_2.concat)([this.r, this.yParityAndS]);\n    }\n    /**\n     *  The serialized representation.\n     */\n    get serialized() {\n        return (0, index_js_2.concat)([this.r, this.s, (this.yParity ? \"0x1c\" : \"0x1b\")]);\n    }\n    /**\n     *  @private\n     */\n    constructor(guard, r, s, v) {\n        (0, index_js_2.assertPrivate)(guard, _guard, \"Signature\");\n        this.#r = r;\n        this.#s = s;\n        this.#v = v;\n        this.#networkV = null;\n    }\n    [Symbol.for('nodejs.util.inspect.custom')]() {\n        return `Signature { r: \"${this.r}\", s: \"${this.s}\", yParity: ${this.yParity}, networkV: ${this.networkV} }`;\n    }\n    /**\n     *  Returns a new identical [[Signature]].\n     */\n    clone() {\n        const clone = new Signature(_guard, this.r, this.s, this.v);\n        if (this.networkV) {\n            clone.#networkV = this.networkV;\n        }\n        return clone;\n    }\n    /**\n     *  Returns a representation that is compatible with ``JSON.stringify``.\n     */\n    toJSON() {\n        const networkV = this.networkV;\n        return {\n            _type: \"signature\",\n            networkV: ((networkV != null) ? networkV.toString() : null),\n            r: this.r, s: this.s, v: this.v,\n        };\n    }\n    /**\n     *  Compute the chain ID from the ``v`` in a legacy EIP-155 transactions.\n     *\n     *  @example:\n     *    Signature.getChainId(45)\n     *    //_result:\n     *\n     *    Signature.getChainId(46)\n     *    //_result:\n     */\n    static getChainId(v) {\n        const bv = (0, index_js_2.getBigInt)(v, \"v\");\n        // The v is not an EIP-155 v, so it is the unspecified chain ID\n        if ((bv == BN_27) || (bv == BN_28)) {\n            return BN_0;\n        }\n        // Bad value for an EIP-155 v\n        (0, index_js_2.assertArgument)(bv >= BN_35, \"invalid EIP-155 v\", \"v\", v);\n        return (bv - BN_35) / BN_2;\n    }\n    /**\n     *  Compute the ``v`` for a chain ID for a legacy EIP-155 transactions.\n     *\n     *  Legacy transactions which use [[link-eip-155]] hijack the ``v``\n     *  property to include the chain ID.\n     *\n     *  @example:\n     *    Signature.getChainIdV(5, 27)\n     *    //_result:\n     *\n     *    Signature.getChainIdV(5, 28)\n     *    //_result:\n     *\n     */\n    static getChainIdV(chainId, v) {\n        return ((0, index_js_2.getBigInt)(chainId) * BN_2) + BigInt(35 + v - 27);\n    }\n    /**\n     *  Compute the normalized legacy transaction ``v`` from a ``yParirty``,\n     *  a legacy transaction ``v`` or a legacy [[link-eip-155]] transaction.\n     *\n     *  @example:\n     *    // The values 0 and 1 imply v is actually yParity\n     *    Signature.getNormalizedV(0)\n     *    //_result:\n     *\n     *    // Legacy non-EIP-1559 transaction (i.e. 27 or 28)\n     *    Signature.getNormalizedV(27)\n     *    //_result:\n     *\n     *    // Legacy EIP-155 transaction (i.e. >= 35)\n     *    Signature.getNormalizedV(46)\n     *    //_result:\n     *\n     *    // Invalid values throw\n     *    Signature.getNormalizedV(5)\n     *    //_error:\n     */\n    static getNormalizedV(v) {\n        const bv = (0, index_js_2.getBigInt)(v);\n        if (bv === BN_0 || bv === BN_27) {\n            return 27;\n        }\n        if (bv === BN_1 || bv === BN_28) {\n            return 28;\n        }\n        (0, index_js_2.assertArgument)(bv >= BN_35, \"invalid v\", \"v\", v);\n        // Otherwise, EIP-155 v means odd is 27 and even is 28\n        return (bv & BN_1) ? 27 : 28;\n    }\n    /**\n     *  Creates a new [[Signature]].\n     *\n     *  If no %%sig%% is provided, a new [[Signature]] is created\n     *  with default values.\n     *\n     *  If %%sig%% is a string, it is parsed.\n     */\n    static from(sig) {\n        function assertError(check, message) {\n            (0, index_js_2.assertArgument)(check, message, \"signature\", sig);\n        }\n        ;\n        if (sig == null) {\n            return new Signature(_guard, index_js_1.ZeroHash, index_js_1.ZeroHash, 27);\n        }\n        if (typeof (sig) === \"string\") {\n            const bytes = (0, index_js_2.getBytes)(sig, \"signature\");\n            if (bytes.length === 64) {\n                const r = (0, index_js_2.hexlify)(bytes.slice(0, 32));\n                const s = bytes.slice(32, 64);\n                const v = (s[0] & 0x80) ? 28 : 27;\n                s[0] &= 0x7f;\n                return new Signature(_guard, r, (0, index_js_2.hexlify)(s), v);\n            }\n            if (bytes.length === 65) {\n                const r = (0, index_js_2.hexlify)(bytes.slice(0, 32));\n                const s = bytes.slice(32, 64);\n                assertError((s[0] & 0x80) === 0, \"non-canonical s\");\n                const v = Signature.getNormalizedV(bytes[64]);\n                return new Signature(_guard, r, (0, index_js_2.hexlify)(s), v);\n            }\n            assertError(false, \"invalid raw signature length\");\n        }\n        if (sig instanceof Signature) {\n            return sig.clone();\n        }\n        // Get r\n        const _r = sig.r;\n        assertError(_r != null, \"missing r\");\n        const r = toUint256(_r);\n        // Get s; by any means necessary (we check consistency below)\n        const s = (function (s, yParityAndS) {\n            if (s != null) {\n                return toUint256(s);\n            }\n            if (yParityAndS != null) {\n                assertError((0, index_js_2.isHexString)(yParityAndS, 32), \"invalid yParityAndS\");\n                const bytes = (0, index_js_2.getBytes)(yParityAndS);\n                bytes[0] &= 0x7f;\n                return (0, index_js_2.hexlify)(bytes);\n            }\n            assertError(false, \"missing s\");\n        })(sig.s, sig.yParityAndS);\n        assertError(((0, index_js_2.getBytes)(s)[0] & 0x80) == 0, \"non-canonical s\");\n        // Get v; by any means necessary (we check consistency below)\n        const { networkV, v } = (function (_v, yParityAndS, yParity) {\n            if (_v != null) {\n                const v = (0, index_js_2.getBigInt)(_v);\n                return {\n                    networkV: ((v >= BN_35) ? v : undefined),\n                    v: Signature.getNormalizedV(v)\n                };\n            }\n            if (yParityAndS != null) {\n                assertError((0, index_js_2.isHexString)(yParityAndS, 32), \"invalid yParityAndS\");\n                return { v: (((0, index_js_2.getBytes)(yParityAndS)[0] & 0x80) ? 28 : 27) };\n            }\n            if (yParity != null) {\n                switch ((0, index_js_2.getNumber)(yParity, \"sig.yParity\")) {\n                    case 0: return { v: 27 };\n                    case 1: return { v: 28 };\n                }\n                assertError(false, \"invalid yParity\");\n            }\n            assertError(false, \"missing v\");\n        })(sig.v, sig.yParityAndS, sig.yParity);\n        const result = new Signature(_guard, r, s, v);\n        if (networkV) {\n            result.#networkV = networkV;\n        }\n        // If multiple of v, yParity, yParityAndS we given, check they match\n        assertError(sig.yParity == null || (0, index_js_2.getNumber)(sig.yParity, \"sig.yParity\") === result.yParity, \"yParity mismatch\");\n        assertError(sig.yParityAndS == null || sig.yParityAndS === result.yParityAndS, \"yParityAndS mismatch\");\n        return result;\n    }\n}\nexports.Signature = Signature;\n//# sourceMappingURL=signature.js.map","\"use strict\";\n/**\n *  Add details about signing here.\n *\n *  @_subsection: api/crypto:Signing  [about-signing]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SigningKey = void 0;\nconst secp256k1_1 = require(\"@noble/curves/secp256k1\");\nconst index_js_1 = require(\"../utils/index.js\");\nconst signature_js_1 = require(\"./signature.js\");\n/**\n *  A **SigningKey** provides high-level access to the elliptic curve\n *  cryptography (ECC) operations and key management.\n */\nclass SigningKey {\n    #privateKey;\n    /**\n     *  Creates a new **SigningKey** for %%privateKey%%.\n     */\n    constructor(privateKey) {\n        (0, index_js_1.assertArgument)((0, index_js_1.dataLength)(privateKey) === 32, \"invalid private key\", \"privateKey\", \"[REDACTED]\");\n        this.#privateKey = (0, index_js_1.hexlify)(privateKey);\n    }\n    /**\n     *  The private key.\n     */\n    get privateKey() { return this.#privateKey; }\n    /**\n     *  The uncompressed public key.\n     *\n     * This will always begin with the prefix ``0x04`` and be 132\n     * characters long (the ``0x`` prefix and 130 hexadecimal nibbles).\n     */\n    get publicKey() { return SigningKey.computePublicKey(this.#privateKey); }\n    /**\n     *  The compressed public key.\n     *\n     *  This will always begin with either the prefix ``0x02`` or ``0x03``\n     *  and be 68 characters long (the ``0x`` prefix and 33 hexadecimal\n     *  nibbles)\n     */\n    get compressedPublicKey() { return SigningKey.computePublicKey(this.#privateKey, true); }\n    /**\n     *  Return the signature of the signed %%digest%%.\n     */\n    sign(digest) {\n        (0, index_js_1.assertArgument)((0, index_js_1.dataLength)(digest) === 32, \"invalid digest length\", \"digest\", digest);\n        const sig = secp256k1_1.secp256k1.sign((0, index_js_1.getBytesCopy)(digest), (0, index_js_1.getBytesCopy)(this.#privateKey), {\n            lowS: true\n        });\n        return signature_js_1.Signature.from({\n            r: (0, index_js_1.toBeHex)(sig.r, 32),\n            s: (0, index_js_1.toBeHex)(sig.s, 32),\n            v: (sig.recovery ? 0x1c : 0x1b)\n        });\n    }\n    /**\n     *  Returns the [[link-wiki-ecdh]] shared secret between this\n     *  private key and the %%other%% key.\n     *\n     *  The %%other%% key may be any type of key, a raw public key,\n     *  a compressed/uncompressed pubic key or aprivate key.\n     *\n     *  Best practice is usually to use a cryptographic hash on the\n     *  returned value before using it as a symetric secret.\n     *\n     *  @example:\n     *    sign1 = new SigningKey(id(\"some-secret-1\"))\n     *    sign2 = new SigningKey(id(\"some-secret-2\"))\n     *\n     *    // Notice that privA.computeSharedSecret(pubB)...\n     *    sign1.computeSharedSecret(sign2.publicKey)\n     *    //_result:\n     *\n     *    // ...is equal to privB.computeSharedSecret(pubA).\n     *    sign2.computeSharedSecret(sign1.publicKey)\n     *    //_result:\n     */\n    computeSharedSecret(other) {\n        const pubKey = SigningKey.computePublicKey(other);\n        return (0, index_js_1.hexlify)(secp256k1_1.secp256k1.getSharedSecret((0, index_js_1.getBytesCopy)(this.#privateKey), (0, index_js_1.getBytes)(pubKey), false));\n    }\n    /**\n     *  Compute the public key for %%key%%, optionally %%compressed%%.\n     *\n     *  The %%key%% may be any type of key, a raw public key, a\n     *  compressed/uncompressed public key or private key.\n     *\n     *  @example:\n     *    sign = new SigningKey(id(\"some-secret\"));\n     *\n     *    // Compute the uncompressed public key for a private key\n     *    SigningKey.computePublicKey(sign.privateKey)\n     *    //_result:\n     *\n     *    // Compute the compressed public key for a private key\n     *    SigningKey.computePublicKey(sign.privateKey, true)\n     *    //_result:\n     *\n     *    // Compute the uncompressed public key\n     *    SigningKey.computePublicKey(sign.publicKey, false);\n     *    //_result:\n     *\n     *    // Compute the Compressed a public key\n     *    SigningKey.computePublicKey(sign.publicKey, true);\n     *    //_result:\n     */\n    static computePublicKey(key, compressed) {\n        let bytes = (0, index_js_1.getBytes)(key, \"key\");\n        // private key\n        if (bytes.length === 32) {\n            const pubKey = secp256k1_1.secp256k1.getPublicKey(bytes, !!compressed);\n            return (0, index_js_1.hexlify)(pubKey);\n        }\n        // raw public key; use uncompressed key with 0x04 prefix\n        if (bytes.length === 64) {\n            const pub = new Uint8Array(65);\n            pub[0] = 0x04;\n            pub.set(bytes, 1);\n            bytes = pub;\n        }\n        const point = secp256k1_1.secp256k1.ProjectivePoint.fromHex(bytes);\n        return (0, index_js_1.hexlify)(point.toRawBytes(compressed));\n    }\n    /**\n     *  Returns the public key for the private key which produced the\n     *  %%signature%% for the given %%digest%%.\n     *\n     *  @example:\n     *    key = new SigningKey(id(\"some-secret\"))\n     *    digest = id(\"hello world\")\n     *    sig = key.sign(digest)\n     *\n     *    // Notice the signer public key...\n     *    key.publicKey\n     *    //_result:\n     *\n     *    // ...is equal to the recovered public key\n     *    SigningKey.recoverPublicKey(digest, sig)\n     *    //_result:\n     *\n     */\n    static recoverPublicKey(digest, signature) {\n        (0, index_js_1.assertArgument)((0, index_js_1.dataLength)(digest) === 32, \"invalid digest length\", \"digest\", digest);\n        const sig = signature_js_1.Signature.from(signature);\n        let secpSig = secp256k1_1.secp256k1.Signature.fromCompact((0, index_js_1.getBytesCopy)((0, index_js_1.concat)([sig.r, sig.s])));\n        secpSig = secpSig.addRecoveryBit(sig.yParity);\n        const pubKey = secpSig.recoverPublicKey((0, index_js_1.getBytesCopy)(digest));\n        (0, index_js_1.assertArgument)(pubKey != null, \"invalid signautre for digest\", \"signature\", signature);\n        return \"0x\" + pubKey.toHex(false);\n    }\n    /**\n     *  Returns the point resulting from adding the ellipic curve points\n     *  %%p0%% and %%p1%%.\n     *\n     *  This is not a common function most developers should require, but\n     *  can be useful for certain privacy-specific techniques.\n     *\n     *  For example, it is used by [[HDNodeWallet]] to compute child\n     *  addresses from parent public keys and chain codes.\n     */\n    static addPoints(p0, p1, compressed) {\n        const pub0 = secp256k1_1.secp256k1.ProjectivePoint.fromHex(SigningKey.computePublicKey(p0).substring(2));\n        const pub1 = secp256k1_1.secp256k1.ProjectivePoint.fromHex(SigningKey.computePublicKey(p1).substring(2));\n        return \"0x\" + pub0.add(pub1).toHex(!!compressed);\n    }\n}\nexports.SigningKey = SigningKey;\n//# sourceMappingURL=signing-key.js.map","\"use strict\";\n/////////////////////////////\n//\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ripemd160 = exports.keccak256 = exports.randomBytes = exports.computeHmac = exports.UndecodedEventLog = exports.EventLog = exports.ContractUnknownEventPayload = exports.ContractTransactionResponse = exports.ContractTransactionReceipt = exports.ContractEventPayload = exports.ContractFactory = exports.Contract = exports.BaseContract = exports.MessagePrefix = exports.EtherSymbol = exports.ZeroHash = exports.N = exports.MaxInt256 = exports.MinInt256 = exports.MaxUint256 = exports.WeiPerEther = exports.ZeroAddress = exports.resolveAddress = exports.isAddress = exports.isAddressable = exports.getCreate2Address = exports.getCreateAddress = exports.getIcapAddress = exports.getAddress = exports.Typed = exports.TransactionDescription = exports.Result = exports.LogDescription = exports.Interface = exports.Indexed = exports.ErrorDescription = exports.checkResultErrors = exports.StructFragment = exports.ParamType = exports.NamedFragment = exports.FunctionFragment = exports.FallbackFragment = exports.Fragment = exports.EventFragment = exports.ErrorFragment = exports.ConstructorFragment = exports.AbiCoder = exports.encodeBytes32String = exports.decodeBytes32String = exports.version = void 0;\nexports.EnsPlugin = exports.Network = exports.EnsResolver = exports.WebSocketProvider = exports.SocketProvider = exports.IpcSocketProvider = exports.QuickNodeProvider = exports.PocketProvider = exports.InfuraWebSocketProvider = exports.InfuraProvider = exports.EtherscanProvider = exports.CloudflareProvider = exports.ChainstackProvider = exports.AnkrProvider = exports.AlchemyProvider = exports.BrowserProvider = exports.JsonRpcSigner = exports.JsonRpcProvider = exports.JsonRpcApiProvider = exports.FallbackProvider = exports.AbstractProvider = exports.VoidSigner = exports.NonceManager = exports.AbstractSigner = exports.TransactionResponse = exports.TransactionReceipt = exports.Log = exports.FeeData = exports.Block = exports.getDefaultProvider = exports.verifyTypedData = exports.TypedDataEncoder = exports.solidityPackedSha256 = exports.solidityPackedKeccak256 = exports.solidityPacked = exports.verifyMessage = exports.hashMessage = exports.dnsEncode = exports.namehash = exports.isValidName = exports.ensNormalize = exports.id = exports.SigningKey = exports.Signature = exports.lock = exports.scryptSync = exports.scrypt = exports.pbkdf2 = exports.sha512 = exports.sha256 = void 0;\nexports.getUint = exports.getNumber = exports.getBigInt = exports.FixedNumber = exports.FetchCancelSignal = exports.FetchResponse = exports.FetchRequest = exports.EventPayload = exports.isError = exports.isCallException = exports.makeError = exports.assertPrivate = exports.assertNormalize = exports.assertArgumentCount = exports.assertArgument = exports.assert = exports.resolveProperties = exports.defineProperties = exports.zeroPadValue = exports.zeroPadBytes = exports.stripZerosLeft = exports.isBytesLike = exports.isHexString = exports.hexlify = exports.getBytesCopy = exports.getBytes = exports.dataSlice = exports.dataLength = exports.concat = exports.encodeBase64 = exports.decodeBase64 = exports.encodeBase58 = exports.decodeBase58 = exports.Transaction = exports.recoverAddress = exports.computeAddress = exports.accessListify = exports.showThrottleMessage = exports.copyRequest = exports.UnmanagedSubscriber = exports.SocketSubscriber = exports.SocketPendingSubscriber = exports.SocketEventSubscriber = exports.SocketBlockSubscriber = exports.MulticoinProviderPlugin = exports.NetworkPlugin = exports.GasCostPlugin = exports.FetchUrlFeeDataNetworkPlugin = exports.FeeDataNetworkPlugin = exports.EtherscanPlugin = void 0;\nexports.wordlists = exports.WordlistOwlA = exports.WordlistOwl = exports.LangEn = exports.Wordlist = exports.encryptKeystoreJsonSync = exports.encryptKeystoreJson = exports.decryptKeystoreJson = exports.decryptKeystoreJsonSync = exports.decryptCrowdsaleJson = exports.isKeystoreJson = exports.isCrowdsaleJson = exports.getIndexedAccountPath = exports.getAccountPath = exports.defaultPath = exports.Wallet = exports.HDNodeVoidWallet = exports.HDNodeWallet = exports.BaseWallet = exports.Mnemonic = exports.uuidV4 = exports.encodeRlp = exports.decodeRlp = exports.Utf8ErrorFuncs = exports.toUtf8String = exports.toUtf8CodePoints = exports.toUtf8Bytes = exports.parseUnits = exports.formatUnits = exports.parseEther = exports.formatEther = exports.mask = exports.toTwos = exports.fromTwos = exports.toQuantity = exports.toNumber = exports.toBeHex = exports.toBigInt = exports.toBeArray = void 0;\nvar _version_js_1 = require(\"./_version.js\");\nObject.defineProperty(exports, \"version\", { enumerable: true, get: function () { return _version_js_1.version; } });\nvar index_js_1 = require(\"./abi/index.js\");\nObject.defineProperty(exports, \"decodeBytes32String\", { enumerable: true, get: function () { return index_js_1.decodeBytes32String; } });\nObject.defineProperty(exports, \"encodeBytes32String\", { enumerable: true, get: function () { return index_js_1.encodeBytes32String; } });\nObject.defineProperty(exports, \"AbiCoder\", { enumerable: true, get: function () { return index_js_1.AbiCoder; } });\nObject.defineProperty(exports, \"ConstructorFragment\", { enumerable: true, get: function () { return index_js_1.ConstructorFragment; } });\nObject.defineProperty(exports, \"ErrorFragment\", { enumerable: true, get: function () { return index_js_1.ErrorFragment; } });\nObject.defineProperty(exports, \"EventFragment\", { enumerable: true, get: function () { return index_js_1.EventFragment; } });\nObject.defineProperty(exports, \"Fragment\", { enumerable: true, get: function () { return index_js_1.Fragment; } });\nObject.defineProperty(exports, \"FallbackFragment\", { enumerable: true, get: function () { return index_js_1.FallbackFragment; } });\nObject.defineProperty(exports, \"FunctionFragment\", { enumerable: true, get: function () { return index_js_1.FunctionFragment; } });\nObject.defineProperty(exports, \"NamedFragment\", { enumerable: true, get: function () { return index_js_1.NamedFragment; } });\nObject.defineProperty(exports, \"ParamType\", { enumerable: true, get: function () { return index_js_1.ParamType; } });\nObject.defineProperty(exports, \"StructFragment\", { enumerable: true, get: function () { return index_js_1.StructFragment; } });\nObject.defineProperty(exports, \"checkResultErrors\", { enumerable: true, get: function () { return index_js_1.checkResultErrors; } });\nObject.defineProperty(exports, \"ErrorDescription\", { enumerable: true, get: function () { return index_js_1.ErrorDescription; } });\nObject.defineProperty(exports, \"Indexed\", { enumerable: true, get: function () { return index_js_1.Indexed; } });\nObject.defineProperty(exports, \"Interface\", { enumerable: true, get: function () { return index_js_1.Interface; } });\nObject.defineProperty(exports, \"LogDescription\", { enumerable: true, get: function () { return index_js_1.LogDescription; } });\nObject.defineProperty(exports, \"Result\", { enumerable: true, get: function () { return index_js_1.Result; } });\nObject.defineProperty(exports, \"TransactionDescription\", { enumerable: true, get: function () { return index_js_1.TransactionDescription; } });\nObject.defineProperty(exports, \"Typed\", { enumerable: true, get: function () { return index_js_1.Typed; } });\nvar index_js_2 = require(\"./address/index.js\");\nObject.defineProperty(exports, \"getAddress\", { enumerable: true, get: function () { return index_js_2.getAddress; } });\nObject.defineProperty(exports, \"getIcapAddress\", { enumerable: true, get: function () { return index_js_2.getIcapAddress; } });\nObject.defineProperty(exports, \"getCreateAddress\", { enumerable: true, get: function () { return index_js_2.getCreateAddress; } });\nObject.defineProperty(exports, \"getCreate2Address\", { enumerable: true, get: function () { return index_js_2.getCreate2Address; } });\nObject.defineProperty(exports, \"isAddressable\", { enumerable: true, get: function () { return index_js_2.isAddressable; } });\nObject.defineProperty(exports, \"isAddress\", { enumerable: true, get: function () { return index_js_2.isAddress; } });\nObject.defineProperty(exports, \"resolveAddress\", { enumerable: true, get: function () { return index_js_2.resolveAddress; } });\nvar index_js_3 = require(\"./constants/index.js\");\nObject.defineProperty(exports, \"ZeroAddress\", { enumerable: true, get: function () { return index_js_3.ZeroAddress; } });\nObject.defineProperty(exports, \"WeiPerEther\", { enumerable: true, get: function () { return index_js_3.WeiPerEther; } });\nObject.defineProperty(exports, \"MaxUint256\", { enumerable: true, get: function () { return index_js_3.MaxUint256; } });\nObject.defineProperty(exports, \"MinInt256\", { enumerable: true, get: function () { return index_js_3.MinInt256; } });\nObject.defineProperty(exports, \"MaxInt256\", { enumerable: true, get: function () { return index_js_3.MaxInt256; } });\nObject.defineProperty(exports, \"N\", { enumerable: true, get: function () { return index_js_3.N; } });\nObject.defineProperty(exports, \"ZeroHash\", { enumerable: true, get: function () { return index_js_3.ZeroHash; } });\nObject.defineProperty(exports, \"EtherSymbol\", { enumerable: true, get: function () { return index_js_3.EtherSymbol; } });\nObject.defineProperty(exports, \"MessagePrefix\", { enumerable: true, get: function () { return index_js_3.MessagePrefix; } });\nvar index_js_4 = require(\"./contract/index.js\");\nObject.defineProperty(exports, \"BaseContract\", { enumerable: true, get: function () { return index_js_4.BaseContract; } });\nObject.defineProperty(exports, \"Contract\", { enumerable: true, get: function () { return index_js_4.Contract; } });\nObject.defineProperty(exports, \"ContractFactory\", { enumerable: true, get: function () { return index_js_4.ContractFactory; } });\nObject.defineProperty(exports, \"ContractEventPayload\", { enumerable: true, get: function () { return index_js_4.ContractEventPayload; } });\nObject.defineProperty(exports, \"ContractTransactionReceipt\", { enumerable: true, get: function () { return index_js_4.ContractTransactionReceipt; } });\nObject.defineProperty(exports, \"ContractTransactionResponse\", { enumerable: true, get: function () { return index_js_4.ContractTransactionResponse; } });\nObject.defineProperty(exports, \"ContractUnknownEventPayload\", { enumerable: true, get: function () { return index_js_4.ContractUnknownEventPayload; } });\nObject.defineProperty(exports, \"EventLog\", { enumerable: true, get: function () { return index_js_4.EventLog; } });\nObject.defineProperty(exports, \"UndecodedEventLog\", { enumerable: true, get: function () { return index_js_4.UndecodedEventLog; } });\nvar index_js_5 = require(\"./crypto/index.js\");\nObject.defineProperty(exports, \"computeHmac\", { enumerable: true, get: function () { return index_js_5.computeHmac; } });\nObject.defineProperty(exports, \"randomBytes\", { enumerable: true, get: function () { return index_js_5.randomBytes; } });\nObject.defineProperty(exports, \"keccak256\", { enumerable: true, get: function () { return index_js_5.keccak256; } });\nObject.defineProperty(exports, \"ripemd160\", { enumerable: true, get: function () { return index_js_5.ripemd160; } });\nObject.defineProperty(exports, \"sha256\", { enumerable: true, get: function () { return index_js_5.sha256; } });\nObject.defineProperty(exports, \"sha512\", { enumerable: true, get: function () { return index_js_5.sha512; } });\nObject.defineProperty(exports, \"pbkdf2\", { enumerable: true, get: function () { return index_js_5.pbkdf2; } });\nObject.defineProperty(exports, \"scrypt\", { enumerable: true, get: function () { return index_js_5.scrypt; } });\nObject.defineProperty(exports, \"scryptSync\", { enumerable: true, get: function () { return index_js_5.scryptSync; } });\nObject.defineProperty(exports, \"lock\", { enumerable: true, get: function () { return index_js_5.lock; } });\nObject.defineProperty(exports, \"Signature\", { enumerable: true, get: function () { return index_js_5.Signature; } });\nObject.defineProperty(exports, \"SigningKey\", { enumerable: true, get: function () { return index_js_5.SigningKey; } });\nvar index_js_6 = require(\"./hash/index.js\");\nObject.defineProperty(exports, \"id\", { enumerable: true, get: function () { return index_js_6.id; } });\nObject.defineProperty(exports, \"ensNormalize\", { enumerable: true, get: function () { return index_js_6.ensNormalize; } });\nObject.defineProperty(exports, \"isValidName\", { enumerable: true, get: function () { return index_js_6.isValidName; } });\nObject.defineProperty(exports, \"namehash\", { enumerable: true, get: function () { return index_js_6.namehash; } });\nObject.defineProperty(exports, \"dnsEncode\", { enumerable: true, get: function () { return index_js_6.dnsEncode; } });\nObject.defineProperty(exports, \"hashMessage\", { enumerable: true, get: function () { return index_js_6.hashMessage; } });\nObject.defineProperty(exports, \"verifyMessage\", { enumerable: true, get: function () { return index_js_6.verifyMessage; } });\nObject.defineProperty(exports, \"solidityPacked\", { enumerable: true, get: function () { return index_js_6.solidityPacked; } });\nObject.defineProperty(exports, \"solidityPackedKeccak256\", { enumerable: true, get: function () { return index_js_6.solidityPackedKeccak256; } });\nObject.defineProperty(exports, \"solidityPackedSha256\", { enumerable: true, get: function () { return index_js_6.solidityPackedSha256; } });\nObject.defineProperty(exports, \"TypedDataEncoder\", { enumerable: true, get: function () { return index_js_6.TypedDataEncoder; } });\nObject.defineProperty(exports, \"verifyTypedData\", { enumerable: true, get: function () { return index_js_6.verifyTypedData; } });\nvar index_js_7 = require(\"./providers/index.js\");\nObject.defineProperty(exports, \"getDefaultProvider\", { enumerable: true, get: function () { return index_js_7.getDefaultProvider; } });\nObject.defineProperty(exports, \"Block\", { enumerable: true, get: function () { return index_js_7.Block; } });\nObject.defineProperty(exports, \"FeeData\", { enumerable: true, get: function () { return index_js_7.FeeData; } });\nObject.defineProperty(exports, \"Log\", { enumerable: true, get: function () { return index_js_7.Log; } });\nObject.defineProperty(exports, \"TransactionReceipt\", { enumerable: true, get: function () { return index_js_7.TransactionReceipt; } });\nObject.defineProperty(exports, \"TransactionResponse\", { enumerable: true, get: function () { return index_js_7.TransactionResponse; } });\nObject.defineProperty(exports, \"AbstractSigner\", { enumerable: true, get: function () { return index_js_7.AbstractSigner; } });\nObject.defineProperty(exports, \"NonceManager\", { enumerable: true, get: function () { return index_js_7.NonceManager; } });\nObject.defineProperty(exports, \"VoidSigner\", { enumerable: true, get: function () { return index_js_7.VoidSigner; } });\nObject.defineProperty(exports, \"AbstractProvider\", { enumerable: true, get: function () { return index_js_7.AbstractProvider; } });\nObject.defineProperty(exports, \"FallbackProvider\", { enumerable: true, get: function () { return index_js_7.FallbackProvider; } });\nObject.defineProperty(exports, \"JsonRpcApiProvider\", { enumerable: true, get: function () { return index_js_7.JsonRpcApiProvider; } });\nObject.defineProperty(exports, \"JsonRpcProvider\", { enumerable: true, get: function () { return index_js_7.JsonRpcProvider; } });\nObject.defineProperty(exports, \"JsonRpcSigner\", { enumerable: true, get: function () { return index_js_7.JsonRpcSigner; } });\nObject.defineProperty(exports, \"BrowserProvider\", { enumerable: true, get: function () { return index_js_7.BrowserProvider; } });\nObject.defineProperty(exports, \"AlchemyProvider\", { enumerable: true, get: function () { return index_js_7.AlchemyProvider; } });\nObject.defineProperty(exports, \"AnkrProvider\", { enumerable: true, get: function () { return index_js_7.AnkrProvider; } });\nObject.defineProperty(exports, \"ChainstackProvider\", { enumerable: true, get: function () { return index_js_7.ChainstackProvider; } });\nObject.defineProperty(exports, \"CloudflareProvider\", { enumerable: true, get: function () { return index_js_7.CloudflareProvider; } });\nObject.defineProperty(exports, \"EtherscanProvider\", { enumerable: true, get: function () { return index_js_7.EtherscanProvider; } });\nObject.defineProperty(exports, \"InfuraProvider\", { enumerable: true, get: function () { return index_js_7.InfuraProvider; } });\nObject.defineProperty(exports, \"InfuraWebSocketProvider\", { enumerable: true, get: function () { return index_js_7.InfuraWebSocketProvider; } });\nObject.defineProperty(exports, \"PocketProvider\", { enumerable: true, get: function () { return index_js_7.PocketProvider; } });\nObject.defineProperty(exports, \"QuickNodeProvider\", { enumerable: true, get: function () { return index_js_7.QuickNodeProvider; } });\nObject.defineProperty(exports, \"IpcSocketProvider\", { enumerable: true, get: function () { return index_js_7.IpcSocketProvider; } });\nObject.defineProperty(exports, \"SocketProvider\", { enumerable: true, get: function () { return index_js_7.SocketProvider; } });\nObject.defineProperty(exports, \"WebSocketProvider\", { enumerable: true, get: function () { return index_js_7.WebSocketProvider; } });\nObject.defineProperty(exports, \"EnsResolver\", { enumerable: true, get: function () { return index_js_7.EnsResolver; } });\nObject.defineProperty(exports, \"Network\", { enumerable: true, get: function () { return index_js_7.Network; } });\nObject.defineProperty(exports, \"EnsPlugin\", { enumerable: true, get: function () { return index_js_7.EnsPlugin; } });\nObject.defineProperty(exports, \"EtherscanPlugin\", { enumerable: true, get: function () { return index_js_7.EtherscanPlugin; } });\nObject.defineProperty(exports, \"FeeDataNetworkPlugin\", { enumerable: true, get: function () { return index_js_7.FeeDataNetworkPlugin; } });\nObject.defineProperty(exports, \"FetchUrlFeeDataNetworkPlugin\", { enumerable: true, get: function () { return index_js_7.FetchUrlFeeDataNetworkPlugin; } });\nObject.defineProperty(exports, \"GasCostPlugin\", { enumerable: true, get: function () { return index_js_7.GasCostPlugin; } });\nObject.defineProperty(exports, \"NetworkPlugin\", { enumerable: true, get: function () { return index_js_7.NetworkPlugin; } });\nObject.defineProperty(exports, \"MulticoinProviderPlugin\", { enumerable: true, get: function () { return index_js_7.MulticoinProviderPlugin; } });\nObject.defineProperty(exports, \"SocketBlockSubscriber\", { enumerable: true, get: function () { return index_js_7.SocketBlockSubscriber; } });\nObject.defineProperty(exports, \"SocketEventSubscriber\", { enumerable: true, get: function () { return index_js_7.SocketEventSubscriber; } });\nObject.defineProperty(exports, \"SocketPendingSubscriber\", { enumerable: true, get: function () { return index_js_7.SocketPendingSubscriber; } });\nObject.defineProperty(exports, \"SocketSubscriber\", { enumerable: true, get: function () { return index_js_7.SocketSubscriber; } });\nObject.defineProperty(exports, \"UnmanagedSubscriber\", { enumerable: true, get: function () { return index_js_7.UnmanagedSubscriber; } });\nObject.defineProperty(exports, \"copyRequest\", { enumerable: true, get: function () { return index_js_7.copyRequest; } });\nObject.defineProperty(exports, \"showThrottleMessage\", { enumerable: true, get: function () { return index_js_7.showThrottleMessage; } });\nvar index_js_8 = require(\"./transaction/index.js\");\nObject.defineProperty(exports, \"accessListify\", { enumerable: true, get: function () { return index_js_8.accessListify; } });\nObject.defineProperty(exports, \"computeAddress\", { enumerable: true, get: function () { return index_js_8.computeAddress; } });\nObject.defineProperty(exports, \"recoverAddress\", { enumerable: true, get: function () { return index_js_8.recoverAddress; } });\nObject.defineProperty(exports, \"Transaction\", { enumerable: true, get: function () { return index_js_8.Transaction; } });\nvar index_js_9 = require(\"./utils/index.js\");\nObject.defineProperty(exports, \"decodeBase58\", { enumerable: true, get: function () { return index_js_9.decodeBase58; } });\nObject.defineProperty(exports, \"encodeBase58\", { enumerable: true, get: function () { return index_js_9.encodeBase58; } });\nObject.defineProperty(exports, \"decodeBase64\", { enumerable: true, get: function () { return index_js_9.decodeBase64; } });\nObject.defineProperty(exports, \"encodeBase64\", { enumerable: true, get: function () { return index_js_9.encodeBase64; } });\nObject.defineProperty(exports, \"concat\", { enumerable: true, get: function () { return index_js_9.concat; } });\nObject.defineProperty(exports, \"dataLength\", { enumerable: true, get: function () { return index_js_9.dataLength; } });\nObject.defineProperty(exports, \"dataSlice\", { enumerable: true, get: function () { return index_js_9.dataSlice; } });\nObject.defineProperty(exports, \"getBytes\", { enumerable: true, get: function () { return index_js_9.getBytes; } });\nObject.defineProperty(exports, \"getBytesCopy\", { enumerable: true, get: function () { return index_js_9.getBytesCopy; } });\nObject.defineProperty(exports, \"hexlify\", { enumerable: true, get: function () { return index_js_9.hexlify; } });\nObject.defineProperty(exports, \"isHexString\", { enumerable: true, get: function () { return index_js_9.isHexString; } });\nObject.defineProperty(exports, \"isBytesLike\", { enumerable: true, get: function () { return index_js_9.isBytesLike; } });\nObject.defineProperty(exports, \"stripZerosLeft\", { enumerable: true, get: function () { return index_js_9.stripZerosLeft; } });\nObject.defineProperty(exports, \"zeroPadBytes\", { enumerable: true, get: function () { return index_js_9.zeroPadBytes; } });\nObject.defineProperty(exports, \"zeroPadValue\", { enumerable: true, get: function () { return index_js_9.zeroPadValue; } });\nObject.defineProperty(exports, \"defineProperties\", { enumerable: true, get: function () { return index_js_9.defineProperties; } });\nObject.defineProperty(exports, \"resolveProperties\", { enumerable: true, get: function () { return index_js_9.resolveProperties; } });\nObject.defineProperty(exports, \"assert\", { enumerable: true, get: function () { return index_js_9.assert; } });\nObject.defineProperty(exports, \"assertArgument\", { enumerable: true, get: function () { return index_js_9.assertArgument; } });\nObject.defineProperty(exports, \"assertArgumentCount\", { enumerable: true, get: function () { return index_js_9.assertArgumentCount; } });\nObject.defineProperty(exports, \"assertNormalize\", { enumerable: true, get: function () { return index_js_9.assertNormalize; } });\nObject.defineProperty(exports, \"assertPrivate\", { enumerable: true, get: function () { return index_js_9.assertPrivate; } });\nObject.defineProperty(exports, \"makeError\", { enumerable: true, get: function () { return index_js_9.makeError; } });\nObject.defineProperty(exports, \"isCallException\", { enumerable: true, get: function () { return index_js_9.isCallException; } });\nObject.defineProperty(exports, \"isError\", { enumerable: true, get: function () { return index_js_9.isError; } });\nObject.defineProperty(exports, \"EventPayload\", { enumerable: true, get: function () { return index_js_9.EventPayload; } });\nObject.defineProperty(exports, \"FetchRequest\", { enumerable: true, get: function () { return index_js_9.FetchRequest; } });\nObject.defineProperty(exports, \"FetchResponse\", { enumerable: true, get: function () { return index_js_9.FetchResponse; } });\nObject.defineProperty(exports, \"FetchCancelSignal\", { enumerable: true, get: function () { return index_js_9.FetchCancelSignal; } });\nObject.defineProperty(exports, \"FixedNumber\", { enumerable: true, get: function () { return index_js_9.FixedNumber; } });\nObject.defineProperty(exports, \"getBigInt\", { enumerable: true, get: function () { return index_js_9.getBigInt; } });\nObject.defineProperty(exports, \"getNumber\", { enumerable: true, get: function () { return index_js_9.getNumber; } });\nObject.defineProperty(exports, \"getUint\", { enumerable: true, get: function () { return index_js_9.getUint; } });\nObject.defineProperty(exports, \"toBeArray\", { enumerable: true, get: function () { return index_js_9.toBeArray; } });\nObject.defineProperty(exports, \"toBigInt\", { enumerable: true, get: function () { return index_js_9.toBigInt; } });\nObject.defineProperty(exports, \"toBeHex\", { enumerable: true, get: function () { return index_js_9.toBeHex; } });\nObject.defineProperty(exports, \"toNumber\", { enumerable: true, get: function () { return index_js_9.toNumber; } });\nObject.defineProperty(exports, \"toQuantity\", { enumerable: true, get: function () { return index_js_9.toQuantity; } });\nObject.defineProperty(exports, \"fromTwos\", { enumerable: true, get: function () { return index_js_9.fromTwos; } });\nObject.defineProperty(exports, \"toTwos\", { enumerable: true, get: function () { return index_js_9.toTwos; } });\nObject.defineProperty(exports, \"mask\", { enumerable: true, get: function () { return index_js_9.mask; } });\nObject.defineProperty(exports, \"formatEther\", { enumerable: true, get: function () { return index_js_9.formatEther; } });\nObject.defineProperty(exports, \"parseEther\", { enumerable: true, get: function () { return index_js_9.parseEther; } });\nObject.defineProperty(exports, \"formatUnits\", { enumerable: true, get: function () { return index_js_9.formatUnits; } });\nObject.defineProperty(exports, \"parseUnits\", { enumerable: true, get: function () { return index_js_9.parseUnits; } });\nObject.defineProperty(exports, \"toUtf8Bytes\", { enumerable: true, get: function () { return index_js_9.toUtf8Bytes; } });\nObject.defineProperty(exports, \"toUtf8CodePoints\", { enumerable: true, get: function () { return index_js_9.toUtf8CodePoints; } });\nObject.defineProperty(exports, \"toUtf8String\", { enumerable: true, get: function () { return index_js_9.toUtf8String; } });\nObject.defineProperty(exports, \"Utf8ErrorFuncs\", { enumerable: true, get: function () { return index_js_9.Utf8ErrorFuncs; } });\nObject.defineProperty(exports, \"decodeRlp\", { enumerable: true, get: function () { return index_js_9.decodeRlp; } });\nObject.defineProperty(exports, \"encodeRlp\", { enumerable: true, get: function () { return index_js_9.encodeRlp; } });\nObject.defineProperty(exports, \"uuidV4\", { enumerable: true, get: function () { return index_js_9.uuidV4; } });\nvar index_js_10 = require(\"./wallet/index.js\");\nObject.defineProperty(exports, \"Mnemonic\", { enumerable: true, get: function () { return index_js_10.Mnemonic; } });\nObject.defineProperty(exports, \"BaseWallet\", { enumerable: true, get: function () { return index_js_10.BaseWallet; } });\nObject.defineProperty(exports, \"HDNodeWallet\", { enumerable: true, get: function () { return index_js_10.HDNodeWallet; } });\nObject.defineProperty(exports, \"HDNodeVoidWallet\", { enumerable: true, get: function () { return index_js_10.HDNodeVoidWallet; } });\nObject.defineProperty(exports, \"Wallet\", { enumerable: true, get: function () { return index_js_10.Wallet; } });\nObject.defineProperty(exports, \"defaultPath\", { enumerable: true, get: function () { return index_js_10.defaultPath; } });\nObject.defineProperty(exports, \"getAccountPath\", { enumerable: true, get: function () { return index_js_10.getAccountPath; } });\nObject.defineProperty(exports, \"getIndexedAccountPath\", { enumerable: true, get: function () { return index_js_10.getIndexedAccountPath; } });\nObject.defineProperty(exports, \"isCrowdsaleJson\", { enumerable: true, get: function () { return index_js_10.isCrowdsaleJson; } });\nObject.defineProperty(exports, \"isKeystoreJson\", { enumerable: true, get: function () { return index_js_10.isKeystoreJson; } });\nObject.defineProperty(exports, \"decryptCrowdsaleJson\", { enumerable: true, get: function () { return index_js_10.decryptCrowdsaleJson; } });\nObject.defineProperty(exports, \"decryptKeystoreJsonSync\", { enumerable: true, get: function () { return index_js_10.decryptKeystoreJsonSync; } });\nObject.defineProperty(exports, \"decryptKeystoreJson\", { enumerable: true, get: function () { return index_js_10.decryptKeystoreJson; } });\nObject.defineProperty(exports, \"encryptKeystoreJson\", { enumerable: true, get: function () { return index_js_10.encryptKeystoreJson; } });\nObject.defineProperty(exports, \"encryptKeystoreJsonSync\", { enumerable: true, get: function () { return index_js_10.encryptKeystoreJsonSync; } });\nvar index_js_11 = require(\"./wordlists/index.js\");\nObject.defineProperty(exports, \"Wordlist\", { enumerable: true, get: function () { return index_js_11.Wordlist; } });\nObject.defineProperty(exports, \"LangEn\", { enumerable: true, get: function () { return index_js_11.LangEn; } });\nObject.defineProperty(exports, \"WordlistOwl\", { enumerable: true, get: function () { return index_js_11.WordlistOwl; } });\nObject.defineProperty(exports, \"WordlistOwlA\", { enumerable: true, get: function () { return index_js_11.WordlistOwlA; } });\nObject.defineProperty(exports, \"wordlists\", { enumerable: true, get: function () { return index_js_11.wordlists; } });\n// dummy change; to pick-up ws security issue changes\n//# sourceMappingURL=ethers.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.id = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\n/**\n *  A simple hashing function which operates on UTF-8 strings to\n *  compute an 32-byte identifier.\n *\n *  This simply computes the [UTF-8 bytes](toUtf8Bytes) and computes\n *  the [[keccak256]].\n *\n *  @example:\n *    id(\"hello world\")\n *    //_result:\n */\nfunction id(value) {\n    return (0, index_js_1.keccak256)((0, index_js_2.toUtf8Bytes)(value));\n}\nexports.id = id;\n//# sourceMappingURL=id.js.map","\"use strict\";\n/**\n *  Utilities for common tasks involving hashing. Also see\n *  [cryptographic hashing](about-crypto-hashing).\n *\n *  @_section: api/hashing:Hashing Utilities  [about-hashing]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.verifyTypedData = exports.TypedDataEncoder = exports.solidityPackedSha256 = exports.solidityPackedKeccak256 = exports.solidityPacked = exports.verifyMessage = exports.hashMessage = exports.dnsEncode = exports.namehash = exports.isValidName = exports.ensNormalize = exports.id = void 0;\nvar id_js_1 = require(\"./id.js\");\nObject.defineProperty(exports, \"id\", { enumerable: true, get: function () { return id_js_1.id; } });\nvar namehash_js_1 = require(\"./namehash.js\");\nObject.defineProperty(exports, \"ensNormalize\", { enumerable: true, get: function () { return namehash_js_1.ensNormalize; } });\nObject.defineProperty(exports, \"isValidName\", { enumerable: true, get: function () { return namehash_js_1.isValidName; } });\nObject.defineProperty(exports, \"namehash\", { enumerable: true, get: function () { return namehash_js_1.namehash; } });\nObject.defineProperty(exports, \"dnsEncode\", { enumerable: true, get: function () { return namehash_js_1.dnsEncode; } });\nvar message_js_1 = require(\"./message.js\");\nObject.defineProperty(exports, \"hashMessage\", { enumerable: true, get: function () { return message_js_1.hashMessage; } });\nObject.defineProperty(exports, \"verifyMessage\", { enumerable: true, get: function () { return message_js_1.verifyMessage; } });\nvar solidity_js_1 = require(\"./solidity.js\");\nObject.defineProperty(exports, \"solidityPacked\", { enumerable: true, get: function () { return solidity_js_1.solidityPacked; } });\nObject.defineProperty(exports, \"solidityPackedKeccak256\", { enumerable: true, get: function () { return solidity_js_1.solidityPackedKeccak256; } });\nObject.defineProperty(exports, \"solidityPackedSha256\", { enumerable: true, get: function () { return solidity_js_1.solidityPackedSha256; } });\nvar typed_data_js_1 = require(\"./typed-data.js\");\nObject.defineProperty(exports, \"TypedDataEncoder\", { enumerable: true, get: function () { return typed_data_js_1.TypedDataEncoder; } });\nObject.defineProperty(exports, \"verifyTypedData\", { enumerable: true, get: function () { return typed_data_js_1.verifyTypedData; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.verifyMessage = exports.hashMessage = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../constants/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\n/**\n *  Computes the [[link-eip-191]] personal-sign message digest to sign.\n *\n *  This prefixes the message with [[MessagePrefix]] and the decimal length\n *  of %%message%% and computes the [[keccak256]] digest.\n *\n *  If %%message%% is a string, it is converted to its UTF-8 bytes\n *  first. To compute the digest of a [[DataHexString]], it must be converted\n *  to [bytes](getBytes).\n *\n *  @example:\n *    hashMessage(\"Hello World\")\n *    //_result:\n *\n *    // Hashes the SIX (6) string characters, i.e.\n *    // [ \"0\", \"x\", \"4\", \"2\", \"4\", \"3\" ]\n *    hashMessage(\"0x4243\")\n *    //_result:\n *\n *    // Hashes the TWO (2) bytes [ 0x42, 0x43 ]...\n *    hashMessage(getBytes(\"0x4243\"))\n *    //_result:\n *\n *    // ...which is equal to using data\n *    hashMessage(new Uint8Array([ 0x42, 0x43 ]))\n *    //_result:\n *\n */\nfunction hashMessage(message) {\n    if (typeof (message) === \"string\") {\n        message = (0, index_js_4.toUtf8Bytes)(message);\n    }\n    return (0, index_js_1.keccak256)((0, index_js_4.concat)([\n        (0, index_js_4.toUtf8Bytes)(index_js_2.MessagePrefix),\n        (0, index_js_4.toUtf8Bytes)(String(message.length)),\n        message\n    ]));\n}\nexports.hashMessage = hashMessage;\n/**\n *  Return the address of the private key that produced\n *  the signature %%sig%% during signing for %%message%%.\n */\nfunction verifyMessage(message, sig) {\n    const digest = hashMessage(message);\n    return (0, index_js_3.recoverAddress)(digest, sig);\n}\nexports.verifyMessage = verifyMessage;\n//# sourceMappingURL=message.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.dnsEncode = exports.namehash = exports.isValidName = exports.ensNormalize = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst ens_normalize_1 = require(\"@adraffy/ens-normalize\");\nconst Zeros = new Uint8Array(32);\nZeros.fill(0);\nfunction checkComponent(comp) {\n    (0, index_js_2.assertArgument)(comp.length !== 0, \"invalid ENS name; empty component\", \"comp\", comp);\n    return comp;\n}\nfunction ensNameSplit(name) {\n    const bytes = (0, index_js_2.toUtf8Bytes)(ensNormalize(name));\n    const comps = [];\n    if (name.length === 0) {\n        return comps;\n    }\n    let last = 0;\n    for (let i = 0; i < bytes.length; i++) {\n        const d = bytes[i];\n        // A separator (i.e. \".\"); copy this component\n        if (d === 0x2e) {\n            comps.push(checkComponent(bytes.slice(last, i)));\n            last = i + 1;\n        }\n    }\n    // There was a stray separator at the end of the name\n    (0, index_js_2.assertArgument)(last < bytes.length, \"invalid ENS name; empty component\", \"name\", name);\n    comps.push(checkComponent(bytes.slice(last)));\n    return comps;\n}\n/**\n *  Returns the ENS %%name%% normalized.\n */\nfunction ensNormalize(name) {\n    try {\n        if (name.length === 0) {\n            throw new Error(\"empty label\");\n        }\n        return (0, ens_normalize_1.ens_normalize)(name);\n    }\n    catch (error) {\n        (0, index_js_2.assertArgument)(false, `invalid ENS name (${error.message})`, \"name\", name);\n    }\n}\nexports.ensNormalize = ensNormalize;\n/**\n *  Returns ``true`` if %%name%% is a valid ENS name.\n */\nfunction isValidName(name) {\n    try {\n        return (ensNameSplit(name).length !== 0);\n    }\n    catch (error) { }\n    return false;\n}\nexports.isValidName = isValidName;\n/**\n *  Returns the [[link-namehash]] for %%name%%.\n */\nfunction namehash(name) {\n    (0, index_js_2.assertArgument)(typeof (name) === \"string\", \"invalid ENS name; not a string\", \"name\", name);\n    (0, index_js_2.assertArgument)(name.length, `invalid ENS name (empty label)`, \"name\", name);\n    let result = Zeros;\n    const comps = ensNameSplit(name);\n    while (comps.length) {\n        result = (0, index_js_1.keccak256)((0, index_js_2.concat)([result, (0, index_js_1.keccak256)((comps.pop()))]));\n    }\n    return (0, index_js_2.hexlify)(result);\n}\nexports.namehash = namehash;\n/**\n *  Returns the DNS encoded %%name%%.\n *\n *  This is used for various parts of ENS name resolution, such\n *  as the wildcard resolution.\n */\nfunction dnsEncode(name, _maxLength) {\n    const length = (_maxLength != null) ? _maxLength : 63;\n    (0, index_js_2.assertArgument)(length <= 255, \"DNS encoded label cannot exceed 255\", \"length\", length);\n    return (0, index_js_2.hexlify)((0, index_js_2.concat)(ensNameSplit(name).map((comp) => {\n        (0, index_js_2.assertArgument)(comp.length <= length, `label ${JSON.stringify(name)} exceeds ${length} bytes`, \"name\", name);\n        const bytes = new Uint8Array(comp.length + 1);\n        bytes.set(comp, 1);\n        bytes[0] = bytes.length - 1;\n        return bytes;\n    }))) + \"00\";\n}\nexports.dnsEncode = dnsEncode;\n//# sourceMappingURL=namehash.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.solidityPackedSha256 = exports.solidityPackedKeccak256 = exports.solidityPacked = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst regexBytes = new RegExp(\"^bytes([0-9]+)$\");\nconst regexNumber = new RegExp(\"^(u?int)([0-9]*)$\");\nconst regexArray = new RegExp(\"^(.*)\\\\[([0-9]*)\\\\]$\");\nfunction _pack(type, value, isArray) {\n    switch (type) {\n        case \"address\":\n            if (isArray) {\n                return (0, index_js_3.getBytes)((0, index_js_3.zeroPadValue)(value, 32));\n            }\n            return (0, index_js_3.getBytes)((0, index_js_1.getAddress)(value));\n        case \"string\":\n            return (0, index_js_3.toUtf8Bytes)(value);\n        case \"bytes\":\n            return (0, index_js_3.getBytes)(value);\n        case \"bool\":\n            value = (!!value ? \"0x01\" : \"0x00\");\n            if (isArray) {\n                return (0, index_js_3.getBytes)((0, index_js_3.zeroPadValue)(value, 32));\n            }\n            return (0, index_js_3.getBytes)(value);\n    }\n    let match = type.match(regexNumber);\n    if (match) {\n        let signed = (match[1] === \"int\");\n        let size = parseInt(match[2] || \"256\");\n        (0, index_js_3.assertArgument)((!match[2] || match[2] === String(size)) && (size % 8 === 0) && size !== 0 && size <= 256, \"invalid number type\", \"type\", type);\n        if (isArray) {\n            size = 256;\n        }\n        if (signed) {\n            value = (0, index_js_3.toTwos)(value, size);\n        }\n        return (0, index_js_3.getBytes)((0, index_js_3.zeroPadValue)((0, index_js_3.toBeArray)(value), size / 8));\n    }\n    match = type.match(regexBytes);\n    if (match) {\n        const size = parseInt(match[1]);\n        (0, index_js_3.assertArgument)(String(size) === match[1] && size !== 0 && size <= 32, \"invalid bytes type\", \"type\", type);\n        (0, index_js_3.assertArgument)((0, index_js_3.dataLength)(value) === size, `invalid value for ${type}`, \"value\", value);\n        if (isArray) {\n            return (0, index_js_3.getBytes)((0, index_js_3.zeroPadBytes)(value, 32));\n        }\n        return value;\n    }\n    match = type.match(regexArray);\n    if (match && Array.isArray(value)) {\n        const baseType = match[1];\n        const count = parseInt(match[2] || String(value.length));\n        (0, index_js_3.assertArgument)(count === value.length, `invalid array length for ${type}`, \"value\", value);\n        const result = [];\n        value.forEach(function (value) {\n            result.push(_pack(baseType, value, true));\n        });\n        return (0, index_js_3.getBytes)((0, index_js_3.concat)(result));\n    }\n    (0, index_js_3.assertArgument)(false, \"invalid type\", \"type\", type);\n}\n// @TODO: Array Enum\n/**\n *   Computes the [[link-solc-packed]] representation of %%values%%\n *   respectively to their %%types%%.\n *\n *   @example:\n *       addr = \"0x8ba1f109551bd432803012645ac136ddd64dba72\"\n *       solidityPacked([ \"address\", \"uint\" ], [ addr, 45 ]);\n *       //_result:\n */\nfunction solidityPacked(types, values) {\n    (0, index_js_3.assertArgument)(types.length === values.length, \"wrong number of values; expected ${ types.length }\", \"values\", values);\n    const tight = [];\n    types.forEach(function (type, index) {\n        tight.push(_pack(type, values[index]));\n    });\n    return (0, index_js_3.hexlify)((0, index_js_3.concat)(tight));\n}\nexports.solidityPacked = solidityPacked;\n/**\n *   Computes the [[link-solc-packed]] [[keccak256]] hash of %%values%%\n *   respectively to their %%types%%.\n *\n *   @example:\n *       addr = \"0x8ba1f109551bd432803012645ac136ddd64dba72\"\n *       solidityPackedKeccak256([ \"address\", \"uint\" ], [ addr, 45 ]);\n *       //_result:\n */\nfunction solidityPackedKeccak256(types, values) {\n    return (0, index_js_2.keccak256)(solidityPacked(types, values));\n}\nexports.solidityPackedKeccak256 = solidityPackedKeccak256;\n/**\n *   Computes the [[link-solc-packed]] [[sha256]] hash of %%values%%\n *   respectively to their %%types%%.\n *\n *   @example:\n *       addr = \"0x8ba1f109551bd432803012645ac136ddd64dba72\"\n *       solidityPackedSha256([ \"address\", \"uint\" ], [ addr, 45 ]);\n *       //_result:\n */\nfunction solidityPackedSha256(types, values) {\n    return (0, index_js_2.sha256)(solidityPacked(types, values));\n}\nexports.solidityPackedSha256 = solidityPackedSha256;\n//# sourceMappingURL=solidity.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.verifyTypedData = exports.TypedDataEncoder = void 0;\n//import { TypedDataDomain, TypedDataField } from \"@ethersproject/providerabstract-signer\";\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst id_js_1 = require(\"./id.js\");\nconst padding = new Uint8Array(32);\npadding.fill(0);\nconst BN__1 = BigInt(-1);\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_MAX_UINT256 = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n;\n;\nfunction hexPadRight(value) {\n    const bytes = (0, index_js_4.getBytes)(value);\n    const padOffset = bytes.length % 32;\n    if (padOffset) {\n        return (0, index_js_4.concat)([bytes, padding.slice(padOffset)]);\n    }\n    return (0, index_js_4.hexlify)(bytes);\n}\nconst hexTrue = (0, index_js_4.toBeHex)(BN_1, 32);\nconst hexFalse = (0, index_js_4.toBeHex)(BN_0, 32);\nconst domainFieldTypes = {\n    name: \"string\",\n    version: \"string\",\n    chainId: \"uint256\",\n    verifyingContract: \"address\",\n    salt: \"bytes32\"\n};\nconst domainFieldNames = [\n    \"name\", \"version\", \"chainId\", \"verifyingContract\", \"salt\"\n];\nfunction checkString(key) {\n    return function (value) {\n        (0, index_js_4.assertArgument)(typeof (value) === \"string\", `invalid domain value for ${JSON.stringify(key)}`, `domain.${key}`, value);\n        return value;\n    };\n}\nconst domainChecks = {\n    name: checkString(\"name\"),\n    version: checkString(\"version\"),\n    chainId: function (_value) {\n        const value = (0, index_js_4.getBigInt)(_value, \"domain.chainId\");\n        (0, index_js_4.assertArgument)(value >= 0, \"invalid chain ID\", \"domain.chainId\", _value);\n        if (Number.isSafeInteger(value)) {\n            return Number(value);\n        }\n        return (0, index_js_4.toQuantity)(value);\n    },\n    verifyingContract: function (value) {\n        try {\n            return (0, index_js_1.getAddress)(value).toLowerCase();\n        }\n        catch (error) { }\n        (0, index_js_4.assertArgument)(false, `invalid domain value \"verifyingContract\"`, \"domain.verifyingContract\", value);\n    },\n    salt: function (value) {\n        const bytes = (0, index_js_4.getBytes)(value, \"domain.salt\");\n        (0, index_js_4.assertArgument)(bytes.length === 32, `invalid domain value \"salt\"`, \"domain.salt\", value);\n        return (0, index_js_4.hexlify)(bytes);\n    }\n};\nfunction getBaseEncoder(type) {\n    // intXX and uintXX\n    {\n        const match = type.match(/^(u?)int(\\d+)$/);\n        if (match) {\n            const signed = (match[1] === \"\");\n            const width = parseInt(match[2]);\n            (0, index_js_4.assertArgument)(width % 8 === 0 && width !== 0 && width <= 256 && match[2] === String(width), \"invalid numeric width\", \"type\", type);\n            const boundsUpper = (0, index_js_4.mask)(BN_MAX_UINT256, signed ? (width - 1) : width);\n            const boundsLower = signed ? ((boundsUpper + BN_1) * BN__1) : BN_0;\n            return function (_value) {\n                const value = (0, index_js_4.getBigInt)(_value, \"value\");\n                (0, index_js_4.assertArgument)(value >= boundsLower && value <= boundsUpper, `value out-of-bounds for ${type}`, \"value\", value);\n                return (0, index_js_4.toBeHex)(signed ? (0, index_js_4.toTwos)(value, 256) : value, 32);\n            };\n        }\n    }\n    // bytesXX\n    {\n        const match = type.match(/^bytes(\\d+)$/);\n        if (match) {\n            const width = parseInt(match[1]);\n            (0, index_js_4.assertArgument)(width !== 0 && width <= 32 && match[1] === String(width), \"invalid bytes width\", \"type\", type);\n            return function (value) {\n                const bytes = (0, index_js_4.getBytes)(value);\n                (0, index_js_4.assertArgument)(bytes.length === width, `invalid length for ${type}`, \"value\", value);\n                return hexPadRight(value);\n            };\n        }\n    }\n    switch (type) {\n        case \"address\": return function (value) {\n            return (0, index_js_4.zeroPadValue)((0, index_js_1.getAddress)(value), 32);\n        };\n        case \"bool\": return function (value) {\n            return ((!value) ? hexFalse : hexTrue);\n        };\n        case \"bytes\": return function (value) {\n            return (0, index_js_2.keccak256)(value);\n        };\n        case \"string\": return function (value) {\n            return (0, id_js_1.id)(value);\n        };\n    }\n    return null;\n}\nfunction encodeType(name, fields) {\n    return `${name}(${fields.map(({ name, type }) => (type + \" \" + name)).join(\",\")})`;\n}\n// foo[][3] => { base: \"foo\", index: \"[][3]\", array: {\n//     base: \"foo\", prefix: \"foo[]\", count: 3 } }\nfunction splitArray(type) {\n    const match = type.match(/^([^\\x5b]*)((\\x5b\\d*\\x5d)*)(\\x5b(\\d*)\\x5d)$/);\n    if (match) {\n        return {\n            base: match[1],\n            index: (match[2] + match[4]),\n            array: {\n                base: match[1],\n                prefix: (match[1] + match[2]),\n                count: (match[5] ? parseInt(match[5]) : -1),\n            }\n        };\n    }\n    return { base: type };\n}\n/**\n *  A **TypedDataEncode** prepares and encodes [[link-eip-712]] payloads\n *  for signed typed data.\n *\n *  This is useful for those that wish to compute various components of a\n *  typed data hash, primary types, or sub-components, but generally the\n *  higher level [[Signer-signTypedData]] is more useful.\n */\nclass TypedDataEncoder {\n    /**\n     *  The primary type for the structured [[types]].\n     *\n     *  This is derived automatically from the [[types]], since no\n     *  recursion is possible, once the DAG for the types is consturcted\n     *  internally, the primary type must be the only remaining type with\n     *  no parent nodes.\n     */\n    primaryType;\n    #types;\n    /**\n     *  The types.\n     */\n    get types() {\n        return JSON.parse(this.#types);\n    }\n    #fullTypes;\n    #encoderCache;\n    /**\n     *  Create a new **TypedDataEncoder** for %%types%%.\n     *\n     *  This performs all necessary checking that types are valid and\n     *  do not violate the [[link-eip-712]] structural constraints as\n     *  well as computes the [[primaryType]].\n     */\n    constructor(_types) {\n        this.#fullTypes = new Map();\n        this.#encoderCache = new Map();\n        // Link struct types to their direct child structs\n        const links = new Map();\n        // Link structs to structs which contain them as a child\n        const parents = new Map();\n        // Link all subtypes within a given struct\n        const subtypes = new Map();\n        const types = {};\n        Object.keys(_types).forEach((type) => {\n            types[type] = _types[type].map(({ name, type }) => {\n                // Normalize the base type (unless name conflict)\n                let { base, index } = splitArray(type);\n                if (base === \"int\" && !_types[\"int\"]) {\n                    base = \"int256\";\n                }\n                if (base === \"uint\" && !_types[\"uint\"]) {\n                    base = \"uint256\";\n                }\n                return { name, type: (base + (index || \"\")) };\n            });\n            links.set(type, new Set());\n            parents.set(type, []);\n            subtypes.set(type, new Set());\n        });\n        this.#types = JSON.stringify(types);\n        for (const name in types) {\n            const uniqueNames = new Set();\n            for (const field of types[name]) {\n                // Check each field has a unique name\n                (0, index_js_4.assertArgument)(!uniqueNames.has(field.name), `duplicate variable name ${JSON.stringify(field.name)} in ${JSON.stringify(name)}`, \"types\", _types);\n                uniqueNames.add(field.name);\n                // Get the base type (drop any array specifiers)\n                const baseType = splitArray(field.type).base;\n                (0, index_js_4.assertArgument)(baseType !== name, `circular type reference to ${JSON.stringify(baseType)}`, \"types\", _types);\n                // Is this a base encoding type?\n                const encoder = getBaseEncoder(baseType);\n                if (encoder) {\n                    continue;\n                }\n                (0, index_js_4.assertArgument)(parents.has(baseType), `unknown type ${JSON.stringify(baseType)}`, \"types\", _types);\n                // Add linkage\n                parents.get(baseType).push(name);\n                links.get(name).add(baseType);\n            }\n        }\n        // Deduce the primary type\n        const primaryTypes = Array.from(parents.keys()).filter((n) => (parents.get(n).length === 0));\n        (0, index_js_4.assertArgument)(primaryTypes.length !== 0, \"missing primary type\", \"types\", _types);\n        (0, index_js_4.assertArgument)(primaryTypes.length === 1, `ambiguous primary types or unused types: ${primaryTypes.map((t) => (JSON.stringify(t))).join(\", \")}`, \"types\", _types);\n        (0, index_js_4.defineProperties)(this, { primaryType: primaryTypes[0] });\n        // Check for circular type references\n        function checkCircular(type, found) {\n            (0, index_js_4.assertArgument)(!found.has(type), `circular type reference to ${JSON.stringify(type)}`, \"types\", _types);\n            found.add(type);\n            for (const child of links.get(type)) {\n                if (!parents.has(child)) {\n                    continue;\n                }\n                // Recursively check children\n                checkCircular(child, found);\n                // Mark all ancestors as having this decendant\n                for (const subtype of found) {\n                    subtypes.get(subtype).add(child);\n                }\n            }\n            found.delete(type);\n        }\n        checkCircular(this.primaryType, new Set());\n        // Compute each fully describe type\n        for (const [name, set] of subtypes) {\n            const st = Array.from(set);\n            st.sort();\n            this.#fullTypes.set(name, encodeType(name, types[name]) + st.map((t) => encodeType(t, types[t])).join(\"\"));\n        }\n    }\n    /**\n     *  Returnthe encoder for the specific %%type%%.\n     */\n    getEncoder(type) {\n        let encoder = this.#encoderCache.get(type);\n        if (!encoder) {\n            encoder = this.#getEncoder(type);\n            this.#encoderCache.set(type, encoder);\n        }\n        return encoder;\n    }\n    #getEncoder(type) {\n        // Basic encoder type (address, bool, uint256, etc)\n        {\n            const encoder = getBaseEncoder(type);\n            if (encoder) {\n                return encoder;\n            }\n        }\n        // Array\n        const array = splitArray(type).array;\n        if (array) {\n            const subtype = array.prefix;\n            const subEncoder = this.getEncoder(subtype);\n            return (value) => {\n                (0, index_js_4.assertArgument)(array.count === -1 || array.count === value.length, `array length mismatch; expected length ${array.count}`, \"value\", value);\n                let result = value.map(subEncoder);\n                if (this.#fullTypes.has(subtype)) {\n                    result = result.map(index_js_2.keccak256);\n                }\n                return (0, index_js_2.keccak256)((0, index_js_4.concat)(result));\n            };\n        }\n        // Struct\n        const fields = this.types[type];\n        if (fields) {\n            const encodedType = (0, id_js_1.id)(this.#fullTypes.get(type));\n            return (value) => {\n                const values = fields.map(({ name, type }) => {\n                    const result = this.getEncoder(type)(value[name]);\n                    if (this.#fullTypes.has(type)) {\n                        return (0, index_js_2.keccak256)(result);\n                    }\n                    return result;\n                });\n                values.unshift(encodedType);\n                return (0, index_js_4.concat)(values);\n            };\n        }\n        (0, index_js_4.assertArgument)(false, `unknown type: ${type}`, \"type\", type);\n    }\n    /**\n     *  Return the full type for %%name%%.\n     */\n    encodeType(name) {\n        const result = this.#fullTypes.get(name);\n        (0, index_js_4.assertArgument)(result, `unknown type: ${JSON.stringify(name)}`, \"name\", name);\n        return result;\n    }\n    /**\n     *  Return the encoded %%value%% for the %%type%%.\n     */\n    encodeData(type, value) {\n        return this.getEncoder(type)(value);\n    }\n    /**\n     *  Returns the hash of %%value%% for the type of %%name%%.\n     */\n    hashStruct(name, value) {\n        return (0, index_js_2.keccak256)(this.encodeData(name, value));\n    }\n    /**\n     *  Return the fulled encoded %%value%% for the [[types]].\n     */\n    encode(value) {\n        return this.encodeData(this.primaryType, value);\n    }\n    /**\n     *  Return the hash of the fully encoded %%value%% for the [[types]].\n     */\n    hash(value) {\n        return this.hashStruct(this.primaryType, value);\n    }\n    /**\n     *  @_ignore:\n     */\n    _visit(type, value, callback) {\n        // Basic encoder type (address, bool, uint256, etc)\n        {\n            const encoder = getBaseEncoder(type);\n            if (encoder) {\n                return callback(type, value);\n            }\n        }\n        // Array\n        const array = splitArray(type).array;\n        if (array) {\n            (0, index_js_4.assertArgument)(array.count === -1 || array.count === value.length, `array length mismatch; expected length ${array.count}`, \"value\", value);\n            return value.map((v) => this._visit(array.prefix, v, callback));\n        }\n        // Struct\n        const fields = this.types[type];\n        if (fields) {\n            return fields.reduce((accum, { name, type }) => {\n                accum[name] = this._visit(type, value[name], callback);\n                return accum;\n            }, {});\n        }\n        (0, index_js_4.assertArgument)(false, `unknown type: ${type}`, \"type\", type);\n    }\n    /**\n     *  Call %%calback%% for each value in %%value%%, passing the type and\n     *  component within %%value%%.\n     *\n     *  This is useful for replacing addresses or other transformation that\n     *  may be desired on each component, based on its type.\n     */\n    visit(value, callback) {\n        return this._visit(this.primaryType, value, callback);\n    }\n    /**\n     *  Create a new **TypedDataEncoder** for %%types%%.\n     */\n    static from(types) {\n        return new TypedDataEncoder(types);\n    }\n    /**\n     *  Return the primary type for %%types%%.\n     */\n    static getPrimaryType(types) {\n        return TypedDataEncoder.from(types).primaryType;\n    }\n    /**\n     *  Return the hashed struct for %%value%% using %%types%% and %%name%%.\n     */\n    static hashStruct(name, types, value) {\n        return TypedDataEncoder.from(types).hashStruct(name, value);\n    }\n    /**\n     *  Return the domain hash for %%domain%%.\n     */\n    static hashDomain(domain) {\n        const domainFields = [];\n        for (const name in domain) {\n            if (domain[name] == null) {\n                continue;\n            }\n            const type = domainFieldTypes[name];\n            (0, index_js_4.assertArgument)(type, `invalid typed-data domain key: ${JSON.stringify(name)}`, \"domain\", domain);\n            domainFields.push({ name, type });\n        }\n        domainFields.sort((a, b) => {\n            return domainFieldNames.indexOf(a.name) - domainFieldNames.indexOf(b.name);\n        });\n        return TypedDataEncoder.hashStruct(\"EIP712Domain\", { EIP712Domain: domainFields }, domain);\n    }\n    /**\n     *  Return the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.\n     */\n    static encode(domain, types, value) {\n        return (0, index_js_4.concat)([\n            \"0x1901\",\n            TypedDataEncoder.hashDomain(domain),\n            TypedDataEncoder.from(types).hash(value)\n        ]);\n    }\n    /**\n     *  Return the hash of the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.\n     */\n    static hash(domain, types, value) {\n        return (0, index_js_2.keccak256)(TypedDataEncoder.encode(domain, types, value));\n    }\n    // Replaces all address types with ENS names with their looked up address\n    /**\n     * Resolves to the value from resolving all addresses in %%value%% for\n     * %%types%% and the %%domain%%.\n     */\n    static async resolveNames(domain, types, value, resolveName) {\n        // Make a copy to isolate it from the object passed in\n        domain = Object.assign({}, domain);\n        // Allow passing null to ignore value\n        for (const key in domain) {\n            if (domain[key] == null) {\n                delete domain[key];\n            }\n        }\n        // Look up all ENS names\n        const ensCache = {};\n        // Do we need to look up the domain's verifyingContract?\n        if (domain.verifyingContract && !(0, index_js_4.isHexString)(domain.verifyingContract, 20)) {\n            ensCache[domain.verifyingContract] = \"0x\";\n        }\n        // We are going to use the encoder to visit all the base values\n        const encoder = TypedDataEncoder.from(types);\n        // Get a list of all the addresses\n        encoder.visit(value, (type, value) => {\n            if (type === \"address\" && !(0, index_js_4.isHexString)(value, 20)) {\n                ensCache[value] = \"0x\";\n            }\n            return value;\n        });\n        // Lookup each name\n        for (const name in ensCache) {\n            ensCache[name] = await resolveName(name);\n        }\n        // Replace the domain verifyingContract if needed\n        if (domain.verifyingContract && ensCache[domain.verifyingContract]) {\n            domain.verifyingContract = ensCache[domain.verifyingContract];\n        }\n        // Replace all ENS names with their address\n        value = encoder.visit(value, (type, value) => {\n            if (type === \"address\" && ensCache[value]) {\n                return ensCache[value];\n            }\n            return value;\n        });\n        return { domain, value };\n    }\n    /**\n     *  Returns the JSON-encoded payload expected by nodes which implement\n     *  the JSON-RPC [[link-eip-712]] method.\n     */\n    static getPayload(domain, types, value) {\n        // Validate the domain fields\n        TypedDataEncoder.hashDomain(domain);\n        // Derive the EIP712Domain Struct reference type\n        const domainValues = {};\n        const domainTypes = [];\n        domainFieldNames.forEach((name) => {\n            const value = domain[name];\n            if (value == null) {\n                return;\n            }\n            domainValues[name] = domainChecks[name](value);\n            domainTypes.push({ name, type: domainFieldTypes[name] });\n        });\n        const encoder = TypedDataEncoder.from(types);\n        // Get the normalized types\n        types = encoder.types;\n        const typesWithDomain = Object.assign({}, types);\n        (0, index_js_4.assertArgument)(typesWithDomain.EIP712Domain == null, \"types must not contain EIP712Domain type\", \"types.EIP712Domain\", types);\n        typesWithDomain.EIP712Domain = domainTypes;\n        // Validate the data structures and types\n        encoder.encode(value);\n        return {\n            types: typesWithDomain,\n            domain: domainValues,\n            primaryType: encoder.primaryType,\n            message: encoder.visit(value, (type, value) => {\n                // bytes\n                if (type.match(/^bytes(\\d*)/)) {\n                    return (0, index_js_4.hexlify)((0, index_js_4.getBytes)(value));\n                }\n                // uint or int\n                if (type.match(/^u?int/)) {\n                    return (0, index_js_4.getBigInt)(value).toString();\n                }\n                switch (type) {\n                    case \"address\":\n                        return value.toLowerCase();\n                    case \"bool\":\n                        return !!value;\n                    case \"string\":\n                        (0, index_js_4.assertArgument)(typeof (value) === \"string\", \"invalid string\", \"value\", value);\n                        return value;\n                }\n                (0, index_js_4.assertArgument)(false, \"unsupported type\", \"type\", type);\n            })\n        };\n    }\n}\nexports.TypedDataEncoder = TypedDataEncoder;\n/**\n *  Compute the address used to sign the typed data for the %%signature%%.\n */\nfunction verifyTypedData(domain, types, value, signature) {\n    return (0, index_js_3.recoverAddress)(TypedDataEncoder.hash(domain, types, value), signature);\n}\nexports.verifyTypedData = verifyTypedData;\n//# sourceMappingURL=typed-data.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ethers = void 0;\nconst tslib_1 = require(\"tslib\");\n/**\n *  The Application Programming Interface (API) is the collection of\n *  functions, classes and types offered by the Ethers library.\n *\n *  @_section: api:Application Programming Interface  [about-api]\n *  @_navTitle: API\n */\nconst ethers = tslib_1.__importStar(require(\"./ethers.js\"));\nexports.ethers = ethers;\ntslib_1.__exportStar(require(\"./ethers.js\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n *  The available providers should suffice for most developers purposes,\n *  but the [[AbstractProvider]] class has many features which enable\n *  sub-classing it for specific purposes.\n *\n *  @_section: api/providers/abstract-provider: Subclassing Provider  [abstract-provider]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AbstractProvider = exports.UnmanagedSubscriber = void 0;\n// @TODO\n// Event coalescence\n//   When we register an event with an async value (e.g. address is a Signer\n//   or ENS name), we need to add it immeidately for the Event API, but also\n//   need time to resolve the address. Upon resolving the address, we need to\n//   migrate the listener to the static event. We also need to maintain a map\n//   of Signer/ENS name to address so we can sync respond to listenerCount.\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../constants/index.js\");\nconst index_js_3 = require(\"../contract/index.js\");\nconst index_js_4 = require(\"../hash/index.js\");\nconst index_js_5 = require(\"../transaction/index.js\");\nconst index_js_6 = require(\"../utils/index.js\");\nconst ens_resolver_js_1 = require(\"./ens-resolver.js\");\nconst format_js_1 = require(\"./format.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_js_1 = require(\"./provider.js\");\nconst subscriber_polling_js_1 = require(\"./subscriber-polling.js\");\n// Constants\nconst BN_2 = BigInt(2);\nconst MAX_CCIP_REDIRECTS = 10;\nfunction isPromise(value) {\n    return (value && typeof (value.then) === \"function\");\n}\nfunction getTag(prefix, value) {\n    return prefix + \":\" + JSON.stringify(value, (k, v) => {\n        if (v == null) {\n            return \"null\";\n        }\n        if (typeof (v) === \"bigint\") {\n            return `bigint:${v.toString()}`;\n        }\n        if (typeof (v) === \"string\") {\n            return v.toLowerCase();\n        }\n        // Sort object keys\n        if (typeof (v) === \"object\" && !Array.isArray(v)) {\n            const keys = Object.keys(v);\n            keys.sort();\n            return keys.reduce((accum, key) => {\n                accum[key] = v[key];\n                return accum;\n            }, {});\n        }\n        return v;\n    });\n}\n/**\n *  An **UnmanagedSubscriber** is useful for events which do not require\n *  any additional management, such as ``\"debug\"`` which only requires\n *  emit in synchronous event loop triggered calls.\n */\nclass UnmanagedSubscriber {\n    /**\n     *  The name fof the event.\n     */\n    name;\n    /**\n     *  Create a new UnmanagedSubscriber with %%name%%.\n     */\n    constructor(name) { (0, index_js_6.defineProperties)(this, { name }); }\n    start() { }\n    stop() { }\n    pause(dropWhilePaused) { }\n    resume() { }\n}\nexports.UnmanagedSubscriber = UnmanagedSubscriber;\nfunction copy(value) {\n    return JSON.parse(JSON.stringify(value));\n}\nfunction concisify(items) {\n    items = Array.from((new Set(items)).values());\n    items.sort();\n    return items;\n}\nasync function getSubscription(_event, provider) {\n    if (_event == null) {\n        throw new Error(\"invalid event\");\n    }\n    // Normalize topic array info an EventFilter\n    if (Array.isArray(_event)) {\n        _event = { topics: _event };\n    }\n    if (typeof (_event) === \"string\") {\n        switch (_event) {\n            case \"block\":\n            case \"debug\":\n            case \"error\":\n            case \"finalized\":\n            case \"network\":\n            case \"pending\":\n            case \"safe\": {\n                return { type: _event, tag: _event };\n            }\n        }\n    }\n    if ((0, index_js_6.isHexString)(_event, 32)) {\n        const hash = _event.toLowerCase();\n        return { type: \"transaction\", tag: getTag(\"tx\", { hash }), hash };\n    }\n    if (_event.orphan) {\n        const event = _event;\n        // @TODO: Should lowercase and whatnot things here instead of copy...\n        return { type: \"orphan\", tag: getTag(\"orphan\", event), filter: copy(event) };\n    }\n    if ((_event.address || _event.topics)) {\n        const event = _event;\n        const filter = {\n            topics: ((event.topics || []).map((t) => {\n                if (t == null) {\n                    return null;\n                }\n                if (Array.isArray(t)) {\n                    return concisify(t.map((t) => t.toLowerCase()));\n                }\n                return t.toLowerCase();\n            }))\n        };\n        if (event.address) {\n            const addresses = [];\n            const promises = [];\n            const addAddress = (addr) => {\n                if ((0, index_js_6.isHexString)(addr)) {\n                    addresses.push(addr);\n                }\n                else {\n                    promises.push((async () => {\n                        addresses.push(await (0, index_js_1.resolveAddress)(addr, provider));\n                    })());\n                }\n            };\n            if (Array.isArray(event.address)) {\n                event.address.forEach(addAddress);\n            }\n            else {\n                addAddress(event.address);\n            }\n            if (promises.length) {\n                await Promise.all(promises);\n            }\n            filter.address = concisify(addresses.map((a) => a.toLowerCase()));\n        }\n        return { filter, tag: getTag(\"event\", filter), type: \"event\" };\n    }\n    (0, index_js_6.assertArgument)(false, \"unknown ProviderEvent\", \"event\", _event);\n}\nfunction getTime() { return (new Date()).getTime(); }\nconst defaultOptions = {\n    cacheTimeout: 250,\n    pollingInterval: 4000\n};\n/**\n *  An **AbstractProvider** provides a base class for other sub-classes to\n *  implement the [[Provider]] API by normalizing input arguments and\n *  formatting output results as well as tracking events for consistent\n *  behaviour on an eventually-consistent network.\n */\nclass AbstractProvider {\n    #subs;\n    #plugins;\n    // null=unpaused, true=paused+dropWhilePaused, false=paused\n    #pausedState;\n    #destroyed;\n    #networkPromise;\n    #anyNetwork;\n    #performCache;\n    // The most recent block number if running an event or -1 if no \"block\" event\n    #lastBlockNumber;\n    #nextTimer;\n    #timers;\n    #disableCcipRead;\n    #options;\n    /**\n     *  Create a new **AbstractProvider** connected to %%network%%, or\n     *  use the various network detection capabilities to discover the\n     *  [[Network]] if necessary.\n     */\n    constructor(_network, options) {\n        this.#options = Object.assign({}, defaultOptions, options || {});\n        if (_network === \"any\") {\n            this.#anyNetwork = true;\n            this.#networkPromise = null;\n        }\n        else if (_network) {\n            const network = network_js_1.Network.from(_network);\n            this.#anyNetwork = false;\n            this.#networkPromise = Promise.resolve(network);\n            setTimeout(() => { this.emit(\"network\", network, null); }, 0);\n        }\n        else {\n            this.#anyNetwork = false;\n            this.#networkPromise = null;\n        }\n        this.#lastBlockNumber = -1;\n        this.#performCache = new Map();\n        this.#subs = new Map();\n        this.#plugins = new Map();\n        this.#pausedState = null;\n        this.#destroyed = false;\n        this.#nextTimer = 1;\n        this.#timers = new Map();\n        this.#disableCcipRead = false;\n    }\n    get pollingInterval() { return this.#options.pollingInterval; }\n    /**\n     *  Returns ``this``, to allow an **AbstractProvider** to implement\n     *  the [[ContractRunner]] interface.\n     */\n    get provider() { return this; }\n    /**\n     *  Returns all the registered plug-ins.\n     */\n    get plugins() {\n        return Array.from(this.#plugins.values());\n    }\n    /**\n     *  Attach a new plug-in.\n     */\n    attachPlugin(plugin) {\n        if (this.#plugins.get(plugin.name)) {\n            throw new Error(`cannot replace existing plugin: ${plugin.name} `);\n        }\n        this.#plugins.set(plugin.name, plugin.connect(this));\n        return this;\n    }\n    /**\n     *  Get a plugin by name.\n     */\n    getPlugin(name) {\n        return (this.#plugins.get(name)) || null;\n    }\n    /**\n     *  Prevent any CCIP-read operation, regardless of whether requested\n     *  in a [[call]] using ``enableCcipRead``.\n     */\n    get disableCcipRead() { return this.#disableCcipRead; }\n    set disableCcipRead(value) { this.#disableCcipRead = !!value; }\n    // Shares multiple identical requests made during the same 250ms\n    async #perform(req) {\n        const timeout = this.#options.cacheTimeout;\n        // Caching disabled\n        if (timeout < 0) {\n            return await this._perform(req);\n        }\n        // Create a tag\n        const tag = getTag(req.method, req);\n        let perform = this.#performCache.get(tag);\n        if (!perform) {\n            perform = this._perform(req);\n            this.#performCache.set(tag, perform);\n            setTimeout(() => {\n                if (this.#performCache.get(tag) === perform) {\n                    this.#performCache.delete(tag);\n                }\n            }, timeout);\n        }\n        return await perform;\n    }\n    /**\n     *  Resolves to the data for executing the CCIP-read operations.\n     */\n    async ccipReadFetch(tx, calldata, urls) {\n        if (this.disableCcipRead || urls.length === 0 || tx.to == null) {\n            return null;\n        }\n        const sender = tx.to.toLowerCase();\n        const data = calldata.toLowerCase();\n        const errorMessages = [];\n        for (let i = 0; i < urls.length; i++) {\n            const url = urls[i];\n            // URL expansion\n            const href = url.replace(\"{sender}\", sender).replace(\"{data}\", data);\n            // If no {data} is present, use POST; otherwise GET\n            //const json: string | null = (url.indexOf(\"{data}\") >= 0) ? null: JSON.stringify({ data, sender });\n            //const result = await fetchJson({ url: href, errorPassThrough: true }, json, (value, response) => {\n            //    value.status = response.statusCode;\n            //    return value;\n            //});\n            const request = new index_js_6.FetchRequest(href);\n            if (url.indexOf(\"{data}\") === -1) {\n                request.body = { data, sender };\n            }\n            this.emit(\"debug\", { action: \"sendCcipReadFetchRequest\", request, index: i, urls });\n            let errorMessage = \"unknown error\";\n            const resp = await request.send();\n            try {\n                const result = resp.bodyJson;\n                if (result.data) {\n                    this.emit(\"debug\", { action: \"receiveCcipReadFetchResult\", request, result });\n                    return result.data;\n                }\n                if (result.message) {\n                    errorMessage = result.message;\n                }\n                this.emit(\"debug\", { action: \"receiveCcipReadFetchError\", request, result });\n            }\n            catch (error) { }\n            // 4xx indicates the result is not present; stop\n            (0, index_js_6.assert)(resp.statusCode < 400 || resp.statusCode >= 500, `response not found during CCIP fetch: ${errorMessage}`, \"OFFCHAIN_FAULT\", { reason: \"404_MISSING_RESOURCE\", transaction: tx, info: { url, errorMessage } });\n            // 5xx indicates server issue; try the next url\n            errorMessages.push(errorMessage);\n        }\n        (0, index_js_6.assert)(false, `error encountered during CCIP fetch: ${errorMessages.map((m) => JSON.stringify(m)).join(\", \")}`, \"OFFCHAIN_FAULT\", {\n            reason: \"500_SERVER_ERROR\",\n            transaction: tx, info: { urls, errorMessages }\n        });\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a block before\n     *  returning it, to add additional properties or an alternate\n     *  sub-class of [[Block]].\n     */\n    _wrapBlock(value, network) {\n        return new provider_js_1.Block((0, format_js_1.formatBlock)(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a log before\n     *  returning it, to add additional properties or an alternate\n     *  sub-class of [[Log]].\n     */\n    _wrapLog(value, network) {\n        return new provider_js_1.Log((0, format_js_1.formatLog)(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a transaction\n     *  receipt before returning it, to add additional properties or an\n     *  alternate sub-class of [[TransactionReceipt]].\n     */\n    _wrapTransactionReceipt(value, network) {\n        return new provider_js_1.TransactionReceipt((0, format_js_1.formatTransactionReceipt)(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a transaction\n     *  response before returning it, to add additional properties or an\n     *  alternate sub-class of [[TransactionResponse]].\n     */\n    _wrapTransactionResponse(tx, network) {\n        return new provider_js_1.TransactionResponse((0, format_js_1.formatTransactionResponse)(tx), this);\n    }\n    /**\n     *  Resolves to the Network, forcing a network detection using whatever\n     *  technique the sub-class requires.\n     *\n     *  Sub-classes **must** override this.\n     */\n    _detectNetwork() {\n        (0, index_js_6.assert)(false, \"sub-classes must implement this\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"_detectNetwork\"\n        });\n    }\n    /**\n     *  Sub-classes should use this to perform all built-in operations. All\n     *  methods sanitizes and normalizes the values passed into this.\n     *\n     *  Sub-classes **must** override this.\n     */\n    async _perform(req) {\n        (0, index_js_6.assert)(false, `unsupported method: ${req.method}`, \"UNSUPPORTED_OPERATION\", {\n            operation: req.method,\n            info: req\n        });\n    }\n    // State\n    async getBlockNumber() {\n        const blockNumber = (0, index_js_6.getNumber)(await this.#perform({ method: \"getBlockNumber\" }), \"%response\");\n        if (this.#lastBlockNumber >= 0) {\n            this.#lastBlockNumber = blockNumber;\n        }\n        return blockNumber;\n    }\n    /**\n     *  Returns or resolves to the address for %%address%%, resolving ENS\n     *  names and [[Addressable]] objects and returning if already an\n     *  address.\n     */\n    _getAddress(address) {\n        return (0, index_js_1.resolveAddress)(address, this);\n    }\n    /**\n     *  Returns or resolves to a valid block tag for %%blockTag%%, resolving\n     *  negative values and returning if already a valid block tag.\n     */\n    _getBlockTag(blockTag) {\n        if (blockTag == null) {\n            return \"latest\";\n        }\n        switch (blockTag) {\n            case \"earliest\":\n                return \"0x0\";\n            case \"finalized\":\n            case \"latest\":\n            case \"pending\":\n            case \"safe\":\n                return blockTag;\n        }\n        if ((0, index_js_6.isHexString)(blockTag)) {\n            if ((0, index_js_6.isHexString)(blockTag, 32)) {\n                return blockTag;\n            }\n            return (0, index_js_6.toQuantity)(blockTag);\n        }\n        if (typeof (blockTag) === \"bigint\") {\n            blockTag = (0, index_js_6.getNumber)(blockTag, \"blockTag\");\n        }\n        if (typeof (blockTag) === \"number\") {\n            if (blockTag >= 0) {\n                return (0, index_js_6.toQuantity)(blockTag);\n            }\n            if (this.#lastBlockNumber >= 0) {\n                return (0, index_js_6.toQuantity)(this.#lastBlockNumber + blockTag);\n            }\n            return this.getBlockNumber().then((b) => (0, index_js_6.toQuantity)(b + blockTag));\n        }\n        (0, index_js_6.assertArgument)(false, \"invalid blockTag\", \"blockTag\", blockTag);\n    }\n    /**\n     *  Returns or resolves to a filter for %%filter%%, resolving any ENS\n     *  names or [[Addressable]] object and returning if already a valid\n     *  filter.\n     */\n    _getFilter(filter) {\n        // Create a canonical representation of the topics\n        const topics = (filter.topics || []).map((t) => {\n            if (t == null) {\n                return null;\n            }\n            if (Array.isArray(t)) {\n                return concisify(t.map((t) => t.toLowerCase()));\n            }\n            return t.toLowerCase();\n        });\n        const blockHash = (\"blockHash\" in filter) ? filter.blockHash : undefined;\n        const resolve = (_address, fromBlock, toBlock) => {\n            let address = undefined;\n            switch (_address.length) {\n                case 0: break;\n                case 1:\n                    address = _address[0];\n                    break;\n                default:\n                    _address.sort();\n                    address = _address;\n            }\n            if (blockHash) {\n                if (fromBlock != null || toBlock != null) {\n                    throw new Error(\"invalid filter\");\n                }\n            }\n            const filter = {};\n            if (address) {\n                filter.address = address;\n            }\n            if (topics.length) {\n                filter.topics = topics;\n            }\n            if (fromBlock) {\n                filter.fromBlock = fromBlock;\n            }\n            if (toBlock) {\n                filter.toBlock = toBlock;\n            }\n            if (blockHash) {\n                filter.blockHash = blockHash;\n            }\n            return filter;\n        };\n        // Addresses could be async (ENS names or Addressables)\n        let address = [];\n        if (filter.address) {\n            if (Array.isArray(filter.address)) {\n                for (const addr of filter.address) {\n                    address.push(this._getAddress(addr));\n                }\n            }\n            else {\n                address.push(this._getAddress(filter.address));\n            }\n        }\n        let fromBlock = undefined;\n        if (\"fromBlock\" in filter) {\n            fromBlock = this._getBlockTag(filter.fromBlock);\n        }\n        let toBlock = undefined;\n        if (\"toBlock\" in filter) {\n            toBlock = this._getBlockTag(filter.toBlock);\n        }\n        if (address.filter((a) => (typeof (a) !== \"string\")).length ||\n            (fromBlock != null && typeof (fromBlock) !== \"string\") ||\n            (toBlock != null && typeof (toBlock) !== \"string\")) {\n            return Promise.all([Promise.all(address), fromBlock, toBlock]).then((result) => {\n                return resolve(result[0], result[1], result[2]);\n            });\n        }\n        return resolve(address, fromBlock, toBlock);\n    }\n    /**\n     *  Returns or resolves to a transaction for %%request%%, resolving\n     *  any ENS names or [[Addressable]] and returning if already a valid\n     *  transaction.\n     */\n    _getTransactionRequest(_request) {\n        const request = (0, provider_js_1.copyRequest)(_request);\n        const promises = [];\n        [\"to\", \"from\"].forEach((key) => {\n            if (request[key] == null) {\n                return;\n            }\n            const addr = (0, index_js_1.resolveAddress)(request[key], this);\n            if (isPromise(addr)) {\n                promises.push((async function () { request[key] = await addr; })());\n            }\n            else {\n                request[key] = addr;\n            }\n        });\n        if (request.blockTag != null) {\n            const blockTag = this._getBlockTag(request.blockTag);\n            if (isPromise(blockTag)) {\n                promises.push((async function () { request.blockTag = await blockTag; })());\n            }\n            else {\n                request.blockTag = blockTag;\n            }\n        }\n        if (promises.length) {\n            return (async function () {\n                await Promise.all(promises);\n                return request;\n            })();\n        }\n        return request;\n    }\n    async getNetwork() {\n        // No explicit network was set and this is our first time\n        if (this.#networkPromise == null) {\n            // Detect the current network (shared with all calls)\n            const detectNetwork = (async () => {\n                try {\n                    const network = await this._detectNetwork();\n                    this.emit(\"network\", network, null);\n                    return network;\n                }\n                catch (error) {\n                    if (this.#networkPromise === detectNetwork) {\n                        this.#networkPromise = null;\n                    }\n                    throw error;\n                }\n            })();\n            this.#networkPromise = detectNetwork;\n            return (await detectNetwork).clone();\n        }\n        const networkPromise = this.#networkPromise;\n        const [expected, actual] = await Promise.all([\n            networkPromise,\n            this._detectNetwork() // The actual connected network\n        ]);\n        if (expected.chainId !== actual.chainId) {\n            if (this.#anyNetwork) {\n                // The \"any\" network can change, so notify listeners\n                this.emit(\"network\", actual, expected);\n                // Update the network if something else hasn't already changed it\n                if (this.#networkPromise === networkPromise) {\n                    this.#networkPromise = Promise.resolve(actual);\n                }\n            }\n            else {\n                // Otherwise, we do not allow changes to the underlying network\n                (0, index_js_6.assert)(false, `network changed: ${expected.chainId} => ${actual.chainId} `, \"NETWORK_ERROR\", {\n                    event: \"changed\"\n                });\n            }\n        }\n        return expected.clone();\n    }\n    async getFeeData() {\n        const network = await this.getNetwork();\n        const getFeeDataFunc = async () => {\n            const { _block, gasPrice, priorityFee } = await (0, index_js_6.resolveProperties)({\n                _block: this.#getBlock(\"latest\", false),\n                gasPrice: ((async () => {\n                    try {\n                        const value = await this.#perform({ method: \"getGasPrice\" });\n                        return (0, index_js_6.getBigInt)(value, \"%response\");\n                    }\n                    catch (error) { }\n                    return null;\n                })()),\n                priorityFee: ((async () => {\n                    try {\n                        const value = await this.#perform({ method: \"getPriorityFee\" });\n                        return (0, index_js_6.getBigInt)(value, \"%response\");\n                    }\n                    catch (error) { }\n                    return null;\n                })())\n            });\n            let maxFeePerGas = null;\n            let maxPriorityFeePerGas = null;\n            // These are the recommended EIP-1559 heuristics for fee data\n            const block = this._wrapBlock(_block, network);\n            if (block && block.baseFeePerGas) {\n                maxPriorityFeePerGas = (priorityFee != null) ? priorityFee : BigInt(\"1000000000\");\n                maxFeePerGas = (block.baseFeePerGas * BN_2) + maxPriorityFeePerGas;\n            }\n            return new provider_js_1.FeeData(gasPrice, maxFeePerGas, maxPriorityFeePerGas);\n        };\n        // Check for a FeeDataNetWorkPlugin\n        const plugin = network.getPlugin(\"org.ethers.plugins.network.FetchUrlFeeDataPlugin\");\n        if (plugin) {\n            const req = new index_js_6.FetchRequest(plugin.url);\n            const feeData = await plugin.processFunc(getFeeDataFunc, this, req);\n            return new provider_js_1.FeeData(feeData.gasPrice, feeData.maxFeePerGas, feeData.maxPriorityFeePerGas);\n        }\n        return await getFeeDataFunc();\n    }\n    async estimateGas(_tx) {\n        let tx = this._getTransactionRequest(_tx);\n        if (isPromise(tx)) {\n            tx = await tx;\n        }\n        return (0, index_js_6.getBigInt)(await this.#perform({\n            method: \"estimateGas\", transaction: tx\n        }), \"%response\");\n    }\n    async #call(tx, blockTag, attempt) {\n        (0, index_js_6.assert)(attempt < MAX_CCIP_REDIRECTS, \"CCIP read exceeded maximum redirections\", \"OFFCHAIN_FAULT\", {\n            reason: \"TOO_MANY_REDIRECTS\",\n            transaction: Object.assign({}, tx, { blockTag, enableCcipRead: true })\n        });\n        // This came in as a PerformActionTransaction, so to/from are safe; we can cast\n        const transaction = (0, provider_js_1.copyRequest)(tx);\n        try {\n            return (0, index_js_6.hexlify)(await this._perform({ method: \"call\", transaction, blockTag }));\n        }\n        catch (error) {\n            // CCIP Read OffchainLookup\n            if (!this.disableCcipRead && (0, index_js_6.isCallException)(error) && error.data && attempt >= 0 && blockTag === \"latest\" && transaction.to != null && (0, index_js_6.dataSlice)(error.data, 0, 4) === \"0x556f1830\") {\n                const data = error.data;\n                const txSender = await (0, index_js_1.resolveAddress)(transaction.to, this);\n                // Parse the CCIP Read Arguments\n                let ccipArgs;\n                try {\n                    ccipArgs = parseOffchainLookup((0, index_js_6.dataSlice)(error.data, 4));\n                }\n                catch (error) {\n                    (0, index_js_6.assert)(false, error.message, \"OFFCHAIN_FAULT\", {\n                        reason: \"BAD_DATA\", transaction, info: { data }\n                    });\n                }\n                // Check the sender of the OffchainLookup matches the transaction\n                (0, index_js_6.assert)(ccipArgs.sender.toLowerCase() === txSender.toLowerCase(), \"CCIP Read sender mismatch\", \"CALL_EXCEPTION\", {\n                    action: \"call\",\n                    data,\n                    reason: \"OffchainLookup\",\n                    transaction: transaction,\n                    invocation: null,\n                    revert: {\n                        signature: \"OffchainLookup(address,string[],bytes,bytes4,bytes)\",\n                        name: \"OffchainLookup\",\n                        args: ccipArgs.errorArgs\n                    }\n                });\n                const ccipResult = await this.ccipReadFetch(transaction, ccipArgs.calldata, ccipArgs.urls);\n                (0, index_js_6.assert)(ccipResult != null, \"CCIP Read failed to fetch data\", \"OFFCHAIN_FAULT\", {\n                    reason: \"FETCH_FAILED\", transaction, info: { data: error.data, errorArgs: ccipArgs.errorArgs }\n                });\n                const tx = {\n                    to: txSender,\n                    data: (0, index_js_6.concat)([ccipArgs.selector, encodeBytes([ccipResult, ccipArgs.extraData])])\n                };\n                this.emit(\"debug\", { action: \"sendCcipReadCall\", transaction: tx });\n                try {\n                    const result = await this.#call(tx, blockTag, attempt + 1);\n                    this.emit(\"debug\", { action: \"receiveCcipReadCallResult\", transaction: Object.assign({}, tx), result });\n                    return result;\n                }\n                catch (error) {\n                    this.emit(\"debug\", { action: \"receiveCcipReadCallError\", transaction: Object.assign({}, tx), error });\n                    throw error;\n                }\n            }\n            throw error;\n        }\n    }\n    async #checkNetwork(promise) {\n        const { value } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            value: promise\n        });\n        return value;\n    }\n    async call(_tx) {\n        const { tx, blockTag } = await (0, index_js_6.resolveProperties)({\n            tx: this._getTransactionRequest(_tx),\n            blockTag: this._getBlockTag(_tx.blockTag)\n        });\n        return await this.#checkNetwork(this.#call(tx, blockTag, _tx.enableCcipRead ? 0 : -1));\n    }\n    // Account\n    async #getAccountValue(request, _address, _blockTag) {\n        let address = this._getAddress(_address);\n        let blockTag = this._getBlockTag(_blockTag);\n        if (typeof (address) !== \"string\" || typeof (blockTag) !== \"string\") {\n            [address, blockTag] = await Promise.all([address, blockTag]);\n        }\n        return await this.#checkNetwork(this.#perform(Object.assign(request, { address, blockTag })));\n    }\n    async getBalance(address, blockTag) {\n        return (0, index_js_6.getBigInt)(await this.#getAccountValue({ method: \"getBalance\" }, address, blockTag), \"%response\");\n    }\n    async getTransactionCount(address, blockTag) {\n        return (0, index_js_6.getNumber)(await this.#getAccountValue({ method: \"getTransactionCount\" }, address, blockTag), \"%response\");\n    }\n    async getCode(address, blockTag) {\n        return (0, index_js_6.hexlify)(await this.#getAccountValue({ method: \"getCode\" }, address, blockTag));\n    }\n    async getStorage(address, _position, blockTag) {\n        const position = (0, index_js_6.getBigInt)(_position, \"position\");\n        return (0, index_js_6.hexlify)(await this.#getAccountValue({ method: \"getStorage\", position }, address, blockTag));\n    }\n    // Write\n    async broadcastTransaction(signedTx) {\n        const { blockNumber, hash, network } = await (0, index_js_6.resolveProperties)({\n            blockNumber: this.getBlockNumber(),\n            hash: this._perform({\n                method: \"broadcastTransaction\",\n                signedTransaction: signedTx\n            }),\n            network: this.getNetwork()\n        });\n        const tx = index_js_5.Transaction.from(signedTx);\n        if (tx.hash !== hash) {\n            throw new Error(\"@TODO: the returned hash did not match\");\n        }\n        return this._wrapTransactionResponse(tx, network).replaceableTransaction(blockNumber);\n    }\n    async #getBlock(block, includeTransactions) {\n        // @TODO: Add CustomBlockPlugin check\n        if ((0, index_js_6.isHexString)(block, 32)) {\n            return await this.#perform({\n                method: \"getBlock\", blockHash: block, includeTransactions\n            });\n        }\n        let blockTag = this._getBlockTag(block);\n        if (typeof (blockTag) !== \"string\") {\n            blockTag = await blockTag;\n        }\n        return await this.#perform({\n            method: \"getBlock\", blockTag, includeTransactions\n        });\n    }\n    // Queries\n    async getBlock(block, prefetchTxs) {\n        const { network, params } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            params: this.#getBlock(block, !!prefetchTxs)\n        });\n        if (params == null) {\n            return null;\n        }\n        return this._wrapBlock(params, network);\n    }\n    async getTransaction(hash) {\n        const { network, params } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getTransaction\", hash })\n        });\n        if (params == null) {\n            return null;\n        }\n        return this._wrapTransactionResponse(params, network);\n    }\n    async getTransactionReceipt(hash) {\n        const { network, params } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getTransactionReceipt\", hash })\n        });\n        if (params == null) {\n            return null;\n        }\n        // Some backends did not backfill the effectiveGasPrice into old transactions\n        // in the receipt, so we look it up manually and inject it.\n        if (params.gasPrice == null && params.effectiveGasPrice == null) {\n            const tx = await this.#perform({ method: \"getTransaction\", hash });\n            if (tx == null) {\n                throw new Error(\"report this; could not find tx or effectiveGasPrice\");\n            }\n            params.effectiveGasPrice = tx.gasPrice;\n        }\n        return this._wrapTransactionReceipt(params, network);\n    }\n    async getTransactionResult(hash) {\n        const { result } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            result: this.#perform({ method: \"getTransactionResult\", hash })\n        });\n        if (result == null) {\n            return null;\n        }\n        return (0, index_js_6.hexlify)(result);\n    }\n    // Bloom-filter Queries\n    async getLogs(_filter) {\n        let filter = this._getFilter(_filter);\n        if (isPromise(filter)) {\n            filter = await filter;\n        }\n        const { network, params } = await (0, index_js_6.resolveProperties)({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getLogs\", filter })\n        });\n        return params.map((p) => this._wrapLog(p, network));\n    }\n    // ENS\n    _getProvider(chainId) {\n        (0, index_js_6.assert)(false, \"provider cannot connect to target network\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"_getProvider()\"\n        });\n    }\n    async getResolver(name) {\n        return await ens_resolver_js_1.EnsResolver.fromName(this, name);\n    }\n    async getAvatar(name) {\n        const resolver = await this.getResolver(name);\n        if (resolver) {\n            return await resolver.getAvatar();\n        }\n        return null;\n    }\n    async resolveName(name) {\n        const resolver = await this.getResolver(name);\n        if (resolver) {\n            return await resolver.getAddress();\n        }\n        return null;\n    }\n    async lookupAddress(address) {\n        address = (0, index_js_1.getAddress)(address);\n        const node = (0, index_js_4.namehash)(address.substring(2).toLowerCase() + \".addr.reverse\");\n        try {\n            const ensAddr = await ens_resolver_js_1.EnsResolver.getEnsAddress(this);\n            const ensContract = new index_js_3.Contract(ensAddr, [\n                \"function resolver(bytes32) view returns (address)\"\n            ], this);\n            const resolver = await ensContract.resolver(node);\n            if (resolver == null || resolver === index_js_2.ZeroAddress) {\n                return null;\n            }\n            const resolverContract = new index_js_3.Contract(resolver, [\n                \"function name(bytes32) view returns (string)\"\n            ], this);\n            const name = await resolverContract.name(node);\n            // Failed forward resolution\n            const check = await this.resolveName(name);\n            if (check !== address) {\n                return null;\n            }\n            return name;\n        }\n        catch (error) {\n            // No data was returned from the resolver\n            if ((0, index_js_6.isError)(error, \"BAD_DATA\") && error.value === \"0x\") {\n                return null;\n            }\n            // Something reerted\n            if ((0, index_js_6.isError)(error, \"CALL_EXCEPTION\")) {\n                return null;\n            }\n            throw error;\n        }\n        return null;\n    }\n    async waitForTransaction(hash, _confirms, timeout) {\n        const confirms = (_confirms != null) ? _confirms : 1;\n        if (confirms === 0) {\n            return this.getTransactionReceipt(hash);\n        }\n        return new Promise(async (resolve, reject) => {\n            let timer = null;\n            const listener = (async (blockNumber) => {\n                try {\n                    const receipt = await this.getTransactionReceipt(hash);\n                    if (receipt != null) {\n                        if (blockNumber - receipt.blockNumber + 1 >= confirms) {\n                            resolve(receipt);\n                            //this.off(\"block\", listener);\n                            if (timer) {\n                                clearTimeout(timer);\n                                timer = null;\n                            }\n                            return;\n                        }\n                    }\n                }\n                catch (error) {\n                    console.log(\"EEE\", error);\n                }\n                this.once(\"block\", listener);\n            });\n            if (timeout != null) {\n                timer = setTimeout(() => {\n                    if (timer == null) {\n                        return;\n                    }\n                    timer = null;\n                    this.off(\"block\", listener);\n                    reject((0, index_js_6.makeError)(\"timeout\", \"TIMEOUT\", { reason: \"timeout\" }));\n                }, timeout);\n            }\n            listener(await this.getBlockNumber());\n        });\n    }\n    async waitForBlock(blockTag) {\n        (0, index_js_6.assert)(false, \"not implemented yet\", \"NOT_IMPLEMENTED\", {\n            operation: \"waitForBlock\"\n        });\n    }\n    /**\n     *  Clear a timer created using the [[_setTimeout]] method.\n     */\n    _clearTimeout(timerId) {\n        const timer = this.#timers.get(timerId);\n        if (!timer) {\n            return;\n        }\n        if (timer.timer) {\n            clearTimeout(timer.timer);\n        }\n        this.#timers.delete(timerId);\n    }\n    /**\n     *  Create a timer that will execute %%func%% after at least %%timeout%%\n     *  (in ms). If %%timeout%% is unspecified, then %%func%% will execute\n     *  in the next event loop.\n     *\n     *  [Pausing](AbstractProvider-paused) the provider will pause any\n     *  associated timers.\n     */\n    _setTimeout(_func, timeout) {\n        if (timeout == null) {\n            timeout = 0;\n        }\n        const timerId = this.#nextTimer++;\n        const func = () => {\n            this.#timers.delete(timerId);\n            _func();\n        };\n        if (this.paused) {\n            this.#timers.set(timerId, { timer: null, func, time: timeout });\n        }\n        else {\n            const timer = setTimeout(func, timeout);\n            this.#timers.set(timerId, { timer, func, time: getTime() });\n        }\n        return timerId;\n    }\n    /**\n     *  Perform %%func%% on each subscriber.\n     */\n    _forEachSubscriber(func) {\n        for (const sub of this.#subs.values()) {\n            func(sub.subscriber);\n        }\n    }\n    /**\n     *  Sub-classes may override this to customize subscription\n     *  implementations.\n     */\n    _getSubscriber(sub) {\n        switch (sub.type) {\n            case \"debug\":\n            case \"error\":\n            case \"network\":\n                return new UnmanagedSubscriber(sub.type);\n            case \"block\": {\n                const subscriber = new subscriber_polling_js_1.PollingBlockSubscriber(this);\n                subscriber.pollingInterval = this.pollingInterval;\n                return subscriber;\n            }\n            case \"safe\":\n            case \"finalized\":\n                return new subscriber_polling_js_1.PollingBlockTagSubscriber(this, sub.type);\n            case \"event\":\n                return new subscriber_polling_js_1.PollingEventSubscriber(this, sub.filter);\n            case \"transaction\":\n                return new subscriber_polling_js_1.PollingTransactionSubscriber(this, sub.hash);\n            case \"orphan\":\n                return new subscriber_polling_js_1.PollingOrphanSubscriber(this, sub.filter);\n        }\n        throw new Error(`unsupported event: ${sub.type}`);\n    }\n    /**\n     *  If a [[Subscriber]] fails and needs to replace itself, this\n     *  method may be used.\n     *\n     *  For example, this is used for providers when using the\n     *  ``eth_getFilterChanges`` method, which can return null if state\n     *  filters are not supported by the backend, allowing the Subscriber\n     *  to swap in a [[PollingEventSubscriber]].\n     */\n    _recoverSubscriber(oldSub, newSub) {\n        for (const sub of this.#subs.values()) {\n            if (sub.subscriber === oldSub) {\n                if (sub.started) {\n                    sub.subscriber.stop();\n                }\n                sub.subscriber = newSub;\n                if (sub.started) {\n                    newSub.start();\n                }\n                if (this.#pausedState != null) {\n                    newSub.pause(this.#pausedState);\n                }\n                break;\n            }\n        }\n    }\n    async #hasSub(event, emitArgs) {\n        let sub = await getSubscription(event, this);\n        // This is a log that is removing an existing log; we actually want\n        // to emit an orphan event for the removed log\n        if (sub.type === \"event\" && emitArgs && emitArgs.length > 0 && emitArgs[0].removed === true) {\n            sub = await getSubscription({ orphan: \"drop-log\", log: emitArgs[0] }, this);\n        }\n        return this.#subs.get(sub.tag) || null;\n    }\n    async #getSub(event) {\n        const subscription = await getSubscription(event, this);\n        // Prevent tampering with our tag in any subclass' _getSubscriber\n        const tag = subscription.tag;\n        let sub = this.#subs.get(tag);\n        if (!sub) {\n            const subscriber = this._getSubscriber(subscription);\n            const addressableMap = new WeakMap();\n            const nameMap = new Map();\n            sub = { subscriber, tag, addressableMap, nameMap, started: false, listeners: [] };\n            this.#subs.set(tag, sub);\n        }\n        return sub;\n    }\n    async on(event, listener) {\n        const sub = await this.#getSub(event);\n        sub.listeners.push({ listener, once: false });\n        if (!sub.started) {\n            sub.subscriber.start();\n            sub.started = true;\n            if (this.#pausedState != null) {\n                sub.subscriber.pause(this.#pausedState);\n            }\n        }\n        return this;\n    }\n    async once(event, listener) {\n        const sub = await this.#getSub(event);\n        sub.listeners.push({ listener, once: true });\n        if (!sub.started) {\n            sub.subscriber.start();\n            sub.started = true;\n            if (this.#pausedState != null) {\n                sub.subscriber.pause(this.#pausedState);\n            }\n        }\n        return this;\n    }\n    async emit(event, ...args) {\n        const sub = await this.#hasSub(event, args);\n        // If there is not subscription or if a recent emit removed\n        // the last of them (which also deleted the sub) do nothing\n        if (!sub || sub.listeners.length === 0) {\n            return false;\n        }\n        ;\n        const count = sub.listeners.length;\n        sub.listeners = sub.listeners.filter(({ listener, once }) => {\n            const payload = new index_js_6.EventPayload(this, (once ? null : listener), event);\n            try {\n                listener.call(this, ...args, payload);\n            }\n            catch (error) { }\n            return !once;\n        });\n        if (sub.listeners.length === 0) {\n            if (sub.started) {\n                sub.subscriber.stop();\n            }\n            this.#subs.delete(sub.tag);\n        }\n        return (count > 0);\n    }\n    async listenerCount(event) {\n        if (event) {\n            const sub = await this.#hasSub(event);\n            if (!sub) {\n                return 0;\n            }\n            return sub.listeners.length;\n        }\n        let total = 0;\n        for (const { listeners } of this.#subs.values()) {\n            total += listeners.length;\n        }\n        return total;\n    }\n    async listeners(event) {\n        if (event) {\n            const sub = await this.#hasSub(event);\n            if (!sub) {\n                return [];\n            }\n            return sub.listeners.map(({ listener }) => listener);\n        }\n        let result = [];\n        for (const { listeners } of this.#subs.values()) {\n            result = result.concat(listeners.map(({ listener }) => listener));\n        }\n        return result;\n    }\n    async off(event, listener) {\n        const sub = await this.#hasSub(event);\n        if (!sub) {\n            return this;\n        }\n        if (listener) {\n            const index = sub.listeners.map(({ listener }) => listener).indexOf(listener);\n            if (index >= 0) {\n                sub.listeners.splice(index, 1);\n            }\n        }\n        if (!listener || sub.listeners.length === 0) {\n            if (sub.started) {\n                sub.subscriber.stop();\n            }\n            this.#subs.delete(sub.tag);\n        }\n        return this;\n    }\n    async removeAllListeners(event) {\n        if (event) {\n            const { tag, started, subscriber } = await this.#getSub(event);\n            if (started) {\n                subscriber.stop();\n            }\n            this.#subs.delete(tag);\n        }\n        else {\n            for (const [tag, { started, subscriber }] of this.#subs) {\n                if (started) {\n                    subscriber.stop();\n                }\n                this.#subs.delete(tag);\n            }\n        }\n        return this;\n    }\n    // Alias for \"on\"\n    async addListener(event, listener) {\n        return await this.on(event, listener);\n    }\n    // Alias for \"off\"\n    async removeListener(event, listener) {\n        return this.off(event, listener);\n    }\n    /**\n     *  If this provider has been destroyed using the [[destroy]] method.\n     *\n     *  Once destroyed, all resources are reclaimed, internal event loops\n     *  and timers are cleaned up and no further requests may be sent to\n     *  the provider.\n     */\n    get destroyed() {\n        return this.#destroyed;\n    }\n    /**\n     *  Sub-classes may use this to shutdown any sockets or release their\n     *  resources and reject any pending requests.\n     *\n     *  Sub-classes **must** call ``super.destroy()``.\n     */\n    destroy() {\n        // Stop all listeners\n        this.removeAllListeners();\n        // Shut down all tiemrs\n        for (const timerId of this.#timers.keys()) {\n            this._clearTimeout(timerId);\n        }\n        this.#destroyed = true;\n    }\n    /**\n     *  Whether the provider is currently paused.\n     *\n     *  A paused provider will not emit any events, and generally should\n     *  not make any requests to the network, but that is up to sub-classes\n     *  to manage.\n     *\n     *  Setting ``paused = true`` is identical to calling ``.pause(false)``,\n     *  which will buffer any events that occur while paused until the\n     *  provider is unpaused.\n     */\n    get paused() { return (this.#pausedState != null); }\n    set paused(pause) {\n        if (!!pause === this.paused) {\n            return;\n        }\n        if (this.paused) {\n            this.resume();\n        }\n        else {\n            this.pause(false);\n        }\n    }\n    /**\n     *  Pause the provider. If %%dropWhilePaused%%, any events that occur\n     *  while paused are dropped, otherwise all events will be emitted once\n     *  the provider is unpaused.\n     */\n    pause(dropWhilePaused) {\n        this.#lastBlockNumber = -1;\n        if (this.#pausedState != null) {\n            if (this.#pausedState == !!dropWhilePaused) {\n                return;\n            }\n            (0, index_js_6.assert)(false, \"cannot change pause type; resume first\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"pause\"\n            });\n        }\n        this._forEachSubscriber((s) => s.pause(dropWhilePaused));\n        this.#pausedState = !!dropWhilePaused;\n        for (const timer of this.#timers.values()) {\n            // Clear the timer\n            if (timer.timer) {\n                clearTimeout(timer.timer);\n            }\n            // Remaining time needed for when we become unpaused\n            timer.time = getTime() - timer.time;\n        }\n    }\n    /**\n     *  Resume the provider.\n     */\n    resume() {\n        if (this.#pausedState == null) {\n            return;\n        }\n        this._forEachSubscriber((s) => s.resume());\n        this.#pausedState = null;\n        for (const timer of this.#timers.values()) {\n            // Remaining time when we were paused\n            let timeout = timer.time;\n            if (timeout < 0) {\n                timeout = 0;\n            }\n            // Start time (in cause paused, so we con compute remaininf time)\n            timer.time = getTime();\n            // Start the timer\n            setTimeout(timer.func, timeout);\n        }\n    }\n}\nexports.AbstractProvider = AbstractProvider;\nfunction _parseString(result, start) {\n    try {\n        const bytes = _parseBytes(result, start);\n        if (bytes) {\n            return (0, index_js_6.toUtf8String)(bytes);\n        }\n    }\n    catch (error) { }\n    return null;\n}\nfunction _parseBytes(result, start) {\n    if (result === \"0x\") {\n        return null;\n    }\n    try {\n        const offset = (0, index_js_6.getNumber)((0, index_js_6.dataSlice)(result, start, start + 32));\n        const length = (0, index_js_6.getNumber)((0, index_js_6.dataSlice)(result, offset, offset + 32));\n        return (0, index_js_6.dataSlice)(result, offset + 32, offset + 32 + length);\n    }\n    catch (error) { }\n    return null;\n}\nfunction numPad(value) {\n    const result = (0, index_js_6.toBeArray)(value);\n    if (result.length > 32) {\n        throw new Error(\"internal; should not happen\");\n    }\n    const padded = new Uint8Array(32);\n    padded.set(result, 32 - result.length);\n    return padded;\n}\nfunction bytesPad(value) {\n    if ((value.length % 32) === 0) {\n        return value;\n    }\n    const result = new Uint8Array(Math.ceil(value.length / 32) * 32);\n    result.set(value);\n    return result;\n}\nconst empty = new Uint8Array([]);\n// ABI Encodes a series of (bytes, bytes, ...)\nfunction encodeBytes(datas) {\n    const result = [];\n    let byteCount = 0;\n    // Add place-holders for pointers as we add items\n    for (let i = 0; i < datas.length; i++) {\n        result.push(empty);\n        byteCount += 32;\n    }\n    for (let i = 0; i < datas.length; i++) {\n        const data = (0, index_js_6.getBytes)(datas[i]);\n        // Update the bytes offset\n        result[i] = numPad(byteCount);\n        // The length and padded value of data\n        result.push(numPad(data.length));\n        result.push(bytesPad(data));\n        byteCount += 32 + Math.ceil(data.length / 32) * 32;\n    }\n    return (0, index_js_6.concat)(result);\n}\nconst zeros = \"0x0000000000000000000000000000000000000000000000000000000000000000\";\nfunction parseOffchainLookup(data) {\n    const result = {\n        sender: \"\", urls: [], calldata: \"\", selector: \"\", extraData: \"\", errorArgs: []\n    };\n    (0, index_js_6.assert)((0, index_js_6.dataLength)(data) >= 5 * 32, \"insufficient OffchainLookup data\", \"OFFCHAIN_FAULT\", {\n        reason: \"insufficient OffchainLookup data\"\n    });\n    const sender = (0, index_js_6.dataSlice)(data, 0, 32);\n    (0, index_js_6.assert)((0, index_js_6.dataSlice)(sender, 0, 12) === (0, index_js_6.dataSlice)(zeros, 0, 12), \"corrupt OffchainLookup sender\", \"OFFCHAIN_FAULT\", {\n        reason: \"corrupt OffchainLookup sender\"\n    });\n    result.sender = (0, index_js_6.dataSlice)(sender, 12);\n    // Read the URLs from the response\n    try {\n        const urls = [];\n        const urlsOffset = (0, index_js_6.getNumber)((0, index_js_6.dataSlice)(data, 32, 64));\n        const urlsLength = (0, index_js_6.getNumber)((0, index_js_6.dataSlice)(data, urlsOffset, urlsOffset + 32));\n        const urlsData = (0, index_js_6.dataSlice)(data, urlsOffset + 32);\n        for (let u = 0; u < urlsLength; u++) {\n            const url = _parseString(urlsData, u * 32);\n            if (url == null) {\n                throw new Error(\"abort\");\n            }\n            urls.push(url);\n        }\n        result.urls = urls;\n    }\n    catch (error) {\n        (0, index_js_6.assert)(false, \"corrupt OffchainLookup urls\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup urls\"\n        });\n    }\n    // Get the CCIP calldata to forward\n    try {\n        const calldata = _parseBytes(data, 64);\n        if (calldata == null) {\n            throw new Error(\"abort\");\n        }\n        result.calldata = calldata;\n    }\n    catch (error) {\n        (0, index_js_6.assert)(false, \"corrupt OffchainLookup calldata\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup calldata\"\n        });\n    }\n    // Get the callbackSelector (bytes4)\n    (0, index_js_6.assert)((0, index_js_6.dataSlice)(data, 100, 128) === (0, index_js_6.dataSlice)(zeros, 0, 28), \"corrupt OffchainLookup callbaackSelector\", \"OFFCHAIN_FAULT\", {\n        reason: \"corrupt OffchainLookup callbaackSelector\"\n    });\n    result.selector = (0, index_js_6.dataSlice)(data, 96, 100);\n    // Get the extra data to send back to the contract as context\n    try {\n        const extraData = _parseBytes(data, 128);\n        if (extraData == null) {\n            throw new Error(\"abort\");\n        }\n        result.extraData = extraData;\n    }\n    catch (error) {\n        (0, index_js_6.assert)(false, \"corrupt OffchainLookup extraData\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup extraData\"\n        });\n    }\n    result.errorArgs = \"sender,urls,calldata,selector,extraData\".split(/,/).map((k) => result[k]);\n    return result;\n}\n//# sourceMappingURL=abstract-provider.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.VoidSigner = exports.AbstractSigner = void 0;\n/**\n *  Generally the [[Wallet]] and [[JsonRpcSigner]] and their sub-classes\n *  are sufficent for most developers, but this is provided to\n *  fascilitate more complex Signers.\n *\n *  @_section: api/providers/abstract-signer: Subclassing Signer [abstract-signer]\n */\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../transaction/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst provider_js_1 = require(\"./provider.js\");\nfunction checkProvider(signer, operation) {\n    if (signer.provider) {\n        return signer.provider;\n    }\n    (0, index_js_3.assert)(false, \"missing provider\", \"UNSUPPORTED_OPERATION\", { operation });\n}\nasync function populate(signer, tx) {\n    let pop = (0, provider_js_1.copyRequest)(tx);\n    if (pop.to != null) {\n        pop.to = (0, index_js_1.resolveAddress)(pop.to, signer);\n    }\n    if (pop.from != null) {\n        const from = pop.from;\n        pop.from = Promise.all([\n            signer.getAddress(),\n            (0, index_js_1.resolveAddress)(from, signer)\n        ]).then(([address, from]) => {\n            (0, index_js_3.assertArgument)(address.toLowerCase() === from.toLowerCase(), \"transaction from mismatch\", \"tx.from\", from);\n            return address;\n        });\n    }\n    else {\n        pop.from = signer.getAddress();\n    }\n    return await (0, index_js_3.resolveProperties)(pop);\n}\n/**\n *  An **AbstractSigner** includes most of teh functionality required\n *  to get a [[Signer]] working as expected, but requires a few\n *  Signer-specific methods be overridden.\n *\n */\nclass AbstractSigner {\n    /**\n     *  The provider this signer is connected to.\n     */\n    provider;\n    /**\n     *  Creates a new Signer connected to %%provider%%.\n     */\n    constructor(provider) {\n        (0, index_js_3.defineProperties)(this, { provider: (provider || null) });\n    }\n    async getNonce(blockTag) {\n        return checkProvider(this, \"getTransactionCount\").getTransactionCount(await this.getAddress(), blockTag);\n    }\n    async populateCall(tx) {\n        const pop = await populate(this, tx);\n        return pop;\n    }\n    async populateTransaction(tx) {\n        const provider = checkProvider(this, \"populateTransaction\");\n        const pop = await populate(this, tx);\n        if (pop.nonce == null) {\n            pop.nonce = await this.getNonce(\"pending\");\n        }\n        if (pop.gasLimit == null) {\n            pop.gasLimit = await this.estimateGas(pop);\n        }\n        // Populate the chain ID\n        const network = await (this.provider).getNetwork();\n        if (pop.chainId != null) {\n            const chainId = (0, index_js_3.getBigInt)(pop.chainId);\n            (0, index_js_3.assertArgument)(chainId === network.chainId, \"transaction chainId mismatch\", \"tx.chainId\", tx.chainId);\n        }\n        else {\n            pop.chainId = network.chainId;\n        }\n        // Do not allow mixing pre-eip-1559 and eip-1559 properties\n        const hasEip1559 = (pop.maxFeePerGas != null || pop.maxPriorityFeePerGas != null);\n        if (pop.gasPrice != null && (pop.type === 2 || hasEip1559)) {\n            (0, index_js_3.assertArgument)(false, \"eip-1559 transaction do not support gasPrice\", \"tx\", tx);\n        }\n        else if ((pop.type === 0 || pop.type === 1) && hasEip1559) {\n            (0, index_js_3.assertArgument)(false, \"pre-eip-1559 transaction do not support maxFeePerGas/maxPriorityFeePerGas\", \"tx\", tx);\n        }\n        if ((pop.type === 2 || pop.type == null) && (pop.maxFeePerGas != null && pop.maxPriorityFeePerGas != null)) {\n            // Fully-formed EIP-1559 transaction (skip getFeeData)\n            pop.type = 2;\n        }\n        else if (pop.type === 0 || pop.type === 1) {\n            // Explicit Legacy or EIP-2930 transaction\n            // We need to get fee data to determine things\n            const feeData = await provider.getFeeData();\n            (0, index_js_3.assert)(feeData.gasPrice != null, \"network does not support gasPrice\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"getGasPrice\"\n            });\n            // Populate missing gasPrice\n            if (pop.gasPrice == null) {\n                pop.gasPrice = feeData.gasPrice;\n            }\n        }\n        else {\n            // We need to get fee data to determine things\n            const feeData = await provider.getFeeData();\n            if (pop.type == null) {\n                // We need to auto-detect the intended type of this transaction...\n                if (feeData.maxFeePerGas != null && feeData.maxPriorityFeePerGas != null) {\n                    // The network supports EIP-1559!\n                    // Upgrade transaction from null to eip-1559\n                    pop.type = 2;\n                    if (pop.gasPrice != null) {\n                        // Using legacy gasPrice property on an eip-1559 network,\n                        // so use gasPrice as both fee properties\n                        const gasPrice = pop.gasPrice;\n                        delete pop.gasPrice;\n                        pop.maxFeePerGas = gasPrice;\n                        pop.maxPriorityFeePerGas = gasPrice;\n                    }\n                    else {\n                        // Populate missing fee data\n                        if (pop.maxFeePerGas == null) {\n                            pop.maxFeePerGas = feeData.maxFeePerGas;\n                        }\n                        if (pop.maxPriorityFeePerGas == null) {\n                            pop.maxPriorityFeePerGas = feeData.maxPriorityFeePerGas;\n                        }\n                    }\n                }\n                else if (feeData.gasPrice != null) {\n                    // Network doesn't support EIP-1559...\n                    // ...but they are trying to use EIP-1559 properties\n                    (0, index_js_3.assert)(!hasEip1559, \"network does not support EIP-1559\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"populateTransaction\"\n                    });\n                    // Populate missing fee data\n                    if (pop.gasPrice == null) {\n                        pop.gasPrice = feeData.gasPrice;\n                    }\n                    // Explicitly set untyped transaction to legacy\n                    // @TODO: Maybe this shold allow type 1?\n                    pop.type = 0;\n                }\n                else {\n                    // getFeeData has failed us.\n                    (0, index_js_3.assert)(false, \"failed to get consistent fee data\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"signer.getFeeData\"\n                    });\n                }\n            }\n            else if (pop.type === 2 || pop.type === 3) {\n                // Explicitly using EIP-1559 or EIP-4844\n                // Populate missing fee data\n                if (pop.maxFeePerGas == null) {\n                    pop.maxFeePerGas = feeData.maxFeePerGas;\n                }\n                if (pop.maxPriorityFeePerGas == null) {\n                    pop.maxPriorityFeePerGas = feeData.maxPriorityFeePerGas;\n                }\n            }\n        }\n        //@TOOD: Don't await all over the place; save them up for\n        // the end for better batching\n        return await (0, index_js_3.resolveProperties)(pop);\n    }\n    async estimateGas(tx) {\n        return checkProvider(this, \"estimateGas\").estimateGas(await this.populateCall(tx));\n    }\n    async call(tx) {\n        return checkProvider(this, \"call\").call(await this.populateCall(tx));\n    }\n    async resolveName(name) {\n        const provider = checkProvider(this, \"resolveName\");\n        return await provider.resolveName(name);\n    }\n    async sendTransaction(tx) {\n        const provider = checkProvider(this, \"sendTransaction\");\n        const pop = await this.populateTransaction(tx);\n        delete pop.from;\n        const txObj = index_js_2.Transaction.from(pop);\n        return await provider.broadcastTransaction(await this.signTransaction(txObj));\n    }\n}\nexports.AbstractSigner = AbstractSigner;\n/**\n *  A **VoidSigner** is a class deisgned to allow an address to be used\n *  in any API which accepts a Signer, but for which there are no\n *  credentials available to perform any actual signing.\n *\n *  This for example allow impersonating an account for the purpose of\n *  static calls or estimating gas, but does not allow sending transactions.\n */\nclass VoidSigner extends AbstractSigner {\n    /**\n     *  The signer address.\n     */\n    address;\n    /**\n     *  Creates a new **VoidSigner** with %%address%% attached to\n     *  %%provider%%.\n     */\n    constructor(address, provider) {\n        super(provider);\n        (0, index_js_3.defineProperties)(this, { address });\n    }\n    async getAddress() { return this.address; }\n    connect(provider) {\n        return new VoidSigner(this.address, provider);\n    }\n    #throwUnsupported(suffix, operation) {\n        (0, index_js_3.assert)(false, `VoidSigner cannot sign ${suffix}`, \"UNSUPPORTED_OPERATION\", { operation });\n    }\n    async signTransaction(tx) {\n        this.#throwUnsupported(\"transactions\", \"signTransaction\");\n    }\n    async signMessage(message) {\n        this.#throwUnsupported(\"messages\", \"signMessage\");\n    }\n    async signTypedData(domain, types, value) {\n        this.#throwUnsupported(\"typed-data\", \"signTypedData\");\n    }\n}\nexports.VoidSigner = VoidSigner;\n//# sourceMappingURL=abstract-signer.js.map","\"use strict\";\n/**\n *  There are many awesome community services that provide Ethereum\n *  nodes both for developers just starting out and for large-scale\n *  communities.\n *\n *  @_section: api/providers/thirdparty: Community Providers  [thirdparty]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.showThrottleMessage = void 0;\n// Show the throttle message only once per service\nconst shown = new Set();\n/**\n *  Displays a warning in tht console when the community resource is\n *  being used too heavily by the app, recommending the developer\n *  acquire their own credentials instead of using the community\n *  credentials.\n *\n *  The notification will only occur once per service.\n */\nfunction showThrottleMessage(service) {\n    if (shown.has(service)) {\n        return;\n    }\n    shown.add(service);\n    console.log(\"========= NOTICE =========\");\n    console.log(`Request-Rate Exceeded for ${service} (this message will not be repeated)`);\n    console.log(\"\");\n    console.log(\"The default API keys for each service are provided as a highly-throttled,\");\n    console.log(\"community resource for low-traffic projects and early prototyping.\");\n    console.log(\"\");\n    console.log(\"While your application will continue to function, we highly recommended\");\n    console.log(\"signing up for your own API keys to improve performance, increase your\");\n    console.log(\"request rate/limit and enable other perks, such as metrics and advanced APIs.\");\n    console.log(\"\");\n    console.log(\"For more details: https:/\\/docs.ethers.org/api-keys/\");\n    console.log(\"==========================\");\n}\nexports.showThrottleMessage = showThrottleMessage;\n//# sourceMappingURL=community.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getDefaultProvider = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst provider_ankr_js_1 = require(\"./provider-ankr.js\");\nconst provider_alchemy_js_1 = require(\"./provider-alchemy.js\");\nconst provider_chainstack_js_1 = require(\"./provider-chainstack.js\");\nconst provider_cloudflare_js_1 = require(\"./provider-cloudflare.js\");\nconst provider_etherscan_js_1 = require(\"./provider-etherscan.js\");\nconst provider_infura_js_1 = require(\"./provider-infura.js\");\n//import { PocketProvider } from \"./provider-pocket.js\";\nconst provider_quicknode_js_1 = require(\"./provider-quicknode.js\");\nconst provider_fallback_js_1 = require(\"./provider-fallback.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_websocket_js_1 = require(\"./provider-websocket.js\");\nfunction isWebSocketLike(value) {\n    return (value && typeof (value.send) === \"function\" &&\n        typeof (value.close) === \"function\");\n}\nconst Testnets = \"goerli kovan sepolia classicKotti optimism-goerli arbitrum-goerli matic-mumbai bnbt\".split(\" \");\n/**\n *  Returns a default provider for %%network%%.\n *\n *  If %%network%% is a [[WebSocketLike]] or string that begins with\n *  ``\"ws:\"`` or ``\"wss:\"``, a [[WebSocketProvider]] is returned backed\n *  by that WebSocket or URL.\n *\n *  If %%network%% is a string that begins with ``\"HTTP:\"`` or ``\"HTTPS:\"``,\n *  a [[JsonRpcProvider]] is returned connected to that URL.\n *\n *  Otherwise, a default provider is created backed by well-known public\n *  Web3 backends (such as [[link-infura]]) using community-provided API\n *  keys.\n *\n *  The %%options%% allows specifying custom API keys per backend (setting\n *  an API key to ``\"-\"`` will omit that provider) and ``options.exclusive``\n *  can be set to either a backend name or and array of backend names, which\n *  will whitelist **only** those backends.\n *\n *  Current backend strings supported are:\n *  - ``\"alchemy\"``\n *  - ``\"ankr\"``\n *  - ``\"cloudflare\"``\n *  - ``\"chainstack\"``\n *  - ``\"etherscan\"``\n *  - ``\"infura\"``\n *  - ``\"publicPolygon\"``\n *  - ``\"quicknode\"``\n *\n *  @example:\n *    // Connect to a local Geth node\n *    provider = getDefaultProvider(\"http://localhost:8545/\");\n *\n *    // Connect to Ethereum mainnet with any current and future\n *    // third-party services available\n *    provider = getDefaultProvider(\"mainnet\");\n *\n *    // Connect to Polygon, but only allow Etherscan and\n *    // INFURA and use \"MY_API_KEY\" in calls to Etherscan.\n *    provider = getDefaultProvider(\"matic\", {\n *      etherscan: \"MY_API_KEY\",\n *      exclusive: [ \"etherscan\", \"infura\" ]\n *    });\n */\nfunction getDefaultProvider(network, options) {\n    if (options == null) {\n        options = {};\n    }\n    const allowService = (name) => {\n        if (options[name] === \"-\") {\n            return false;\n        }\n        if (typeof (options.exclusive) === \"string\") {\n            return (name === options.exclusive);\n        }\n        if (Array.isArray(options.exclusive)) {\n            return (options.exclusive.indexOf(name) !== -1);\n        }\n        return true;\n    };\n    if (typeof (network) === \"string\" && network.match(/^https?:/)) {\n        return new provider_jsonrpc_js_1.JsonRpcProvider(network);\n    }\n    if (typeof (network) === \"string\" && network.match(/^wss?:/) || isWebSocketLike(network)) {\n        return new provider_websocket_js_1.WebSocketProvider(network);\n    }\n    // Get the network and name, if possible\n    let staticNetwork = null;\n    try {\n        staticNetwork = network_js_1.Network.from(network);\n    }\n    catch (error) { }\n    const providers = [];\n    if (allowService(\"publicPolygon\") && staticNetwork) {\n        if (staticNetwork.name === \"matic\") {\n            providers.push(new provider_jsonrpc_js_1.JsonRpcProvider(\"https:/\\/polygon-rpc.com/\", staticNetwork, { staticNetwork }));\n        }\n        else if (staticNetwork.name === \"matic-amoy\") {\n            providers.push(new provider_jsonrpc_js_1.JsonRpcProvider(\"https:/\\/rpc-amoy.polygon.technology/\", staticNetwork, { staticNetwork }));\n        }\n    }\n    if (allowService(\"alchemy\")) {\n        try {\n            providers.push(new provider_alchemy_js_1.AlchemyProvider(network, options.alchemy));\n        }\n        catch (error) { }\n    }\n    if (allowService(\"ankr\") && options.ankr != null) {\n        try {\n            providers.push(new provider_ankr_js_1.AnkrProvider(network, options.ankr));\n        }\n        catch (error) { }\n    }\n    if (allowService(\"chainstack\")) {\n        try {\n            providers.push(new provider_chainstack_js_1.ChainstackProvider(network, options.chainstack));\n        }\n        catch (error) { }\n    }\n    if (allowService(\"cloudflare\")) {\n        try {\n            providers.push(new provider_cloudflare_js_1.CloudflareProvider(network));\n        }\n        catch (error) { }\n    }\n    if (allowService(\"etherscan\")) {\n        try {\n            providers.push(new provider_etherscan_js_1.EtherscanProvider(network, options.etherscan));\n        }\n        catch (error) { }\n    }\n    if (allowService(\"infura\")) {\n        try {\n            let projectId = options.infura;\n            let projectSecret = undefined;\n            if (typeof (projectId) === \"object\") {\n                projectSecret = projectId.projectSecret;\n                projectId = projectId.projectId;\n            }\n            providers.push(new provider_infura_js_1.InfuraProvider(network, projectId, projectSecret));\n        }\n        catch (error) { }\n    }\n    /*\n        if (options.pocket !== \"-\") {\n            try {\n                let appId = options.pocket;\n                let secretKey: undefined | string = undefined;\n                let loadBalancer: undefined | boolean = undefined;\n                if (typeof(appId) === \"object\") {\n                    loadBalancer = !!appId.loadBalancer;\n                    secretKey = appId.secretKey;\n                    appId = appId.appId;\n                }\n                providers.push(new PocketProvider(network, appId, secretKey, loadBalancer));\n            } catch (error) { console.log(error); }\n        }\n    */\n    if (allowService(\"quicknode\")) {\n        try {\n            let token = options.quicknode;\n            providers.push(new provider_quicknode_js_1.QuickNodeProvider(network, token));\n        }\n        catch (error) { }\n    }\n    (0, index_js_1.assert)(providers.length, \"unsupported default network\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"getDefaultProvider\"\n    });\n    // No need for a FallbackProvider\n    if (providers.length === 1) {\n        return providers[0];\n    }\n    // We use the floor because public third-party providers can be unreliable,\n    // so a low number of providers with a large quorum will fail too often\n    let quorum = Math.floor(providers.length / 2);\n    if (quorum > 2) {\n        quorum = 2;\n    }\n    // Testnets don't need as strong a security gaurantee and speed is\n    // more useful during testing\n    if (staticNetwork && Testnets.indexOf(staticNetwork.name) !== -1) {\n        quorum = 1;\n    }\n    // Provided override qorum takes priority\n    if (options && options.quorum) {\n        quorum = options.quorum;\n    }\n    return new provider_fallback_js_1.FallbackProvider(providers, undefined, { quorum });\n}\nexports.getDefaultProvider = getDefaultProvider;\n//# sourceMappingURL=default-provider.js.map","\"use strict\";\n/**\n *  ENS is a service which allows easy-to-remember names to map to\n *  network addresses.\n *\n *  @_section: api/providers/ens-resolver:ENS Resolver  [about-ens-rsolver]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EnsResolver = exports.BasicMulticoinProviderPlugin = exports.MulticoinProviderPlugin = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../constants/index.js\");\nconst index_js_3 = require(\"../contract/index.js\");\nconst index_js_4 = require(\"../hash/index.js\");\nconst index_js_5 = require(\"../utils/index.js\");\n// @TODO: This should use the fetch-data:ipfs gateway\n// Trim off the ipfs:// prefix and return the default gateway URL\nfunction getIpfsLink(link) {\n    if (link.match(/^ipfs:\\/\\/ipfs\\//i)) {\n        link = link.substring(12);\n    }\n    else if (link.match(/^ipfs:\\/\\//i)) {\n        link = link.substring(7);\n    }\n    else {\n        (0, index_js_5.assertArgument)(false, \"unsupported IPFS format\", \"link\", link);\n    }\n    return `https:/\\/gateway.ipfs.io/ipfs/${link}`;\n}\n;\n;\n/**\n *  A provider plugin super-class for processing multicoin address types.\n */\nclass MulticoinProviderPlugin {\n    /**\n     *  The name.\n     */\n    name;\n    /**\n     *  Creates a new **MulticoinProviderPluing** for %%name%%.\n     */\n    constructor(name) {\n        (0, index_js_5.defineProperties)(this, { name });\n    }\n    connect(proivder) {\n        return this;\n    }\n    /**\n     *  Returns ``true`` if %%coinType%% is supported by this plugin.\n     */\n    supportsCoinType(coinType) {\n        return false;\n    }\n    /**\n     *  Resolves to the encoded %%address%% for %%coinType%%.\n     */\n    async encodeAddress(coinType, address) {\n        throw new Error(\"unsupported coin\");\n    }\n    /**\n     *  Resolves to the decoded %%data%% for %%coinType%%.\n     */\n    async decodeAddress(coinType, data) {\n        throw new Error(\"unsupported coin\");\n    }\n}\nexports.MulticoinProviderPlugin = MulticoinProviderPlugin;\nconst BasicMulticoinPluginId = \"org.ethers.plugins.provider.BasicMulticoin\";\n/**\n *  A **BasicMulticoinProviderPlugin** provides service for common\n *  coin types, which do not require additional libraries to encode or\n *  decode.\n */\nclass BasicMulticoinProviderPlugin extends MulticoinProviderPlugin {\n    /**\n     *  Creates a new **BasicMulticoinProviderPlugin**.\n     */\n    constructor() {\n        super(BasicMulticoinPluginId);\n    }\n}\nexports.BasicMulticoinProviderPlugin = BasicMulticoinProviderPlugin;\nconst matcherIpfs = new RegExp(\"^(ipfs):/\\/(.*)$\", \"i\");\nconst matchers = [\n    new RegExp(\"^(https):/\\/(.*)$\", \"i\"),\n    new RegExp(\"^(data):(.*)$\", \"i\"),\n    matcherIpfs,\n    new RegExp(\"^eip155:[0-9]+/(erc[0-9]+):(.*)$\", \"i\"),\n];\n/**\n *  A connected object to a resolved ENS name resolver, which can be\n *  used to query additional details.\n */\nclass EnsResolver {\n    /**\n     *  The connected provider.\n     */\n    provider;\n    /**\n     *  The address of the resolver.\n     */\n    address;\n    /**\n     *  The name this resolver was resolved against.\n     */\n    name;\n    // For EIP-2544 names, the ancestor that provided the resolver\n    #supports2544;\n    #resolver;\n    constructor(provider, address, name) {\n        (0, index_js_5.defineProperties)(this, { provider, address, name });\n        this.#supports2544 = null;\n        this.#resolver = new index_js_3.Contract(address, [\n            \"function supportsInterface(bytes4) view returns (bool)\",\n            \"function resolve(bytes, bytes) view returns (bytes)\",\n            \"function addr(bytes32) view returns (address)\",\n            \"function addr(bytes32, uint) view returns (bytes)\",\n            \"function text(bytes32, string) view returns (string)\",\n            \"function contenthash(bytes32) view returns (bytes)\",\n        ], provider);\n    }\n    /**\n     *  Resolves to true if the resolver supports wildcard resolution.\n     */\n    async supportsWildcard() {\n        if (this.#supports2544 == null) {\n            this.#supports2544 = (async () => {\n                try {\n                    return await this.#resolver.supportsInterface(\"0x9061b923\");\n                }\n                catch (error) {\n                    // Wildcard resolvers must understand supportsInterface\n                    // and return true.\n                    if ((0, index_js_5.isError)(error, \"CALL_EXCEPTION\")) {\n                        return false;\n                    }\n                    // Let future attempts try again...\n                    this.#supports2544 = null;\n                    throw error;\n                }\n            })();\n        }\n        return await this.#supports2544;\n    }\n    async #fetch(funcName, params) {\n        params = (params || []).slice();\n        const iface = this.#resolver.interface;\n        // The first parameters is always the nodehash\n        params.unshift((0, index_js_4.namehash)(this.name));\n        let fragment = null;\n        if (await this.supportsWildcard()) {\n            fragment = iface.getFunction(funcName);\n            (0, index_js_5.assert)(fragment, \"missing fragment\", \"UNKNOWN_ERROR\", {\n                info: { funcName }\n            });\n            params = [\n                (0, index_js_4.dnsEncode)(this.name, 255),\n                iface.encodeFunctionData(fragment, params)\n            ];\n            funcName = \"resolve(bytes,bytes)\";\n        }\n        params.push({\n            enableCcipRead: true\n        });\n        try {\n            const result = await this.#resolver[funcName](...params);\n            if (fragment) {\n                return iface.decodeFunctionResult(fragment, result)[0];\n            }\n            return result;\n        }\n        catch (error) {\n            if (!(0, index_js_5.isError)(error, \"CALL_EXCEPTION\")) {\n                throw error;\n            }\n        }\n        return null;\n    }\n    /**\n     *  Resolves to the address for %%coinType%% or null if the\n     *  provided %%coinType%% has not been configured.\n     */\n    async getAddress(coinType) {\n        if (coinType == null) {\n            coinType = 60;\n        }\n        if (coinType === 60) {\n            try {\n                const result = await this.#fetch(\"addr(bytes32)\");\n                // No address\n                if (result == null || result === index_js_2.ZeroAddress) {\n                    return null;\n                }\n                return result;\n            }\n            catch (error) {\n                if ((0, index_js_5.isError)(error, \"CALL_EXCEPTION\")) {\n                    return null;\n                }\n                throw error;\n            }\n        }\n        // Try decoding its EVM canonical chain as an EVM chain address first\n        if (coinType >= 0 && coinType < 0x80000000) {\n            let ethCoinType = coinType + 0x80000000;\n            const data = await this.#fetch(\"addr(bytes32,uint)\", [ethCoinType]);\n            if ((0, index_js_5.isHexString)(data, 20)) {\n                return (0, index_js_1.getAddress)(data);\n            }\n        }\n        let coinPlugin = null;\n        for (const plugin of this.provider.plugins) {\n            if (!(plugin instanceof MulticoinProviderPlugin)) {\n                continue;\n            }\n            if (plugin.supportsCoinType(coinType)) {\n                coinPlugin = plugin;\n                break;\n            }\n        }\n        if (coinPlugin == null) {\n            return null;\n        }\n        // keccak256(\"addr(bytes32,uint256\")\n        const data = await this.#fetch(\"addr(bytes32,uint)\", [coinType]);\n        // No address\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        // Compute the address\n        const address = await coinPlugin.decodeAddress(coinType, data);\n        if (address != null) {\n            return address;\n        }\n        (0, index_js_5.assert)(false, `invalid coin data`, \"UNSUPPORTED_OPERATION\", {\n            operation: `getAddress(${coinType})`,\n            info: { coinType, data }\n        });\n    }\n    /**\n     *  Resolves to the EIP-634 text record for %%key%%, or ``null``\n     *  if unconfigured.\n     */\n    async getText(key) {\n        const data = await this.#fetch(\"text(bytes32,string)\", [key]);\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        return data;\n    }\n    /**\n     *  Rsolves to the content-hash or ``null`` if unconfigured.\n     */\n    async getContentHash() {\n        // keccak256(\"contenthash()\")\n        const data = await this.#fetch(\"contenthash(bytes32)\");\n        // No contenthash\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        // IPFS (CID: 1, Type: 70=DAG-PB, 72=libp2p-key)\n        const ipfs = data.match(/^0x(e3010170|e5010172)(([0-9a-f][0-9a-f])([0-9a-f][0-9a-f])([0-9a-f]*))$/);\n        if (ipfs) {\n            const scheme = (ipfs[1] === \"e3010170\") ? \"ipfs\" : \"ipns\";\n            const length = parseInt(ipfs[4], 16);\n            if (ipfs[5].length === length * 2) {\n                return `${scheme}:/\\/${(0, index_js_5.encodeBase58)(\"0x\" + ipfs[2])}`;\n            }\n        }\n        // Swarm (CID: 1, Type: swarm-manifest; hash/length hard-coded to keccak256/32)\n        const swarm = data.match(/^0xe40101fa011b20([0-9a-f]*)$/);\n        if (swarm && swarm[1].length === 64) {\n            return `bzz:/\\/${swarm[1]}`;\n        }\n        (0, index_js_5.assert)(false, `invalid or unsupported content hash data`, \"UNSUPPORTED_OPERATION\", {\n            operation: \"getContentHash()\",\n            info: { data }\n        });\n    }\n    /**\n     *  Resolves to the avatar url or ``null`` if the avatar is either\n     *  unconfigured or incorrectly configured (e.g. references an NFT\n     *  not owned by the address).\n     *\n     *  If diagnosing issues with configurations, the [[_getAvatar]]\n     *  method may be useful.\n     */\n    async getAvatar() {\n        const avatar = await this._getAvatar();\n        return avatar.url;\n    }\n    /**\n     *  When resolving an avatar, there are many steps involved, such\n     *  fetching metadata and possibly validating ownership of an\n     *  NFT.\n     *\n     *  This method can be used to examine each step and the value it\n     *  was working from.\n     */\n    async _getAvatar() {\n        const linkage = [{ type: \"name\", value: this.name }];\n        try {\n            // test data for ricmoo.eth\n            //const avatar = \"eip155:1/erc721:0x265385c7f4132228A0d54EB1A9e7460b91c0cC68/29233\";\n            const avatar = await this.getText(\"avatar\");\n            if (avatar == null) {\n                linkage.push({ type: \"!avatar\", value: \"\" });\n                return { url: null, linkage };\n            }\n            linkage.push({ type: \"avatar\", value: avatar });\n            for (let i = 0; i < matchers.length; i++) {\n                const match = avatar.match(matchers[i]);\n                if (match == null) {\n                    continue;\n                }\n                const scheme = match[1].toLowerCase();\n                switch (scheme) {\n                    case \"https\":\n                    case \"data\":\n                        linkage.push({ type: \"url\", value: avatar });\n                        return { linkage, url: avatar };\n                    case \"ipfs\": {\n                        const url = getIpfsLink(avatar);\n                        linkage.push({ type: \"ipfs\", value: avatar });\n                        linkage.push({ type: \"url\", value: url });\n                        return { linkage, url };\n                    }\n                    case \"erc721\":\n                    case \"erc1155\": {\n                        // Depending on the ERC type, use tokenURI(uint256) or url(uint256)\n                        const selector = (scheme === \"erc721\") ? \"tokenURI(uint256)\" : \"uri(uint256)\";\n                        linkage.push({ type: scheme, value: avatar });\n                        // The owner of this name\n                        const owner = await this.getAddress();\n                        if (owner == null) {\n                            linkage.push({ type: \"!owner\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        const comps = (match[2] || \"\").split(\"/\");\n                        if (comps.length !== 2) {\n                            linkage.push({ type: `!${scheme}caip`, value: (match[2] || \"\") });\n                            return { url: null, linkage };\n                        }\n                        const tokenId = comps[1];\n                        const contract = new index_js_3.Contract(comps[0], [\n                            // ERC-721\n                            \"function tokenURI(uint) view returns (string)\",\n                            \"function ownerOf(uint) view returns (address)\",\n                            // ERC-1155\n                            \"function uri(uint) view returns (string)\",\n                            \"function balanceOf(address, uint256) view returns (uint)\"\n                        ], this.provider);\n                        // Check that this account owns the token\n                        if (scheme === \"erc721\") {\n                            const tokenOwner = await contract.ownerOf(tokenId);\n                            if (owner !== tokenOwner) {\n                                linkage.push({ type: \"!owner\", value: tokenOwner });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"owner\", value: tokenOwner });\n                        }\n                        else if (scheme === \"erc1155\") {\n                            const balance = await contract.balanceOf(owner, tokenId);\n                            if (!balance) {\n                                linkage.push({ type: \"!balance\", value: \"0\" });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"balance\", value: balance.toString() });\n                        }\n                        // Call the token contract for the metadata URL\n                        let metadataUrl = await contract[selector](tokenId);\n                        if (metadataUrl == null || metadataUrl === \"0x\") {\n                            linkage.push({ type: \"!metadata-url\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        linkage.push({ type: \"metadata-url-base\", value: metadataUrl });\n                        // ERC-1155 allows a generic {id} in the URL\n                        if (scheme === \"erc1155\") {\n                            metadataUrl = metadataUrl.replace(\"{id}\", (0, index_js_5.toBeHex)(tokenId, 32).substring(2));\n                            linkage.push({ type: \"metadata-url-expanded\", value: metadataUrl });\n                        }\n                        // Transform IPFS metadata links\n                        if (metadataUrl.match(/^ipfs:/i)) {\n                            metadataUrl = getIpfsLink(metadataUrl);\n                        }\n                        linkage.push({ type: \"metadata-url\", value: metadataUrl });\n                        // Get the token metadata\n                        let metadata = {};\n                        const response = await (new index_js_5.FetchRequest(metadataUrl)).send();\n                        response.assertOk();\n                        try {\n                            metadata = response.bodyJson;\n                        }\n                        catch (error) {\n                            try {\n                                linkage.push({ type: \"!metadata\", value: response.bodyText });\n                            }\n                            catch (error) {\n                                const bytes = response.body;\n                                if (bytes) {\n                                    linkage.push({ type: \"!metadata\", value: (0, index_js_5.hexlify)(bytes) });\n                                }\n                                return { url: null, linkage };\n                            }\n                            return { url: null, linkage };\n                        }\n                        if (!metadata) {\n                            linkage.push({ type: \"!metadata\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        linkage.push({ type: \"metadata\", value: JSON.stringify(metadata) });\n                        // Pull the image URL out\n                        let imageUrl = metadata.image;\n                        if (typeof (imageUrl) !== \"string\") {\n                            linkage.push({ type: \"!imageUrl\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        if (imageUrl.match(/^(https:\\/\\/|data:)/i)) {\n                            // Allow\n                        }\n                        else {\n                            // Transform IPFS link to gateway\n                            const ipfs = imageUrl.match(matcherIpfs);\n                            if (ipfs == null) {\n                                linkage.push({ type: \"!imageUrl-ipfs\", value: imageUrl });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"imageUrl-ipfs\", value: imageUrl });\n                            imageUrl = getIpfsLink(imageUrl);\n                        }\n                        linkage.push({ type: \"url\", value: imageUrl });\n                        return { linkage, url: imageUrl };\n                    }\n                }\n            }\n        }\n        catch (error) { }\n        return { linkage, url: null };\n    }\n    static async getEnsAddress(provider) {\n        const network = await provider.getNetwork();\n        const ensPlugin = network.getPlugin(\"org.ethers.plugins.network.Ens\");\n        // No ENS...\n        (0, index_js_5.assert)(ensPlugin, \"network does not support ENS\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"getEnsAddress\", info: { network }\n        });\n        return ensPlugin.address;\n    }\n    static async #getResolver(provider, name) {\n        const ensAddr = await EnsResolver.getEnsAddress(provider);\n        try {\n            const contract = new index_js_3.Contract(ensAddr, [\n                \"function resolver(bytes32) view returns (address)\"\n            ], provider);\n            const addr = await contract.resolver((0, index_js_4.namehash)(name), {\n                enableCcipRead: true\n            });\n            if (addr === index_js_2.ZeroAddress) {\n                return null;\n            }\n            return addr;\n        }\n        catch (error) {\n            // ENS registry cannot throw errors on resolver(bytes32),\n            // so probably a link error\n            throw error;\n        }\n        return null;\n    }\n    /**\n     *  Resolve to the ENS resolver for %%name%% using %%provider%% or\n     *  ``null`` if unconfigured.\n     */\n    static async fromName(provider, name) {\n        let currentName = name;\n        while (true) {\n            if (currentName === \"\" || currentName === \".\") {\n                return null;\n            }\n            // Optimization since the eth node cannot change and does\n            // not have a wildcard resolver\n            if (name !== \"eth\" && currentName === \"eth\") {\n                return null;\n            }\n            // Check the current node for a resolver\n            const addr = await EnsResolver.#getResolver(provider, currentName);\n            // Found a resolver!\n            if (addr != null) {\n                const resolver = new EnsResolver(provider, addr, name);\n                // Legacy resolver found, using EIP-2544 so it isn't safe to use\n                if (currentName !== name && !(await resolver.supportsWildcard())) {\n                    return null;\n                }\n                return resolver;\n            }\n            // Get the parent node\n            currentName = currentName.split(\".\").slice(1).join(\".\");\n        }\n    }\n}\nexports.EnsResolver = EnsResolver;\n//# sourceMappingURL=ens-resolver.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.formatTransactionResponse = exports.formatTransactionReceipt = exports.formatReceiptLog = exports.formatBlock = exports.formatLog = exports.formatUint256 = exports.formatHash = exports.formatData = exports.formatBoolean = exports.object = exports.arrayOf = exports.allowNull = void 0;\n/**\n *  @_ignore\n */\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst BN_0 = BigInt(0);\nfunction allowNull(format, nullValue) {\n    return (function (value) {\n        if (value == null) {\n            return nullValue;\n        }\n        return format(value);\n    });\n}\nexports.allowNull = allowNull;\nfunction arrayOf(format, allowNull) {\n    return ((array) => {\n        if (allowNull && array == null) {\n            return null;\n        }\n        if (!Array.isArray(array)) {\n            throw new Error(\"not an array\");\n        }\n        return array.map((i) => format(i));\n    });\n}\nexports.arrayOf = arrayOf;\n// Requires an object which matches a fleet of other formatters\n// Any FormatFunc may return `undefined` to have the value omitted\n// from the result object. Calls preserve `this`.\nfunction object(format, altNames) {\n    return ((value) => {\n        const result = {};\n        for (const key in format) {\n            let srcKey = key;\n            if (altNames && key in altNames && !(srcKey in value)) {\n                for (const altKey of altNames[key]) {\n                    if (altKey in value) {\n                        srcKey = altKey;\n                        break;\n                    }\n                }\n            }\n            try {\n                const nv = format[key](value[srcKey]);\n                if (nv !== undefined) {\n                    result[key] = nv;\n                }\n            }\n            catch (error) {\n                const message = (error instanceof Error) ? error.message : \"not-an-error\";\n                (0, index_js_4.assert)(false, `invalid value for value.${key} (${message})`, \"BAD_DATA\", { value });\n            }\n        }\n        return result;\n    });\n}\nexports.object = object;\nfunction formatBoolean(value) {\n    switch (value) {\n        case true:\n        case \"true\":\n            return true;\n        case false:\n        case \"false\":\n            return false;\n    }\n    (0, index_js_4.assertArgument)(false, `invalid boolean; ${JSON.stringify(value)}`, \"value\", value);\n}\nexports.formatBoolean = formatBoolean;\nfunction formatData(value) {\n    (0, index_js_4.assertArgument)((0, index_js_4.isHexString)(value, true), \"invalid data\", \"value\", value);\n    return value;\n}\nexports.formatData = formatData;\nfunction formatHash(value) {\n    (0, index_js_4.assertArgument)((0, index_js_4.isHexString)(value, 32), \"invalid hash\", \"value\", value);\n    return value;\n}\nexports.formatHash = formatHash;\nfunction formatUint256(value) {\n    if (!(0, index_js_4.isHexString)(value)) {\n        throw new Error(\"invalid uint256\");\n    }\n    return (0, index_js_4.zeroPadValue)(value, 32);\n}\nexports.formatUint256 = formatUint256;\nconst _formatLog = object({\n    address: index_js_1.getAddress,\n    blockHash: formatHash,\n    blockNumber: index_js_4.getNumber,\n    data: formatData,\n    index: index_js_4.getNumber,\n    removed: allowNull(formatBoolean, false),\n    topics: arrayOf(formatHash),\n    transactionHash: formatHash,\n    transactionIndex: index_js_4.getNumber,\n}, {\n    index: [\"logIndex\"]\n});\nfunction formatLog(value) {\n    return _formatLog(value);\n}\nexports.formatLog = formatLog;\nconst _formatBlock = object({\n    hash: allowNull(formatHash),\n    parentHash: formatHash,\n    parentBeaconBlockRoot: allowNull(formatHash, null),\n    number: index_js_4.getNumber,\n    timestamp: index_js_4.getNumber,\n    nonce: allowNull(formatData),\n    difficulty: index_js_4.getBigInt,\n    gasLimit: index_js_4.getBigInt,\n    gasUsed: index_js_4.getBigInt,\n    stateRoot: allowNull(formatHash, null),\n    receiptsRoot: allowNull(formatHash, null),\n    blobGasUsed: allowNull(index_js_4.getBigInt, null),\n    excessBlobGas: allowNull(index_js_4.getBigInt, null),\n    miner: allowNull(index_js_1.getAddress),\n    prevRandao: allowNull(formatHash, null),\n    extraData: formatData,\n    baseFeePerGas: allowNull(index_js_4.getBigInt)\n}, {\n    prevRandao: [\"mixHash\"]\n});\nfunction formatBlock(value) {\n    const result = _formatBlock(value);\n    result.transactions = value.transactions.map((tx) => {\n        if (typeof (tx) === \"string\") {\n            return tx;\n        }\n        return formatTransactionResponse(tx);\n    });\n    return result;\n}\nexports.formatBlock = formatBlock;\nconst _formatReceiptLog = object({\n    transactionIndex: index_js_4.getNumber,\n    blockNumber: index_js_4.getNumber,\n    transactionHash: formatHash,\n    address: index_js_1.getAddress,\n    topics: arrayOf(formatHash),\n    data: formatData,\n    index: index_js_4.getNumber,\n    blockHash: formatHash,\n}, {\n    index: [\"logIndex\"]\n});\nfunction formatReceiptLog(value) {\n    return _formatReceiptLog(value);\n}\nexports.formatReceiptLog = formatReceiptLog;\nconst _formatTransactionReceipt = object({\n    to: allowNull(index_js_1.getAddress, null),\n    from: allowNull(index_js_1.getAddress, null),\n    contractAddress: allowNull(index_js_1.getAddress, null),\n    // should be allowNull(hash), but broken-EIP-658 support is handled in receipt\n    index: index_js_4.getNumber,\n    root: allowNull(index_js_4.hexlify),\n    gasUsed: index_js_4.getBigInt,\n    blobGasUsed: allowNull(index_js_4.getBigInt, null),\n    logsBloom: allowNull(formatData),\n    blockHash: formatHash,\n    hash: formatHash,\n    logs: arrayOf(formatReceiptLog),\n    blockNumber: index_js_4.getNumber,\n    //confirmations: allowNull(getNumber, null),\n    cumulativeGasUsed: index_js_4.getBigInt,\n    effectiveGasPrice: allowNull(index_js_4.getBigInt),\n    blobGasPrice: allowNull(index_js_4.getBigInt, null),\n    status: allowNull(index_js_4.getNumber),\n    type: allowNull(index_js_4.getNumber, 0)\n}, {\n    effectiveGasPrice: [\"gasPrice\"],\n    hash: [\"transactionHash\"],\n    index: [\"transactionIndex\"],\n});\nfunction formatTransactionReceipt(value) {\n    return _formatTransactionReceipt(value);\n}\nexports.formatTransactionReceipt = formatTransactionReceipt;\nfunction formatTransactionResponse(value) {\n    // Some clients (TestRPC) do strange things like return 0x0 for the\n    // 0 address; correct this to be a real address\n    if (value.to && (0, index_js_4.getBigInt)(value.to) === BN_0) {\n        value.to = \"0x0000000000000000000000000000000000000000\";\n    }\n    const result = object({\n        hash: formatHash,\n        // Some nodes do not return this, usually test nodes (like Ganache)\n        index: allowNull(index_js_4.getNumber, undefined),\n        type: (value) => {\n            if (value === \"0x\" || value == null) {\n                return 0;\n            }\n            return (0, index_js_4.getNumber)(value);\n        },\n        accessList: allowNull(index_js_3.accessListify, null),\n        blobVersionedHashes: allowNull(arrayOf(formatHash, true), null),\n        blockHash: allowNull(formatHash, null),\n        blockNumber: allowNull(index_js_4.getNumber, null),\n        transactionIndex: allowNull(index_js_4.getNumber, null),\n        from: index_js_1.getAddress,\n        // either (gasPrice) or (maxPriorityFeePerGas + maxFeePerGas) must be set\n        gasPrice: allowNull(index_js_4.getBigInt),\n        maxPriorityFeePerGas: allowNull(index_js_4.getBigInt),\n        maxFeePerGas: allowNull(index_js_4.getBigInt),\n        maxFeePerBlobGas: allowNull(index_js_4.getBigInt, null),\n        gasLimit: index_js_4.getBigInt,\n        to: allowNull(index_js_1.getAddress, null),\n        value: index_js_4.getBigInt,\n        nonce: index_js_4.getNumber,\n        data: formatData,\n        creates: allowNull(index_js_1.getAddress, null),\n        chainId: allowNull(index_js_4.getBigInt, null)\n    }, {\n        data: [\"input\"],\n        gasLimit: [\"gas\"],\n        index: [\"transactionIndex\"]\n    })(value);\n    // If to and creates are empty, populate the creates from the value\n    if (result.to == null && result.creates == null) {\n        result.creates = (0, index_js_1.getCreateAddress)(result);\n    }\n    // @TODO: Check fee data\n    // Add an access list to supported transaction types\n    if ((value.type === 1 || value.type === 2) && value.accessList == null) {\n        result.accessList = [];\n    }\n    // Compute the signature\n    if (value.signature) {\n        result.signature = index_js_2.Signature.from(value.signature);\n    }\n    else {\n        result.signature = index_js_2.Signature.from(value);\n    }\n    // Some backends omit ChainId on legacy transactions, but we can compute it\n    if (result.chainId == null) {\n        const chainId = result.signature.legacyChainId;\n        if (chainId != null) {\n            result.chainId = chainId;\n        }\n    }\n    // @TODO: check chainID\n    /*\n    if (value.chainId != null) {\n        let chainId = value.chainId;\n\n        if (isHexString(chainId)) {\n            chainId = BigNumber.from(chainId).toNumber();\n        }\n\n        result.chainId = chainId;\n\n    } else {\n        let chainId = value.networkId;\n\n        // geth-etc returns chainId\n        if (chainId == null && result.v == null) {\n            chainId = value.chainId;\n        }\n\n        if (isHexString(chainId)) {\n            chainId = BigNumber.from(chainId).toNumber();\n        }\n\n        if (typeof(chainId) !== \"number\" && result.v != null) {\n            chainId = (result.v - 35) / 2;\n            if (chainId < 0) { chainId = 0; }\n            chainId = parseInt(chainId);\n        }\n\n        if (typeof(chainId) !== \"number\") { chainId = 0; }\n\n        result.chainId = chainId;\n    }\n    */\n    // 0x0000... should actually be null\n    if (result.blockHash && (0, index_js_4.getBigInt)(result.blockHash) === BN_0) {\n        result.blockHash = null;\n    }\n    return result;\n}\nexports.formatTransactionResponse = formatTransactionResponse;\n//# sourceMappingURL=format.js.map","\"use strict\";\n/**\n *  A **Provider** provides a connection to the blockchain, whch can be\n *  used to query its current state, simulate execution and send transactions\n *  to update the state.\n *\n *  It is one of the most fundamental components of interacting with a\n *  blockchain application, and there are many ways to connect, such as over\n *  HTTP, WebSockets or injected providers such as [MetaMask](link-metamask).\n *\n *  @_section: api/providers:Providers  [about-providers]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SocketEventSubscriber = exports.SocketPendingSubscriber = exports.SocketBlockSubscriber = exports.SocketSubscriber = exports.WebSocketProvider = exports.SocketProvider = exports.IpcSocketProvider = exports.QuickNodeProvider = exports.PocketProvider = exports.InfuraWebSocketProvider = exports.InfuraProvider = exports.EtherscanPlugin = exports.EtherscanProvider = exports.ChainstackProvider = exports.CloudflareProvider = exports.AnkrProvider = exports.AlchemyProvider = exports.BrowserProvider = exports.JsonRpcSigner = exports.JsonRpcProvider = exports.JsonRpcApiProvider = exports.FallbackProvider = exports.copyRequest = exports.TransactionResponse = exports.TransactionReceipt = exports.Log = exports.FeeData = exports.Block = exports.FetchUrlFeeDataNetworkPlugin = exports.FeeDataNetworkPlugin = exports.EnsPlugin = exports.GasCostPlugin = exports.NetworkPlugin = exports.NonceManager = exports.Network = exports.MulticoinProviderPlugin = exports.EnsResolver = exports.getDefaultProvider = exports.showThrottleMessage = exports.VoidSigner = exports.AbstractSigner = exports.UnmanagedSubscriber = exports.AbstractProvider = void 0;\nvar abstract_provider_js_1 = require(\"./abstract-provider.js\");\nObject.defineProperty(exports, \"AbstractProvider\", { enumerable: true, get: function () { return abstract_provider_js_1.AbstractProvider; } });\nObject.defineProperty(exports, \"UnmanagedSubscriber\", { enumerable: true, get: function () { return abstract_provider_js_1.UnmanagedSubscriber; } });\nvar abstract_signer_js_1 = require(\"./abstract-signer.js\");\nObject.defineProperty(exports, \"AbstractSigner\", { enumerable: true, get: function () { return abstract_signer_js_1.AbstractSigner; } });\nObject.defineProperty(exports, \"VoidSigner\", { enumerable: true, get: function () { return abstract_signer_js_1.VoidSigner; } });\nvar community_js_1 = require(\"./community.js\");\nObject.defineProperty(exports, \"showThrottleMessage\", { enumerable: true, get: function () { return community_js_1.showThrottleMessage; } });\nvar default_provider_js_1 = require(\"./default-provider.js\");\nObject.defineProperty(exports, \"getDefaultProvider\", { enumerable: true, get: function () { return default_provider_js_1.getDefaultProvider; } });\nvar ens_resolver_js_1 = require(\"./ens-resolver.js\");\nObject.defineProperty(exports, \"EnsResolver\", { enumerable: true, get: function () { return ens_resolver_js_1.EnsResolver; } });\nObject.defineProperty(exports, \"MulticoinProviderPlugin\", { enumerable: true, get: function () { return ens_resolver_js_1.MulticoinProviderPlugin; } });\nvar network_js_1 = require(\"./network.js\");\nObject.defineProperty(exports, \"Network\", { enumerable: true, get: function () { return network_js_1.Network; } });\nvar signer_noncemanager_js_1 = require(\"./signer-noncemanager.js\");\nObject.defineProperty(exports, \"NonceManager\", { enumerable: true, get: function () { return signer_noncemanager_js_1.NonceManager; } });\nvar plugins_network_js_1 = require(\"./plugins-network.js\");\nObject.defineProperty(exports, \"NetworkPlugin\", { enumerable: true, get: function () { return plugins_network_js_1.NetworkPlugin; } });\nObject.defineProperty(exports, \"GasCostPlugin\", { enumerable: true, get: function () { return plugins_network_js_1.GasCostPlugin; } });\nObject.defineProperty(exports, \"EnsPlugin\", { enumerable: true, get: function () { return plugins_network_js_1.EnsPlugin; } });\nObject.defineProperty(exports, \"FeeDataNetworkPlugin\", { enumerable: true, get: function () { return plugins_network_js_1.FeeDataNetworkPlugin; } });\nObject.defineProperty(exports, \"FetchUrlFeeDataNetworkPlugin\", { enumerable: true, get: function () { return plugins_network_js_1.FetchUrlFeeDataNetworkPlugin; } });\nvar provider_js_1 = require(\"./provider.js\");\nObject.defineProperty(exports, \"Block\", { enumerable: true, get: function () { return provider_js_1.Block; } });\nObject.defineProperty(exports, \"FeeData\", { enumerable: true, get: function () { return provider_js_1.FeeData; } });\nObject.defineProperty(exports, \"Log\", { enumerable: true, get: function () { return provider_js_1.Log; } });\nObject.defineProperty(exports, \"TransactionReceipt\", { enumerable: true, get: function () { return provider_js_1.TransactionReceipt; } });\nObject.defineProperty(exports, \"TransactionResponse\", { enumerable: true, get: function () { return provider_js_1.TransactionResponse; } });\nObject.defineProperty(exports, \"copyRequest\", { enumerable: true, get: function () { return provider_js_1.copyRequest; } });\nvar provider_fallback_js_1 = require(\"./provider-fallback.js\");\nObject.defineProperty(exports, \"FallbackProvider\", { enumerable: true, get: function () { return provider_fallback_js_1.FallbackProvider; } });\nvar provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nObject.defineProperty(exports, \"JsonRpcApiProvider\", { enumerable: true, get: function () { return provider_jsonrpc_js_1.JsonRpcApiProvider; } });\nObject.defineProperty(exports, \"JsonRpcProvider\", { enumerable: true, get: function () { return provider_jsonrpc_js_1.JsonRpcProvider; } });\nObject.defineProperty(exports, \"JsonRpcSigner\", { enumerable: true, get: function () { return provider_jsonrpc_js_1.JsonRpcSigner; } });\nvar provider_browser_js_1 = require(\"./provider-browser.js\");\nObject.defineProperty(exports, \"BrowserProvider\", { enumerable: true, get: function () { return provider_browser_js_1.BrowserProvider; } });\nvar provider_alchemy_js_1 = require(\"./provider-alchemy.js\");\nObject.defineProperty(exports, \"AlchemyProvider\", { enumerable: true, get: function () { return provider_alchemy_js_1.AlchemyProvider; } });\nvar provider_ankr_js_1 = require(\"./provider-ankr.js\");\nObject.defineProperty(exports, \"AnkrProvider\", { enumerable: true, get: function () { return provider_ankr_js_1.AnkrProvider; } });\nvar provider_cloudflare_js_1 = require(\"./provider-cloudflare.js\");\nObject.defineProperty(exports, \"CloudflareProvider\", { enumerable: true, get: function () { return provider_cloudflare_js_1.CloudflareProvider; } });\nvar provider_chainstack_js_1 = require(\"./provider-chainstack.js\");\nObject.defineProperty(exports, \"ChainstackProvider\", { enumerable: true, get: function () { return provider_chainstack_js_1.ChainstackProvider; } });\nvar provider_etherscan_js_1 = require(\"./provider-etherscan.js\");\nObject.defineProperty(exports, \"EtherscanProvider\", { enumerable: true, get: function () { return provider_etherscan_js_1.EtherscanProvider; } });\nObject.defineProperty(exports, \"EtherscanPlugin\", { enumerable: true, get: function () { return provider_etherscan_js_1.EtherscanPlugin; } });\nvar provider_infura_js_1 = require(\"./provider-infura.js\");\nObject.defineProperty(exports, \"InfuraProvider\", { enumerable: true, get: function () { return provider_infura_js_1.InfuraProvider; } });\nObject.defineProperty(exports, \"InfuraWebSocketProvider\", { enumerable: true, get: function () { return provider_infura_js_1.InfuraWebSocketProvider; } });\nvar provider_pocket_js_1 = require(\"./provider-pocket.js\");\nObject.defineProperty(exports, \"PocketProvider\", { enumerable: true, get: function () { return provider_pocket_js_1.PocketProvider; } });\nvar provider_quicknode_js_1 = require(\"./provider-quicknode.js\");\nObject.defineProperty(exports, \"QuickNodeProvider\", { enumerable: true, get: function () { return provider_quicknode_js_1.QuickNodeProvider; } });\nconst provider_ipcsocket_js_1 = require(\"./provider-ipcsocket.js\"); /*-browser*/\nObject.defineProperty(exports, \"IpcSocketProvider\", { enumerable: true, get: function () { return provider_ipcsocket_js_1.IpcSocketProvider; } });\nvar provider_socket_js_1 = require(\"./provider-socket.js\");\nObject.defineProperty(exports, \"SocketProvider\", { enumerable: true, get: function () { return provider_socket_js_1.SocketProvider; } });\nvar provider_websocket_js_1 = require(\"./provider-websocket.js\");\nObject.defineProperty(exports, \"WebSocketProvider\", { enumerable: true, get: function () { return provider_websocket_js_1.WebSocketProvider; } });\nvar provider_socket_js_2 = require(\"./provider-socket.js\");\nObject.defineProperty(exports, \"SocketSubscriber\", { enumerable: true, get: function () { return provider_socket_js_2.SocketSubscriber; } });\nObject.defineProperty(exports, \"SocketBlockSubscriber\", { enumerable: true, get: function () { return provider_socket_js_2.SocketBlockSubscriber; } });\nObject.defineProperty(exports, \"SocketPendingSubscriber\", { enumerable: true, get: function () { return provider_socket_js_2.SocketPendingSubscriber; } });\nObject.defineProperty(exports, \"SocketEventSubscriber\", { enumerable: true, get: function () { return provider_socket_js_2.SocketEventSubscriber; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n *  A **Network** encapsulates the various properties required to\n *  interact with a specific chain.\n *\n *  @_subsection: api/providers:Networks  [networks]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Network = void 0;\nconst index_js_1 = require(\"../transaction/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst plugins_network_js_1 = require(\"./plugins-network.js\");\n/* * * *\n// Networks which operation against an L2 can use this plugin to\n// specify how to access L1, for the purpose of resolving ENS,\n// for example.\nexport class LayerOneConnectionPlugin extends NetworkPlugin {\n    readonly provider!: Provider;\n// @TODO: Rename to ChainAccess and allow for connecting to any chain\n    constructor(provider: Provider) {\n        super(\"org.ethers.plugins.layer-one-connection\");\n        defineProperties<LayerOneConnectionPlugin>(this, { provider });\n    }\n\n    clone(): LayerOneConnectionPlugin {\n        return new LayerOneConnectionPlugin(this.provider);\n    }\n}\n*/\nconst Networks = new Map();\n/**\n *  A **Network** provides access to a chain's properties and allows\n *  for plug-ins to extend functionality.\n */\nclass Network {\n    #name;\n    #chainId;\n    #plugins;\n    /**\n     *  Creates a new **Network** for %%name%% and %%chainId%%.\n     */\n    constructor(name, chainId) {\n        this.#name = name;\n        this.#chainId = (0, index_js_2.getBigInt)(chainId);\n        this.#plugins = new Map();\n    }\n    /**\n     *  Returns a JSON-compatible representation of a Network.\n     */\n    toJSON() {\n        return { name: this.name, chainId: String(this.chainId) };\n    }\n    /**\n     *  The network common name.\n     *\n     *  This is the canonical name, as networks migh have multiple\n     *  names.\n     */\n    get name() { return this.#name; }\n    set name(value) { this.#name = value; }\n    /**\n     *  The network chain ID.\n     */\n    get chainId() { return this.#chainId; }\n    set chainId(value) { this.#chainId = (0, index_js_2.getBigInt)(value, \"chainId\"); }\n    /**\n     *  Returns true if %%other%% matches this network. Any chain ID\n     *  must match, and if no chain ID is present, the name must match.\n     *\n     *  This method does not currently check for additional properties,\n     *  such as ENS address or plug-in compatibility.\n     */\n    matches(other) {\n        if (other == null) {\n            return false;\n        }\n        if (typeof (other) === \"string\") {\n            try {\n                return (this.chainId === (0, index_js_2.getBigInt)(other));\n            }\n            catch (error) { }\n            return (this.name === other);\n        }\n        if (typeof (other) === \"number\" || typeof (other) === \"bigint\") {\n            try {\n                return (this.chainId === (0, index_js_2.getBigInt)(other));\n            }\n            catch (error) { }\n            return false;\n        }\n        if (typeof (other) === \"object\") {\n            if (other.chainId != null) {\n                try {\n                    return (this.chainId === (0, index_js_2.getBigInt)(other.chainId));\n                }\n                catch (error) { }\n                return false;\n            }\n            if (other.name != null) {\n                return (this.name === other.name);\n            }\n            return false;\n        }\n        return false;\n    }\n    /**\n     *  Returns the list of plugins currently attached to this Network.\n     */\n    get plugins() {\n        return Array.from(this.#plugins.values());\n    }\n    /**\n     *  Attach a new %%plugin%% to this Network. The network name\n     *  must be unique, excluding any fragment.\n     */\n    attachPlugin(plugin) {\n        if (this.#plugins.get(plugin.name)) {\n            throw new Error(`cannot replace existing plugin: ${plugin.name} `);\n        }\n        this.#plugins.set(plugin.name, plugin.clone());\n        return this;\n    }\n    /**\n     *  Return the plugin, if any, matching %%name%% exactly. Plugins\n     *  with fragments will not be returned unless %%name%% includes\n     *  a fragment.\n     */\n    getPlugin(name) {\n        return (this.#plugins.get(name)) || null;\n    }\n    /**\n     *  Gets a list of all plugins that match %%name%%, with otr without\n     *  a fragment.\n     */\n    getPlugins(basename) {\n        return (this.plugins.filter((p) => (p.name.split(\"#\")[0] === basename)));\n    }\n    /**\n     *  Create a copy of this Network.\n     */\n    clone() {\n        const clone = new Network(this.name, this.chainId);\n        this.plugins.forEach((plugin) => {\n            clone.attachPlugin(plugin.clone());\n        });\n        return clone;\n    }\n    /**\n     *  Compute the intrinsic gas required for a transaction.\n     *\n     *  A GasCostPlugin can be attached to override the default\n     *  values.\n     */\n    computeIntrinsicGas(tx) {\n        const costs = this.getPlugin(\"org.ethers.plugins.network.GasCost\") || (new plugins_network_js_1.GasCostPlugin());\n        let gas = costs.txBase;\n        if (tx.to == null) {\n            gas += costs.txCreate;\n        }\n        if (tx.data) {\n            for (let i = 2; i < tx.data.length; i += 2) {\n                if (tx.data.substring(i, i + 2) === \"00\") {\n                    gas += costs.txDataZero;\n                }\n                else {\n                    gas += costs.txDataNonzero;\n                }\n            }\n        }\n        if (tx.accessList) {\n            const accessList = (0, index_js_1.accessListify)(tx.accessList);\n            for (const addr in accessList) {\n                gas += costs.txAccessListAddress + costs.txAccessListStorageKey * accessList[addr].storageKeys.length;\n            }\n        }\n        return gas;\n    }\n    /**\n     *  Returns a new Network for the %%network%% name or chainId.\n     */\n    static from(network) {\n        injectCommonNetworks();\n        // Default network\n        if (network == null) {\n            return Network.from(\"mainnet\");\n        }\n        // Canonical name or chain ID\n        if (typeof (network) === \"number\") {\n            network = BigInt(network);\n        }\n        if (typeof (network) === \"string\" || typeof (network) === \"bigint\") {\n            const networkFunc = Networks.get(network);\n            if (networkFunc) {\n                return networkFunc();\n            }\n            if (typeof (network) === \"bigint\") {\n                return new Network(\"unknown\", network);\n            }\n            (0, index_js_2.assertArgument)(false, \"unknown network\", \"network\", network);\n        }\n        // Clonable with network-like abilities\n        if (typeof (network.clone) === \"function\") {\n            const clone = network.clone();\n            //if (typeof(network.name) !== \"string\" || typeof(network.chainId) !== \"number\") {\n            //}\n            return clone;\n        }\n        // Networkish\n        if (typeof (network) === \"object\") {\n            (0, index_js_2.assertArgument)(typeof (network.name) === \"string\" && typeof (network.chainId) === \"number\", \"invalid network object name or chainId\", \"network\", network);\n            const custom = new Network((network.name), (network.chainId));\n            if (network.ensAddress || network.ensNetwork != null) {\n                custom.attachPlugin(new plugins_network_js_1.EnsPlugin(network.ensAddress, network.ensNetwork));\n            }\n            //if ((<any>network).layerOneConnection) {\n            //    custom.attachPlugin(new LayerOneConnectionPlugin((<any>network).layerOneConnection));\n            //}\n            return custom;\n        }\n        (0, index_js_2.assertArgument)(false, \"invalid network\", \"network\", network);\n    }\n    /**\n     *  Register %%nameOrChainId%% with a function which returns\n     *  an instance of a Network representing that chain.\n     */\n    static register(nameOrChainId, networkFunc) {\n        if (typeof (nameOrChainId) === \"number\") {\n            nameOrChainId = BigInt(nameOrChainId);\n        }\n        const existing = Networks.get(nameOrChainId);\n        if (existing) {\n            (0, index_js_2.assertArgument)(false, `conflicting network for ${JSON.stringify(existing.name)}`, \"nameOrChainId\", nameOrChainId);\n        }\n        Networks.set(nameOrChainId, networkFunc);\n    }\n}\nexports.Network = Network;\n// We don't want to bring in formatUnits because it is backed by\n// FixedNumber and we want to keep Networks tiny. The values\n// included by the Gas Stations are also IEEE 754 with lots of\n// rounding issues and exceed the strict checks formatUnits has.\nfunction parseUnits(_value, decimals) {\n    const value = String(_value);\n    if (!value.match(/^[0-9.]+$/)) {\n        throw new Error(`invalid gwei value: ${_value}`);\n    }\n    // Break into [ whole, fraction ]\n    const comps = value.split(\".\");\n    if (comps.length === 1) {\n        comps.push(\"\");\n    }\n    // More than 1 decimal point or too many fractional positions\n    if (comps.length !== 2) {\n        throw new Error(`invalid gwei value: ${_value}`);\n    }\n    // Pad the fraction to 9 decimalplaces\n    while (comps[1].length < decimals) {\n        comps[1] += \"0\";\n    }\n    // Too many decimals and some non-zero ending, take the ceiling\n    if (comps[1].length > 9) {\n        let frac = BigInt(comps[1].substring(0, 9));\n        if (!comps[1].substring(9).match(/^0+$/)) {\n            frac++;\n        }\n        comps[1] = frac.toString();\n    }\n    return BigInt(comps[0] + comps[1]);\n}\n// Used by Polygon to use a gas station for fee data\nfunction getGasStationPlugin(url) {\n    return new plugins_network_js_1.FetchUrlFeeDataNetworkPlugin(url, async (fetchFeeData, provider, request) => {\n        // Prevent Cloudflare from blocking our request in node.js\n        request.setHeader(\"User-Agent\", \"ethers\");\n        let response;\n        try {\n            const [_response, _feeData] = await Promise.all([\n                request.send(), fetchFeeData()\n            ]);\n            response = _response;\n            const payload = response.bodyJson.standard;\n            const feeData = {\n                gasPrice: _feeData.gasPrice,\n                maxFeePerGas: parseUnits(payload.maxFee, 9),\n                maxPriorityFeePerGas: parseUnits(payload.maxPriorityFee, 9),\n            };\n            return feeData;\n        }\n        catch (error) {\n            (0, index_js_2.assert)(false, `error encountered with polygon gas station (${JSON.stringify(request.url)})`, \"SERVER_ERROR\", { request, response, error });\n        }\n    });\n}\n// See: https://chainlist.org\nlet injected = false;\nfunction injectCommonNetworks() {\n    if (injected) {\n        return;\n    }\n    injected = true;\n    /// Register popular Ethereum networks\n    function registerEth(name, chainId, options) {\n        const func = function () {\n            const network = new Network(name, chainId);\n            // We use 0 to disable ENS\n            if (options.ensNetwork != null) {\n                network.attachPlugin(new plugins_network_js_1.EnsPlugin(null, options.ensNetwork));\n            }\n            network.attachPlugin(new plugins_network_js_1.GasCostPlugin());\n            (options.plugins || []).forEach((plugin) => {\n                network.attachPlugin(plugin);\n            });\n            return network;\n        };\n        // Register the network by name and chain ID\n        Network.register(name, func);\n        Network.register(chainId, func);\n        if (options.altNames) {\n            options.altNames.forEach((name) => {\n                Network.register(name, func);\n            });\n        }\n    }\n    registerEth(\"mainnet\", 1, { ensNetwork: 1, altNames: [\"homestead\"] });\n    registerEth(\"ropsten\", 3, { ensNetwork: 3 });\n    registerEth(\"rinkeby\", 4, { ensNetwork: 4 });\n    registerEth(\"goerli\", 5, { ensNetwork: 5 });\n    registerEth(\"kovan\", 42, { ensNetwork: 42 });\n    registerEth(\"sepolia\", 11155111, { ensNetwork: 11155111 });\n    registerEth(\"holesky\", 17000, { ensNetwork: 17000 });\n    registerEth(\"classic\", 61, {});\n    registerEth(\"classicKotti\", 6, {});\n    registerEth(\"arbitrum\", 42161, {\n        ensNetwork: 1,\n    });\n    registerEth(\"arbitrum-goerli\", 421613, {});\n    registerEth(\"arbitrum-sepolia\", 421614, {});\n    registerEth(\"base\", 8453, { ensNetwork: 1 });\n    registerEth(\"base-goerli\", 84531, {});\n    registerEth(\"base-sepolia\", 84532, {});\n    registerEth(\"bnb\", 56, { ensNetwork: 1 });\n    registerEth(\"bnbt\", 97, {});\n    registerEth(\"linea\", 59144, { ensNetwork: 1 });\n    registerEth(\"linea-goerli\", 59140, {});\n    registerEth(\"linea-sepolia\", 59141, {});\n    registerEth(\"matic\", 137, {\n        ensNetwork: 1,\n        plugins: [\n            getGasStationPlugin(\"https:/\\/gasstation.polygon.technology/v2\")\n        ]\n    });\n    registerEth(\"matic-amoy\", 80002, {});\n    registerEth(\"matic-mumbai\", 80001, {\n        altNames: [\"maticMumbai\", \"maticmum\"],\n        plugins: [\n            getGasStationPlugin(\"https:/\\/gasstation-testnet.polygon.technology/v2\")\n        ]\n    });\n    registerEth(\"optimism\", 10, {\n        ensNetwork: 1,\n        plugins: []\n    });\n    registerEth(\"optimism-goerli\", 420, {});\n    registerEth(\"optimism-sepolia\", 11155420, {});\n    registerEth(\"xdai\", 100, { ensNetwork: 1 });\n}\n//# sourceMappingURL=network.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FetchUrlFeeDataNetworkPlugin = exports.FeeDataNetworkPlugin = exports.EnsPlugin = exports.GasCostPlugin = exports.NetworkPlugin = void 0;\nconst properties_js_1 = require(\"../utils/properties.js\");\nconst index_js_1 = require(\"../utils/index.js\");\nconst EnsAddress = \"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e\";\n/**\n *  A **NetworkPlugin** provides additional functionality on a [[Network]].\n */\nclass NetworkPlugin {\n    /**\n     *  The name of the plugin.\n     *\n     *  It is recommended to use reverse-domain-notation, which permits\n     *  unique names with a known authority as well as hierarchal entries.\n     */\n    name;\n    /**\n     *  Creates a new **NetworkPlugin**.\n     */\n    constructor(name) {\n        (0, properties_js_1.defineProperties)(this, { name });\n    }\n    /**\n     *  Creates a copy of this plugin.\n     */\n    clone() {\n        return new NetworkPlugin(this.name);\n    }\n}\nexports.NetworkPlugin = NetworkPlugin;\n/**\n *  A **GasCostPlugin** allows a network to provide alternative values when\n *  computing the intrinsic gas required for a transaction.\n */\nclass GasCostPlugin extends NetworkPlugin {\n    /**\n     *  The block number to treat these values as valid from.\n     *\n     *  This allows a hardfork to have updated values included as well as\n     *  mulutiple hardforks to be supported.\n     */\n    effectiveBlock;\n    /**\n     *  The transactions base fee.\n     */\n    txBase;\n    /**\n     *  The fee for creating a new account.\n     */\n    txCreate;\n    /**\n     *  The fee per zero-byte in the data.\n     */\n    txDataZero;\n    /**\n     *  The fee per non-zero-byte in the data.\n     */\n    txDataNonzero;\n    /**\n     *  The fee per storage key in the [[link-eip-2930]] access list.\n     */\n    txAccessListStorageKey;\n    /**\n     *  The fee per address in the [[link-eip-2930]] access list.\n     */\n    txAccessListAddress;\n    /**\n     *  Creates a new GasCostPlugin from %%effectiveBlock%% until the\n     *  latest block or another GasCostPlugin supercedes that block number,\n     *  with the associated %%costs%%.\n     */\n    constructor(effectiveBlock, costs) {\n        if (effectiveBlock == null) {\n            effectiveBlock = 0;\n        }\n        super(`org.ethers.network.plugins.GasCost#${(effectiveBlock || 0)}`);\n        const props = { effectiveBlock };\n        function set(name, nullish) {\n            let value = (costs || {})[name];\n            if (value == null) {\n                value = nullish;\n            }\n            (0, index_js_1.assertArgument)(typeof (value) === \"number\", `invalud value for ${name}`, \"costs\", costs);\n            props[name] = value;\n        }\n        set(\"txBase\", 21000);\n        set(\"txCreate\", 32000);\n        set(\"txDataZero\", 4);\n        set(\"txDataNonzero\", 16);\n        set(\"txAccessListStorageKey\", 1900);\n        set(\"txAccessListAddress\", 2400);\n        (0, properties_js_1.defineProperties)(this, props);\n    }\n    clone() {\n        return new GasCostPlugin(this.effectiveBlock, this);\n    }\n}\nexports.GasCostPlugin = GasCostPlugin;\n/**\n *  An **EnsPlugin** allows a [[Network]] to specify the ENS Registry\n *  Contract address and the target network to use when using that\n *  contract.\n *\n *  Various testnets have their own instance of the contract to use, but\n *  in general, the mainnet instance supports multi-chain addresses and\n *  should be used.\n */\nclass EnsPlugin extends NetworkPlugin {\n    /**\n     *  The ENS Registrty Contract address.\n     */\n    address;\n    /**\n     *  The chain ID that the ENS contract lives on.\n     */\n    targetNetwork;\n    /**\n     *  Creates a new **EnsPlugin** connected to %%address%% on the\n     *  %%targetNetwork%%. The default ENS address and mainnet is used\n     *  if unspecified.\n     */\n    constructor(address, targetNetwork) {\n        super(\"org.ethers.plugins.network.Ens\");\n        (0, properties_js_1.defineProperties)(this, {\n            address: (address || EnsAddress),\n            targetNetwork: ((targetNetwork == null) ? 1 : targetNetwork)\n        });\n    }\n    clone() {\n        return new EnsPlugin(this.address, this.targetNetwork);\n    }\n}\nexports.EnsPlugin = EnsPlugin;\n/**\n *  A **FeeDataNetworkPlugin** allows a network to provide and alternate\n *  means to specify its fee data.\n *\n *  For example, a network which does not support [[link-eip-1559]] may\n *  choose to use a Gas Station site to approximate the gas price.\n */\nclass FeeDataNetworkPlugin extends NetworkPlugin {\n    #feeDataFunc;\n    /**\n     *  The fee data function provided to the constructor.\n     */\n    get feeDataFunc() {\n        return this.#feeDataFunc;\n    }\n    /**\n     *  Creates a new **FeeDataNetworkPlugin**.\n     */\n    constructor(feeDataFunc) {\n        super(\"org.ethers.plugins.network.FeeData\");\n        this.#feeDataFunc = feeDataFunc;\n    }\n    /**\n     *  Resolves to the fee data.\n     */\n    async getFeeData(provider) {\n        return await this.#feeDataFunc(provider);\n    }\n    clone() {\n        return new FeeDataNetworkPlugin(this.#feeDataFunc);\n    }\n}\nexports.FeeDataNetworkPlugin = FeeDataNetworkPlugin;\nclass FetchUrlFeeDataNetworkPlugin extends NetworkPlugin {\n    #url;\n    #processFunc;\n    /**\n     *  The URL to initialize the FetchRequest with in %%processFunc%%.\n     */\n    get url() { return this.#url; }\n    /**\n     *  The callback to use when computing the FeeData.\n     */\n    get processFunc() { return this.#processFunc; }\n    /**\n     *  Creates a new **FetchUrlFeeDataNetworkPlugin** which will\n     *  be used when computing the fee data for the network.\n     */\n    constructor(url, processFunc) {\n        super(\"org.ethers.plugins.network.FetchUrlFeeDataPlugin\");\n        this.#url = url;\n        this.#processFunc = processFunc;\n    }\n    // We are immutable, so we can serve as our own clone\n    clone() { return this; }\n}\nexports.FetchUrlFeeDataNetworkPlugin = FetchUrlFeeDataNetworkPlugin;\n/*\nexport class CustomBlockNetworkPlugin extends NetworkPlugin {\n    readonly #blockFunc: (provider: Provider, block: BlockParams<string>) => Block<string>;\n    readonly #blockWithTxsFunc: (provider: Provider, block: BlockParams<TransactionResponseParams>) => Block<TransactionResponse>;\n\n    constructor(blockFunc: (provider: Provider, block: BlockParams<string>) => Block<string>, blockWithTxsFunc: (provider: Provider, block: BlockParams<TransactionResponseParams>) => Block<TransactionResponse>) {\n        super(\"org.ethers.network-plugins.custom-block\");\n        this.#blockFunc = blockFunc;\n        this.#blockWithTxsFunc = blockWithTxsFunc;\n    }\n\n    async getBlock(provider: Provider, block: BlockParams<string>): Promise<Block<string>> {\n        return await this.#blockFunc(provider, block);\n    }\n\n    async getBlockions(provider: Provider, block: BlockParams<TransactionResponseParams>): Promise<Block<TransactionResponse>> {\n        return await this.#blockWithTxsFunc(provider, block);\n    }\n\n    clone(): CustomBlockNetworkPlugin {\n        return new CustomBlockNetworkPlugin(this.#blockFunc, this.#blockWithTxsFunc);\n    }\n}\n*/\n//# sourceMappingURL=plugins-network.js.map","\"use strict\";\n/**\n *  [[link-alchemy]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Sepolia Testnet (``sepolia``)\n *  - Arbitrum (``arbitrum``)\n *  - Arbitrum Goerli Testnet (``arbitrum-goerli``)\n *  - Arbitrum Sepolia Testnet (``arbitrum-sepolia``)\n *  - Base (``base``)\n *  - Base Goerlia Testnet (``base-goerli``)\n *  - Base Sepolia Testnet (``base-sepolia``)\n *  - Optimism (``optimism``)\n *  - Optimism Goerli Testnet (``optimism-goerli``)\n *  - Optimism Sepolia Testnet (``optimism-sepolia``)\n *  - Polygon (``matic``)\n *  - Polygon Amoy Testnet (``matic-amoy``)\n *  - Polygon Mumbai Testnet (``matic-mumbai``)\n *\n *  @_subsection: api/providers/thirdparty:Alchemy  [providers-alchemy]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AlchemyProvider = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst defaultApiKey = \"_gg7wSSi0KMBsdKnGVfHDueq6xMB9EkC\";\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"eth-mainnet.alchemyapi.io\";\n        case \"goerli\":\n            return \"eth-goerli.g.alchemy.com\";\n        case \"sepolia\":\n            return \"eth-sepolia.g.alchemy.com\";\n        case \"arbitrum\":\n            return \"arb-mainnet.g.alchemy.com\";\n        case \"arbitrum-goerli\":\n            return \"arb-goerli.g.alchemy.com\";\n        case \"arbitrum-sepolia\":\n            return \"arb-sepolia.g.alchemy.com\";\n        case \"base\":\n            return \"base-mainnet.g.alchemy.com\";\n        case \"base-goerli\":\n            return \"base-goerli.g.alchemy.com\";\n        case \"base-sepolia\":\n            return \"base-sepolia.g.alchemy.com\";\n        case \"matic\":\n            return \"polygon-mainnet.g.alchemy.com\";\n        case \"matic-amoy\":\n            return \"polygon-amoy.g.alchemy.com\";\n        case \"matic-mumbai\":\n            return \"polygon-mumbai.g.alchemy.com\";\n        case \"optimism\":\n            return \"opt-mainnet.g.alchemy.com\";\n        case \"optimism-goerli\":\n            return \"opt-goerli.g.alchemy.com\";\n        case \"optimism-sepolia\":\n            return \"opt-sepolia.g.alchemy.com\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/**\n *  The **AlchemyProvider** connects to the [[link-alchemy]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-alchemy-signup).\n *\n *  @_docloc: api/providers/thirdparty\n */\nclass AlchemyProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    apiKey;\n    constructor(_network, apiKey) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (apiKey == null) {\n            apiKey = defaultApiKey;\n        }\n        const request = AlchemyProvider.getRequest(network, apiKey);\n        super(request, network, { staticNetwork: network });\n        (0, index_js_1.defineProperties)(this, { apiKey });\n    }\n    _getProvider(chainId) {\n        try {\n            return new AlchemyProvider(chainId, this.apiKey);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    async _perform(req) {\n        // https://docs.alchemy.com/reference/trace-transaction\n        if (req.method === \"getTransactionResult\") {\n            const { trace, tx } = await (0, index_js_1.resolveProperties)({\n                trace: this.send(\"trace_transaction\", [req.hash]),\n                tx: this.getTransaction(req.hash)\n            });\n            if (trace == null || tx == null) {\n                return null;\n            }\n            let data;\n            let error = false;\n            try {\n                data = trace[0].result.output;\n                error = (trace[0].error === \"Reverted\");\n            }\n            catch (error) { }\n            if (data) {\n                (0, index_js_1.assert)(!error, \"an error occurred during transaction executions\", \"CALL_EXCEPTION\", {\n                    action: \"getTransactionResult\",\n                    data,\n                    reason: null,\n                    transaction: tx,\n                    invocation: null,\n                    revert: null // @TODO\n                });\n                return data;\n            }\n            (0, index_js_1.assert)(false, \"could not parse trace result\", \"BAD_DATA\", { value: trace });\n        }\n        return await super._perform(req);\n    }\n    isCommunityResource() {\n        return (this.apiKey === defaultApiKey);\n    }\n    static getRequest(network, apiKey) {\n        if (apiKey == null) {\n            apiKey = defaultApiKey;\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/v2/${apiKey}`);\n        request.allowGzip = true;\n        if (apiKey === defaultApiKey) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"alchemy\");\n                return true;\n            };\n        }\n        return request;\n    }\n}\nexports.AlchemyProvider = AlchemyProvider;\n//# sourceMappingURL=provider-alchemy.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AnkrProvider = void 0;\n/**\n *  [[link-ankr]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Sepolia Testnet (``sepolia``)\n *  - Arbitrum (``arbitrum``)\n *  - Base (``base``)\n *  - Base Goerlia Testnet (``base-goerli``)\n *  - Base Sepolia Testnet (``base-sepolia``)\n *  - BNB (``bnb``)\n *  - BNB Testnet (``bnbt``)\n *  - Optimism (``optimism``)\n *  - Optimism Goerli Testnet (``optimism-goerli``)\n *  - Optimism Sepolia Testnet (``optimism-sepolia``)\n *  - Polygon (``matic``)\n *  - Polygon Mumbai Testnet (``matic-mumbai``)\n *\n *  @_subsection: api/providers/thirdparty:Ankr  [providers-ankr]\n */\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst defaultApiKey = \"9f7d929b018cdffb338517efa06f58359e86ff1ffd350bc889738523659e7972\";\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"rpc.ankr.com/eth\";\n        case \"goerli\":\n            return \"rpc.ankr.com/eth_goerli\";\n        case \"sepolia\":\n            return \"rpc.ankr.com/eth_sepolia\";\n        case \"arbitrum\":\n            return \"rpc.ankr.com/arbitrum\";\n        case \"base\":\n            return \"rpc.ankr.com/base\";\n        case \"base-goerli\":\n            return \"rpc.ankr.com/base_goerli\";\n        case \"base-sepolia\":\n            return \"rpc.ankr.com/base_sepolia\";\n        case \"bnb\":\n            return \"rpc.ankr.com/bsc\";\n        case \"bnbt\":\n            return \"rpc.ankr.com/bsc_testnet_chapel\";\n        case \"matic\":\n            return \"rpc.ankr.com/polygon\";\n        case \"matic-mumbai\":\n            return \"rpc.ankr.com/polygon_mumbai\";\n        case \"optimism\":\n            return \"rpc.ankr.com/optimism\";\n        case \"optimism-goerli\":\n            return \"rpc.ankr.com/optimism_testnet\";\n        case \"optimism-sepolia\":\n            return \"rpc.ankr.com/optimism_sepolia\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/**\n *  The **AnkrProvider** connects to the [[link-ankr]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-ankr-signup).\n */\nclass AnkrProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    /**\n     *  The API key for the Ankr connection.\n     */\n    apiKey;\n    /**\n     *  Create a new **AnkrProvider**.\n     *\n     *  By default connecting to ``mainnet`` with a highly throttled\n     *  API key.\n     */\n    constructor(_network, apiKey) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (apiKey == null) {\n            apiKey = defaultApiKey;\n        }\n        // Ankr does not support filterId, so we force polling\n        const options = { polling: true, staticNetwork: network };\n        const request = AnkrProvider.getRequest(network, apiKey);\n        super(request, network, options);\n        (0, index_js_1.defineProperties)(this, { apiKey });\n    }\n    _getProvider(chainId) {\n        try {\n            return new AnkrProvider(chainId, this.apiKey);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    /**\n     *  Returns a prepared request for connecting to %%network%% with\n     *  %%apiKey%%.\n     */\n    static getRequest(network, apiKey) {\n        if (apiKey == null) {\n            apiKey = defaultApiKey;\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/${apiKey}`);\n        request.allowGzip = true;\n        if (apiKey === defaultApiKey) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"AnkrProvider\");\n                return true;\n            };\n        }\n        return request;\n    }\n    getRpcError(payload, error) {\n        if (payload.method === \"eth_sendRawTransaction\") {\n            if (error && error.error && error.error.message === \"INTERNAL_ERROR: could not replace existing tx\") {\n                error.error.message = \"replacement transaction underpriced\";\n            }\n        }\n        return super.getRpcError(payload, error);\n    }\n    isCommunityResource() {\n        return (this.apiKey === defaultApiKey);\n    }\n}\nexports.AnkrProvider = AnkrProvider;\n//# sourceMappingURL=provider-ankr.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BrowserProvider = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\n;\n/**\n *  A **BrowserProvider** is intended to wrap an injected provider which\n *  adheres to the [[link-eip-1193]] standard, which most (if not all)\n *  currently do.\n */\nclass BrowserProvider extends provider_jsonrpc_js_1.JsonRpcApiPollingProvider {\n    #request;\n    /**\n     *  Connnect to the %%ethereum%% provider, optionally forcing the\n     *  %%network%%.\n     */\n    constructor(ethereum, network, _options) {\n        // Copy the options\n        const options = Object.assign({}, ((_options != null) ? _options : {}), { batchMaxCount: 1 });\n        (0, index_js_1.assertArgument)(ethereum && ethereum.request, \"invalid EIP-1193 provider\", \"ethereum\", ethereum);\n        super(network, options);\n        this.#request = async (method, params) => {\n            const payload = { method, params };\n            this.emit(\"debug\", { action: \"sendEip1193Request\", payload });\n            try {\n                const result = await ethereum.request(payload);\n                this.emit(\"debug\", { action: \"receiveEip1193Result\", result });\n                return result;\n            }\n            catch (e) {\n                const error = new Error(e.message);\n                error.code = e.code;\n                error.data = e.data;\n                error.payload = payload;\n                this.emit(\"debug\", { action: \"receiveEip1193Error\", error });\n                throw error;\n            }\n        };\n    }\n    async send(method, params) {\n        await this._start();\n        return await super.send(method, params);\n    }\n    async _send(payload) {\n        (0, index_js_1.assertArgument)(!Array.isArray(payload), \"EIP-1193 does not support batch request\", \"payload\", payload);\n        try {\n            const result = await this.#request(payload.method, payload.params || []);\n            return [{ id: payload.id, result }];\n        }\n        catch (e) {\n            return [{\n                    id: payload.id,\n                    error: { code: e.code, data: e.data, message: e.message }\n                }];\n        }\n    }\n    getRpcError(payload, error) {\n        error = JSON.parse(JSON.stringify(error));\n        // EIP-1193 gives us some machine-readable error codes, so rewrite\n        // them into \n        switch (error.error.code || -1) {\n            case 4001:\n                error.error.message = `ethers-user-denied: ${error.error.message}`;\n                break;\n            case 4200:\n                error.error.message = `ethers-unsupported: ${error.error.message}`;\n                break;\n        }\n        return super.getRpcError(payload, error);\n    }\n    /**\n     *  Resolves to ``true`` if the provider manages the %%address%%.\n     */\n    async hasSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        const accounts = await this.send(\"eth_accounts\", []);\n        if (typeof (address) === \"number\") {\n            return (accounts.length > address);\n        }\n        address = address.toLowerCase();\n        return accounts.filter((a) => (a.toLowerCase() === address)).length !== 0;\n    }\n    async getSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        if (!(await this.hasSigner(address))) {\n            try {\n                //const resp = \n                await this.#request(\"eth_requestAccounts\", []);\n                //console.log(\"RESP\", resp);\n            }\n            catch (error) {\n                const payload = error.payload;\n                throw this.getRpcError(payload, { id: payload.id, error });\n            }\n        }\n        return await super.getSigner(address);\n    }\n}\nexports.BrowserProvider = BrowserProvider;\n//# sourceMappingURL=provider-browser.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ChainstackProvider = void 0;\n/**\n *  [[link-chainstack]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Arbitrum (``arbitrum``)\n *  - BNB Smart Chain Mainnet (``bnb``)\n *  - Polygon (``matic``)\n *\n *  @_subsection: api/providers/thirdparty:Chainstack  [providers-chainstack]\n */\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nfunction getApiKey(name) {\n    switch (name) {\n        case \"mainnet\": return \"39f1d67cedf8b7831010a665328c9197\";\n        case \"arbitrum\": return \"0550c209db33c3abf4cc927e1e18cea1\";\n        case \"bnb\": return \"98b5a77e531614387366f6fc5da097f8\";\n        case \"matic\": return \"cd9d4d70377471aa7c142ec4a4205249\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"ethereum-mainnet.core.chainstack.com\";\n        case \"arbitrum\":\n            return \"arbitrum-mainnet.core.chainstack.com\";\n        case \"bnb\":\n            return \"bsc-mainnet.core.chainstack.com\";\n        case \"matic\":\n            return \"polygon-mainnet.core.chainstack.com\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/**\n *  The **ChainstackProvider** connects to the [[link-chainstack]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-chainstack).\n */\nclass ChainstackProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    /**\n     *  The API key for the Chainstack connection.\n     */\n    apiKey;\n    /**\n     *  Creates a new **ChainstackProvider**.\n     */\n    constructor(_network, apiKey) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (apiKey == null) {\n            apiKey = getApiKey(network.name);\n        }\n        const request = ChainstackProvider.getRequest(network, apiKey);\n        super(request, network, { staticNetwork: network });\n        (0, index_js_1.defineProperties)(this, { apiKey });\n    }\n    _getProvider(chainId) {\n        try {\n            return new ChainstackProvider(chainId, this.apiKey);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    isCommunityResource() {\n        return (this.apiKey === getApiKey(this._network.name));\n    }\n    /**\n     *  Returns a prepared request for connecting to %%network%%\n     *  with %%apiKey%% and %%projectSecret%%.\n     */\n    static getRequest(network, apiKey) {\n        if (apiKey == null) {\n            apiKey = getApiKey(network.name);\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/${apiKey}`);\n        request.allowGzip = true;\n        if (apiKey === getApiKey(network.name)) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"ChainstackProvider\");\n                return true;\n            };\n        }\n        return request;\n    }\n}\nexports.ChainstackProvider = ChainstackProvider;\n//# sourceMappingURL=provider-chainstack.js.map","\"use strict\";\n/**\n *  About Cloudflare\n *\n *  @_subsection: api/providers/thirdparty:Cloudflare  [providers-cloudflare]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CloudflareProvider = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\n/**\n *  About Cloudflare...\n */\nclass CloudflareProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    constructor(_network) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        (0, index_js_1.assertArgument)(network.name === \"mainnet\", \"unsupported network\", \"network\", _network);\n        super(\"https:/\\/cloudflare-eth.com/\", network, { staticNetwork: network });\n    }\n}\nexports.CloudflareProvider = CloudflareProvider;\n//# sourceMappingURL=provider-cloudflare.js.map","\"use strict\";\n/**\n *  [[link-etherscan]] provides a third-party service for connecting to\n *  various blockchains over a combination of JSON-RPC and custom API\n *  endpoints.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Sepolia Testnet (``sepolia``)\n *  - Holesky Testnet (``holesky``)\n *  - Arbitrum (``arbitrum``)\n *  - Arbitrum Goerli Testnet (``arbitrum-goerli``)\n *  - Base (``base``)\n *  - Base Sepolia Testnet (``base-sepolia``)\n *  - BNB Smart Chain Mainnet (``bnb``)\n *  - BNB Smart Chain Testnet (``bnbt``)\n *  - Optimism (``optimism``)\n *  - Optimism Goerli Testnet (``optimism-goerli``)\n *  - Polygon (``matic``)\n *  - Polygon Mumbai Testnet (``matic-mumbai``)\n *  - Polygon Amoy Testnet (``matic-amoy``)\n *\n *  @_subsection api/providers/thirdparty:Etherscan  [providers-etherscan]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EtherscanProvider = exports.EtherscanPlugin = void 0;\nconst index_js_1 = require(\"../abi/index.js\");\nconst index_js_2 = require(\"../contract/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst abstract_provider_js_1 = require(\"./abstract-provider.js\");\nconst network_js_1 = require(\"./network.js\");\nconst plugins_network_js_1 = require(\"./plugins-network.js\");\nconst community_js_1 = require(\"./community.js\");\nconst THROTTLE = 2000;\nfunction isPromise(value) {\n    return (value && typeof (value.then) === \"function\");\n}\nconst EtherscanPluginId = \"org.ethers.plugins.provider.Etherscan\";\n/**\n *  A Network can include an **EtherscanPlugin** to provide\n *  a custom base URL.\n *\n *  @_docloc: api/providers/thirdparty:Etherscan\n */\nclass EtherscanPlugin extends plugins_network_js_1.NetworkPlugin {\n    /**\n     *  The Etherscan API base URL.\n     */\n    baseUrl;\n    /**\n     *  Creates a new **EtherscanProvider** which will use\n     *  %%baseUrl%%.\n     */\n    constructor(baseUrl) {\n        super(EtherscanPluginId);\n        (0, index_js_4.defineProperties)(this, { baseUrl });\n    }\n    clone() {\n        return new EtherscanPlugin(this.baseUrl);\n    }\n}\nexports.EtherscanPlugin = EtherscanPlugin;\nconst skipKeys = [\"enableCcipRead\"];\nlet nextId = 1;\n/**\n *  The **EtherscanBaseProvider** is the super-class of\n *  [[EtherscanProvider]], which should generally be used instead.\n *\n *  Since the **EtherscanProvider** includes additional code for\n *  [[Contract]] access, in //rare cases// that contracts are not\n *  used, this class can reduce code size.\n *\n *  @_docloc: api/providers/thirdparty:Etherscan\n */\nclass EtherscanProvider extends abstract_provider_js_1.AbstractProvider {\n    /**\n     *  The connected network.\n     */\n    network;\n    /**\n     *  The API key or null if using the community provided bandwidth.\n     */\n    apiKey;\n    #plugin;\n    /**\n     *  Creates a new **EtherscanBaseProvider**.\n     */\n    constructor(_network, _apiKey) {\n        const apiKey = (_apiKey != null) ? _apiKey : null;\n        super();\n        const network = network_js_1.Network.from(_network);\n        this.#plugin = network.getPlugin(EtherscanPluginId);\n        (0, index_js_4.defineProperties)(this, { apiKey, network });\n        // Test that the network is supported by Etherscan\n        this.getBaseUrl();\n    }\n    /**\n     *  Returns the base URL.\n     *\n     *  If an [[EtherscanPlugin]] is configured on the\n     *  [[EtherscanBaseProvider_network]], returns the plugin's\n     *  baseUrl.\n     */\n    getBaseUrl() {\n        if (this.#plugin) {\n            return this.#plugin.baseUrl;\n        }\n        switch (this.network.name) {\n            case \"mainnet\":\n                return \"https:/\\/api.etherscan.io\";\n            case \"goerli\":\n                return \"https:/\\/api-goerli.etherscan.io\";\n            case \"sepolia\":\n                return \"https:/\\/api-sepolia.etherscan.io\";\n            case \"holesky\":\n                return \"https:/\\/api-holesky.etherscan.io\";\n            case \"arbitrum\":\n                return \"https:/\\/api.arbiscan.io\";\n            case \"arbitrum-goerli\":\n                return \"https:/\\/api-goerli.arbiscan.io\";\n            case \"base\":\n                return \"https:/\\/api.basescan.org\";\n            case \"base-sepolia\":\n                return \"https:/\\/api-sepolia.basescan.org\";\n            case \"bnb\":\n                return \"https:/\\/api.bscscan.com\";\n            case \"bnbt\":\n                return \"https:/\\/api-testnet.bscscan.com\";\n            case \"matic\":\n                return \"https:/\\/api.polygonscan.com\";\n            case \"matic-amoy\":\n                return \"https:/\\/api-amoy.polygonscan.com\";\n            case \"matic-mumbai\":\n                return \"https:/\\/api-testnet.polygonscan.com\";\n            case \"optimism\":\n                return \"https:/\\/api-optimistic.etherscan.io\";\n            case \"optimism-goerli\":\n                return \"https:/\\/api-goerli-optimistic.etherscan.io\";\n            default:\n        }\n        (0, index_js_4.assertArgument)(false, \"unsupported network\", \"network\", this.network);\n    }\n    /**\n     *  Returns the URL for the %%module%% and %%params%%.\n     */\n    getUrl(module, params) {\n        const query = Object.keys(params).reduce((accum, key) => {\n            const value = params[key];\n            if (value != null) {\n                accum += `&${key}=${value}`;\n            }\n            return accum;\n        }, \"\");\n        const apiKey = ((this.apiKey) ? `&apikey=${this.apiKey}` : \"\");\n        return `${this.getBaseUrl()}/api?module=${module}${query}${apiKey}`;\n    }\n    /**\n     *  Returns the URL for using POST requests.\n     */\n    getPostUrl() {\n        return `${this.getBaseUrl()}/api`;\n    }\n    /**\n     *  Returns the parameters for using POST requests.\n     */\n    getPostData(module, params) {\n        params.module = module;\n        params.apikey = this.apiKey;\n        return params;\n    }\n    async detectNetwork() {\n        return this.network;\n    }\n    /**\n     *  Resolves to the result of calling %%module%% with %%params%%.\n     *\n     *  If %%post%%, the request is made as a POST request.\n     */\n    async fetch(module, params, post) {\n        const id = nextId++;\n        const url = (post ? this.getPostUrl() : this.getUrl(module, params));\n        const payload = (post ? this.getPostData(module, params) : null);\n        this.emit(\"debug\", { action: \"sendRequest\", id, url, payload: payload });\n        const request = new index_js_4.FetchRequest(url);\n        request.setThrottleParams({ slotInterval: 1000 });\n        request.retryFunc = (req, resp, attempt) => {\n            if (this.isCommunityResource()) {\n                (0, community_js_1.showThrottleMessage)(\"Etherscan\");\n            }\n            return Promise.resolve(true);\n        };\n        request.processFunc = async (request, response) => {\n            const result = response.hasBody() ? JSON.parse((0, index_js_4.toUtf8String)(response.body)) : {};\n            const throttle = ((typeof (result.result) === \"string\") ? result.result : \"\").toLowerCase().indexOf(\"rate limit\") >= 0;\n            if (module === \"proxy\") {\n                // This JSON response indicates we are being throttled\n                if (result && result.status == 0 && result.message == \"NOTOK\" && throttle) {\n                    this.emit(\"debug\", { action: \"receiveError\", id, reason: \"proxy-NOTOK\", error: result });\n                    response.throwThrottleError(result.result, THROTTLE);\n                }\n            }\n            else {\n                if (throttle) {\n                    this.emit(\"debug\", { action: \"receiveError\", id, reason: \"null result\", error: result.result });\n                    response.throwThrottleError(result.result, THROTTLE);\n                }\n            }\n            return response;\n        };\n        if (payload) {\n            request.setHeader(\"content-type\", \"application/x-www-form-urlencoded; charset=UTF-8\");\n            request.body = Object.keys(payload).map((k) => `${k}=${payload[k]}`).join(\"&\");\n        }\n        const response = await request.send();\n        try {\n            response.assertOk();\n        }\n        catch (error) {\n            this.emit(\"debug\", { action: \"receiveError\", id, error, reason: \"assertOk\" });\n            (0, index_js_4.assert)(false, \"response error\", \"SERVER_ERROR\", { request, response });\n        }\n        if (!response.hasBody()) {\n            this.emit(\"debug\", { action: \"receiveError\", id, error: \"missing body\", reason: \"null body\" });\n            (0, index_js_4.assert)(false, \"missing response\", \"SERVER_ERROR\", { request, response });\n        }\n        const result = JSON.parse((0, index_js_4.toUtf8String)(response.body));\n        if (module === \"proxy\") {\n            if (result.jsonrpc != \"2.0\") {\n                this.emit(\"debug\", { action: \"receiveError\", id, result, reason: \"invalid JSON-RPC\" });\n                (0, index_js_4.assert)(false, \"invalid JSON-RPC response (missing jsonrpc='2.0')\", \"SERVER_ERROR\", { request, response, info: { result } });\n            }\n            if (result.error) {\n                this.emit(\"debug\", { action: \"receiveError\", id, result, reason: \"JSON-RPC error\" });\n                (0, index_js_4.assert)(false, \"error response\", \"SERVER_ERROR\", { request, response, info: { result } });\n            }\n            this.emit(\"debug\", { action: \"receiveRequest\", id, result });\n            return result.result;\n        }\n        else {\n            // getLogs, getHistory have weird success responses\n            if (result.status == 0 && (result.message === \"No records found\" || result.message === \"No transactions found\")) {\n                this.emit(\"debug\", { action: \"receiveRequest\", id, result });\n                return result.result;\n            }\n            if (result.status != 1 || (typeof (result.message) === \"string\" && !result.message.match(/^OK/))) {\n                this.emit(\"debug\", { action: \"receiveError\", id, result });\n                (0, index_js_4.assert)(false, \"error response\", \"SERVER_ERROR\", { request, response, info: { result } });\n            }\n            this.emit(\"debug\", { action: \"receiveRequest\", id, result });\n            return result.result;\n        }\n    }\n    /**\n     *  Returns %%transaction%% normalized for the Etherscan API.\n     */\n    _getTransactionPostData(transaction) {\n        const result = {};\n        for (let key in transaction) {\n            if (skipKeys.indexOf(key) >= 0) {\n                continue;\n            }\n            if (transaction[key] == null) {\n                continue;\n            }\n            let value = transaction[key];\n            if (key === \"type\" && value === 0) {\n                continue;\n            }\n            if (key === \"blockTag\" && value === \"latest\") {\n                continue;\n            }\n            // Quantity-types require no leading zero, unless 0\n            if ({ type: true, gasLimit: true, gasPrice: true, maxFeePerGs: true, maxPriorityFeePerGas: true, nonce: true, value: true }[key]) {\n                value = (0, index_js_4.toQuantity)(value);\n            }\n            else if (key === \"accessList\") {\n                value = \"[\" + (0, index_js_3.accessListify)(value).map((set) => {\n                    return `{address:\"${set.address}\",storageKeys:[\"${set.storageKeys.join('\",\"')}\"]}`;\n                }).join(\",\") + \"]\";\n            }\n            else if (key === \"blobVersionedHashes\") {\n                if (value.length === 0) {\n                    continue;\n                }\n                // @TODO: update this once the API supports blobs\n                (0, index_js_4.assert)(false, \"Etherscan API does not support blobVersionedHashes\", \"UNSUPPORTED_OPERATION\", {\n                    operation: \"_getTransactionPostData\",\n                    info: { transaction }\n                });\n            }\n            else {\n                value = (0, index_js_4.hexlify)(value);\n            }\n            result[key] = value;\n        }\n        return result;\n    }\n    /**\n     *  Throws the normalized Etherscan error.\n     */\n    _checkError(req, error, transaction) {\n        // Pull any message out if, possible\n        let message = \"\";\n        if ((0, index_js_4.isError)(error, \"SERVER_ERROR\")) {\n            // Check for an error emitted by a proxy call\n            try {\n                message = error.info.result.error.message;\n            }\n            catch (e) { }\n            if (!message) {\n                try {\n                    message = error.info.message;\n                }\n                catch (e) { }\n            }\n        }\n        if (req.method === \"estimateGas\") {\n            if (!message.match(/revert/i) && message.match(/insufficient funds/i)) {\n                (0, index_js_4.assert)(false, \"insufficient funds\", \"INSUFFICIENT_FUNDS\", {\n                    transaction: req.transaction\n                });\n            }\n        }\n        if (req.method === \"call\" || req.method === \"estimateGas\") {\n            if (message.match(/execution reverted/i)) {\n                let data = \"\";\n                try {\n                    data = error.info.result.error.data;\n                }\n                catch (error) { }\n                const e = index_js_1.AbiCoder.getBuiltinCallException(req.method, req.transaction, data);\n                e.info = { request: req, error };\n                throw e;\n            }\n        }\n        if (message) {\n            if (req.method === \"broadcastTransaction\") {\n                const transaction = index_js_3.Transaction.from(req.signedTransaction);\n                if (message.match(/replacement/i) && message.match(/underpriced/i)) {\n                    (0, index_js_4.assert)(false, \"replacement fee too low\", \"REPLACEMENT_UNDERPRICED\", {\n                        transaction\n                    });\n                }\n                if (message.match(/insufficient funds/)) {\n                    (0, index_js_4.assert)(false, \"insufficient funds for intrinsic transaction cost\", \"INSUFFICIENT_FUNDS\", {\n                        transaction\n                    });\n                }\n                if (message.match(/same hash was already imported|transaction nonce is too low|nonce too low/)) {\n                    (0, index_js_4.assert)(false, \"nonce has already been used\", \"NONCE_EXPIRED\", {\n                        transaction\n                    });\n                }\n            }\n        }\n        // Something we could not process\n        throw error;\n    }\n    async _detectNetwork() {\n        return this.network;\n    }\n    async _perform(req) {\n        switch (req.method) {\n            case \"chainId\":\n                return this.network.chainId;\n            case \"getBlockNumber\":\n                return this.fetch(\"proxy\", { action: \"eth_blockNumber\" });\n            case \"getGasPrice\":\n                return this.fetch(\"proxy\", { action: \"eth_gasPrice\" });\n            case \"getPriorityFee\":\n                // This is temporary until Etherscan completes support\n                if (this.network.name === \"mainnet\") {\n                    return \"1000000000\";\n                }\n                else if (this.network.name === \"optimism\") {\n                    return \"1000000\";\n                }\n                else {\n                    throw new Error(\"fallback onto the AbstractProvider default\");\n                }\n            /* Working with Etherscan to get this added:\n            try {\n                const test = await this.fetch(\"proxy\", {\n                    action: \"eth_maxPriorityFeePerGas\"\n                });\n                console.log(test);\n                return test;\n            } catch (e) {\n                console.log(\"DEBUG\", e);\n                throw e;\n            }\n            */\n            /* This might be safe; but due to rounding neither myself\n               or Etherscan are necessarily comfortable with this. :)\n            try {\n                const result = await this.fetch(\"gastracker\", { action: \"gasoracle\" });\n                console.log(result);\n                const gasPrice = parseUnits(result.SafeGasPrice, \"gwei\");\n                const baseFee = parseUnits(result.suggestBaseFee, \"gwei\");\n                const priorityFee = gasPrice - baseFee;\n                if (priorityFee < 0) { throw new Error(\"negative priority fee; defer to abstract provider default\"); }\n                return priorityFee;\n            } catch (error) {\n                console.log(\"DEBUG\", error);\n                throw error;\n            }\n            */\n            case \"getBalance\":\n                // Returns base-10 result\n                return this.fetch(\"account\", {\n                    action: \"balance\",\n                    address: req.address,\n                    tag: req.blockTag\n                });\n            case \"getTransactionCount\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_getTransactionCount\",\n                    address: req.address,\n                    tag: req.blockTag\n                });\n            case \"getCode\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_getCode\",\n                    address: req.address,\n                    tag: req.blockTag\n                });\n            case \"getStorage\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_getStorageAt\",\n                    address: req.address,\n                    position: req.position,\n                    tag: req.blockTag\n                });\n            case \"broadcastTransaction\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_sendRawTransaction\",\n                    hex: req.signedTransaction\n                }, true).catch((error) => {\n                    return this._checkError(req, error, req.signedTransaction);\n                });\n            case \"getBlock\":\n                if (\"blockTag\" in req) {\n                    return this.fetch(\"proxy\", {\n                        action: \"eth_getBlockByNumber\",\n                        tag: req.blockTag,\n                        boolean: (req.includeTransactions ? \"true\" : \"false\")\n                    });\n                }\n                (0, index_js_4.assert)(false, \"getBlock by blockHash not supported by Etherscan\", \"UNSUPPORTED_OPERATION\", {\n                    operation: \"getBlock(blockHash)\"\n                });\n            case \"getTransaction\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_getTransactionByHash\",\n                    txhash: req.hash\n                });\n            case \"getTransactionReceipt\":\n                return this.fetch(\"proxy\", {\n                    action: \"eth_getTransactionReceipt\",\n                    txhash: req.hash\n                });\n            case \"call\": {\n                if (req.blockTag !== \"latest\") {\n                    throw new Error(\"EtherscanProvider does not support blockTag for call\");\n                }\n                const postData = this._getTransactionPostData(req.transaction);\n                postData.module = \"proxy\";\n                postData.action = \"eth_call\";\n                try {\n                    return await this.fetch(\"proxy\", postData, true);\n                }\n                catch (error) {\n                    return this._checkError(req, error, req.transaction);\n                }\n            }\n            case \"estimateGas\": {\n                const postData = this._getTransactionPostData(req.transaction);\n                postData.module = \"proxy\";\n                postData.action = \"eth_estimateGas\";\n                try {\n                    return await this.fetch(\"proxy\", postData, true);\n                }\n                catch (error) {\n                    return this._checkError(req, error, req.transaction);\n                }\n            }\n            /*\n                        case \"getLogs\": {\n                            // Needs to complain if more than one address is passed in\n                            const args: Record<string, any> = { action: \"getLogs\" }\n            \n                            if (params.filter.fromBlock) {\n                                args.fromBlock = checkLogTag(params.filter.fromBlock);\n                            }\n            \n                            if (params.filter.toBlock) {\n                                args.toBlock = checkLogTag(params.filter.toBlock);\n                            }\n            \n                            if (params.filter.address) {\n                                args.address = params.filter.address;\n                            }\n            \n                            // @TODO: We can handle slightly more complicated logs using the logs API\n                            if (params.filter.topics && params.filter.topics.length > 0) {\n                                if (params.filter.topics.length > 1) {\n                                    logger.throwError(\"unsupported topic count\", Logger.Errors.UNSUPPORTED_OPERATION, { topics: params.filter.topics });\n                                }\n                                if (params.filter.topics.length === 1) {\n                                    const topic0 = params.filter.topics[0];\n                                    if (typeof(topic0) !== \"string\" || topic0.length !== 66) {\n                                        logger.throwError(\"unsupported topic format\", Logger.Errors.UNSUPPORTED_OPERATION, { topic0: topic0 });\n                                    }\n                                    args.topic0 = topic0;\n                                }\n                            }\n            \n                            const logs: Array<any> = await this.fetch(\"logs\", args);\n            \n                            // Cache txHash => blockHash\n                            let blocks: { [tag: string]: string } = {};\n            \n                            // Add any missing blockHash to the logs\n                            for (let i = 0; i < logs.length; i++) {\n                                const log = logs[i];\n                                if (log.blockHash != null) { continue; }\n                                if (blocks[log.blockNumber] == null) {\n                                    const block = await this.getBlock(log.blockNumber);\n                                    if (block) {\n                                        blocks[log.blockNumber] = block.hash;\n                                    }\n                                }\n            \n                                log.blockHash = blocks[log.blockNumber];\n                            }\n            \n                            return logs;\n                        }\n            */\n            default:\n                break;\n        }\n        return super._perform(req);\n    }\n    async getNetwork() {\n        return this.network;\n    }\n    /**\n     *  Resolves to the current price of ether.\n     *\n     *  This returns ``0`` on any network other than ``mainnet``.\n     */\n    async getEtherPrice() {\n        if (this.network.name !== \"mainnet\") {\n            return 0.0;\n        }\n        return parseFloat((await this.fetch(\"stats\", { action: \"ethprice\" })).ethusd);\n    }\n    /**\n     *  Resolves to a [Contract]] for %%address%%, using the\n     *  Etherscan API to retreive the Contract ABI.\n     */\n    async getContract(_address) {\n        let address = this._getAddress(_address);\n        if (isPromise(address)) {\n            address = await address;\n        }\n        try {\n            const resp = await this.fetch(\"contract\", {\n                action: \"getabi\", address\n            });\n            const abi = JSON.parse(resp);\n            return new index_js_2.Contract(address, abi, this);\n        }\n        catch (error) {\n            return null;\n        }\n    }\n    isCommunityResource() {\n        return (this.apiKey == null);\n    }\n}\nexports.EtherscanProvider = EtherscanProvider;\n//# sourceMappingURL=provider-etherscan.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FallbackProvider = void 0;\n/**\n *  A **FallbackProvider** provides resilience, security and performance\n *  in a way that is customizable and configurable.\n *\n *  @_section: api/providers/fallback-provider:Fallback Provider [about-fallback-provider]\n */\nconst index_js_1 = require(\"../utils/index.js\");\nconst abstract_provider_js_1 = require(\"./abstract-provider.js\");\nconst network_js_1 = require(\"./network.js\");\nconst BN_1 = BigInt(\"1\");\nconst BN_2 = BigInt(\"2\");\nfunction shuffle(array) {\n    for (let i = array.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        const tmp = array[i];\n        array[i] = array[j];\n        array[j] = tmp;\n    }\n}\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(resolve, duration); });\n}\nfunction getTime() { return (new Date()).getTime(); }\nfunction stringify(value) {\n    return JSON.stringify(value, (key, value) => {\n        if (typeof (value) === \"bigint\") {\n            return { type: \"bigint\", value: value.toString() };\n        }\n        return value;\n    });\n}\n;\nconst defaultConfig = { stallTimeout: 400, priority: 1, weight: 1 };\nconst defaultState = {\n    blockNumber: -2, requests: 0, lateResponses: 0, errorResponses: 0,\n    outOfSync: -1, unsupportedEvents: 0, rollingDuration: 0, score: 0,\n    _network: null, _updateNumber: null, _totalTime: 0,\n    _lastFatalError: null, _lastFatalErrorTimestamp: 0\n};\nasync function waitForSync(config, blockNumber) {\n    while (config.blockNumber < 0 || config.blockNumber < blockNumber) {\n        if (!config._updateNumber) {\n            config._updateNumber = (async () => {\n                try {\n                    const blockNumber = await config.provider.getBlockNumber();\n                    if (blockNumber > config.blockNumber) {\n                        config.blockNumber = blockNumber;\n                    }\n                }\n                catch (error) {\n                    config.blockNumber = -2;\n                    config._lastFatalError = error;\n                    config._lastFatalErrorTimestamp = getTime();\n                }\n                config._updateNumber = null;\n            })();\n        }\n        await config._updateNumber;\n        config.outOfSync++;\n        if (config._lastFatalError) {\n            break;\n        }\n    }\n}\nfunction _normalize(value) {\n    if (value == null) {\n        return \"null\";\n    }\n    if (Array.isArray(value)) {\n        return \"[\" + (value.map(_normalize)).join(\",\") + \"]\";\n    }\n    if (typeof (value) === \"object\" && typeof (value.toJSON) === \"function\") {\n        return _normalize(value.toJSON());\n    }\n    switch (typeof (value)) {\n        case \"boolean\":\n        case \"symbol\":\n            return value.toString();\n        case \"bigint\":\n        case \"number\":\n            return BigInt(value).toString();\n        case \"string\":\n            return JSON.stringify(value);\n        case \"object\": {\n            const keys = Object.keys(value);\n            keys.sort();\n            return \"{\" + keys.map((k) => `${JSON.stringify(k)}:${_normalize(value[k])}`).join(\",\") + \"}\";\n        }\n    }\n    console.log(\"Could not serialize\", value);\n    throw new Error(\"Hmm...\");\n}\nfunction normalizeResult(value) {\n    if (\"error\" in value) {\n        const error = value.error;\n        return { tag: _normalize(error), value: error };\n    }\n    const result = value.result;\n    return { tag: _normalize(result), value: result };\n}\n// This strategy picks the highest weight result, as long as the weight is\n// equal to or greater than quorum\nfunction checkQuorum(quorum, results) {\n    const tally = new Map();\n    for (const { value, tag, weight } of results) {\n        const t = tally.get(tag) || { value, weight: 0 };\n        t.weight += weight;\n        tally.set(tag, t);\n    }\n    let best = null;\n    for (const r of tally.values()) {\n        if (r.weight >= quorum && (!best || r.weight > best.weight)) {\n            best = r;\n        }\n    }\n    if (best) {\n        return best.value;\n    }\n    return undefined;\n}\nfunction getMedian(quorum, results) {\n    let resultWeight = 0;\n    const errorMap = new Map();\n    let bestError = null;\n    const values = [];\n    for (const { value, tag, weight } of results) {\n        if (value instanceof Error) {\n            const e = errorMap.get(tag) || { value, weight: 0 };\n            e.weight += weight;\n            errorMap.set(tag, e);\n            if (bestError == null || e.weight > bestError.weight) {\n                bestError = e;\n            }\n        }\n        else {\n            values.push(BigInt(value));\n            resultWeight += weight;\n        }\n    }\n    if (resultWeight < quorum) {\n        // We have quorum for an error\n        if (bestError && bestError.weight >= quorum) {\n            return bestError.value;\n        }\n        // We do not have quorum for a result\n        return undefined;\n    }\n    // Get the sorted values\n    values.sort((a, b) => ((a < b) ? -1 : (b > a) ? 1 : 0));\n    const mid = Math.floor(values.length / 2);\n    // Odd-length; take the middle value\n    if (values.length % 2) {\n        return values[mid];\n    }\n    // Even length; take the ceiling of the mean of the center two values\n    return (values[mid - 1] + values[mid] + BN_1) / BN_2;\n}\nfunction getAnyResult(quorum, results) {\n    // If any value or error meets quorum, that is our preferred result\n    const result = checkQuorum(quorum, results);\n    if (result !== undefined) {\n        return result;\n    }\n    // Otherwise, do we have any result?\n    for (const r of results) {\n        if (r.value) {\n            return r.value;\n        }\n    }\n    // Nope!\n    return undefined;\n}\nfunction getFuzzyMode(quorum, results) {\n    if (quorum === 1) {\n        return (0, index_js_1.getNumber)(getMedian(quorum, results), \"%internal\");\n    }\n    const tally = new Map();\n    const add = (result, weight) => {\n        const t = tally.get(result) || { result, weight: 0 };\n        t.weight += weight;\n        tally.set(result, t);\n    };\n    for (const { weight, value } of results) {\n        const r = (0, index_js_1.getNumber)(value);\n        add(r - 1, weight);\n        add(r, weight);\n        add(r + 1, weight);\n    }\n    let bestWeight = 0;\n    let bestResult = undefined;\n    for (const { weight, result } of tally.values()) {\n        // Use this result, if this result meets quorum and has either:\n        // - a better weight\n        // - or equal weight, but the result is larger\n        if (weight >= quorum && (weight > bestWeight || (bestResult != null && weight === bestWeight && result > bestResult))) {\n            bestWeight = weight;\n            bestResult = result;\n        }\n    }\n    return bestResult;\n}\n/**\n *  A **FallbackProvider** manages several [[Providers]] providing\n *  resilience by switching between slow or misbehaving nodes, security\n *  by requiring multiple backends to aggree and performance by allowing\n *  faster backends to respond earlier.\n *\n */\nclass FallbackProvider extends abstract_provider_js_1.AbstractProvider {\n    /**\n     *  The number of backends that must agree on a value before it is\n     *  accpeted.\n     */\n    quorum;\n    /**\n     *  @_ignore:\n     */\n    eventQuorum;\n    /**\n     *  @_ignore:\n     */\n    eventWorkers;\n    #configs;\n    #height;\n    #initialSyncPromise;\n    /**\n     *  Creates a new **FallbackProvider** with %%providers%% connected to\n     *  %%network%%.\n     *\n     *  If a [[Provider]] is included in %%providers%%, defaults are used\n     *  for the configuration.\n     */\n    constructor(providers, network, options) {\n        super(network, options);\n        this.#configs = providers.map((p) => {\n            if (p instanceof abstract_provider_js_1.AbstractProvider) {\n                return Object.assign({ provider: p }, defaultConfig, defaultState);\n            }\n            else {\n                return Object.assign({}, defaultConfig, p, defaultState);\n            }\n        });\n        this.#height = -2;\n        this.#initialSyncPromise = null;\n        if (options && options.quorum != null) {\n            this.quorum = options.quorum;\n        }\n        else {\n            this.quorum = Math.ceil(this.#configs.reduce((accum, config) => {\n                accum += config.weight;\n                return accum;\n            }, 0) / 2);\n        }\n        this.eventQuorum = 1;\n        this.eventWorkers = 1;\n        (0, index_js_1.assertArgument)(this.quorum <= this.#configs.reduce((a, c) => (a + c.weight), 0), \"quorum exceed provider weight\", \"quorum\", this.quorum);\n    }\n    get providerConfigs() {\n        return this.#configs.map((c) => {\n            const result = Object.assign({}, c);\n            for (const key in result) {\n                if (key[0] === \"_\") {\n                    delete result[key];\n                }\n            }\n            return result;\n        });\n    }\n    async _detectNetwork() {\n        return network_js_1.Network.from((0, index_js_1.getBigInt)(await this._perform({ method: \"chainId\" })));\n    }\n    // @TODO: Add support to select providers to be the event subscriber\n    //_getSubscriber(sub: Subscription): Subscriber {\n    //    throw new Error(\"@TODO\");\n    //}\n    /**\n     *  Transforms a %%req%% into the correct method call on %%provider%%.\n     */\n    async _translatePerform(provider, req) {\n        switch (req.method) {\n            case \"broadcastTransaction\":\n                return await provider.broadcastTransaction(req.signedTransaction);\n            case \"call\":\n                return await provider.call(Object.assign({}, req.transaction, { blockTag: req.blockTag }));\n            case \"chainId\":\n                return (await provider.getNetwork()).chainId;\n            case \"estimateGas\":\n                return await provider.estimateGas(req.transaction);\n            case \"getBalance\":\n                return await provider.getBalance(req.address, req.blockTag);\n            case \"getBlock\": {\n                const block = (\"blockHash\" in req) ? req.blockHash : req.blockTag;\n                return await provider.getBlock(block, req.includeTransactions);\n            }\n            case \"getBlockNumber\":\n                return await provider.getBlockNumber();\n            case \"getCode\":\n                return await provider.getCode(req.address, req.blockTag);\n            case \"getGasPrice\":\n                return (await provider.getFeeData()).gasPrice;\n            case \"getPriorityFee\":\n                return (await provider.getFeeData()).maxPriorityFeePerGas;\n            case \"getLogs\":\n                return await provider.getLogs(req.filter);\n            case \"getStorage\":\n                return await provider.getStorage(req.address, req.position, req.blockTag);\n            case \"getTransaction\":\n                return await provider.getTransaction(req.hash);\n            case \"getTransactionCount\":\n                return await provider.getTransactionCount(req.address, req.blockTag);\n            case \"getTransactionReceipt\":\n                return await provider.getTransactionReceipt(req.hash);\n            case \"getTransactionResult\":\n                return await provider.getTransactionResult(req.hash);\n        }\n    }\n    // Grab the next (random) config that is not already part of\n    // the running set\n    #getNextConfig(running) {\n        // @TODO: Maybe do a check here to favour (heavily) providers that\n        //        do not require waitForSync and disfavour providers that\n        //        seem down-ish or are behaving slowly\n        const configs = Array.from(running).map((r) => r.config);\n        // Shuffle the states, sorted by priority\n        const allConfigs = this.#configs.slice();\n        shuffle(allConfigs);\n        allConfigs.sort((a, b) => (a.priority - b.priority));\n        for (const config of allConfigs) {\n            if (config._lastFatalError) {\n                continue;\n            }\n            if (configs.indexOf(config) === -1) {\n                return config;\n            }\n        }\n        return null;\n    }\n    // Adds a new runner (if available) to running.\n    #addRunner(running, req) {\n        const config = this.#getNextConfig(running);\n        // No runners available\n        if (config == null) {\n            return null;\n        }\n        // Create a new runner\n        const runner = {\n            config, result: null, didBump: false,\n            perform: null, staller: null\n        };\n        const now = getTime();\n        // Start performing this operation\n        runner.perform = (async () => {\n            try {\n                config.requests++;\n                const result = await this._translatePerform(config.provider, req);\n                runner.result = { result };\n            }\n            catch (error) {\n                config.errorResponses++;\n                runner.result = { error };\n            }\n            const dt = (getTime() - now);\n            config._totalTime += dt;\n            config.rollingDuration = 0.95 * config.rollingDuration + 0.05 * dt;\n            runner.perform = null;\n        })();\n        // Start a staller; when this times out, it's time to force\n        // kicking off another runner because we are taking too long\n        runner.staller = (async () => {\n            await stall(config.stallTimeout);\n            runner.staller = null;\n        })();\n        running.add(runner);\n        return runner;\n    }\n    // Initializes the blockNumber and network for each runner and\n    // blocks until initialized\n    async #initialSync() {\n        let initialSync = this.#initialSyncPromise;\n        if (!initialSync) {\n            const promises = [];\n            this.#configs.forEach((config) => {\n                promises.push((async () => {\n                    await waitForSync(config, 0);\n                    if (!config._lastFatalError) {\n                        config._network = await config.provider.getNetwork();\n                    }\n                })());\n            });\n            this.#initialSyncPromise = initialSync = (async () => {\n                // Wait for all providers to have a block number and network\n                await Promise.all(promises);\n                // Check all the networks match\n                let chainId = null;\n                for (const config of this.#configs) {\n                    if (config._lastFatalError) {\n                        continue;\n                    }\n                    const network = (config._network);\n                    if (chainId == null) {\n                        chainId = network.chainId;\n                    }\n                    else if (network.chainId !== chainId) {\n                        (0, index_js_1.assert)(false, \"cannot mix providers on different networks\", \"UNSUPPORTED_OPERATION\", {\n                            operation: \"new FallbackProvider\"\n                        });\n                    }\n                }\n            })();\n        }\n        await initialSync;\n    }\n    async #checkQuorum(running, req) {\n        // Get all the result objects\n        const results = [];\n        for (const runner of running) {\n            if (runner.result != null) {\n                const { tag, value } = normalizeResult(runner.result);\n                results.push({ tag, value, weight: runner.config.weight });\n            }\n        }\n        // Are there enough results to event meet quorum?\n        if (results.reduce((a, r) => (a + r.weight), 0) < this.quorum) {\n            return undefined;\n        }\n        switch (req.method) {\n            case \"getBlockNumber\": {\n                // We need to get the bootstrap block height\n                if (this.#height === -2) {\n                    this.#height = Math.ceil((0, index_js_1.getNumber)(getMedian(this.quorum, this.#configs.filter((c) => (!c._lastFatalError)).map((c) => ({\n                        value: c.blockNumber,\n                        tag: (0, index_js_1.getNumber)(c.blockNumber).toString(),\n                        weight: c.weight\n                    })))));\n                }\n                // Find the mode across all the providers, allowing for\n                // a little drift between block heights\n                const mode = getFuzzyMode(this.quorum, results);\n                if (mode === undefined) {\n                    return undefined;\n                }\n                if (mode > this.#height) {\n                    this.#height = mode;\n                }\n                return this.#height;\n            }\n            case \"getGasPrice\":\n            case \"getPriorityFee\":\n            case \"estimateGas\":\n                return getMedian(this.quorum, results);\n            case \"getBlock\":\n                // Pending blocks are in the mempool and already\n                // quite untrustworthy; just grab anything\n                if (\"blockTag\" in req && req.blockTag === \"pending\") {\n                    return getAnyResult(this.quorum, results);\n                }\n                return checkQuorum(this.quorum, results);\n            case \"call\":\n            case \"chainId\":\n            case \"getBalance\":\n            case \"getTransactionCount\":\n            case \"getCode\":\n            case \"getStorage\":\n            case \"getTransaction\":\n            case \"getTransactionReceipt\":\n            case \"getLogs\":\n                return checkQuorum(this.quorum, results);\n            case \"broadcastTransaction\":\n                return getAnyResult(this.quorum, results);\n        }\n        (0, index_js_1.assert)(false, \"unsupported method\", \"UNSUPPORTED_OPERATION\", {\n            operation: `_perform(${stringify(req.method)})`\n        });\n    }\n    async #waitForQuorum(running, req) {\n        if (running.size === 0) {\n            throw new Error(\"no runners?!\");\n        }\n        // Any promises that are interesting to watch for; an expired stall\n        // or a successful perform\n        const interesting = [];\n        let newRunners = 0;\n        for (const runner of running) {\n            // No responses, yet; keep an eye on it\n            if (runner.perform) {\n                interesting.push(runner.perform);\n            }\n            // Still stalling...\n            if (runner.staller) {\n                interesting.push(runner.staller);\n                continue;\n            }\n            // This runner has already triggered another runner\n            if (runner.didBump) {\n                continue;\n            }\n            // Got a response (result or error) or stalled; kick off another runner\n            runner.didBump = true;\n            newRunners++;\n        }\n        // Check if we have reached quorum on a result (or error)\n        const value = await this.#checkQuorum(running, req);\n        if (value !== undefined) {\n            if (value instanceof Error) {\n                throw value;\n            }\n            return value;\n        }\n        // Add any new runners, because a staller timed out or a result\n        // or error response came in.\n        for (let i = 0; i < newRunners; i++) {\n            this.#addRunner(running, req);\n        }\n        // All providers have returned, and we have no result\n        (0, index_js_1.assert)(interesting.length > 0, \"quorum not met\", \"SERVER_ERROR\", {\n            request: \"%sub-requests\",\n            info: { request: req, results: Array.from(running).map((r) => stringify(r.result)) }\n        });\n        // Wait for someone to either complete its perform or stall out\n        await Promise.race(interesting);\n        // This is recursive, but at worst case the depth is 2x the\n        // number of providers (each has a perform and a staller)\n        return await this.#waitForQuorum(running, req);\n    }\n    async _perform(req) {\n        // Broadcasting a transaction is rare (ish) and already incurs\n        // a cost on the user, so spamming is safe-ish. Just send it to\n        // every backend.\n        if (req.method === \"broadcastTransaction\") {\n            // Once any broadcast provides a positive result, use it. No\n            // need to wait for anyone else\n            const results = this.#configs.map((c) => null);\n            const broadcasts = this.#configs.map(async ({ provider, weight }, index) => {\n                try {\n                    const result = await provider._perform(req);\n                    results[index] = Object.assign(normalizeResult({ result }), { weight });\n                }\n                catch (error) {\n                    results[index] = Object.assign(normalizeResult({ error }), { weight });\n                }\n            });\n            // As each promise finishes...\n            while (true) {\n                // Check for a valid broadcast result\n                const done = results.filter((r) => (r != null));\n                for (const { value } of done) {\n                    if (!(value instanceof Error)) {\n                        return value;\n                    }\n                }\n                // Check for a legit broadcast error (one which we cannot\n                // recover from; some nodes may return the following red\n                // herring events:\n                // - alredy seend (UNKNOWN_ERROR)\n                // - NONCE_EXPIRED\n                // - REPLACEMENT_UNDERPRICED\n                const result = checkQuorum(this.quorum, results.filter((r) => (r != null)));\n                if ((0, index_js_1.isError)(result, \"INSUFFICIENT_FUNDS\")) {\n                    throw result;\n                }\n                // Kick off the next provider (if any)\n                const waiting = broadcasts.filter((b, i) => (results[i] == null));\n                if (waiting.length === 0) {\n                    break;\n                }\n                await Promise.race(waiting);\n            }\n            // Use standard quorum results; any result was returned above,\n            // so this will find any error that met quorum if any\n            const result = getAnyResult(this.quorum, results);\n            (0, index_js_1.assert)(result !== undefined, \"problem multi-broadcasting\", \"SERVER_ERROR\", {\n                request: \"%sub-requests\",\n                info: { request: req, results: results.map(stringify) }\n            });\n            if (result instanceof Error) {\n                throw result;\n            }\n            return result;\n        }\n        await this.#initialSync();\n        // Bootstrap enough runners to meet quorum\n        const running = new Set();\n        let inflightQuorum = 0;\n        while (true) {\n            const runner = this.#addRunner(running, req);\n            if (runner == null) {\n                break;\n            }\n            inflightQuorum += runner.config.weight;\n            if (inflightQuorum >= this.quorum) {\n                break;\n            }\n        }\n        const result = await this.#waitForQuorum(running, req);\n        // Track requests sent to a provider that are still\n        // outstanding after quorum has been otherwise found\n        for (const runner of running) {\n            if (runner.perform && runner.result == null) {\n                runner.config.lateResponses++;\n            }\n        }\n        return result;\n    }\n    async destroy() {\n        for (const { provider } of this.#configs) {\n            provider.destroy();\n        }\n        super.destroy();\n    }\n}\nexports.FallbackProvider = FallbackProvider;\n//# sourceMappingURL=provider-fallback.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InfuraProvider = exports.InfuraWebSocketProvider = void 0;\n/**\n *  [[link-infura]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Sepolia Testnet (``sepolia``)\n *  - Arbitrum (``arbitrum``)\n *  - Arbitrum Goerli Testnet (``arbitrum-goerli``)\n *  - Arbitrum Sepolia Testnet (``arbitrum-sepolia``)\n *  - Base (``base``)\n *  - Base Goerlia Testnet (``base-goerli``)\n *  - Base Sepolia Testnet (``base-sepolia``)\n *  - BNB Smart Chain Mainnet (``bnb``)\n *  - BNB Smart Chain Testnet (``bnbt``)\n *  - Linea (``linea``)\n *  - Linea Goerli Testnet (``linea-goerli``)\n *  - Linea Sepolia Testnet (``linea-sepolia``)\n *  - Optimism (``optimism``)\n *  - Optimism Goerli Testnet (``optimism-goerli``)\n *  - Optimism Sepolia Testnet (``optimism-sepolia``)\n *  - Polygon (``matic``)\n *  - Polygon Amoy Testnet (``matic-amoy``)\n *  - Polygon Mumbai Testnet (``matic-mumbai``)\n *\n *  @_subsection: api/providers/thirdparty:INFURA  [providers-infura]\n */\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst provider_websocket_js_1 = require(\"./provider-websocket.js\");\nconst defaultProjectId = \"84842078b09946638c03157f83405213\";\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"mainnet.infura.io\";\n        case \"goerli\":\n            return \"goerli.infura.io\";\n        case \"sepolia\":\n            return \"sepolia.infura.io\";\n        case \"arbitrum\":\n            return \"arbitrum-mainnet.infura.io\";\n        case \"arbitrum-goerli\":\n            return \"arbitrum-goerli.infura.io\";\n        case \"arbitrum-sepolia\":\n            return \"arbitrum-sepolia.infura.io\";\n        case \"base\":\n            return \"base-mainnet.infura.io\";\n        case \"base-goerlia\":\n            return \"base-goerli.infura.io\";\n        case \"base-sepolia\":\n            return \"base-sepolia.infura.io\";\n        case \"bnb\":\n            return \"bnbsmartchain-mainnet.infura.io\";\n        case \"bnbt\":\n            return \"bnbsmartchain-testnet.infura.io\";\n        case \"linea\":\n            return \"linea-mainnet.infura.io\";\n        case \"linea-goerli\":\n            return \"linea-goerli.infura.io\";\n        case \"linea-sepolia\":\n            return \"linea-sepolia.infura.io\";\n        case \"matic\":\n            return \"polygon-mainnet.infura.io\";\n        case \"matic-amoy\":\n            return \"polygon-amoy.infura.io\";\n        case \"matic-mumbai\":\n            return \"polygon-mumbai.infura.io\";\n        case \"optimism\":\n            return \"optimism-mainnet.infura.io\";\n        case \"optimism-goerli\":\n            return \"optimism-goerli.infura.io\";\n        case \"optimism-sepolia\":\n            return \"optimism-sepolia.infura.io\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/**\n *  The **InfuraWebSocketProvider** connects to the [[link-infura]]\n *  WebSocket end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-infura-signup).\n */\nclass InfuraWebSocketProvider extends provider_websocket_js_1.WebSocketProvider {\n    /**\n     *  The Project ID for the INFURA connection.\n     */\n    projectId;\n    /**\n     *  The Project Secret.\n     *\n     *  If null, no authenticated requests are made. This should not\n     *  be used outside of private contexts.\n     */\n    projectSecret;\n    /**\n     *  Creates a new **InfuraWebSocketProvider**.\n     */\n    constructor(network, projectId) {\n        const provider = new InfuraProvider(network, projectId);\n        const req = provider._getConnection();\n        (0, index_js_1.assert)(!req.credentials, \"INFURA WebSocket project secrets unsupported\", \"UNSUPPORTED_OPERATION\", { operation: \"InfuraProvider.getWebSocketProvider()\" });\n        const url = req.url.replace(/^http/i, \"ws\").replace(\"/v3/\", \"/ws/v3/\");\n        super(url, provider._network);\n        (0, index_js_1.defineProperties)(this, {\n            projectId: provider.projectId,\n            projectSecret: provider.projectSecret\n        });\n    }\n    isCommunityResource() {\n        return (this.projectId === defaultProjectId);\n    }\n}\nexports.InfuraWebSocketProvider = InfuraWebSocketProvider;\n/**\n *  The **InfuraProvider** connects to the [[link-infura]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-infura-signup).\n */\nclass InfuraProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    /**\n     *  The Project ID for the INFURA connection.\n     */\n    projectId;\n    /**\n     *  The Project Secret.\n     *\n     *  If null, no authenticated requests are made. This should not\n     *  be used outside of private contexts.\n     */\n    projectSecret;\n    /**\n     *  Creates a new **InfuraProvider**.\n     */\n    constructor(_network, projectId, projectSecret) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (projectId == null) {\n            projectId = defaultProjectId;\n        }\n        if (projectSecret == null) {\n            projectSecret = null;\n        }\n        const request = InfuraProvider.getRequest(network, projectId, projectSecret);\n        super(request, network, { staticNetwork: network });\n        (0, index_js_1.defineProperties)(this, { projectId, projectSecret });\n    }\n    _getProvider(chainId) {\n        try {\n            return new InfuraProvider(chainId, this.projectId, this.projectSecret);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    isCommunityResource() {\n        return (this.projectId === defaultProjectId);\n    }\n    /**\n     *  Creates a new **InfuraWebSocketProvider**.\n     */\n    static getWebSocketProvider(network, projectId) {\n        return new InfuraWebSocketProvider(network, projectId);\n    }\n    /**\n     *  Returns a prepared request for connecting to %%network%%\n     *  with %%projectId%% and %%projectSecret%%.\n     */\n    static getRequest(network, projectId, projectSecret) {\n        if (projectId == null) {\n            projectId = defaultProjectId;\n        }\n        if (projectSecret == null) {\n            projectSecret = null;\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/v3/${projectId}`);\n        request.allowGzip = true;\n        if (projectSecret) {\n            request.setCredentials(\"\", projectSecret);\n        }\n        if (projectId === defaultProjectId) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"InfuraProvider\");\n                return true;\n            };\n        }\n        return request;\n    }\n}\nexports.InfuraProvider = InfuraProvider;\n//# sourceMappingURL=provider-infura.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.IpcSocketProvider = void 0;\nconst IpcSocketProvider = undefined;\nexports.IpcSocketProvider = IpcSocketProvider;\n//# sourceMappingURL=provider-ipcsocket-browser.js.map","\"use strict\";\n/**\n *  One of the most common ways to interact with the blockchain is\n *  by a node running a JSON-RPC interface which can be connected to,\n *  based on the transport, using:\n *\n *  - HTTP or HTTPS - [[JsonRpcProvider]]\n *  - WebSocket - [[WebSocketProvider]]\n *  - IPC - [[IpcSocketProvider]]\n *\n * @_section: api/providers/jsonrpc:JSON-RPC Provider  [about-jsonrpcProvider]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.JsonRpcProvider = exports.JsonRpcApiPollingProvider = exports.JsonRpcApiProvider = exports.JsonRpcSigner = void 0;\n// @TODO:\n// - Add the batching API\n// https://playground.open-rpc.org/?schemaUrl=https://raw.githubusercontent.com/ethereum/eth1.0-apis/assembled-spec/openrpc.json&uiSchema%5BappBar%5D%5Bui:splitView%5D=true&uiSchema%5BappBar%5D%5Bui:input%5D=false&uiSchema%5BappBar%5D%5Bui:examplesDropdown%5D=false\nconst index_js_1 = require(\"../abi/index.js\");\nconst index_js_2 = require(\"../address/index.js\");\nconst index_js_3 = require(\"../hash/index.js\");\nconst index_js_4 = require(\"../transaction/index.js\");\nconst index_js_5 = require(\"../utils/index.js\");\nconst abstract_provider_js_1 = require(\"./abstract-provider.js\");\nconst abstract_signer_js_1 = require(\"./abstract-signer.js\");\nconst network_js_1 = require(\"./network.js\");\nconst subscriber_filterid_js_1 = require(\"./subscriber-filterid.js\");\nconst subscriber_polling_js_1 = require(\"./subscriber-polling.js\");\nconst Primitive = \"bigint,boolean,function,number,string,symbol\".split(/,/g);\n//const Methods = \"getAddress,then\".split(/,/g);\nfunction deepCopy(value) {\n    if (value == null || Primitive.indexOf(typeof (value)) >= 0) {\n        return value;\n    }\n    // Keep any Addressable\n    if (typeof (value.getAddress) === \"function\") {\n        return value;\n    }\n    if (Array.isArray(value)) {\n        return (value.map(deepCopy));\n    }\n    if (typeof (value) === \"object\") {\n        return Object.keys(value).reduce((accum, key) => {\n            accum[key] = value[key];\n            return accum;\n        }, {});\n    }\n    throw new Error(`should not happen: ${value} (${typeof (value)})`);\n}\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(resolve, duration); });\n}\nfunction getLowerCase(value) {\n    if (value) {\n        return value.toLowerCase();\n    }\n    return value;\n}\nfunction isPollable(value) {\n    return (value && typeof (value.pollingInterval) === \"number\");\n}\nconst defaultOptions = {\n    polling: false,\n    staticNetwork: null,\n    batchStallTime: 10,\n    batchMaxSize: (1 << 20),\n    batchMaxCount: 100,\n    cacheTimeout: 250,\n    pollingInterval: 4000\n};\n// @TODO: Unchecked Signers\nclass JsonRpcSigner extends abstract_signer_js_1.AbstractSigner {\n    address;\n    constructor(provider, address) {\n        super(provider);\n        address = (0, index_js_2.getAddress)(address);\n        (0, index_js_5.defineProperties)(this, { address });\n    }\n    connect(provider) {\n        (0, index_js_5.assert)(false, \"cannot reconnect JsonRpcSigner\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"signer.connect\"\n        });\n    }\n    async getAddress() {\n        return this.address;\n    }\n    // JSON-RPC will automatially fill in nonce, etc. so we just check from\n    async populateTransaction(tx) {\n        return await this.populateCall(tx);\n    }\n    // Returns just the hash of the transaction after sent, which is what\n    // the bare JSON-RPC API does;\n    async sendUncheckedTransaction(_tx) {\n        const tx = deepCopy(_tx);\n        const promises = [];\n        // Make sure the from matches the sender\n        if (tx.from) {\n            const _from = tx.from;\n            promises.push((async () => {\n                const from = await (0, index_js_2.resolveAddress)(_from, this.provider);\n                (0, index_js_5.assertArgument)(from != null && from.toLowerCase() === this.address.toLowerCase(), \"from address mismatch\", \"transaction\", _tx);\n                tx.from = from;\n            })());\n        }\n        else {\n            tx.from = this.address;\n        }\n        // The JSON-RPC for eth_sendTransaction uses 90000 gas; if the user\n        // wishes to use this, it is easy to specify explicitly, otherwise\n        // we look it up for them.\n        if (tx.gasLimit == null) {\n            promises.push((async () => {\n                tx.gasLimit = await this.provider.estimateGas({ ...tx, from: this.address });\n            })());\n        }\n        // The address may be an ENS name or Addressable\n        if (tx.to != null) {\n            const _to = tx.to;\n            promises.push((async () => {\n                tx.to = await (0, index_js_2.resolveAddress)(_to, this.provider);\n            })());\n        }\n        // Wait until all of our properties are filled in\n        if (promises.length) {\n            await Promise.all(promises);\n        }\n        const hexTx = this.provider.getRpcTransaction(tx);\n        return this.provider.send(\"eth_sendTransaction\", [hexTx]);\n    }\n    async sendTransaction(tx) {\n        // This cannot be mined any earlier than any recent block\n        const blockNumber = await this.provider.getBlockNumber();\n        // Send the transaction\n        const hash = await this.sendUncheckedTransaction(tx);\n        // Unfortunately, JSON-RPC only provides and opaque transaction hash\n        // for a response, and we need the actual transaction, so we poll\n        // for it; it should show up very quickly\n        return await (new Promise((resolve, reject) => {\n            const timeouts = [1000, 100];\n            let invalids = 0;\n            const checkTx = async () => {\n                try {\n                    // Try getting the transaction\n                    const tx = await this.provider.getTransaction(hash);\n                    if (tx != null) {\n                        resolve(tx.replaceableTransaction(blockNumber));\n                        return;\n                    }\n                }\n                catch (error) {\n                    // If we were cancelled: stop polling.\n                    // If the data is bad: the node returns bad transactions\n                    // If the network changed: calling again will also fail\n                    // If unsupported: likely destroyed\n                    if ((0, index_js_5.isError)(error, \"CANCELLED\") || (0, index_js_5.isError)(error, \"BAD_DATA\") ||\n                        (0, index_js_5.isError)(error, \"NETWORK_ERROR\" || (0, index_js_5.isError)(error, \"UNSUPPORTED_OPERATION\"))) {\n                        if (error.info == null) {\n                            error.info = {};\n                        }\n                        error.info.sendTransactionHash = hash;\n                        reject(error);\n                        return;\n                    }\n                    // Stop-gap for misbehaving backends; see #4513\n                    if ((0, index_js_5.isError)(error, \"INVALID_ARGUMENT\")) {\n                        invalids++;\n                        if (error.info == null) {\n                            error.info = {};\n                        }\n                        error.info.sendTransactionHash = hash;\n                        if (invalids > 10) {\n                            reject(error);\n                            return;\n                        }\n                    }\n                    // Notify anyone that cares; but we will try again, since\n                    // it is likely an intermittent service error\n                    this.provider.emit(\"error\", (0, index_js_5.makeError)(\"failed to fetch transation after sending (will try again)\", \"UNKNOWN_ERROR\", { error }));\n                }\n                // Wait another 4 seconds\n                this.provider._setTimeout(() => { checkTx(); }, timeouts.pop() || 4000);\n            };\n            checkTx();\n        }));\n    }\n    async signTransaction(_tx) {\n        const tx = deepCopy(_tx);\n        // Make sure the from matches the sender\n        if (tx.from) {\n            const from = await (0, index_js_2.resolveAddress)(tx.from, this.provider);\n            (0, index_js_5.assertArgument)(from != null && from.toLowerCase() === this.address.toLowerCase(), \"from address mismatch\", \"transaction\", _tx);\n            tx.from = from;\n        }\n        else {\n            tx.from = this.address;\n        }\n        const hexTx = this.provider.getRpcTransaction(tx);\n        return await this.provider.send(\"eth_signTransaction\", [hexTx]);\n    }\n    async signMessage(_message) {\n        const message = ((typeof (_message) === \"string\") ? (0, index_js_5.toUtf8Bytes)(_message) : _message);\n        return await this.provider.send(\"personal_sign\", [\n            (0, index_js_5.hexlify)(message), this.address.toLowerCase()\n        ]);\n    }\n    async signTypedData(domain, types, _value) {\n        const value = deepCopy(_value);\n        // Populate any ENS names (in-place)\n        const populated = await index_js_3.TypedDataEncoder.resolveNames(domain, types, value, async (value) => {\n            const address = await (0, index_js_2.resolveAddress)(value);\n            (0, index_js_5.assertArgument)(address != null, \"TypedData does not support null address\", \"value\", value);\n            return address;\n        });\n        return await this.provider.send(\"eth_signTypedData_v4\", [\n            this.address.toLowerCase(),\n            JSON.stringify(index_js_3.TypedDataEncoder.getPayload(populated.domain, types, populated.value))\n        ]);\n    }\n    async unlock(password) {\n        return this.provider.send(\"personal_unlockAccount\", [\n            this.address.toLowerCase(), password, null\n        ]);\n    }\n    // https://github.com/ethereum/wiki/wiki/JSON-RPC#eth_sign\n    async _legacySignMessage(_message) {\n        const message = ((typeof (_message) === \"string\") ? (0, index_js_5.toUtf8Bytes)(_message) : _message);\n        return await this.provider.send(\"eth_sign\", [\n            this.address.toLowerCase(), (0, index_js_5.hexlify)(message)\n        ]);\n    }\n}\nexports.JsonRpcSigner = JsonRpcSigner;\n/**\n *  The JsonRpcApiProvider is an abstract class and **MUST** be\n *  sub-classed.\n *\n *  It provides the base for all JSON-RPC-based Provider interaction.\n *\n *  Sub-classing Notes:\n *  - a sub-class MUST override _send\n *  - a sub-class MUST call the `_start()` method once connected\n */\nclass JsonRpcApiProvider extends abstract_provider_js_1.AbstractProvider {\n    #options;\n    // The next ID to use for the JSON-RPC ID field\n    #nextId;\n    // Payloads are queued and triggered in batches using the drainTimer\n    #payloads;\n    #drainTimer;\n    #notReady;\n    #network;\n    #pendingDetectNetwork;\n    #scheduleDrain() {\n        if (this.#drainTimer) {\n            return;\n        }\n        // If we aren't using batching, no harm in sending it immediately\n        const stallTime = (this._getOption(\"batchMaxCount\") === 1) ? 0 : this._getOption(\"batchStallTime\");\n        this.#drainTimer = setTimeout(() => {\n            this.#drainTimer = null;\n            const payloads = this.#payloads;\n            this.#payloads = [];\n            while (payloads.length) {\n                // Create payload batches that satisfy our batch constraints\n                const batch = [(payloads.shift())];\n                while (payloads.length) {\n                    if (batch.length === this.#options.batchMaxCount) {\n                        break;\n                    }\n                    batch.push((payloads.shift()));\n                    const bytes = JSON.stringify(batch.map((p) => p.payload));\n                    if (bytes.length > this.#options.batchMaxSize) {\n                        payloads.unshift((batch.pop()));\n                        break;\n                    }\n                }\n                // Process the result to each payload\n                (async () => {\n                    const payload = ((batch.length === 1) ? batch[0].payload : batch.map((p) => p.payload));\n                    this.emit(\"debug\", { action: \"sendRpcPayload\", payload });\n                    try {\n                        const result = await this._send(payload);\n                        this.emit(\"debug\", { action: \"receiveRpcResult\", result });\n                        // Process results in batch order\n                        for (const { resolve, reject, payload } of batch) {\n                            if (this.destroyed) {\n                                reject((0, index_js_5.makeError)(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: payload.method }));\n                                continue;\n                            }\n                            // Find the matching result\n                            const resp = result.filter((r) => (r.id === payload.id))[0];\n                            // No result; the node failed us in unexpected ways\n                            if (resp == null) {\n                                const error = (0, index_js_5.makeError)(\"missing response for request\", \"BAD_DATA\", {\n                                    value: result, info: { payload }\n                                });\n                                this.emit(\"error\", error);\n                                reject(error);\n                                continue;\n                            }\n                            // The response is an error\n                            if (\"error\" in resp) {\n                                reject(this.getRpcError(payload, resp));\n                                continue;\n                            }\n                            // All good; send the result\n                            resolve(resp.result);\n                        }\n                    }\n                    catch (error) {\n                        this.emit(\"debug\", { action: \"receiveRpcError\", error });\n                        for (const { reject } of batch) {\n                            // @TODO: augment the error with the payload\n                            reject(error);\n                        }\n                    }\n                })();\n            }\n        }, stallTime);\n    }\n    constructor(network, options) {\n        super(network, options);\n        this.#nextId = 1;\n        this.#options = Object.assign({}, defaultOptions, options || {});\n        this.#payloads = [];\n        this.#drainTimer = null;\n        this.#network = null;\n        this.#pendingDetectNetwork = null;\n        {\n            let resolve = null;\n            const promise = new Promise((_resolve) => {\n                resolve = _resolve;\n            });\n            this.#notReady = { promise, resolve };\n        }\n        const staticNetwork = this._getOption(\"staticNetwork\");\n        if (typeof (staticNetwork) === \"boolean\") {\n            (0, index_js_5.assertArgument)(!staticNetwork || network !== \"any\", \"staticNetwork cannot be used on special network 'any'\", \"options\", options);\n            if (staticNetwork && network != null) {\n                this.#network = network_js_1.Network.from(network);\n            }\n        }\n        else if (staticNetwork) {\n            // Make sure any static network is compatbile with the provided netwrok\n            (0, index_js_5.assertArgument)(network == null || staticNetwork.matches(network), \"staticNetwork MUST match network object\", \"options\", options);\n            this.#network = staticNetwork;\n        }\n    }\n    /**\n     *  Returns the value associated with the option %%key%%.\n     *\n     *  Sub-classes can use this to inquire about configuration options.\n     */\n    _getOption(key) {\n        return this.#options[key];\n    }\n    /**\n     *  Gets the [[Network]] this provider has committed to. On each call, the network\n     *  is detected, and if it has changed, the call will reject.\n     */\n    get _network() {\n        (0, index_js_5.assert)(this.#network, \"network is not available yet\", \"NETWORK_ERROR\");\n        return this.#network;\n    }\n    /**\n     *  Resolves to the non-normalized value by performing %%req%%.\n     *\n     *  Sub-classes may override this to modify behavior of actions,\n     *  and should generally call ``super._perform`` as a fallback.\n     */\n    async _perform(req) {\n        // Legacy networks do not like the type field being passed along (which\n        // is fair), so we delete type if it is 0 and a non-EIP-1559 network\n        if (req.method === \"call\" || req.method === \"estimateGas\") {\n            let tx = req.transaction;\n            if (tx && tx.type != null && (0, index_js_5.getBigInt)(tx.type)) {\n                // If there are no EIP-1559 or newer properties, it might be pre-EIP-1559\n                if (tx.maxFeePerGas == null && tx.maxPriorityFeePerGas == null) {\n                    const feeData = await this.getFeeData();\n                    if (feeData.maxFeePerGas == null && feeData.maxPriorityFeePerGas == null) {\n                        // Network doesn't know about EIP-1559 (and hence type)\n                        req = Object.assign({}, req, {\n                            transaction: Object.assign({}, tx, { type: undefined })\n                        });\n                    }\n                }\n            }\n        }\n        const request = this.getRpcRequest(req);\n        if (request != null) {\n            return await this.send(request.method, request.args);\n        }\n        return super._perform(req);\n    }\n    /**\n     *  Sub-classes may override this; it detects the *actual* network that\n     *  we are **currently** connected to.\n     *\n     *  Keep in mind that [[send]] may only be used once [[ready]], otherwise the\n     *  _send primitive must be used instead.\n     */\n    async _detectNetwork() {\n        const network = this._getOption(\"staticNetwork\");\n        if (network) {\n            if (network === true) {\n                if (this.#network) {\n                    return this.#network;\n                }\n            }\n            else {\n                return network;\n            }\n        }\n        if (this.#pendingDetectNetwork) {\n            return await this.#pendingDetectNetwork;\n        }\n        // If we are ready, use ``send``, which enabled requests to be batched\n        if (this.ready) {\n            this.#pendingDetectNetwork = (async () => {\n                try {\n                    const result = network_js_1.Network.from((0, index_js_5.getBigInt)(await this.send(\"eth_chainId\", [])));\n                    this.#pendingDetectNetwork = null;\n                    return result;\n                }\n                catch (error) {\n                    this.#pendingDetectNetwork = null;\n                    throw error;\n                }\n            })();\n            return await this.#pendingDetectNetwork;\n        }\n        // We are not ready yet; use the primitive _send\n        this.#pendingDetectNetwork = (async () => {\n            const payload = {\n                id: this.#nextId++, method: \"eth_chainId\", params: [], jsonrpc: \"2.0\"\n            };\n            this.emit(\"debug\", { action: \"sendRpcPayload\", payload });\n            let result;\n            try {\n                result = (await this._send(payload))[0];\n                this.#pendingDetectNetwork = null;\n            }\n            catch (error) {\n                this.#pendingDetectNetwork = null;\n                this.emit(\"debug\", { action: \"receiveRpcError\", error });\n                throw error;\n            }\n            this.emit(\"debug\", { action: \"receiveRpcResult\", result });\n            if (\"result\" in result) {\n                return network_js_1.Network.from((0, index_js_5.getBigInt)(result.result));\n            }\n            throw this.getRpcError(payload, result);\n        })();\n        return await this.#pendingDetectNetwork;\n    }\n    /**\n     *  Sub-classes **MUST** call this. Until [[_start]] has been called, no calls\n     *  will be passed to [[_send]] from [[send]]. If it is overridden, then\n     *  ``super._start()`` **MUST** be called.\n     *\n     *  Calling it multiple times is safe and has no effect.\n     */\n    _start() {\n        if (this.#notReady == null || this.#notReady.resolve == null) {\n            return;\n        }\n        this.#notReady.resolve();\n        this.#notReady = null;\n        (async () => {\n            // Bootstrap the network\n            while (this.#network == null && !this.destroyed) {\n                try {\n                    this.#network = await this._detectNetwork();\n                }\n                catch (error) {\n                    if (this.destroyed) {\n                        break;\n                    }\n                    console.log(\"JsonRpcProvider failed to detect network and cannot start up; retry in 1s (perhaps the URL is wrong or the node is not started)\");\n                    this.emit(\"error\", (0, index_js_5.makeError)(\"failed to bootstrap network detection\", \"NETWORK_ERROR\", { event: \"initial-network-discovery\", info: { error } }));\n                    await stall(1000);\n                }\n            }\n            // Start dispatching requests\n            this.#scheduleDrain();\n        })();\n    }\n    /**\n     *  Resolves once the [[_start]] has been called. This can be used in\n     *  sub-classes to defer sending data until the connection has been\n     *  established.\n     */\n    async _waitUntilReady() {\n        if (this.#notReady == null) {\n            return;\n        }\n        return await this.#notReady.promise;\n    }\n    /**\n     *  Return a Subscriber that will manage the %%sub%%.\n     *\n     *  Sub-classes may override this to modify the behavior of\n     *  subscription management.\n     */\n    _getSubscriber(sub) {\n        // Pending Filters aren't availble via polling\n        if (sub.type === \"pending\") {\n            return new subscriber_filterid_js_1.FilterIdPendingSubscriber(this);\n        }\n        if (sub.type === \"event\") {\n            if (this._getOption(\"polling\")) {\n                return new subscriber_polling_js_1.PollingEventSubscriber(this, sub.filter);\n            }\n            return new subscriber_filterid_js_1.FilterIdEventSubscriber(this, sub.filter);\n        }\n        // Orphaned Logs are handled automatically, by the filter, since\n        // logs with removed are emitted by it\n        if (sub.type === \"orphan\" && sub.filter.orphan === \"drop-log\") {\n            return new abstract_provider_js_1.UnmanagedSubscriber(\"orphan\");\n        }\n        return super._getSubscriber(sub);\n    }\n    /**\n     *  Returns true only if the [[_start]] has been called.\n     */\n    get ready() { return this.#notReady == null; }\n    /**\n     *  Returns %%tx%% as a normalized JSON-RPC transaction request,\n     *  which has all values hexlified and any numeric values converted\n     *  to Quantity values.\n     */\n    getRpcTransaction(tx) {\n        const result = {};\n        // JSON-RPC now requires numeric values to be \"quantity\" values\n        [\"chainId\", \"gasLimit\", \"gasPrice\", \"type\", \"maxFeePerGas\", \"maxPriorityFeePerGas\", \"nonce\", \"value\"].forEach((key) => {\n            if (tx[key] == null) {\n                return;\n            }\n            let dstKey = key;\n            if (key === \"gasLimit\") {\n                dstKey = \"gas\";\n            }\n            result[dstKey] = (0, index_js_5.toQuantity)((0, index_js_5.getBigInt)(tx[key], `tx.${key}`));\n        });\n        // Make sure addresses and data are lowercase\n        [\"from\", \"to\", \"data\"].forEach((key) => {\n            if (tx[key] == null) {\n                return;\n            }\n            result[key] = (0, index_js_5.hexlify)(tx[key]);\n        });\n        // Normalize the access list object\n        if (tx.accessList) {\n            result[\"accessList\"] = (0, index_js_4.accessListify)(tx.accessList);\n        }\n        if (tx.blobVersionedHashes) {\n            // @TODO: Remove this <any> case once EIP-4844 added to prepared tx\n            result[\"blobVersionedHashes\"] = tx.blobVersionedHashes.map(h => h.toLowerCase());\n        }\n        // @TODO: blobs should probably also be copied over, optionally\n        // accounting for the kzg property to backfill blobVersionedHashes\n        // using the commitment. Or should that be left as an exercise to\n        // the caller?\n        return result;\n    }\n    /**\n     *  Returns the request method and arguments required to perform\n     *  %%req%%.\n     */\n    getRpcRequest(req) {\n        switch (req.method) {\n            case \"chainId\":\n                return { method: \"eth_chainId\", args: [] };\n            case \"getBlockNumber\":\n                return { method: \"eth_blockNumber\", args: [] };\n            case \"getGasPrice\":\n                return { method: \"eth_gasPrice\", args: [] };\n            case \"getPriorityFee\":\n                return { method: \"eth_maxPriorityFeePerGas\", args: [] };\n            case \"getBalance\":\n                return {\n                    method: \"eth_getBalance\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getTransactionCount\":\n                return {\n                    method: \"eth_getTransactionCount\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getCode\":\n                return {\n                    method: \"eth_getCode\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getStorage\":\n                return {\n                    method: \"eth_getStorageAt\",\n                    args: [\n                        getLowerCase(req.address),\n                        (\"0x\" + req.position.toString(16)),\n                        req.blockTag\n                    ]\n                };\n            case \"broadcastTransaction\":\n                return {\n                    method: \"eth_sendRawTransaction\",\n                    args: [req.signedTransaction]\n                };\n            case \"getBlock\":\n                if (\"blockTag\" in req) {\n                    return {\n                        method: \"eth_getBlockByNumber\",\n                        args: [req.blockTag, !!req.includeTransactions]\n                    };\n                }\n                else if (\"blockHash\" in req) {\n                    return {\n                        method: \"eth_getBlockByHash\",\n                        args: [req.blockHash, !!req.includeTransactions]\n                    };\n                }\n                break;\n            case \"getTransaction\":\n                return {\n                    method: \"eth_getTransactionByHash\",\n                    args: [req.hash]\n                };\n            case \"getTransactionReceipt\":\n                return {\n                    method: \"eth_getTransactionReceipt\",\n                    args: [req.hash]\n                };\n            case \"call\":\n                return {\n                    method: \"eth_call\",\n                    args: [this.getRpcTransaction(req.transaction), req.blockTag]\n                };\n            case \"estimateGas\": {\n                return {\n                    method: \"eth_estimateGas\",\n                    args: [this.getRpcTransaction(req.transaction)]\n                };\n            }\n            case \"getLogs\":\n                if (req.filter && req.filter.address != null) {\n                    if (Array.isArray(req.filter.address)) {\n                        req.filter.address = req.filter.address.map(getLowerCase);\n                    }\n                    else {\n                        req.filter.address = getLowerCase(req.filter.address);\n                    }\n                }\n                return { method: \"eth_getLogs\", args: [req.filter] };\n        }\n        return null;\n    }\n    /**\n     *  Returns an ethers-style Error for the given JSON-RPC error\n     *  %%payload%%, coalescing the various strings and error shapes\n     *  that different nodes return, coercing them into a machine-readable\n     *  standardized error.\n     */\n    getRpcError(payload, _error) {\n        const { method } = payload;\n        const { error } = _error;\n        if (method === \"eth_estimateGas\" && error.message) {\n            const msg = error.message;\n            if (!msg.match(/revert/i) && msg.match(/insufficient funds/i)) {\n                return (0, index_js_5.makeError)(\"insufficient funds\", \"INSUFFICIENT_FUNDS\", {\n                    transaction: (payload.params[0]),\n                    info: { payload, error }\n                });\n            }\n        }\n        if (method === \"eth_call\" || method === \"eth_estimateGas\") {\n            const result = spelunkData(error);\n            const e = index_js_1.AbiCoder.getBuiltinCallException((method === \"eth_call\") ? \"call\" : \"estimateGas\", (payload.params[0]), (result ? result.data : null));\n            e.info = { error, payload };\n            return e;\n        }\n        // Only estimateGas and call can return arbitrary contract-defined text, so now we\n        // we can process text safely.\n        const message = JSON.stringify(spelunkMessage(error));\n        if (typeof (error.message) === \"string\" && error.message.match(/user denied|ethers-user-denied/i)) {\n            const actionMap = {\n                eth_sign: \"signMessage\",\n                personal_sign: \"signMessage\",\n                eth_signTypedData_v4: \"signTypedData\",\n                eth_signTransaction: \"signTransaction\",\n                eth_sendTransaction: \"sendTransaction\",\n                eth_requestAccounts: \"requestAccess\",\n                wallet_requestAccounts: \"requestAccess\",\n            };\n            return (0, index_js_5.makeError)(`user rejected action`, \"ACTION_REJECTED\", {\n                action: (actionMap[method] || \"unknown\"),\n                reason: \"rejected\",\n                info: { payload, error }\n            });\n        }\n        if (method === \"eth_sendRawTransaction\" || method === \"eth_sendTransaction\") {\n            const transaction = (payload.params[0]);\n            if (message.match(/insufficient funds|base fee exceeds gas limit/i)) {\n                return (0, index_js_5.makeError)(\"insufficient funds for intrinsic transaction cost\", \"INSUFFICIENT_FUNDS\", {\n                    transaction, info: { error }\n                });\n            }\n            if (message.match(/nonce/i) && message.match(/too low/i)) {\n                return (0, index_js_5.makeError)(\"nonce has already been used\", \"NONCE_EXPIRED\", { transaction, info: { error } });\n            }\n            // \"replacement transaction underpriced\"\n            if (message.match(/replacement transaction/i) && message.match(/underpriced/i)) {\n                return (0, index_js_5.makeError)(\"replacement fee too low\", \"REPLACEMENT_UNDERPRICED\", { transaction, info: { error } });\n            }\n            if (message.match(/only replay-protected/i)) {\n                return (0, index_js_5.makeError)(\"legacy pre-eip-155 transactions not supported\", \"UNSUPPORTED_OPERATION\", {\n                    operation: method, info: { transaction, info: { error } }\n                });\n            }\n        }\n        let unsupported = !!message.match(/the method .* does not exist/i);\n        if (!unsupported) {\n            if (error && error.details && error.details.startsWith(\"Unauthorized method:\")) {\n                unsupported = true;\n            }\n        }\n        if (unsupported) {\n            return (0, index_js_5.makeError)(\"unsupported operation\", \"UNSUPPORTED_OPERATION\", {\n                operation: payload.method, info: { error, payload }\n            });\n        }\n        return (0, index_js_5.makeError)(\"could not coalesce error\", \"UNKNOWN_ERROR\", { error, payload });\n    }\n    /**\n     *  Requests the %%method%% with %%params%% via the JSON-RPC protocol\n     *  over the underlying channel. This can be used to call methods\n     *  on the backend that do not have a high-level API within the Provider\n     *  API.\n     *\n     *  This method queues requests according to the batch constraints\n     *  in the options, assigns the request a unique ID.\n     *\n     *  **Do NOT override** this method in sub-classes; instead\n     *  override [[_send]] or force the options values in the\n     *  call to the constructor to modify this method's behavior.\n     */\n    send(method, params) {\n        // @TODO: cache chainId?? purge on switch_networks\n        // We have been destroyed; no operations are supported anymore\n        if (this.destroyed) {\n            return Promise.reject((0, index_js_5.makeError)(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: method }));\n        }\n        const id = this.#nextId++;\n        const promise = new Promise((resolve, reject) => {\n            this.#payloads.push({\n                resolve, reject,\n                payload: { method, params, id, jsonrpc: \"2.0\" }\n            });\n        });\n        // If there is not a pending drainTimer, set one\n        this.#scheduleDrain();\n        return promise;\n    }\n    /**\n     *  Resolves to the [[Signer]] account for  %%address%% managed by\n     *  the client.\n     *\n     *  If the %%address%% is a number, it is used as an index in the\n     *  the accounts from [[listAccounts]].\n     *\n     *  This can only be used on clients which manage accounts (such as\n     *  Geth with imported account or MetaMask).\n     *\n     *  Throws if the account doesn't exist.\n     */\n    async getSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        const accountsPromise = this.send(\"eth_accounts\", []);\n        // Account index\n        if (typeof (address) === \"number\") {\n            const accounts = (await accountsPromise);\n            if (address >= accounts.length) {\n                throw new Error(\"no such account\");\n            }\n            return new JsonRpcSigner(this, accounts[address]);\n        }\n        const { accounts } = await (0, index_js_5.resolveProperties)({\n            network: this.getNetwork(),\n            accounts: accountsPromise\n        });\n        // Account address\n        address = (0, index_js_2.getAddress)(address);\n        for (const account of accounts) {\n            if ((0, index_js_2.getAddress)(account) === address) {\n                return new JsonRpcSigner(this, address);\n            }\n        }\n        throw new Error(\"invalid account\");\n    }\n    async listAccounts() {\n        const accounts = await this.send(\"eth_accounts\", []);\n        return accounts.map((a) => new JsonRpcSigner(this, a));\n    }\n    destroy() {\n        // Stop processing requests\n        if (this.#drainTimer) {\n            clearTimeout(this.#drainTimer);\n            this.#drainTimer = null;\n        }\n        // Cancel all pending requests\n        for (const { payload, reject } of this.#payloads) {\n            reject((0, index_js_5.makeError)(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: payload.method }));\n        }\n        this.#payloads = [];\n        // Parent clean-up\n        super.destroy();\n    }\n}\nexports.JsonRpcApiProvider = JsonRpcApiProvider;\n// @TODO: remove this in v7, it is not exported because this functionality\n// is exposed in the JsonRpcApiProvider by setting polling to true. It should\n// be safe to remove regardless, because it isn't reachable, but just in case.\n/**\n *  @_ignore:\n */\nclass JsonRpcApiPollingProvider extends JsonRpcApiProvider {\n    #pollingInterval;\n    constructor(network, options) {\n        super(network, options);\n        let pollingInterval = this._getOption(\"pollingInterval\");\n        if (pollingInterval == null) {\n            pollingInterval = defaultOptions.pollingInterval;\n        }\n        this.#pollingInterval = pollingInterval;\n    }\n    _getSubscriber(sub) {\n        const subscriber = super._getSubscriber(sub);\n        if (isPollable(subscriber)) {\n            subscriber.pollingInterval = this.#pollingInterval;\n        }\n        return subscriber;\n    }\n    /**\n     *  The polling interval (default: 4000 ms)\n     */\n    get pollingInterval() { return this.#pollingInterval; }\n    set pollingInterval(value) {\n        if (!Number.isInteger(value) || value < 0) {\n            throw new Error(\"invalid interval\");\n        }\n        this.#pollingInterval = value;\n        this._forEachSubscriber((sub) => {\n            if (isPollable(sub)) {\n                sub.pollingInterval = this.#pollingInterval;\n            }\n        });\n    }\n}\nexports.JsonRpcApiPollingProvider = JsonRpcApiPollingProvider;\n/**\n *  The JsonRpcProvider is one of the most common Providers,\n *  which performs all operations over HTTP (or HTTPS) requests.\n *\n *  Events are processed by polling the backend for the current block\n *  number; when it advances, all block-base events are then checked\n *  for updates.\n */\nclass JsonRpcProvider extends JsonRpcApiPollingProvider {\n    #connect;\n    constructor(url, network, options) {\n        if (url == null) {\n            url = \"http:/\\/localhost:8545\";\n        }\n        super(network, options);\n        if (typeof (url) === \"string\") {\n            this.#connect = new index_js_5.FetchRequest(url);\n        }\n        else {\n            this.#connect = url.clone();\n        }\n    }\n    _getConnection() {\n        return this.#connect.clone();\n    }\n    async send(method, params) {\n        // All requests are over HTTP, so we can just start handling requests\n        // We do this here rather than the constructor so that we don't send any\n        // requests to the network (i.e. eth_chainId) until we absolutely have to.\n        await this._start();\n        return await super.send(method, params);\n    }\n    async _send(payload) {\n        // Configure a POST connection for the requested method\n        const request = this._getConnection();\n        request.body = JSON.stringify(payload);\n        request.setHeader(\"content-type\", \"application/json\");\n        const response = await request.send();\n        response.assertOk();\n        let resp = response.bodyJson;\n        if (!Array.isArray(resp)) {\n            resp = [resp];\n        }\n        return resp;\n    }\n}\nexports.JsonRpcProvider = JsonRpcProvider;\nfunction spelunkData(value) {\n    if (value == null) {\n        return null;\n    }\n    // These *are* the droids we're looking for.\n    if (typeof (value.message) === \"string\" && value.message.match(/revert/i) && (0, index_js_5.isHexString)(value.data)) {\n        return { message: value.message, data: value.data };\n    }\n    // Spelunk further...\n    if (typeof (value) === \"object\") {\n        for (const key in value) {\n            const result = spelunkData(value[key]);\n            if (result) {\n                return result;\n            }\n        }\n        return null;\n    }\n    // Might be a JSON string we can further descend...\n    if (typeof (value) === \"string\") {\n        try {\n            return spelunkData(JSON.parse(value));\n        }\n        catch (error) { }\n    }\n    return null;\n}\nfunction _spelunkMessage(value, result) {\n    if (value == null) {\n        return;\n    }\n    // These *are* the droids we're looking for.\n    if (typeof (value.message) === \"string\") {\n        result.push(value.message);\n    }\n    // Spelunk further...\n    if (typeof (value) === \"object\") {\n        for (const key in value) {\n            _spelunkMessage(value[key], result);\n        }\n    }\n    // Might be a JSON string we can further descend...\n    if (typeof (value) === \"string\") {\n        try {\n            return _spelunkMessage(JSON.parse(value), result);\n        }\n        catch (error) { }\n    }\n}\nfunction spelunkMessage(value) {\n    const result = [];\n    _spelunkMessage(value, result);\n    return result;\n}\n//# sourceMappingURL=provider-jsonrpc.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PocketProvider = void 0;\n/**\n *  [[link-pocket]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Polygon (``matic``)\n *  - Arbitrum (``arbitrum``)\n *\n *  @_subsection: api/providers/thirdparty:Pocket  [providers-pocket]\n */\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst defaultApplicationId = \"62e1ad51b37b8e00394bda3b\";\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"eth-mainnet.gateway.pokt.network\";\n        case \"goerli\":\n            return \"eth-goerli.gateway.pokt.network\";\n        case \"matic\":\n            return \"poly-mainnet.gateway.pokt.network\";\n        case \"matic-mumbai\":\n            return \"polygon-mumbai-rpc.gateway.pokt.network\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/**\n *  The **PocketProvider** connects to the [[link-pocket]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API key is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-pocket-signup).\n */\nclass PocketProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    /**\n     *  The Application ID for the Pocket connection.\n     */\n    applicationId;\n    /**\n     *  The Application Secret for making authenticated requests\n     *  to the Pocket connection.\n     */\n    applicationSecret;\n    /**\n     *  Create a new **PocketProvider**.\n     *\n     *  By default connecting to ``mainnet`` with a highly throttled\n     *  API key.\n     */\n    constructor(_network, applicationId, applicationSecret) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (applicationId == null) {\n            applicationId = defaultApplicationId;\n        }\n        if (applicationSecret == null) {\n            applicationSecret = null;\n        }\n        const options = { staticNetwork: network };\n        const request = PocketProvider.getRequest(network, applicationId, applicationSecret);\n        super(request, network, options);\n        (0, index_js_1.defineProperties)(this, { applicationId, applicationSecret });\n    }\n    _getProvider(chainId) {\n        try {\n            return new PocketProvider(chainId, this.applicationId, this.applicationSecret);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    /**\n     *  Returns a prepared request for connecting to %%network%% with\n     *  %%applicationId%%.\n     */\n    static getRequest(network, applicationId, applicationSecret) {\n        if (applicationId == null) {\n            applicationId = defaultApplicationId;\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/v1/lb/${applicationId}`);\n        request.allowGzip = true;\n        if (applicationSecret) {\n            request.setCredentials(\"\", applicationSecret);\n        }\n        if (applicationId === defaultApplicationId) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"PocketProvider\");\n                return true;\n            };\n        }\n        return request;\n    }\n    isCommunityResource() {\n        return (this.applicationId === defaultApplicationId);\n    }\n}\nexports.PocketProvider = PocketProvider;\n//# sourceMappingURL=provider-pocket.js.map","\"use strict\";\n/**\n *  [[link-quicknode]] provides a third-party service for connecting to\n *  various blockchains over JSON-RPC.\n *\n *  **Supported Networks**\n *\n *  - Ethereum Mainnet (``mainnet``)\n *  - Goerli Testnet (``goerli``)\n *  - Sepolia Testnet (``sepolia``)\n *  - Holesky Testnet (``holesky``)\n *  - Arbitrum (``arbitrum``)\n *  - Arbitrum Goerli Testnet (``arbitrum-goerli``)\n *  - Arbitrum Sepolia Testnet (``arbitrum-sepolia``)\n *  - Base Mainnet (``base``);\n *  - Base Goerli Testnet (``base-goerli``);\n *  - Base Sepolia Testnet (``base-sepolia``);\n *  - BNB Smart Chain Mainnet (``bnb``)\n *  - BNB Smart Chain Testnet (``bnbt``)\n *  - Optimism (``optimism``)\n *  - Optimism Goerli Testnet (``optimism-goerli``)\n *  - Optimism Sepolia Testnet (``optimism-sepolia``)\n *  - Polygon (``matic``)\n *  - Polygon Mumbai Testnet (``matic-mumbai``)\n *\n *  @_subsection: api/providers/thirdparty:QuickNode  [providers-quicknode]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.QuickNodeProvider = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst community_js_1 = require(\"./community.js\");\nconst network_js_1 = require(\"./network.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\nconst defaultToken = \"919b412a057b5e9c9b6dce193c5a60242d6efadb\";\nfunction getHost(name) {\n    switch (name) {\n        case \"mainnet\":\n            return \"ethers.quiknode.pro\";\n        case \"goerli\":\n            return \"ethers.ethereum-goerli.quiknode.pro\";\n        case \"sepolia\":\n            return \"ethers.ethereum-sepolia.quiknode.pro\";\n        case \"holesky\":\n            return \"ethers.ethereum-holesky.quiknode.pro\";\n        case \"arbitrum\":\n            return \"ethers.arbitrum-mainnet.quiknode.pro\";\n        case \"arbitrum-goerli\":\n            return \"ethers.arbitrum-goerli.quiknode.pro\";\n        case \"arbitrum-sepolia\":\n            return \"ethers.arbitrum-sepolia.quiknode.pro\";\n        case \"base\":\n            return \"ethers.base-mainnet.quiknode.pro\";\n        case \"base-goerli\":\n            return \"ethers.base-goerli.quiknode.pro\";\n        case \"base-spolia\":\n            return \"ethers.base-sepolia.quiknode.pro\";\n        case \"bnb\":\n            return \"ethers.bsc.quiknode.pro\";\n        case \"bnbt\":\n            return \"ethers.bsc-testnet.quiknode.pro\";\n        case \"matic\":\n            return \"ethers.matic.quiknode.pro\";\n        case \"matic-mumbai\":\n            return \"ethers.matic-testnet.quiknode.pro\";\n        case \"optimism\":\n            return \"ethers.optimism.quiknode.pro\";\n        case \"optimism-goerli\":\n            return \"ethers.optimism-goerli.quiknode.pro\";\n        case \"optimism-sepolia\":\n            return \"ethers.optimism-sepolia.quiknode.pro\";\n        case \"xdai\":\n            return \"ethers.xdai.quiknode.pro\";\n    }\n    (0, index_js_1.assertArgument)(false, \"unsupported network\", \"network\", name);\n}\n/*\n@TODO:\n  These networks are not currently present in the Network\n  default included networks. Research them and ensure they\n  are EVM compatible and work with ethers\n\n  http://ethers.matic-amoy.quiknode.pro\n\n  http://ethers.avalanche-mainnet.quiknode.pro\n  http://ethers.avalanche-testnet.quiknode.pro\n  http://ethers.blast-sepolia.quiknode.pro\n  http://ethers.celo-mainnet.quiknode.pro\n  http://ethers.fantom.quiknode.pro\n  http://ethers.imx-demo.quiknode.pro\n  http://ethers.imx-mainnet.quiknode.pro\n  http://ethers.imx-testnet.quiknode.pro\n  http://ethers.near-mainnet.quiknode.pro\n  http://ethers.near-testnet.quiknode.pro\n  http://ethers.nova-mainnet.quiknode.pro\n  http://ethers.scroll-mainnet.quiknode.pro\n  http://ethers.scroll-testnet.quiknode.pro\n  http://ethers.tron-mainnet.quiknode.pro\n  http://ethers.zkevm-mainnet.quiknode.pro\n  http://ethers.zkevm-testnet.quiknode.pro\n  http://ethers.zksync-mainnet.quiknode.pro\n  http://ethers.zksync-testnet.quiknode.pro\n*/\n/**\n *  The **QuickNodeProvider** connects to the [[link-quicknode]]\n *  JSON-RPC end-points.\n *\n *  By default, a highly-throttled API token is used, which is\n *  appropriate for quick prototypes and simple scripts. To\n *  gain access to an increased rate-limit, it is highly\n *  recommended to [sign up here](link-quicknode).\n */\nclass QuickNodeProvider extends provider_jsonrpc_js_1.JsonRpcProvider {\n    /**\n     *  The API token.\n     */\n    token;\n    /**\n     *  Creates a new **QuickNodeProvider**.\n     */\n    constructor(_network, token) {\n        if (_network == null) {\n            _network = \"mainnet\";\n        }\n        const network = network_js_1.Network.from(_network);\n        if (token == null) {\n            token = defaultToken;\n        }\n        const request = QuickNodeProvider.getRequest(network, token);\n        super(request, network, { staticNetwork: network });\n        (0, index_js_1.defineProperties)(this, { token });\n    }\n    _getProvider(chainId) {\n        try {\n            return new QuickNodeProvider(chainId, this.token);\n        }\n        catch (error) { }\n        return super._getProvider(chainId);\n    }\n    isCommunityResource() {\n        return (this.token === defaultToken);\n    }\n    /**\n     *  Returns a new request prepared for %%network%% and the\n     *  %%token%%.\n     */\n    static getRequest(network, token) {\n        if (token == null) {\n            token = defaultToken;\n        }\n        const request = new index_js_1.FetchRequest(`https:/\\/${getHost(network.name)}/${token}`);\n        request.allowGzip = true;\n        //if (projectSecret) { request.setCredentials(\"\", projectSecret); }\n        if (token === defaultToken) {\n            request.retryFunc = async (request, response, attempt) => {\n                (0, community_js_1.showThrottleMessage)(\"QuickNodeProvider\");\n                return true;\n            };\n        }\n        return request;\n    }\n}\nexports.QuickNodeProvider = QuickNodeProvider;\n//# sourceMappingURL=provider-quicknode.js.map","\"use strict\";\n/**\n *  Generic long-lived socket provider.\n *\n *  Sub-classing notes\n *  - a sub-class MUST call the `_start()` method once connected\n *  - a sub-class MUST override the `_write(string)` method\n *  - a sub-class MUST call `_processMessage(string)` for each message\n *\n *  @_subsection: api/providers/abstract-provider:Socket Providers  [about-socketProvider]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SocketProvider = exports.SocketEventSubscriber = exports.SocketPendingSubscriber = exports.SocketBlockSubscriber = exports.SocketSubscriber = void 0;\nconst abstract_provider_js_1 = require(\"./abstract-provider.js\");\nconst index_js_1 = require(\"../utils/index.js\");\nconst provider_jsonrpc_js_1 = require(\"./provider-jsonrpc.js\");\n/**\n *  A **SocketSubscriber** uses a socket transport to handle events and\n *  should use [[_emit]] to manage the events.\n */\nclass SocketSubscriber {\n    #provider;\n    #filter;\n    /**\n     *  The filter.\n     */\n    get filter() { return JSON.parse(this.#filter); }\n    #filterId;\n    #paused;\n    #emitPromise;\n    /**\n     *  Creates a new **SocketSubscriber** attached to %%provider%% listening\n     *  to %%filter%%.\n     */\n    constructor(provider, filter) {\n        this.#provider = provider;\n        this.#filter = JSON.stringify(filter);\n        this.#filterId = null;\n        this.#paused = null;\n        this.#emitPromise = null;\n    }\n    start() {\n        this.#filterId = this.#provider.send(\"eth_subscribe\", this.filter).then((filterId) => {\n            ;\n            this.#provider._register(filterId, this);\n            return filterId;\n        });\n    }\n    stop() {\n        (this.#filterId).then((filterId) => {\n            if (this.#provider.destroyed) {\n                return;\n            }\n            this.#provider.send(\"eth_unsubscribe\", [filterId]);\n        });\n        this.#filterId = null;\n    }\n    // @TODO: pause should trap the current blockNumber, unsub, and on resume use getLogs\n    //        and resume\n    pause(dropWhilePaused) {\n        (0, index_js_1.assert)(dropWhilePaused, \"preserve logs while paused not supported by SocketSubscriber yet\", \"UNSUPPORTED_OPERATION\", { operation: \"pause(false)\" });\n        this.#paused = !!dropWhilePaused;\n    }\n    resume() {\n        this.#paused = null;\n    }\n    /**\n     *  @_ignore:\n     */\n    _handleMessage(message) {\n        if (this.#filterId == null) {\n            return;\n        }\n        if (this.#paused === null) {\n            let emitPromise = this.#emitPromise;\n            if (emitPromise == null) {\n                emitPromise = this._emit(this.#provider, message);\n            }\n            else {\n                emitPromise = emitPromise.then(async () => {\n                    await this._emit(this.#provider, message);\n                });\n            }\n            this.#emitPromise = emitPromise.then(() => {\n                if (this.#emitPromise === emitPromise) {\n                    this.#emitPromise = null;\n                }\n            });\n        }\n    }\n    /**\n     *  Sub-classes **must** override this to emit the events on the\n     *  provider.\n     */\n    async _emit(provider, message) {\n        throw new Error(\"sub-classes must implemente this; _emit\");\n    }\n}\nexports.SocketSubscriber = SocketSubscriber;\n/**\n *  A **SocketBlockSubscriber** listens for ``newHeads`` events and emits\n *  ``\"block\"`` events.\n */\nclass SocketBlockSubscriber extends SocketSubscriber {\n    /**\n     *  @_ignore:\n     */\n    constructor(provider) {\n        super(provider, [\"newHeads\"]);\n    }\n    async _emit(provider, message) {\n        provider.emit(\"block\", parseInt(message.number));\n    }\n}\nexports.SocketBlockSubscriber = SocketBlockSubscriber;\n/**\n *  A **SocketPendingSubscriber** listens for pending transacitons and emits\n *  ``\"pending\"`` events.\n */\nclass SocketPendingSubscriber extends SocketSubscriber {\n    /**\n     *  @_ignore:\n     */\n    constructor(provider) {\n        super(provider, [\"newPendingTransactions\"]);\n    }\n    async _emit(provider, message) {\n        provider.emit(\"pending\", message);\n    }\n}\nexports.SocketPendingSubscriber = SocketPendingSubscriber;\n/**\n *  A **SocketEventSubscriber** listens for event logs.\n */\nclass SocketEventSubscriber extends SocketSubscriber {\n    #logFilter;\n    /**\n     *  The filter.\n     */\n    get logFilter() { return JSON.parse(this.#logFilter); }\n    /**\n     *  @_ignore:\n     */\n    constructor(provider, filter) {\n        super(provider, [\"logs\", filter]);\n        this.#logFilter = JSON.stringify(filter);\n    }\n    async _emit(provider, message) {\n        provider.emit(this.logFilter, provider._wrapLog(message, provider._network));\n    }\n}\nexports.SocketEventSubscriber = SocketEventSubscriber;\n/**\n *  A **SocketProvider** is backed by a long-lived connection over a\n *  socket, which can subscribe and receive real-time messages over\n *  its communication channel.\n */\nclass SocketProvider extends provider_jsonrpc_js_1.JsonRpcApiProvider {\n    #callbacks;\n    // Maps each filterId to its subscriber\n    #subs;\n    // If any events come in before a subscriber has finished\n    // registering, queue them\n    #pending;\n    /**\n     *  Creates a new **SocketProvider** connected to %%network%%.\n     *\n     *  If unspecified, the network will be discovered.\n     */\n    constructor(network, _options) {\n        // Copy the options\n        const options = Object.assign({}, (_options != null) ? _options : {});\n        // Support for batches is generally not supported for\n        // connection-base providers; if this changes in the future\n        // the _send should be updated to reflect this\n        (0, index_js_1.assertArgument)(options.batchMaxCount == null || options.batchMaxCount === 1, \"sockets-based providers do not support batches\", \"options.batchMaxCount\", _options);\n        options.batchMaxCount = 1;\n        // Socket-based Providers (generally) cannot change their network,\n        // since they have a long-lived connection; but let people override\n        // this if they have just cause.\n        if (options.staticNetwork == null) {\n            options.staticNetwork = true;\n        }\n        super(network, options);\n        this.#callbacks = new Map();\n        this.#subs = new Map();\n        this.#pending = new Map();\n    }\n    // This value is only valid after _start has been called\n    /*\n    get _network(): Network {\n        if (this.#network == null) {\n            throw new Error(\"this shouldn't happen\");\n        }\n        return this.#network.clone();\n    }\n    */\n    _getSubscriber(sub) {\n        switch (sub.type) {\n            case \"close\":\n                return new abstract_provider_js_1.UnmanagedSubscriber(\"close\");\n            case \"block\":\n                return new SocketBlockSubscriber(this);\n            case \"pending\":\n                return new SocketPendingSubscriber(this);\n            case \"event\":\n                return new SocketEventSubscriber(this, sub.filter);\n            case \"orphan\":\n                // Handled auto-matically within AbstractProvider\n                // when the log.removed = true\n                if (sub.filter.orphan === \"drop-log\") {\n                    return new abstract_provider_js_1.UnmanagedSubscriber(\"drop-log\");\n                }\n        }\n        return super._getSubscriber(sub);\n    }\n    /**\n     *  Register a new subscriber. This is used internalled by Subscribers\n     *  and generally is unecessary unless extending capabilities.\n     */\n    _register(filterId, subscriber) {\n        this.#subs.set(filterId, subscriber);\n        const pending = this.#pending.get(filterId);\n        if (pending) {\n            for (const message of pending) {\n                subscriber._handleMessage(message);\n            }\n            this.#pending.delete(filterId);\n        }\n    }\n    async _send(payload) {\n        // WebSocket provider doesn't accept batches\n        (0, index_js_1.assertArgument)(!Array.isArray(payload), \"WebSocket does not support batch send\", \"payload\", payload);\n        // @TODO: stringify payloads here and store to prevent mutations\n        // Prepare a promise to respond to\n        const promise = new Promise((resolve, reject) => {\n            this.#callbacks.set(payload.id, { payload, resolve, reject });\n        });\n        // Wait until the socket is connected before writing to it\n        await this._waitUntilReady();\n        // Write the request to the socket\n        await this._write(JSON.stringify(payload));\n        return [await promise];\n    }\n    // Sub-classes must call this once they are connected\n    /*\n    async _start(): Promise<void> {\n        if (this.#ready) { return; }\n\n        for (const { payload } of this.#callbacks.values()) {\n            await this._write(JSON.stringify(payload));\n        }\n\n        this.#ready = (async function() {\n            await super._start();\n        })();\n    }\n    */\n    /**\n     *  Sub-classes **must** call this with messages received over their\n     *  transport to be processed and dispatched.\n     */\n    async _processMessage(message) {\n        const result = (JSON.parse(message));\n        if (result && typeof (result) === \"object\" && \"id\" in result) {\n            const callback = this.#callbacks.get(result.id);\n            if (callback == null) {\n                this.emit(\"error\", (0, index_js_1.makeError)(\"received result for unknown id\", \"UNKNOWN_ERROR\", {\n                    reasonCode: \"UNKNOWN_ID\",\n                    result\n                }));\n                return;\n            }\n            this.#callbacks.delete(result.id);\n            callback.resolve(result);\n        }\n        else if (result && result.method === \"eth_subscription\") {\n            const filterId = result.params.subscription;\n            const subscriber = this.#subs.get(filterId);\n            if (subscriber) {\n                subscriber._handleMessage(result.params.result);\n            }\n            else {\n                let pending = this.#pending.get(filterId);\n                if (pending == null) {\n                    pending = [];\n                    this.#pending.set(filterId, pending);\n                }\n                pending.push(result.params.result);\n            }\n        }\n        else {\n            this.emit(\"error\", (0, index_js_1.makeError)(\"received unexpected message\", \"UNKNOWN_ERROR\", {\n                reasonCode: \"UNEXPECTED_MESSAGE\",\n                result\n            }));\n            return;\n        }\n    }\n    /**\n     *  Sub-classes **must** override this to send %%message%% over their\n     *  transport.\n     */\n    async _write(message) {\n        throw new Error(\"sub-classes must override this\");\n    }\n}\nexports.SocketProvider = SocketProvider;\n//# sourceMappingURL=provider-socket.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WebSocketProvider = void 0;\nconst ws_js_1 = require(\"./ws.js\"); /*-browser*/\nconst provider_socket_js_1 = require(\"./provider-socket.js\");\n/**\n *  A JSON-RPC provider which is backed by a WebSocket.\n *\n *  WebSockets are often preferred because they retain a live connection\n *  to a server, which permits more instant access to events.\n *\n *  However, this incurs higher server infrasturture costs, so additional\n *  resources may be required to host your own WebSocket nodes and many\n *  third-party services charge additional fees for WebSocket endpoints.\n */\nclass WebSocketProvider extends provider_socket_js_1.SocketProvider {\n    #connect;\n    #websocket;\n    get websocket() {\n        if (this.#websocket == null) {\n            throw new Error(\"websocket closed\");\n        }\n        return this.#websocket;\n    }\n    constructor(url, network, options) {\n        super(network, options);\n        if (typeof (url) === \"string\") {\n            this.#connect = () => { return new ws_js_1.WebSocket(url); };\n            this.#websocket = this.#connect();\n        }\n        else if (typeof (url) === \"function\") {\n            this.#connect = url;\n            this.#websocket = url();\n        }\n        else {\n            this.#connect = null;\n            this.#websocket = url;\n        }\n        this.websocket.onopen = async () => {\n            try {\n                await this._start();\n                this.resume();\n            }\n            catch (error) {\n                console.log(\"failed to start WebsocketProvider\", error);\n                // @TODO: now what? Attempt reconnect?\n            }\n        };\n        this.websocket.onmessage = (message) => {\n            this._processMessage(message.data);\n        };\n        /*\n                this.websocket.onclose = (event) => {\n                    // @TODO: What event.code should we reconnect on?\n                    const reconnect = false;\n                    if (reconnect) {\n                        this.pause(true);\n                        if (this.#connect) {\n                            this.#websocket = this.#connect();\n                            this.#websocket.onopen = ...\n                            // @TODO: this requires the super class to rebroadcast; move it there\n                        }\n                        this._reconnect();\n                    }\n                };\n        */\n    }\n    async _write(message) {\n        this.websocket.send(message);\n    }\n    async destroy() {\n        if (this.#websocket != null) {\n            this.#websocket.close();\n            this.#websocket = null;\n        }\n        super.destroy();\n    }\n}\nexports.WebSocketProvider = WebSocketProvider;\n//# sourceMappingURL=provider-websocket.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TransactionResponse = exports.TransactionReceipt = exports.Log = exports.Block = exports.copyRequest = exports.FeeData = void 0;\n//import { resolveAddress } from \"@ethersproject/address\";\nconst index_js_1 = require(\"../utils/index.js\");\nconst index_js_2 = require(\"../transaction/index.js\");\nconst BN_0 = BigInt(0);\n// -----------------------\nfunction getValue(value) {\n    if (value == null) {\n        return null;\n    }\n    return value;\n}\nfunction toJson(value) {\n    if (value == null) {\n        return null;\n    }\n    return value.toString();\n}\n// @TODO? <T extends FeeData = { }> implements Required<T>\n/**\n *  A **FeeData** wraps all the fee-related values associated with\n *  the network.\n */\nclass FeeData {\n    /**\n     *  The gas price for legacy networks.\n     */\n    gasPrice;\n    /**\n     *  The maximum fee to pay per gas.\n     *\n     *  The base fee per gas is defined by the network and based on\n     *  congestion, increasing the cost during times of heavy load\n     *  and lowering when less busy.\n     *\n     *  The actual fee per gas will be the base fee for the block\n     *  and the priority fee, up to the max fee per gas.\n     *\n     *  This will be ``null`` on legacy networks (i.e. [pre-EIP-1559](link-eip-1559))\n     */\n    maxFeePerGas;\n    /**\n     *  The additional amout to pay per gas to encourage a validator\n     *  to include the transaction.\n     *\n     *  The purpose of this is to compensate the validator for the\n     *  adjusted risk for including a given transaction.\n     *\n     *  This will be ``null`` on legacy networks (i.e. [pre-EIP-1559](link-eip-1559))\n     */\n    maxPriorityFeePerGas;\n    /**\n     *  Creates a new FeeData for %%gasPrice%%, %%maxFeePerGas%% and\n     *  %%maxPriorityFeePerGas%%.\n     */\n    constructor(gasPrice, maxFeePerGas, maxPriorityFeePerGas) {\n        (0, index_js_1.defineProperties)(this, {\n            gasPrice: getValue(gasPrice),\n            maxFeePerGas: getValue(maxFeePerGas),\n            maxPriorityFeePerGas: getValue(maxPriorityFeePerGas)\n        });\n    }\n    /**\n     *  Returns a JSON-friendly value.\n     */\n    toJSON() {\n        const { gasPrice, maxFeePerGas, maxPriorityFeePerGas } = this;\n        return {\n            _type: \"FeeData\",\n            gasPrice: toJson(gasPrice),\n            maxFeePerGas: toJson(maxFeePerGas),\n            maxPriorityFeePerGas: toJson(maxPriorityFeePerGas),\n        };\n    }\n}\nexports.FeeData = FeeData;\n;\n/**\n *  Returns a copy of %%req%% with all properties coerced to their strict\n *  types.\n */\nfunction copyRequest(req) {\n    const result = {};\n    // These could be addresses, ENS names or Addressables\n    if (req.to) {\n        result.to = req.to;\n    }\n    if (req.from) {\n        result.from = req.from;\n    }\n    if (req.data) {\n        result.data = (0, index_js_1.hexlify)(req.data);\n    }\n    const bigIntKeys = \"chainId,gasLimit,gasPrice,maxFeePerBlobGas,maxFeePerGas,maxPriorityFeePerGas,value\".split(/,/);\n    for (const key of bigIntKeys) {\n        if (!(key in req) || req[key] == null) {\n            continue;\n        }\n        result[key] = (0, index_js_1.getBigInt)(req[key], `request.${key}`);\n    }\n    const numberKeys = \"type,nonce\".split(/,/);\n    for (const key of numberKeys) {\n        if (!(key in req) || req[key] == null) {\n            continue;\n        }\n        result[key] = (0, index_js_1.getNumber)(req[key], `request.${key}`);\n    }\n    if (req.accessList) {\n        result.accessList = (0, index_js_2.accessListify)(req.accessList);\n    }\n    if (\"blockTag\" in req) {\n        result.blockTag = req.blockTag;\n    }\n    if (\"enableCcipRead\" in req) {\n        result.enableCcipRead = !!req.enableCcipRead;\n    }\n    if (\"customData\" in req) {\n        result.customData = req.customData;\n    }\n    if (\"blobVersionedHashes\" in req && req.blobVersionedHashes) {\n        result.blobVersionedHashes = req.blobVersionedHashes.slice();\n    }\n    if (\"kzg\" in req) {\n        result.kzg = req.kzg;\n    }\n    if (\"blobs\" in req && req.blobs) {\n        result.blobs = req.blobs.map((b) => {\n            if ((0, index_js_1.isBytesLike)(b)) {\n                return (0, index_js_1.hexlify)(b);\n            }\n            return Object.assign({}, b);\n        });\n    }\n    return result;\n}\nexports.copyRequest = copyRequest;\n/**\n *  A **Block** represents the data associated with a full block on\n *  Ethereum.\n */\nclass Block {\n    /**\n     *  The provider connected to the block used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The block number, sometimes called the block height. This is a\n     *  sequential number that is one higher than the parent block.\n     */\n    number;\n    /**\n     *  The block hash.\n     *\n     *  This hash includes all properties, so can be safely used to identify\n     *  an exact set of block properties.\n     */\n    hash;\n    /**\n     *  The timestamp for this block, which is the number of seconds since\n     *  epoch that this block was included.\n     */\n    timestamp;\n    /**\n     *  The block hash of the parent block.\n     */\n    parentHash;\n    /**\n     *  The hash tree root of the parent beacon block for the given\n     *  execution block. See [[link-eip-4788]].\n     */\n    parentBeaconBlockRoot;\n    /**\n     *  The nonce.\n     *\n     *  On legacy networks, this is the random number inserted which\n     *  permitted the difficulty target to be reached.\n     */\n    nonce;\n    /**\n     *  The difficulty target.\n     *\n     *  On legacy networks, this is the proof-of-work target required\n     *  for a block to meet the protocol rules to be included.\n     *\n     *  On modern networks, this is a random number arrived at using\n     *  randao.  @TODO: Find links?\n     */\n    difficulty;\n    /**\n     *  The total gas limit for this block.\n     */\n    gasLimit;\n    /**\n     *  The total gas used in this block.\n     */\n    gasUsed;\n    /**\n     *  The root hash for the global state after applying changes\n     *  in this block.\n     */\n    stateRoot;\n    /**\n     *  The hash of the transaction receipts trie.\n     */\n    receiptsRoot;\n    /**\n     *  The total amount of blob gas consumed by the transactions\n     *  within the block. See [[link-eip-4844]].\n     */\n    blobGasUsed;\n    /**\n     *  The running total of blob gas consumed in excess of the\n     *  target, prior to the block. See [[link-eip-4844]].\n     */\n    excessBlobGas;\n    /**\n     *  The miner coinbase address, wihch receives any subsidies for\n     *  including this block.\n     */\n    miner;\n    /**\n     *  The latest RANDAO mix of the post beacon state of\n     *  the previous block.\n     */\n    prevRandao;\n    /**\n     *  Any extra data the validator wished to include.\n     */\n    extraData;\n    /**\n     *  The base fee per gas that all transactions in this block were\n     *  charged.\n     *\n     *  This adjusts after each block, depending on how congested the network\n     *  is.\n     */\n    baseFeePerGas;\n    #transactions;\n    /**\n     *  Create a new **Block** object.\n     *\n     *  This should generally not be necessary as the unless implementing a\n     *  low-level library.\n     */\n    constructor(block, provider) {\n        this.#transactions = block.transactions.map((tx) => {\n            if (typeof (tx) !== \"string\") {\n                return new TransactionResponse(tx, provider);\n            }\n            return tx;\n        });\n        (0, index_js_1.defineProperties)(this, {\n            provider,\n            hash: getValue(block.hash),\n            number: block.number,\n            timestamp: block.timestamp,\n            parentHash: block.parentHash,\n            parentBeaconBlockRoot: block.parentBeaconBlockRoot,\n            nonce: block.nonce,\n            difficulty: block.difficulty,\n            gasLimit: block.gasLimit,\n            gasUsed: block.gasUsed,\n            blobGasUsed: block.blobGasUsed,\n            excessBlobGas: block.excessBlobGas,\n            miner: block.miner,\n            prevRandao: getValue(block.prevRandao),\n            extraData: block.extraData,\n            baseFeePerGas: getValue(block.baseFeePerGas),\n            stateRoot: block.stateRoot,\n            receiptsRoot: block.receiptsRoot,\n        });\n    }\n    /**\n     *  Returns the list of transaction hashes, in the order\n     *  they were executed within the block.\n     */\n    get transactions() {\n        return this.#transactions.map((tx) => {\n            if (typeof (tx) === \"string\") {\n                return tx;\n            }\n            return tx.hash;\n        });\n    }\n    /**\n     *  Returns the complete transactions, in the order they\n     *  were executed within the block.\n     *\n     *  This is only available for blocks which prefetched\n     *  transactions, by passing ``true`` to %%prefetchTxs%%\n     *  into [[Provider-getBlock]].\n     */\n    get prefetchedTransactions() {\n        const txs = this.#transactions.slice();\n        // Doesn't matter...\n        if (txs.length === 0) {\n            return [];\n        }\n        // Make sure we prefetched the transactions\n        (0, index_js_1.assert)(typeof (txs[0]) === \"object\", \"transactions were not prefetched with block request\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"transactionResponses()\"\n        });\n        return txs;\n    }\n    /**\n     *  Returns a JSON-friendly value.\n     */\n    toJSON() {\n        const { baseFeePerGas, difficulty, extraData, gasLimit, gasUsed, hash, miner, prevRandao, nonce, number, parentHash, parentBeaconBlockRoot, stateRoot, receiptsRoot, timestamp, transactions } = this;\n        return {\n            _type: \"Block\",\n            baseFeePerGas: toJson(baseFeePerGas),\n            difficulty: toJson(difficulty),\n            extraData,\n            gasLimit: toJson(gasLimit),\n            gasUsed: toJson(gasUsed),\n            blobGasUsed: toJson(this.blobGasUsed),\n            excessBlobGas: toJson(this.excessBlobGas),\n            hash, miner, prevRandao, nonce, number, parentHash, timestamp,\n            parentBeaconBlockRoot, stateRoot, receiptsRoot,\n            transactions,\n        };\n    }\n    [Symbol.iterator]() {\n        let index = 0;\n        const txs = this.transactions;\n        return {\n            next: () => {\n                if (index < this.length) {\n                    return {\n                        value: txs[index++], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The number of transactions in this block.\n     */\n    get length() { return this.#transactions.length; }\n    /**\n     *  The [[link-js-date]] this block was included at.\n     */\n    get date() {\n        if (this.timestamp == null) {\n            return null;\n        }\n        return new Date(this.timestamp * 1000);\n    }\n    /**\n     *  Get the transaction at %%indexe%% within this block.\n     */\n    async getTransaction(indexOrHash) {\n        // Find the internal value by its index or hash\n        let tx = undefined;\n        if (typeof (indexOrHash) === \"number\") {\n            tx = this.#transactions[indexOrHash];\n        }\n        else {\n            const hash = indexOrHash.toLowerCase();\n            for (const v of this.#transactions) {\n                if (typeof (v) === \"string\") {\n                    if (v !== hash) {\n                        continue;\n                    }\n                    tx = v;\n                    break;\n                }\n                else {\n                    if (v.hash === hash) {\n                        continue;\n                    }\n                    tx = v;\n                    break;\n                }\n            }\n        }\n        if (tx == null) {\n            throw new Error(\"no such tx\");\n        }\n        if (typeof (tx) === \"string\") {\n            return (await this.provider.getTransaction(tx));\n        }\n        else {\n            return tx;\n        }\n    }\n    /**\n     *  If a **Block** was fetched with a request to include the transactions\n     *  this will allow synchronous access to those transactions.\n     *\n     *  If the transactions were not prefetched, this will throw.\n     */\n    getPrefetchedTransaction(indexOrHash) {\n        const txs = this.prefetchedTransactions;\n        if (typeof (indexOrHash) === \"number\") {\n            return txs[indexOrHash];\n        }\n        indexOrHash = indexOrHash.toLowerCase();\n        for (const tx of txs) {\n            if (tx.hash === indexOrHash) {\n                return tx;\n            }\n        }\n        (0, index_js_1.assertArgument)(false, \"no matching transaction\", \"indexOrHash\", indexOrHash);\n    }\n    /**\n     *  Returns true if this block been mined. This provides a type guard\n     *  for all properties on a [[MinedBlock]].\n     */\n    isMined() { return !!this.hash; }\n    /**\n     *  Returns true if this block is an [[link-eip-2930]] block.\n     */\n    isLondon() {\n        return !!this.baseFeePerGas;\n    }\n    /**\n     *  @_ignore:\n     */\n    orphanedEvent() {\n        if (!this.isMined()) {\n            throw new Error(\"\");\n        }\n        return createOrphanedBlockFilter(this);\n    }\n}\nexports.Block = Block;\n//////////////////////\n// Log\n/**\n *  A **Log** in Ethereum represents an event that has been included in a\n *  transaction using the ``LOG*`` opcodes, which are most commonly used by\n *  Solidity's emit for announcing events.\n */\nclass Log {\n    /**\n     *  The provider connected to the log used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The transaction hash of the transaction this log occurred in. Use the\n     *  [[Log-getTransaction]] to get the [[TransactionResponse]].\n     */\n    transactionHash;\n    /**\n     *  The block hash of the block this log occurred in. Use the\n     *  [[Log-getBlock]] to get the [[Block]].\n     */\n    blockHash;\n    /**\n     *  The block number of the block this log occurred in. It is preferred\n     *  to use the [[Block-hash]] when fetching the related [[Block]],\n     *  since in the case of an orphaned block, the block at that height may\n     *  have changed.\n     */\n    blockNumber;\n    /**\n     *  If the **Log** represents a block that was removed due to an orphaned\n     *  block, this will be true.\n     *\n     *  This can only happen within an orphan event listener.\n     */\n    removed;\n    /**\n     *  The address of the contract that emitted this log.\n     */\n    address;\n    /**\n     *  The data included in this log when it was emitted.\n     */\n    data;\n    /**\n     *  The indexed topics included in this log when it was emitted.\n     *\n     *  All topics are included in the bloom filters, so they can be\n     *  efficiently filtered using the [[Provider-getLogs]] method.\n     */\n    topics;\n    /**\n     *  The index within the block this log occurred at. This is generally\n     *  not useful to developers, but can be used with the various roots\n     *  to proof inclusion within a block.\n     */\n    index;\n    /**\n     *  The index within the transaction of this log.\n     */\n    transactionIndex;\n    /**\n     *  @_ignore:\n     */\n    constructor(log, provider) {\n        this.provider = provider;\n        const topics = Object.freeze(log.topics.slice());\n        (0, index_js_1.defineProperties)(this, {\n            transactionHash: log.transactionHash,\n            blockHash: log.blockHash,\n            blockNumber: log.blockNumber,\n            removed: log.removed,\n            address: log.address,\n            data: log.data,\n            topics,\n            index: log.index,\n            transactionIndex: log.transactionIndex,\n        });\n    }\n    /**\n     *  Returns a JSON-compatible object.\n     */\n    toJSON() {\n        const { address, blockHash, blockNumber, data, index, removed, topics, transactionHash, transactionIndex } = this;\n        return {\n            _type: \"log\",\n            address, blockHash, blockNumber, data, index,\n            removed, topics, transactionHash, transactionIndex\n        };\n    }\n    /**\n     *  Returns the block that this log occurred in.\n     */\n    async getBlock() {\n        const block = await this.provider.getBlock(this.blockHash);\n        (0, index_js_1.assert)(!!block, \"failed to find transaction\", \"UNKNOWN_ERROR\", {});\n        return block;\n    }\n    /**\n     *  Returns the transaction that this log occurred in.\n     */\n    async getTransaction() {\n        const tx = await this.provider.getTransaction(this.transactionHash);\n        (0, index_js_1.assert)(!!tx, \"failed to find transaction\", \"UNKNOWN_ERROR\", {});\n        return tx;\n    }\n    /**\n     *  Returns the transaction receipt fot the transaction that this\n     *  log occurred in.\n     */\n    async getTransactionReceipt() {\n        const receipt = await this.provider.getTransactionReceipt(this.transactionHash);\n        (0, index_js_1.assert)(!!receipt, \"failed to find transaction receipt\", \"UNKNOWN_ERROR\", {});\n        return receipt;\n    }\n    /**\n     *  @_ignore:\n     */\n    removedEvent() {\n        return createRemovedLogFilter(this);\n    }\n}\nexports.Log = Log;\n//////////////////////\n// Transaction Receipt\n/*\nexport interface LegacyTransactionReceipt {\n    byzantium: false;\n    status: null;\n    root: string;\n}\n\nexport interface ByzantiumTransactionReceipt {\n    byzantium: true;\n    status: number;\n    root: null;\n}\n*/\n/**\n *  A **TransactionReceipt** includes additional information about a\n *  transaction that is only available after it has been mined.\n */\nclass TransactionReceipt {\n    /**\n     *  The provider connected to the log used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The address the transaction was sent to.\n     */\n    to;\n    /**\n     *  The sender of the transaction.\n     */\n    from;\n    /**\n     *  The address of the contract if the transaction was directly\n     *  responsible for deploying one.\n     *\n     *  This is non-null **only** if the ``to`` is empty and the ``data``\n     *  was successfully executed as initcode.\n     */\n    contractAddress;\n    /**\n     *  The transaction hash.\n     */\n    hash;\n    /**\n     *  The index of this transaction within the block transactions.\n     */\n    index;\n    /**\n     *  The block hash of the [[Block]] this transaction was included in.\n     */\n    blockHash;\n    /**\n     *  The block number of the [[Block]] this transaction was included in.\n     */\n    blockNumber;\n    /**\n     *  The bloom filter bytes that represent all logs that occurred within\n     *  this transaction. This is generally not useful for most developers,\n     *  but can be used to validate the included logs.\n     */\n    logsBloom;\n    /**\n     *  The actual amount of gas used by this transaction.\n     *\n     *  When creating a transaction, the amount of gas that will be used can\n     *  only be approximated, but the sender must pay the gas fee for the\n     *  entire gas limit. After the transaction, the difference is refunded.\n     */\n    gasUsed;\n    /**\n     *  The gas used for BLObs. See [[link-eip-4844]].\n     */\n    blobGasUsed;\n    /**\n     *  The amount of gas used by all transactions within the block for this\n     *  and all transactions with a lower ``index``.\n     *\n     *  This is generally not useful for developers but can be used to\n     *  validate certain aspects of execution.\n     */\n    cumulativeGasUsed;\n    /**\n     *  The actual gas price used during execution.\n     *\n     *  Due to the complexity of [[link-eip-1559]] this value can only\n     *  be caluclated after the transaction has been mined, snce the base\n     *  fee is protocol-enforced.\n     */\n    gasPrice;\n    /**\n     *  The price paid per BLOB in gas. See [[link-eip-4844]].\n     */\n    blobGasPrice;\n    /**\n     *  The [[link-eip-2718]] transaction type.\n     */\n    type;\n    //readonly byzantium!: boolean;\n    /**\n     *  The status of this transaction, indicating success (i.e. ``1``) or\n     *  a revert (i.e. ``0``).\n     *\n     *  This is available in post-byzantium blocks, but some backends may\n     *  backfill this value.\n     */\n    status;\n    /**\n     *  The root hash of this transaction.\n     *\n     *  This is no present and was only included in pre-byzantium blocks, but\n     *  could be used to validate certain parts of the receipt.\n     */\n    root;\n    #logs;\n    /**\n     *  @_ignore:\n     */\n    constructor(tx, provider) {\n        this.#logs = Object.freeze(tx.logs.map((log) => {\n            return new Log(log, provider);\n        }));\n        let gasPrice = BN_0;\n        if (tx.effectiveGasPrice != null) {\n            gasPrice = tx.effectiveGasPrice;\n        }\n        else if (tx.gasPrice != null) {\n            gasPrice = tx.gasPrice;\n        }\n        (0, index_js_1.defineProperties)(this, {\n            provider,\n            to: tx.to,\n            from: tx.from,\n            contractAddress: tx.contractAddress,\n            hash: tx.hash,\n            index: tx.index,\n            blockHash: tx.blockHash,\n            blockNumber: tx.blockNumber,\n            logsBloom: tx.logsBloom,\n            gasUsed: tx.gasUsed,\n            cumulativeGasUsed: tx.cumulativeGasUsed,\n            blobGasUsed: tx.blobGasUsed,\n            gasPrice,\n            blobGasPrice: tx.blobGasPrice,\n            type: tx.type,\n            //byzantium: tx.byzantium,\n            status: tx.status,\n            root: tx.root\n        });\n    }\n    /**\n     *  The logs for this transaction.\n     */\n    get logs() { return this.#logs; }\n    /**\n     *  Returns a JSON-compatible representation.\n     */\n    toJSON() {\n        const { to, from, contractAddress, hash, index, blockHash, blockNumber, logsBloom, logs, //byzantium, \n        status, root } = this;\n        return {\n            _type: \"TransactionReceipt\",\n            blockHash, blockNumber,\n            //byzantium, \n            contractAddress,\n            cumulativeGasUsed: toJson(this.cumulativeGasUsed),\n            from,\n            gasPrice: toJson(this.gasPrice),\n            blobGasUsed: toJson(this.blobGasUsed),\n            blobGasPrice: toJson(this.blobGasPrice),\n            gasUsed: toJson(this.gasUsed),\n            hash, index, logs, logsBloom, root, status, to\n        };\n    }\n    /**\n     *  @_ignore:\n     */\n    get length() { return this.logs.length; }\n    [Symbol.iterator]() {\n        let index = 0;\n        return {\n            next: () => {\n                if (index < this.length) {\n                    return { value: this.logs[index++], done: false };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The total fee for this transaction, in wei.\n     */\n    get fee() {\n        return this.gasUsed * this.gasPrice;\n    }\n    /**\n     *  Resolves to the block this transaction occurred in.\n     */\n    async getBlock() {\n        const block = await this.provider.getBlock(this.blockHash);\n        if (block == null) {\n            throw new Error(\"TODO\");\n        }\n        return block;\n    }\n    /**\n     *  Resolves to the transaction this transaction occurred in.\n     */\n    async getTransaction() {\n        const tx = await this.provider.getTransaction(this.hash);\n        if (tx == null) {\n            throw new Error(\"TODO\");\n        }\n        return tx;\n    }\n    /**\n     *  Resolves to the return value of the execution of this transaction.\n     *\n     *  Support for this feature is limited, as it requires an archive node\n     *  with the ``debug_`` or ``trace_`` API enabled.\n     */\n    async getResult() {\n        return (await this.provider.getTransactionResult(this.hash));\n    }\n    /**\n     *  Resolves to the number of confirmations this transaction has.\n     */\n    async confirmations() {\n        return (await this.provider.getBlockNumber()) - this.blockNumber + 1;\n    }\n    /**\n     *  @_ignore:\n     */\n    removedEvent() {\n        return createRemovedTransactionFilter(this);\n    }\n    /**\n     *  @_ignore:\n     */\n    reorderedEvent(other) {\n        (0, index_js_1.assert)(!other || other.isMined(), \"unmined 'other' transction cannot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"reorderedEvent(other)\" });\n        return createReorderedTransactionFilter(this, other);\n    }\n}\nexports.TransactionReceipt = TransactionReceipt;\n/**\n *  A **TransactionResponse** includes all properties about a transaction\n *  that was sent to the network, which may or may not be included in a\n *  block.\n *\n *  The [[TransactionResponse-isMined]] can be used to check if the\n *  transaction has been mined as well as type guard that the otherwise\n *  possibly ``null`` properties are defined.\n */\nclass TransactionResponse {\n    /**\n     *  The provider this is connected to, which will influence how its\n     *  methods will resolve its async inspection methods.\n     */\n    provider;\n    /**\n     *  The block number of the block that this transaction was included in.\n     *\n     *  This is ``null`` for pending transactions.\n     */\n    blockNumber;\n    /**\n     *  The blockHash of the block that this transaction was included in.\n     *\n     *  This is ``null`` for pending transactions.\n     */\n    blockHash;\n    /**\n     *  The index within the block that this transaction resides at.\n     */\n    index;\n    /**\n     *  The transaction hash.\n     */\n    hash;\n    /**\n     *  The [[link-eip-2718]] transaction envelope type. This is\n     *  ``0`` for legacy transactions types.\n     */\n    type;\n    /**\n     *  The receiver of this transaction.\n     *\n     *  If ``null``, then the transaction is an initcode transaction.\n     *  This means the result of executing the [[data]] will be deployed\n     *  as a new contract on chain (assuming it does not revert) and the\n     *  address may be computed using [[getCreateAddress]].\n     */\n    to;\n    /**\n     *  The sender of this transaction. It is implicitly computed\n     *  from the transaction pre-image hash (as the digest) and the\n     *  [[signature]] using ecrecover.\n     */\n    from;\n    /**\n     *  The nonce, which is used to prevent replay attacks and offer\n     *  a method to ensure transactions from a given sender are explicitly\n     *  ordered.\n     *\n     *  When sending a transaction, this must be equal to the number of\n     *  transactions ever sent by [[from]].\n     */\n    nonce;\n    /**\n     *  The maximum units of gas this transaction can consume. If execution\n     *  exceeds this, the entries transaction is reverted and the sender\n     *  is charged for the full amount, despite not state changes being made.\n     */\n    gasLimit;\n    /**\n     *  The gas price can have various values, depending on the network.\n     *\n     *  In modern networks, for transactions that are included this is\n     *  the //effective gas price// (the fee per gas that was actually\n     *  charged), while for transactions that have not been included yet\n     *  is the [[maxFeePerGas]].\n     *\n     *  For legacy transactions, or transactions on legacy networks, this\n     *  is the fee that will be charged per unit of gas the transaction\n     *  consumes.\n     */\n    gasPrice;\n    /**\n     *  The maximum priority fee (per unit of gas) to allow a\n     *  validator to charge the sender. This is inclusive of the\n     *  [[maxFeeFeePerGas]].\n     */\n    maxPriorityFeePerGas;\n    /**\n     *  The maximum fee (per unit of gas) to allow this transaction\n     *  to charge the sender.\n     */\n    maxFeePerGas;\n    /**\n     *  The [[link-eip-4844]] max fee per BLOb gas.\n     */\n    maxFeePerBlobGas;\n    /**\n     *  The data.\n     */\n    data;\n    /**\n     *  The value, in wei. Use [[formatEther]] to format this value\n     *  as ether.\n     */\n    value;\n    /**\n     *  The chain ID.\n     */\n    chainId;\n    /**\n     *  The signature.\n     */\n    signature;\n    /**\n     *  The [[link-eip-2930]] access list for transaction types that\n     *  support it, otherwise ``null``.\n     */\n    accessList;\n    /**\n     *  The [[link-eip-4844]] BLOb versioned hashes.\n     */\n    blobVersionedHashes;\n    #startBlock;\n    /**\n     *  @_ignore:\n     */\n    constructor(tx, provider) {\n        this.provider = provider;\n        this.blockNumber = (tx.blockNumber != null) ? tx.blockNumber : null;\n        this.blockHash = (tx.blockHash != null) ? tx.blockHash : null;\n        this.hash = tx.hash;\n        this.index = tx.index;\n        this.type = tx.type;\n        this.from = tx.from;\n        this.to = tx.to || null;\n        this.gasLimit = tx.gasLimit;\n        this.nonce = tx.nonce;\n        this.data = tx.data;\n        this.value = tx.value;\n        this.gasPrice = tx.gasPrice;\n        this.maxPriorityFeePerGas = (tx.maxPriorityFeePerGas != null) ? tx.maxPriorityFeePerGas : null;\n        this.maxFeePerGas = (tx.maxFeePerGas != null) ? tx.maxFeePerGas : null;\n        this.maxFeePerBlobGas = (tx.maxFeePerBlobGas != null) ? tx.maxFeePerBlobGas : null;\n        this.chainId = tx.chainId;\n        this.signature = tx.signature;\n        this.accessList = (tx.accessList != null) ? tx.accessList : null;\n        this.blobVersionedHashes = (tx.blobVersionedHashes != null) ? tx.blobVersionedHashes : null;\n        this.#startBlock = -1;\n    }\n    /**\n     *  Returns a JSON-compatible representation of this transaction.\n     */\n    toJSON() {\n        const { blockNumber, blockHash, index, hash, type, to, from, nonce, data, signature, accessList, blobVersionedHashes } = this;\n        return {\n            _type: \"TransactionResponse\",\n            accessList, blockNumber, blockHash,\n            blobVersionedHashes,\n            chainId: toJson(this.chainId),\n            data, from,\n            gasLimit: toJson(this.gasLimit),\n            gasPrice: toJson(this.gasPrice),\n            hash,\n            maxFeePerGas: toJson(this.maxFeePerGas),\n            maxPriorityFeePerGas: toJson(this.maxPriorityFeePerGas),\n            maxFeePerBlobGas: toJson(this.maxFeePerBlobGas),\n            nonce, signature, to, index, type,\n            value: toJson(this.value),\n        };\n    }\n    /**\n     *  Resolves to the Block that this transaction was included in.\n     *\n     *  This will return null if the transaction has not been included yet.\n     */\n    async getBlock() {\n        let blockNumber = this.blockNumber;\n        if (blockNumber == null) {\n            const tx = await this.getTransaction();\n            if (tx) {\n                blockNumber = tx.blockNumber;\n            }\n        }\n        if (blockNumber == null) {\n            return null;\n        }\n        const block = this.provider.getBlock(blockNumber);\n        if (block == null) {\n            throw new Error(\"TODO\");\n        }\n        return block;\n    }\n    /**\n     *  Resolves to this transaction being re-requested from the\n     *  provider. This can be used if you have an unmined transaction\n     *  and wish to get an up-to-date populated instance.\n     */\n    async getTransaction() {\n        return this.provider.getTransaction(this.hash);\n    }\n    /**\n     *  Resolve to the number of confirmations this transaction has.\n     */\n    async confirmations() {\n        if (this.blockNumber == null) {\n            const { tx, blockNumber } = await (0, index_js_1.resolveProperties)({\n                tx: this.getTransaction(),\n                blockNumber: this.provider.getBlockNumber()\n            });\n            // Not mined yet...\n            if (tx == null || tx.blockNumber == null) {\n                return 0;\n            }\n            return blockNumber - tx.blockNumber + 1;\n        }\n        const blockNumber = await this.provider.getBlockNumber();\n        return blockNumber - this.blockNumber + 1;\n    }\n    /**\n     *  Resolves once this transaction has been mined and has\n     *  %%confirms%% blocks including it (default: ``1``) with an\n     *  optional %%timeout%%.\n     *\n     *  This can resolve to ``null`` only if %%confirms%% is ``0``\n     *  and the transaction has not been mined, otherwise this will\n     *  wait until enough confirmations have completed.\n     */\n    async wait(_confirms, _timeout) {\n        const confirms = (_confirms == null) ? 1 : _confirms;\n        const timeout = (_timeout == null) ? 0 : _timeout;\n        let startBlock = this.#startBlock;\n        let nextScan = -1;\n        let stopScanning = (startBlock === -1) ? true : false;\n        const checkReplacement = async () => {\n            // Get the current transaction count for this sender\n            if (stopScanning) {\n                return null;\n            }\n            const { blockNumber, nonce } = await (0, index_js_1.resolveProperties)({\n                blockNumber: this.provider.getBlockNumber(),\n                nonce: this.provider.getTransactionCount(this.from)\n            });\n            // No transaction or our nonce has not been mined yet; but we\n            // can start scanning later when we do start\n            if (nonce < this.nonce) {\n                startBlock = blockNumber;\n                return;\n            }\n            // We were mined; no replacement\n            if (stopScanning) {\n                return null;\n            }\n            const mined = await this.getTransaction();\n            if (mined && mined.blockNumber != null) {\n                return;\n            }\n            // We were replaced; start scanning for that transaction\n            // Starting to scan; look back a few extra blocks for safety\n            if (nextScan === -1) {\n                nextScan = startBlock - 3;\n                if (nextScan < this.#startBlock) {\n                    nextScan = this.#startBlock;\n                }\n            }\n            while (nextScan <= blockNumber) {\n                // Get the next block to scan\n                if (stopScanning) {\n                    return null;\n                }\n                const block = await this.provider.getBlock(nextScan, true);\n                // This should not happen; but we'll try again shortly\n                if (block == null) {\n                    return;\n                }\n                // We were mined; no replacement\n                for (const hash of block) {\n                    if (hash === this.hash) {\n                        return;\n                    }\n                }\n                // Search for the transaction that replaced us\n                for (let i = 0; i < block.length; i++) {\n                    const tx = await block.getTransaction(i);\n                    if (tx.from === this.from && tx.nonce === this.nonce) {\n                        // Get the receipt\n                        if (stopScanning) {\n                            return null;\n                        }\n                        const receipt = await this.provider.getTransactionReceipt(tx.hash);\n                        // This should not happen; but we'll try again shortly\n                        if (receipt == null) {\n                            return;\n                        }\n                        // We will retry this on the next block (this case could be optimized)\n                        if ((blockNumber - receipt.blockNumber + 1) < confirms) {\n                            return;\n                        }\n                        // The reason we were replaced\n                        let reason = \"replaced\";\n                        if (tx.data === this.data && tx.to === this.to && tx.value === this.value) {\n                            reason = \"repriced\";\n                        }\n                        else if (tx.data === \"0x\" && tx.from === tx.to && tx.value === BN_0) {\n                            reason = \"cancelled\";\n                        }\n                        (0, index_js_1.assert)(false, \"transaction was replaced\", \"TRANSACTION_REPLACED\", {\n                            cancelled: (reason === \"replaced\" || reason === \"cancelled\"),\n                            reason,\n                            replacement: tx.replaceableTransaction(startBlock),\n                            hash: tx.hash,\n                            receipt\n                        });\n                    }\n                }\n                nextScan++;\n            }\n            return;\n        };\n        const checkReceipt = (receipt) => {\n            if (receipt == null || receipt.status !== 0) {\n                return receipt;\n            }\n            (0, index_js_1.assert)(false, \"transaction execution reverted\", \"CALL_EXCEPTION\", {\n                action: \"sendTransaction\",\n                data: null, reason: null, invocation: null, revert: null,\n                transaction: {\n                    to: receipt.to,\n                    from: receipt.from,\n                    data: \"\" // @TODO: in v7, split out sendTransaction properties\n                }, receipt\n            });\n        };\n        const receipt = await this.provider.getTransactionReceipt(this.hash);\n        if (confirms === 0) {\n            return checkReceipt(receipt);\n        }\n        if (receipt) {\n            if ((await receipt.confirmations()) >= confirms) {\n                return checkReceipt(receipt);\n            }\n        }\n        else {\n            // Check for a replacement; throws if a replacement was found\n            await checkReplacement();\n            // Allow null only when the confirms is 0\n            if (confirms === 0) {\n                return null;\n            }\n        }\n        const waiter = new Promise((resolve, reject) => {\n            // List of things to cancel when we have a result (one way or the other)\n            const cancellers = [];\n            const cancel = () => { cancellers.forEach((c) => c()); };\n            // On cancel, stop scanning for replacements\n            cancellers.push(() => { stopScanning = true; });\n            // Set up any timeout requested\n            if (timeout > 0) {\n                const timer = setTimeout(() => {\n                    cancel();\n                    reject((0, index_js_1.makeError)(\"wait for transaction timeout\", \"TIMEOUT\"));\n                }, timeout);\n                cancellers.push(() => { clearTimeout(timer); });\n            }\n            const txListener = async (receipt) => {\n                // Done; return it!\n                if ((await receipt.confirmations()) >= confirms) {\n                    cancel();\n                    try {\n                        resolve(checkReceipt(receipt));\n                    }\n                    catch (error) {\n                        reject(error);\n                    }\n                }\n            };\n            cancellers.push(() => { this.provider.off(this.hash, txListener); });\n            this.provider.on(this.hash, txListener);\n            // We support replacement detection; start checking\n            if (startBlock >= 0) {\n                const replaceListener = async () => {\n                    try {\n                        // Check for a replacement; this throws only if one is found\n                        await checkReplacement();\n                    }\n                    catch (error) {\n                        // We were replaced (with enough confirms); re-throw the error\n                        if ((0, index_js_1.isError)(error, \"TRANSACTION_REPLACED\")) {\n                            cancel();\n                            reject(error);\n                            return;\n                        }\n                    }\n                    // Rescheudle a check on the next block\n                    if (!stopScanning) {\n                        this.provider.once(\"block\", replaceListener);\n                    }\n                };\n                cancellers.push(() => { this.provider.off(\"block\", replaceListener); });\n                this.provider.once(\"block\", replaceListener);\n            }\n        });\n        return await waiter;\n    }\n    /**\n     *  Returns ``true`` if this transaction has been included.\n     *\n     *  This is effective only as of the time the TransactionResponse\n     *  was instantiated. To get up-to-date information, use\n     *  [[getTransaction]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  non-null property values for properties that are null for\n     *  unmined transactions.\n     */\n    isMined() {\n        return (this.blockHash != null);\n    }\n    /**\n     *  Returns true if the transaction is a legacy (i.e. ``type == 0``)\n     *  transaction.\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isLegacy() {\n        return (this.type === 0);\n    }\n    /**\n     *  Returns true if the transaction is a Berlin (i.e. ``type == 1``)\n     *  transaction. See [[link-eip-2070]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isBerlin() {\n        return (this.type === 1);\n    }\n    /**\n     *  Returns true if the transaction is a London (i.e. ``type == 2``)\n     *  transaction. See [[link-eip-1559]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isLondon() {\n        return (this.type === 2);\n    }\n    /**\n     *  Returns true if hte transaction is a Cancun (i.e. ``type == 3``)\n     *  transaction. See [[link-eip-4844]].\n     */\n    isCancun() {\n        return (this.type === 3);\n    }\n    /**\n     *  Returns a filter which can be used to listen for orphan events\n     *  that evict this transaction.\n     */\n    removedEvent() {\n        (0, index_js_1.assert)(this.isMined(), \"unmined transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        return createRemovedTransactionFilter(this);\n    }\n    /**\n     *  Returns a filter which can be used to listen for orphan events\n     *  that re-order this event against %%other%%.\n     */\n    reorderedEvent(other) {\n        (0, index_js_1.assert)(this.isMined(), \"unmined transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        (0, index_js_1.assert)(!other || other.isMined(), \"unmined 'other' transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        return createReorderedTransactionFilter(this, other);\n    }\n    /**\n     *  Returns a new TransactionResponse instance which has the ability to\n     *  detect (and throw an error) if the transaction is replaced, which\n     *  will begin scanning at %%startBlock%%.\n     *\n     *  This should generally not be used by developers and is intended\n     *  primarily for internal use. Setting an incorrect %%startBlock%% can\n     *  have devastating performance consequences if used incorrectly.\n     */\n    replaceableTransaction(startBlock) {\n        (0, index_js_1.assertArgument)(Number.isInteger(startBlock) && startBlock >= 0, \"invalid startBlock\", \"startBlock\", startBlock);\n        const tx = new TransactionResponse(this, this.provider);\n        tx.#startBlock = startBlock;\n        return tx;\n    }\n}\nexports.TransactionResponse = TransactionResponse;\nfunction createOrphanedBlockFilter(block) {\n    return { orphan: \"drop-block\", hash: block.hash, number: block.number };\n}\nfunction createReorderedTransactionFilter(tx, other) {\n    return { orphan: \"reorder-transaction\", tx, other };\n}\nfunction createRemovedTransactionFilter(tx) {\n    return { orphan: \"drop-transaction\", tx };\n}\nfunction createRemovedLogFilter(log) {\n    return { orphan: \"drop-log\", log: {\n            transactionHash: log.transactionHash,\n            blockHash: log.blockHash,\n            blockNumber: log.blockNumber,\n            address: log.address,\n            data: log.data,\n            topics: Object.freeze(log.topics.slice()),\n            index: log.index\n        } };\n}\n//# sourceMappingURL=provider.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NonceManager = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst abstract_signer_js_1 = require(\"./abstract-signer.js\");\n/**\n *  A **NonceManager** wraps another [[Signer]] and automatically manages\n *  the nonce, ensuring serialized and sequential nonces are used during\n *  transaction.\n */\nclass NonceManager extends abstract_signer_js_1.AbstractSigner {\n    /**\n     *  The Signer being managed.\n     */\n    signer;\n    #noncePromise;\n    #delta;\n    /**\n     *  Creates a new **NonceManager** to manage %%signer%%.\n     */\n    constructor(signer) {\n        super(signer.provider);\n        (0, index_js_1.defineProperties)(this, { signer });\n        this.#noncePromise = null;\n        this.#delta = 0;\n    }\n    async getAddress() {\n        return this.signer.getAddress();\n    }\n    connect(provider) {\n        return new NonceManager(this.signer.connect(provider));\n    }\n    async getNonce(blockTag) {\n        if (blockTag === \"pending\") {\n            if (this.#noncePromise == null) {\n                this.#noncePromise = super.getNonce(\"pending\");\n            }\n            const delta = this.#delta;\n            return (await this.#noncePromise) + delta;\n        }\n        return super.getNonce(blockTag);\n    }\n    /**\n     *  Manually increment the nonce. This may be useful when managng\n     *  offline transactions.\n     */\n    increment() {\n        this.#delta++;\n    }\n    /**\n     *  Resets the nonce, causing the **NonceManager** to reload the current\n     *  nonce from the blockchain on the next transaction.\n     */\n    reset() {\n        this.#delta = 0;\n        this.#noncePromise = null;\n    }\n    async sendTransaction(tx) {\n        const noncePromise = this.getNonce(\"pending\");\n        this.increment();\n        tx = await this.signer.populateTransaction(tx);\n        tx.nonce = await noncePromise;\n        // @TODO: Maybe handle interesting/recoverable errors?\n        // Like don't increment if the tx was certainly not sent\n        return await this.signer.sendTransaction(tx);\n    }\n    signTransaction(tx) {\n        return this.signer.signTransaction(tx);\n    }\n    signMessage(message) {\n        return this.signer.signMessage(message);\n    }\n    signTypedData(domain, types, value) {\n        return this.signer.signTypedData(domain, types, value);\n    }\n}\nexports.NonceManager = NonceManager;\n//# sourceMappingURL=signer-noncemanager.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FilterIdPendingSubscriber = exports.FilterIdEventSubscriber = exports.FilterIdSubscriber = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst subscriber_polling_js_1 = require(\"./subscriber-polling.js\");\nfunction copy(obj) {\n    return JSON.parse(JSON.stringify(obj));\n}\n/**\n *  Some backends support subscribing to events using a Filter ID.\n *\n *  When subscribing with this technique, the node issues a unique\n *  //Filter ID//. At this point the node dedicates resources to\n *  the filter, so that periodic calls to follow up on the //Filter ID//\n *  will receive any events since the last call.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass FilterIdSubscriber {\n    #provider;\n    #filterIdPromise;\n    #poller;\n    #running;\n    #network;\n    #hault;\n    /**\n     *  Creates a new **FilterIdSubscriber** which will used [[_subscribe]]\n     *  and [[_emitResults]] to setup the subscription and provide the event\n     *  to the %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#filterIdPromise = null;\n        this.#poller = this.#poll.bind(this);\n        this.#running = false;\n        this.#network = null;\n        this.#hault = false;\n    }\n    /**\n     *  Sub-classes **must** override this to begin the subscription.\n     */\n    _subscribe(provider) {\n        throw new Error(\"subclasses must override this\");\n    }\n    /**\n     *  Sub-classes **must** override this handle the events.\n     */\n    _emitResults(provider, result) {\n        throw new Error(\"subclasses must override this\");\n    }\n    /**\n     *  Sub-classes **must** override this handle recovery on errors.\n     */\n    _recover(provider) {\n        throw new Error(\"subclasses must override this\");\n    }\n    async #poll(blockNumber) {\n        try {\n            // Subscribe if necessary\n            if (this.#filterIdPromise == null) {\n                this.#filterIdPromise = this._subscribe(this.#provider);\n            }\n            // Get the Filter ID\n            let filterId = null;\n            try {\n                filterId = await this.#filterIdPromise;\n            }\n            catch (error) {\n                if (!(0, index_js_1.isError)(error, \"UNSUPPORTED_OPERATION\") || error.operation !== \"eth_newFilter\") {\n                    throw error;\n                }\n            }\n            // The backend does not support Filter ID; downgrade to\n            // polling\n            if (filterId == null) {\n                this.#filterIdPromise = null;\n                this.#provider._recoverSubscriber(this, this._recover(this.#provider));\n                return;\n            }\n            const network = await this.#provider.getNetwork();\n            if (!this.#network) {\n                this.#network = network;\n            }\n            if (this.#network.chainId !== network.chainId) {\n                throw new Error(\"chaid changed\");\n            }\n            if (this.#hault) {\n                return;\n            }\n            const result = await this.#provider.send(\"eth_getFilterChanges\", [filterId]);\n            await this._emitResults(this.#provider, result);\n        }\n        catch (error) {\n            console.log(\"@TODO\", error);\n        }\n        this.#provider.once(\"block\", this.#poller);\n    }\n    #teardown() {\n        const filterIdPromise = this.#filterIdPromise;\n        if (filterIdPromise) {\n            this.#filterIdPromise = null;\n            filterIdPromise.then((filterId) => {\n                if (this.#provider.destroyed) {\n                    return;\n                }\n                this.#provider.send(\"eth_uninstallFilter\", [filterId]);\n            });\n        }\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        this.#poll(-2);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#hault = true;\n        this.#teardown();\n        this.#provider.off(\"block\", this.#poller);\n    }\n    pause(dropWhilePaused) {\n        if (dropWhilePaused) {\n            this.#teardown();\n        }\n        this.#provider.off(\"block\", this.#poller);\n    }\n    resume() { this.start(); }\n}\nexports.FilterIdSubscriber = FilterIdSubscriber;\n/**\n *  A **FilterIdSubscriber** for receiving contract events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass FilterIdEventSubscriber extends FilterIdSubscriber {\n    #event;\n    /**\n     *  Creates a new **FilterIdEventSubscriber** attached to %%provider%%\n     *  listening for %%filter%%.\n     */\n    constructor(provider, filter) {\n        super(provider);\n        this.#event = copy(filter);\n    }\n    _recover(provider) {\n        return new subscriber_polling_js_1.PollingEventSubscriber(provider, this.#event);\n    }\n    async _subscribe(provider) {\n        const filterId = await provider.send(\"eth_newFilter\", [this.#event]);\n        return filterId;\n    }\n    async _emitResults(provider, results) {\n        for (const result of results) {\n            provider.emit(this.#event, provider._wrapLog(result, provider._network));\n        }\n    }\n}\nexports.FilterIdEventSubscriber = FilterIdEventSubscriber;\n/**\n *  A **FilterIdSubscriber** for receiving pending transactions events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass FilterIdPendingSubscriber extends FilterIdSubscriber {\n    async _subscribe(provider) {\n        return await provider.send(\"eth_newPendingTransactionFilter\", []);\n    }\n    async _emitResults(provider, results) {\n        for (const result of results) {\n            provider.emit(\"pending\", result);\n        }\n    }\n}\nexports.FilterIdPendingSubscriber = FilterIdPendingSubscriber;\n//# sourceMappingURL=subscriber-filterid.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PollingEventSubscriber = exports.PollingTransactionSubscriber = exports.PollingOrphanSubscriber = exports.PollingBlockTagSubscriber = exports.OnBlockSubscriber = exports.PollingBlockSubscriber = exports.getPollingSubscriber = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nfunction copy(obj) {\n    return JSON.parse(JSON.stringify(obj));\n}\n/**\n *  Return the polling subscriber for common events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nfunction getPollingSubscriber(provider, event) {\n    if (event === \"block\") {\n        return new PollingBlockSubscriber(provider);\n    }\n    if ((0, index_js_1.isHexString)(event, 32)) {\n        return new PollingTransactionSubscriber(provider, event);\n    }\n    (0, index_js_1.assert)(false, \"unsupported polling event\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"getPollingSubscriber\", info: { event }\n    });\n}\nexports.getPollingSubscriber = getPollingSubscriber;\n// @TODO: refactor this\n/**\n *  A **PollingBlockSubscriber** polls at a regular interval for a change\n *  in the block number.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass PollingBlockSubscriber {\n    #provider;\n    #poller;\n    #interval;\n    // The most recent block we have scanned for events. The value -2\n    // indicates we still need to fetch an initial block number\n    #blockNumber;\n    /**\n     *  Create a new **PollingBlockSubscriber** attached to %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#poller = null;\n        this.#interval = 4000;\n        this.#blockNumber = -2;\n    }\n    /**\n     *  The polling interval.\n     */\n    get pollingInterval() { return this.#interval; }\n    set pollingInterval(value) { this.#interval = value; }\n    async #poll() {\n        try {\n            const blockNumber = await this.#provider.getBlockNumber();\n            // Bootstrap poll to setup our initial block number\n            if (this.#blockNumber === -2) {\n                this.#blockNumber = blockNumber;\n                return;\n            }\n            // @TODO: Put a cap on the maximum number of events per loop?\n            if (blockNumber !== this.#blockNumber) {\n                for (let b = this.#blockNumber + 1; b <= blockNumber; b++) {\n                    // We have been stopped\n                    if (this.#poller == null) {\n                        return;\n                    }\n                    await this.#provider.emit(\"block\", b);\n                }\n                this.#blockNumber = blockNumber;\n            }\n        }\n        catch (error) {\n            // @TODO: Minor bump, add an \"error\" event to let subscribers\n            //        know things went awry.\n            //console.log(error);\n        }\n        // We have been stopped\n        if (this.#poller == null) {\n            return;\n        }\n        this.#poller = this.#provider._setTimeout(this.#poll.bind(this), this.#interval);\n    }\n    start() {\n        if (this.#poller) {\n            return;\n        }\n        this.#poller = this.#provider._setTimeout(this.#poll.bind(this), this.#interval);\n        this.#poll();\n    }\n    stop() {\n        if (!this.#poller) {\n            return;\n        }\n        this.#provider._clearTimeout(this.#poller);\n        this.#poller = null;\n    }\n    pause(dropWhilePaused) {\n        this.stop();\n        if (dropWhilePaused) {\n            this.#blockNumber = -2;\n        }\n    }\n    resume() {\n        this.start();\n    }\n}\nexports.PollingBlockSubscriber = PollingBlockSubscriber;\n/**\n *  An **OnBlockSubscriber** can be sub-classed, with a [[_poll]]\n *  implmentation which will be called on every new block.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass OnBlockSubscriber {\n    #provider;\n    #poll;\n    #running;\n    /**\n     *  Create a new **OnBlockSubscriber** attached to %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#running = false;\n        this.#poll = (blockNumber) => {\n            this._poll(blockNumber, this.#provider);\n        };\n    }\n    /**\n     *  Called on every new block.\n     */\n    async _poll(blockNumber, provider) {\n        throw new Error(\"sub-classes must override this\");\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        this.#poll(-2);\n        this.#provider.on(\"block\", this.#poll);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#provider.off(\"block\", this.#poll);\n    }\n    pause(dropWhilePaused) { this.stop(); }\n    resume() { this.start(); }\n}\nexports.OnBlockSubscriber = OnBlockSubscriber;\nclass PollingBlockTagSubscriber extends OnBlockSubscriber {\n    #tag;\n    #lastBlock;\n    constructor(provider, tag) {\n        super(provider);\n        this.#tag = tag;\n        this.#lastBlock = -2;\n    }\n    pause(dropWhilePaused) {\n        if (dropWhilePaused) {\n            this.#lastBlock = -2;\n        }\n        super.pause(dropWhilePaused);\n    }\n    async _poll(blockNumber, provider) {\n        const block = await provider.getBlock(this.#tag);\n        if (block == null) {\n            return;\n        }\n        if (this.#lastBlock === -2) {\n            this.#lastBlock = block.number;\n        }\n        else if (block.number > this.#lastBlock) {\n            provider.emit(this.#tag, block.number);\n            this.#lastBlock = block.number;\n        }\n    }\n}\nexports.PollingBlockTagSubscriber = PollingBlockTagSubscriber;\n/**\n *  @_ignore:\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass PollingOrphanSubscriber extends OnBlockSubscriber {\n    #filter;\n    constructor(provider, filter) {\n        super(provider);\n        this.#filter = copy(filter);\n    }\n    async _poll(blockNumber, provider) {\n        throw new Error(\"@TODO\");\n        console.log(this.#filter);\n    }\n}\nexports.PollingOrphanSubscriber = PollingOrphanSubscriber;\n/**\n *  A **PollingTransactionSubscriber** will poll for a given transaction\n *  hash for its receipt.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass PollingTransactionSubscriber extends OnBlockSubscriber {\n    #hash;\n    /**\n     *  Create a new **PollingTransactionSubscriber** attached to\n     *  %%provider%%, listening for %%hash%%.\n     */\n    constructor(provider, hash) {\n        super(provider);\n        this.#hash = hash;\n    }\n    async _poll(blockNumber, provider) {\n        const tx = await provider.getTransactionReceipt(this.#hash);\n        if (tx) {\n            provider.emit(this.#hash, tx);\n        }\n    }\n}\nexports.PollingTransactionSubscriber = PollingTransactionSubscriber;\n/**\n *  A **PollingEventSubscriber** will poll for a given filter for its logs.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nclass PollingEventSubscriber {\n    #provider;\n    #filter;\n    #poller;\n    #running;\n    // The most recent block we have scanned for events. The value -2\n    // indicates we still need to fetch an initial block number\n    #blockNumber;\n    /**\n     *  Create a new **PollingTransactionSubscriber** attached to\n     *  %%provider%%, listening for %%filter%%.\n     */\n    constructor(provider, filter) {\n        this.#provider = provider;\n        this.#filter = copy(filter);\n        this.#poller = this.#poll.bind(this);\n        this.#running = false;\n        this.#blockNumber = -2;\n    }\n    async #poll(blockNumber) {\n        // The initial block hasn't been determined yet\n        if (this.#blockNumber === -2) {\n            return;\n        }\n        const filter = copy(this.#filter);\n        filter.fromBlock = this.#blockNumber + 1;\n        filter.toBlock = blockNumber;\n        const logs = await this.#provider.getLogs(filter);\n        // No logs could just mean the node has not indexed them yet,\n        // so we keep a sliding window of 60 blocks to keep scanning\n        if (logs.length === 0) {\n            if (this.#blockNumber < blockNumber - 60) {\n                this.#blockNumber = blockNumber - 60;\n            }\n            return;\n        }\n        for (const log of logs) {\n            this.#provider.emit(this.#filter, log);\n            // Only advance the block number when logs were found to\n            // account for networks (like BNB and Polygon) which may\n            // sacrifice event consistency for block event speed\n            this.#blockNumber = log.blockNumber;\n        }\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        if (this.#blockNumber === -2) {\n            this.#provider.getBlockNumber().then((blockNumber) => {\n                this.#blockNumber = blockNumber;\n            });\n        }\n        this.#provider.on(\"block\", this.#poller);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#provider.off(\"block\", this.#poller);\n    }\n    pause(dropWhilePaused) {\n        this.stop();\n        if (dropWhilePaused) {\n            this.#blockNumber = -2;\n        }\n    }\n    resume() {\n        this.start();\n    }\n}\nexports.PollingEventSubscriber = PollingEventSubscriber;\n//# sourceMappingURL=subscriber-polling.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WebSocket = void 0;\nfunction getGlobal() {\n    if (typeof self !== 'undefined') {\n        return self;\n    }\n    if (typeof window !== 'undefined') {\n        return window;\n    }\n    if (typeof global !== 'undefined') {\n        return global;\n    }\n    throw new Error('unable to locate global object');\n}\n;\nconst _WebSocket = getGlobal().WebSocket;\nexports.WebSocket = _WebSocket;\n//# sourceMappingURL=ws-browser.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.accessListify = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nfunction accessSetify(addr, storageKeys) {\n    return {\n        address: (0, index_js_1.getAddress)(addr),\n        storageKeys: storageKeys.map((storageKey, index) => {\n            (0, index_js_2.assertArgument)((0, index_js_2.isHexString)(storageKey, 32), \"invalid slot\", `storageKeys[${index}]`, storageKey);\n            return storageKey.toLowerCase();\n        })\n    };\n}\n/**\n *  Returns a [[AccessList]] from any ethers-supported access-list structure.\n */\nfunction accessListify(value) {\n    if (Array.isArray(value)) {\n        return value.map((set, index) => {\n            if (Array.isArray(set)) {\n                (0, index_js_2.assertArgument)(set.length === 2, \"invalid slot set\", `value[${index}]`, set);\n                return accessSetify(set[0], set[1]);\n            }\n            (0, index_js_2.assertArgument)(set != null && typeof (set) === \"object\", \"invalid address-slot set\", \"value\", value);\n            return accessSetify(set.address, set.storageKeys);\n        });\n    }\n    (0, index_js_2.assertArgument)(value != null && typeof (value) === \"object\", \"invalid access list\", \"value\", value);\n    const result = Object.keys(value).map((addr) => {\n        const storageKeys = value[addr].reduce((accum, storageKey) => {\n            accum[storageKey] = true;\n            return accum;\n        }, {});\n        return accessSetify(addr, Object.keys(storageKeys).sort());\n    });\n    result.sort((a, b) => (a.address.localeCompare(b.address)));\n    return result;\n}\nexports.accessListify = accessListify;\n//# sourceMappingURL=accesslist.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.recoverAddress = exports.computeAddress = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\n/**\n *  Returns the address for the %%key%%.\n *\n *  The key may be any standard form of public key or a private key.\n */\nfunction computeAddress(key) {\n    let pubkey;\n    if (typeof (key) === \"string\") {\n        pubkey = index_js_2.SigningKey.computePublicKey(key, false);\n    }\n    else {\n        pubkey = key.publicKey;\n    }\n    return (0, index_js_1.getAddress)((0, index_js_2.keccak256)(\"0x\" + pubkey.substring(4)).substring(26));\n}\nexports.computeAddress = computeAddress;\n/**\n *  Returns the recovered address for the private key that was\n *  used to sign %%digest%% that resulted in %%signature%%.\n */\nfunction recoverAddress(digest, signature) {\n    return computeAddress(index_js_2.SigningKey.recoverPublicKey(digest, signature));\n}\nexports.recoverAddress = recoverAddress;\n//# sourceMappingURL=address.js.map","\"use strict\";\n/**\n *  Each state-changing operation on Ethereum requires a transaction.\n *\n *  @_section api/transaction:Transactions  [about-transactions]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Transaction = exports.recoverAddress = exports.computeAddress = exports.accessListify = void 0;\nnull;\nvar accesslist_js_1 = require(\"./accesslist.js\");\nObject.defineProperty(exports, \"accessListify\", { enumerable: true, get: function () { return accesslist_js_1.accessListify; } });\nvar address_js_1 = require(\"./address.js\");\nObject.defineProperty(exports, \"computeAddress\", { enumerable: true, get: function () { return address_js_1.computeAddress; } });\nObject.defineProperty(exports, \"recoverAddress\", { enumerable: true, get: function () { return address_js_1.recoverAddress; } });\nvar transaction_js_1 = require(\"./transaction.js\");\nObject.defineProperty(exports, \"Transaction\", { enumerable: true, get: function () { return transaction_js_1.Transaction; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Transaction = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst addresses_js_1 = require(\"../constants/addresses.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../utils/index.js\");\nconst accesslist_js_1 = require(\"./accesslist.js\");\nconst address_js_1 = require(\"./address.js\");\nconst BN_0 = BigInt(0);\nconst BN_2 = BigInt(2);\nconst BN_27 = BigInt(27);\nconst BN_28 = BigInt(28);\nconst BN_35 = BigInt(35);\nconst BN_MAX_UINT = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\nconst BLOB_SIZE = 4096 * 32;\nfunction getVersionedHash(version, hash) {\n    let versioned = version.toString(16);\n    while (versioned.length < 2) {\n        versioned = \"0\" + versioned;\n    }\n    versioned += (0, index_js_2.sha256)(hash).substring(4);\n    return \"0x\" + versioned;\n}\nfunction handleAddress(value) {\n    if (value === \"0x\") {\n        return null;\n    }\n    return (0, index_js_1.getAddress)(value);\n}\nfunction handleAccessList(value, param) {\n    try {\n        return (0, accesslist_js_1.accessListify)(value);\n    }\n    catch (error) {\n        (0, index_js_3.assertArgument)(false, error.message, param, value);\n    }\n}\nfunction handleNumber(_value, param) {\n    if (_value === \"0x\") {\n        return 0;\n    }\n    return (0, index_js_3.getNumber)(_value, param);\n}\nfunction handleUint(_value, param) {\n    if (_value === \"0x\") {\n        return BN_0;\n    }\n    const value = (0, index_js_3.getBigInt)(_value, param);\n    (0, index_js_3.assertArgument)(value <= BN_MAX_UINT, \"value exceeds uint size\", param, value);\n    return value;\n}\nfunction formatNumber(_value, name) {\n    const value = (0, index_js_3.getBigInt)(_value, \"value\");\n    const result = (0, index_js_3.toBeArray)(value);\n    (0, index_js_3.assertArgument)(result.length <= 32, `value too large`, `tx.${name}`, value);\n    return result;\n}\nfunction formatAccessList(value) {\n    return (0, accesslist_js_1.accessListify)(value).map((set) => [set.address, set.storageKeys]);\n}\nfunction formatHashes(value, param) {\n    (0, index_js_3.assertArgument)(Array.isArray(value), `invalid ${param}`, \"value\", value);\n    for (let i = 0; i < value.length; i++) {\n        (0, index_js_3.assertArgument)((0, index_js_3.isHexString)(value[i], 32), \"invalid ${ param } hash\", `value[${i}]`, value[i]);\n    }\n    return value;\n}\nfunction _parseLegacy(data) {\n    const fields = (0, index_js_3.decodeRlp)(data);\n    (0, index_js_3.assertArgument)(Array.isArray(fields) && (fields.length === 9 || fields.length === 6), \"invalid field count for legacy transaction\", \"data\", data);\n    const tx = {\n        type: 0,\n        nonce: handleNumber(fields[0], \"nonce\"),\n        gasPrice: handleUint(fields[1], \"gasPrice\"),\n        gasLimit: handleUint(fields[2], \"gasLimit\"),\n        to: handleAddress(fields[3]),\n        value: handleUint(fields[4], \"value\"),\n        data: (0, index_js_3.hexlify)(fields[5]),\n        chainId: BN_0\n    };\n    // Legacy unsigned transaction\n    if (fields.length === 6) {\n        return tx;\n    }\n    const v = handleUint(fields[6], \"v\");\n    const r = handleUint(fields[7], \"r\");\n    const s = handleUint(fields[8], \"s\");\n    if (r === BN_0 && s === BN_0) {\n        // EIP-155 unsigned transaction\n        tx.chainId = v;\n    }\n    else {\n        // Compute the EIP-155 chain ID (or 0 for legacy)\n        let chainId = (v - BN_35) / BN_2;\n        if (chainId < BN_0) {\n            chainId = BN_0;\n        }\n        tx.chainId = chainId;\n        // Signed Legacy Transaction\n        (0, index_js_3.assertArgument)(chainId !== BN_0 || (v === BN_27 || v === BN_28), \"non-canonical legacy v\", \"v\", fields[6]);\n        tx.signature = index_js_2.Signature.from({\n            r: (0, index_js_3.zeroPadValue)(fields[7], 32),\n            s: (0, index_js_3.zeroPadValue)(fields[8], 32),\n            v\n        });\n        //tx.hash = keccak256(data);\n    }\n    return tx;\n}\nfunction _serializeLegacy(tx, sig) {\n    const fields = [\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.gasPrice || 0, \"gasPrice\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n    ];\n    let chainId = BN_0;\n    if (tx.chainId != BN_0) {\n        // A chainId was provided; if non-zero we'll use EIP-155\n        chainId = (0, index_js_3.getBigInt)(tx.chainId, \"tx.chainId\");\n        // We have a chainId in the tx and an EIP-155 v in the signature,\n        // make sure they agree with each other\n        (0, index_js_3.assertArgument)(!sig || sig.networkV == null || sig.legacyChainId === chainId, \"tx.chainId/sig.v mismatch\", \"sig\", sig);\n    }\n    else if (tx.signature) {\n        // No explicit chainId, but EIP-155 have a derived implicit chainId\n        const legacy = tx.signature.legacyChainId;\n        if (legacy != null) {\n            chainId = legacy;\n        }\n    }\n    // Requesting an unsigned transaction\n    if (!sig) {\n        // We have an EIP-155 transaction (chainId was specified and non-zero)\n        if (chainId !== BN_0) {\n            fields.push((0, index_js_3.toBeArray)(chainId));\n            fields.push(\"0x\");\n            fields.push(\"0x\");\n        }\n        return (0, index_js_3.encodeRlp)(fields);\n    }\n    // @TODO: We should probably check that tx.signature, chainId, and sig\n    //        match but that logic could break existing code, so schedule\n    //        this for the next major bump.\n    // Compute the EIP-155 v\n    let v = BigInt(27 + sig.yParity);\n    if (chainId !== BN_0) {\n        v = index_js_2.Signature.getChainIdV(chainId, sig.v);\n    }\n    else if (BigInt(sig.v) !== v) {\n        (0, index_js_3.assertArgument)(false, \"tx.chainId/sig.v mismatch\", \"sig\", sig);\n    }\n    // Add the signature\n    fields.push((0, index_js_3.toBeArray)(v));\n    fields.push((0, index_js_3.toBeArray)(sig.r));\n    fields.push((0, index_js_3.toBeArray)(sig.s));\n    return (0, index_js_3.encodeRlp)(fields);\n}\nfunction _parseEipSignature(tx, fields) {\n    let yParity;\n    try {\n        yParity = handleNumber(fields[0], \"yParity\");\n        if (yParity !== 0 && yParity !== 1) {\n            throw new Error(\"bad yParity\");\n        }\n    }\n    catch (error) {\n        (0, index_js_3.assertArgument)(false, \"invalid yParity\", \"yParity\", fields[0]);\n    }\n    const r = (0, index_js_3.zeroPadValue)(fields[1], 32);\n    const s = (0, index_js_3.zeroPadValue)(fields[2], 32);\n    const signature = index_js_2.Signature.from({ r, s, yParity });\n    tx.signature = signature;\n}\nfunction _parseEip1559(data) {\n    const fields = (0, index_js_3.decodeRlp)((0, index_js_3.getBytes)(data).slice(1));\n    (0, index_js_3.assertArgument)(Array.isArray(fields) && (fields.length === 9 || fields.length === 12), \"invalid field count for transaction type: 2\", \"data\", (0, index_js_3.hexlify)(data));\n    const tx = {\n        type: 2,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        maxPriorityFeePerGas: handleUint(fields[2], \"maxPriorityFeePerGas\"),\n        maxFeePerGas: handleUint(fields[3], \"maxFeePerGas\"),\n        gasPrice: null,\n        gasLimit: handleUint(fields[4], \"gasLimit\"),\n        to: handleAddress(fields[5]),\n        value: handleUint(fields[6], \"value\"),\n        data: (0, index_js_3.hexlify)(fields[7]),\n        accessList: handleAccessList(fields[8], \"accessList\"),\n    };\n    // Unsigned EIP-1559 Transaction\n    if (fields.length === 9) {\n        return tx;\n    }\n    //tx.hash = keccak256(data);\n    _parseEipSignature(tx, fields.slice(9));\n    return tx;\n}\nfunction _serializeEip1559(tx, sig) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.maxPriorityFeePerGas || 0, \"maxPriorityFeePerGas\"),\n        formatNumber(tx.maxFeePerGas || 0, \"maxFeePerGas\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || [])\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"yParity\"));\n        fields.push((0, index_js_3.toBeArray)(sig.r));\n        fields.push((0, index_js_3.toBeArray)(sig.s));\n    }\n    return (0, index_js_3.concat)([\"0x02\", (0, index_js_3.encodeRlp)(fields)]);\n}\nfunction _parseEip2930(data) {\n    const fields = (0, index_js_3.decodeRlp)((0, index_js_3.getBytes)(data).slice(1));\n    (0, index_js_3.assertArgument)(Array.isArray(fields) && (fields.length === 8 || fields.length === 11), \"invalid field count for transaction type: 1\", \"data\", (0, index_js_3.hexlify)(data));\n    const tx = {\n        type: 1,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        gasPrice: handleUint(fields[2], \"gasPrice\"),\n        gasLimit: handleUint(fields[3], \"gasLimit\"),\n        to: handleAddress(fields[4]),\n        value: handleUint(fields[5], \"value\"),\n        data: (0, index_js_3.hexlify)(fields[6]),\n        accessList: handleAccessList(fields[7], \"accessList\")\n    };\n    // Unsigned EIP-2930 Transaction\n    if (fields.length === 8) {\n        return tx;\n    }\n    //tx.hash = keccak256(data);\n    _parseEipSignature(tx, fields.slice(8));\n    return tx;\n}\nfunction _serializeEip2930(tx, sig) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.gasPrice || 0, \"gasPrice\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || [])\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"recoveryParam\"));\n        fields.push((0, index_js_3.toBeArray)(sig.r));\n        fields.push((0, index_js_3.toBeArray)(sig.s));\n    }\n    return (0, index_js_3.concat)([\"0x01\", (0, index_js_3.encodeRlp)(fields)]);\n}\nfunction _parseEip4844(data) {\n    let fields = (0, index_js_3.decodeRlp)((0, index_js_3.getBytes)(data).slice(1));\n    let typeName = \"3\";\n    let blobs = null;\n    // Parse the network format\n    if (fields.length === 4 && Array.isArray(fields[0])) {\n        typeName = \"3 (network format)\";\n        const fBlobs = fields[1], fCommits = fields[2], fProofs = fields[3];\n        (0, index_js_3.assertArgument)(Array.isArray(fBlobs), \"invalid network format: blobs not an array\", \"fields[1]\", fBlobs);\n        (0, index_js_3.assertArgument)(Array.isArray(fCommits), \"invalid network format: commitments not an array\", \"fields[2]\", fCommits);\n        (0, index_js_3.assertArgument)(Array.isArray(fProofs), \"invalid network format: proofs not an array\", \"fields[3]\", fProofs);\n        (0, index_js_3.assertArgument)(fBlobs.length === fCommits.length, \"invalid network format: blobs/commitments length mismatch\", \"fields\", fields);\n        (0, index_js_3.assertArgument)(fBlobs.length === fProofs.length, \"invalid network format: blobs/proofs length mismatch\", \"fields\", fields);\n        blobs = [];\n        for (let i = 0; i < fields[1].length; i++) {\n            blobs.push({\n                data: fBlobs[i],\n                commitment: fCommits[i],\n                proof: fProofs[i],\n            });\n        }\n        fields = fields[0];\n    }\n    (0, index_js_3.assertArgument)(Array.isArray(fields) && (fields.length === 11 || fields.length === 14), `invalid field count for transaction type: ${typeName}`, \"data\", (0, index_js_3.hexlify)(data));\n    const tx = {\n        type: 3,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        maxPriorityFeePerGas: handleUint(fields[2], \"maxPriorityFeePerGas\"),\n        maxFeePerGas: handleUint(fields[3], \"maxFeePerGas\"),\n        gasPrice: null,\n        gasLimit: handleUint(fields[4], \"gasLimit\"),\n        to: handleAddress(fields[5]),\n        value: handleUint(fields[6], \"value\"),\n        data: (0, index_js_3.hexlify)(fields[7]),\n        accessList: handleAccessList(fields[8], \"accessList\"),\n        maxFeePerBlobGas: handleUint(fields[9], \"maxFeePerBlobGas\"),\n        blobVersionedHashes: fields[10]\n    };\n    if (blobs) {\n        tx.blobs = blobs;\n    }\n    (0, index_js_3.assertArgument)(tx.to != null, `invalid address for transaction type: ${typeName}`, \"data\", data);\n    (0, index_js_3.assertArgument)(Array.isArray(tx.blobVersionedHashes), \"invalid blobVersionedHashes: must be an array\", \"data\", data);\n    for (let i = 0; i < tx.blobVersionedHashes.length; i++) {\n        (0, index_js_3.assertArgument)((0, index_js_3.isHexString)(tx.blobVersionedHashes[i], 32), `invalid blobVersionedHash at index ${i}: must be length 32`, \"data\", data);\n    }\n    // Unsigned EIP-4844 Transaction\n    if (fields.length === 11) {\n        return tx;\n    }\n    // @TODO: Do we need to do this? This is only called internally\n    // and used to verify hashes; it might save time to not do this\n    //tx.hash = keccak256(concat([ \"0x03\", encodeRlp(fields) ]));\n    _parseEipSignature(tx, fields.slice(11));\n    return tx;\n}\nfunction _serializeEip4844(tx, sig, blobs) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.maxPriorityFeePerGas || 0, \"maxPriorityFeePerGas\"),\n        formatNumber(tx.maxFeePerGas || 0, \"maxFeePerGas\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || addresses_js_1.ZeroAddress),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || []),\n        formatNumber(tx.maxFeePerBlobGas || 0, \"maxFeePerBlobGas\"),\n        formatHashes(tx.blobVersionedHashes || [], \"blobVersionedHashes\")\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"yParity\"));\n        fields.push((0, index_js_3.toBeArray)(sig.r));\n        fields.push((0, index_js_3.toBeArray)(sig.s));\n        // We have blobs; return the network wrapped format\n        if (blobs) {\n            return (0, index_js_3.concat)([\n                \"0x03\",\n                (0, index_js_3.encodeRlp)([\n                    fields,\n                    blobs.map((b) => b.data),\n                    blobs.map((b) => b.commitment),\n                    blobs.map((b) => b.proof),\n                ])\n            ]);\n        }\n    }\n    return (0, index_js_3.concat)([\"0x03\", (0, index_js_3.encodeRlp)(fields)]);\n}\n/**\n *  A **Transaction** describes an operation to be executed on\n *  Ethereum by an Externally Owned Account (EOA). It includes\n *  who (the [[to]] address), what (the [[data]]) and how much (the\n *  [[value]] in ether) the operation should entail.\n *\n *  @example:\n *    tx = new Transaction()\n *    //_result:\n *\n *    tx.data = \"0x1234\";\n *    //_result:\n */\nclass Transaction {\n    #type;\n    #to;\n    #data;\n    #nonce;\n    #gasLimit;\n    #gasPrice;\n    #maxPriorityFeePerGas;\n    #maxFeePerGas;\n    #value;\n    #chainId;\n    #sig;\n    #accessList;\n    #maxFeePerBlobGas;\n    #blobVersionedHashes;\n    #kzg;\n    #blobs;\n    /**\n     *  The transaction type.\n     *\n     *  If null, the type will be automatically inferred based on\n     *  explicit properties.\n     */\n    get type() { return this.#type; }\n    set type(value) {\n        switch (value) {\n            case null:\n                this.#type = null;\n                break;\n            case 0:\n            case \"legacy\":\n                this.#type = 0;\n                break;\n            case 1:\n            case \"berlin\":\n            case \"eip-2930\":\n                this.#type = 1;\n                break;\n            case 2:\n            case \"london\":\n            case \"eip-1559\":\n                this.#type = 2;\n                break;\n            case 3:\n            case \"cancun\":\n            case \"eip-4844\":\n                this.#type = 3;\n                break;\n            default:\n                (0, index_js_3.assertArgument)(false, \"unsupported transaction type\", \"type\", value);\n        }\n    }\n    /**\n     *  The name of the transaction type.\n     */\n    get typeName() {\n        switch (this.type) {\n            case 0: return \"legacy\";\n            case 1: return \"eip-2930\";\n            case 2: return \"eip-1559\";\n            case 3: return \"eip-4844\";\n        }\n        return null;\n    }\n    /**\n     *  The ``to`` address for the transaction or ``null`` if the\n     *  transaction is an ``init`` transaction.\n     */\n    get to() {\n        const value = this.#to;\n        if (value == null && this.type === 3) {\n            return addresses_js_1.ZeroAddress;\n        }\n        return value;\n    }\n    set to(value) {\n        this.#to = (value == null) ? null : (0, index_js_1.getAddress)(value);\n    }\n    /**\n     *  The transaction nonce.\n     */\n    get nonce() { return this.#nonce; }\n    set nonce(value) { this.#nonce = (0, index_js_3.getNumber)(value, \"value\"); }\n    /**\n     *  The gas limit.\n     */\n    get gasLimit() { return this.#gasLimit; }\n    set gasLimit(value) { this.#gasLimit = (0, index_js_3.getBigInt)(value); }\n    /**\n     *  The gas price.\n     *\n     *  On legacy networks this defines the fee that will be paid. On\n     *  EIP-1559 networks, this should be ``null``.\n     */\n    get gasPrice() {\n        const value = this.#gasPrice;\n        if (value == null && (this.type === 0 || this.type === 1)) {\n            return BN_0;\n        }\n        return value;\n    }\n    set gasPrice(value) {\n        this.#gasPrice = (value == null) ? null : (0, index_js_3.getBigInt)(value, \"gasPrice\");\n    }\n    /**\n     *  The maximum priority fee per unit of gas to pay. On legacy\n     *  networks this should be ``null``.\n     */\n    get maxPriorityFeePerGas() {\n        const value = this.#maxPriorityFeePerGas;\n        if (value == null) {\n            if (this.type === 2 || this.type === 3) {\n                return BN_0;\n            }\n            return null;\n        }\n        return value;\n    }\n    set maxPriorityFeePerGas(value) {\n        this.#maxPriorityFeePerGas = (value == null) ? null : (0, index_js_3.getBigInt)(value, \"maxPriorityFeePerGas\");\n    }\n    /**\n     *  The maximum total fee per unit of gas to pay. On legacy\n     *  networks this should be ``null``.\n     */\n    get maxFeePerGas() {\n        const value = this.#maxFeePerGas;\n        if (value == null) {\n            if (this.type === 2 || this.type === 3) {\n                return BN_0;\n            }\n            return null;\n        }\n        return value;\n    }\n    set maxFeePerGas(value) {\n        this.#maxFeePerGas = (value == null) ? null : (0, index_js_3.getBigInt)(value, \"maxFeePerGas\");\n    }\n    /**\n     *  The transaction data. For ``init`` transactions this is the\n     *  deployment code.\n     */\n    get data() { return this.#data; }\n    set data(value) { this.#data = (0, index_js_3.hexlify)(value); }\n    /**\n     *  The amount of ether (in wei) to send in this transactions.\n     */\n    get value() { return this.#value; }\n    set value(value) {\n        this.#value = (0, index_js_3.getBigInt)(value, \"value\");\n    }\n    /**\n     *  The chain ID this transaction is valid on.\n     */\n    get chainId() { return this.#chainId; }\n    set chainId(value) { this.#chainId = (0, index_js_3.getBigInt)(value); }\n    /**\n     *  If signed, the signature for this transaction.\n     */\n    get signature() { return this.#sig || null; }\n    set signature(value) {\n        this.#sig = (value == null) ? null : index_js_2.Signature.from(value);\n    }\n    /**\n     *  The access list.\n     *\n     *  An access list permits discounted (but pre-paid) access to\n     *  bytecode and state variable access within contract execution.\n     */\n    get accessList() {\n        const value = this.#accessList || null;\n        if (value == null) {\n            if (this.type === 1 || this.type === 2 || this.type === 3) {\n                // @TODO: in v7, this should assign the value or become\n                // a live object itself, otherwise mutation is inconsistent\n                return [];\n            }\n            return null;\n        }\n        return value;\n    }\n    set accessList(value) {\n        this.#accessList = (value == null) ? null : (0, accesslist_js_1.accessListify)(value);\n    }\n    /**\n     *  The max fee per blob gas for Cancun transactions.\n     */\n    get maxFeePerBlobGas() {\n        const value = this.#maxFeePerBlobGas;\n        if (value == null && this.type === 3) {\n            return BN_0;\n        }\n        return value;\n    }\n    set maxFeePerBlobGas(value) {\n        this.#maxFeePerBlobGas = (value == null) ? null : (0, index_js_3.getBigInt)(value, \"maxFeePerBlobGas\");\n    }\n    /**\n     *  The BLOb versioned hashes for Cancun transactions.\n     */\n    get blobVersionedHashes() {\n        // @TODO: Mutation is inconsistent; if unset, the returned value\n        // cannot mutate the object, if set it can\n        let value = this.#blobVersionedHashes;\n        if (value == null && this.type === 3) {\n            return [];\n        }\n        return value;\n    }\n    set blobVersionedHashes(value) {\n        if (value != null) {\n            (0, index_js_3.assertArgument)(Array.isArray(value), \"blobVersionedHashes must be an Array\", \"value\", value);\n            value = value.slice();\n            for (let i = 0; i < value.length; i++) {\n                (0, index_js_3.assertArgument)((0, index_js_3.isHexString)(value[i], 32), \"invalid blobVersionedHash\", `value[${i}]`, value[i]);\n            }\n        }\n        this.#blobVersionedHashes = value;\n    }\n    /**\n     *  The BLObs for the Transaction, if any.\n     *\n     *  If ``blobs`` is non-``null``, then the [[seriailized]]\n     *  will return the network formatted sidecar, otherwise it\n     *  will return the standard [[link-eip-2718]] payload. The\n     *  [[unsignedSerialized]] is unaffected regardless.\n     *\n     *  When setting ``blobs``, either fully valid [[Blob]] objects\n     *  may be specified (i.e. correctly padded, with correct\n     *  committments and proofs) or a raw [[BytesLike]] may\n     *  be provided.\n     *\n     *  If raw [[BytesLike]] are provided, the [[kzg]] property **must**\n     *  be already set. The blob will be correctly padded and the\n     *  [[KzgLibrary]] will be used to compute the committment and\n     *  proof for the blob.\n     *\n     *  A BLOb is a sequence of field elements, each of which must\n     *  be within the BLS field modulo, so some additional processing\n     *  may be required to encode arbitrary data to ensure each 32 byte\n     *  field is within the valid range.\n     *\n     *  Setting this automatically populates [[blobVersionedHashes]],\n     *  overwriting any existing values. Setting this to ``null``\n     *  does **not** remove the [[blobVersionedHashes]], leaving them\n     *  present.\n     */\n    get blobs() {\n        if (this.#blobs == null) {\n            return null;\n        }\n        return this.#blobs.map((b) => Object.assign({}, b));\n    }\n    set blobs(_blobs) {\n        if (_blobs == null) {\n            this.#blobs = null;\n            return;\n        }\n        const blobs = [];\n        const versionedHashes = [];\n        for (let i = 0; i < _blobs.length; i++) {\n            const blob = _blobs[i];\n            if ((0, index_js_3.isBytesLike)(blob)) {\n                (0, index_js_3.assert)(this.#kzg, \"adding a raw blob requires a KZG library\", \"UNSUPPORTED_OPERATION\", {\n                    operation: \"set blobs()\"\n                });\n                let data = (0, index_js_3.getBytes)(blob);\n                (0, index_js_3.assertArgument)(data.length <= BLOB_SIZE, \"blob is too large\", `blobs[${i}]`, blob);\n                // Pad blob if necessary\n                if (data.length !== BLOB_SIZE) {\n                    const padded = new Uint8Array(BLOB_SIZE);\n                    padded.set(data);\n                    data = padded;\n                }\n                const commit = this.#kzg.blobToKzgCommitment(data);\n                const proof = (0, index_js_3.hexlify)(this.#kzg.computeBlobKzgProof(data, commit));\n                blobs.push({\n                    data: (0, index_js_3.hexlify)(data),\n                    commitment: (0, index_js_3.hexlify)(commit),\n                    proof\n                });\n                versionedHashes.push(getVersionedHash(1, commit));\n            }\n            else {\n                const commit = (0, index_js_3.hexlify)(blob.commitment);\n                blobs.push({\n                    data: (0, index_js_3.hexlify)(blob.data),\n                    commitment: commit,\n                    proof: (0, index_js_3.hexlify)(blob.proof)\n                });\n                versionedHashes.push(getVersionedHash(1, commit));\n            }\n        }\n        this.#blobs = blobs;\n        this.#blobVersionedHashes = versionedHashes;\n    }\n    get kzg() { return this.#kzg; }\n    set kzg(kzg) {\n        this.#kzg = kzg;\n    }\n    /**\n     *  Creates a new Transaction with default values.\n     */\n    constructor() {\n        this.#type = null;\n        this.#to = null;\n        this.#nonce = 0;\n        this.#gasLimit = BN_0;\n        this.#gasPrice = null;\n        this.#maxPriorityFeePerGas = null;\n        this.#maxFeePerGas = null;\n        this.#data = \"0x\";\n        this.#value = BN_0;\n        this.#chainId = BN_0;\n        this.#sig = null;\n        this.#accessList = null;\n        this.#maxFeePerBlobGas = null;\n        this.#blobVersionedHashes = null;\n        this.#blobs = null;\n        this.#kzg = null;\n    }\n    /**\n     *  The transaction hash, if signed. Otherwise, ``null``.\n     */\n    get hash() {\n        if (this.signature == null) {\n            return null;\n        }\n        return (0, index_js_2.keccak256)(this.#getSerialized(true, false));\n    }\n    /**\n     *  The pre-image hash of this transaction.\n     *\n     *  This is the digest that a [[Signer]] must sign to authorize\n     *  this transaction.\n     */\n    get unsignedHash() {\n        return (0, index_js_2.keccak256)(this.unsignedSerialized);\n    }\n    /**\n     *  The sending address, if signed. Otherwise, ``null``.\n     */\n    get from() {\n        if (this.signature == null) {\n            return null;\n        }\n        return (0, address_js_1.recoverAddress)(this.unsignedHash, this.signature);\n    }\n    /**\n     *  The public key of the sender, if signed. Otherwise, ``null``.\n     */\n    get fromPublicKey() {\n        if (this.signature == null) {\n            return null;\n        }\n        return index_js_2.SigningKey.recoverPublicKey(this.unsignedHash, this.signature);\n    }\n    /**\n     *  Returns true if signed.\n     *\n     *  This provides a Type Guard that properties requiring a signed\n     *  transaction are non-null.\n     */\n    isSigned() {\n        return this.signature != null;\n    }\n    #getSerialized(signed, sidecar) {\n        (0, index_js_3.assert)(!signed || this.signature != null, \"cannot serialize unsigned transaction; maybe you meant .unsignedSerialized\", \"UNSUPPORTED_OPERATION\", { operation: \".serialized\" });\n        const sig = signed ? this.signature : null;\n        switch (this.inferType()) {\n            case 0:\n                return _serializeLegacy(this, sig);\n            case 1:\n                return _serializeEip2930(this, sig);\n            case 2:\n                return _serializeEip1559(this, sig);\n            case 3:\n                return _serializeEip4844(this, sig, sidecar ? this.blobs : null);\n        }\n        (0, index_js_3.assert)(false, \"unsupported transaction type\", \"UNSUPPORTED_OPERATION\", { operation: \".serialized\" });\n    }\n    /**\n     *  The serialized transaction.\n     *\n     *  This throws if the transaction is unsigned. For the pre-image,\n     *  use [[unsignedSerialized]].\n     */\n    get serialized() {\n        return this.#getSerialized(true, true);\n    }\n    /**\n     *  The transaction pre-image.\n     *\n     *  The hash of this is the digest which needs to be signed to\n     *  authorize this transaction.\n     */\n    get unsignedSerialized() {\n        return this.#getSerialized(false, false);\n    }\n    /**\n     *  Return the most \"likely\" type; currently the highest\n     *  supported transaction type.\n     */\n    inferType() {\n        const types = this.inferTypes();\n        // Prefer London (EIP-1559) over Cancun (BLOb)\n        if (types.indexOf(2) >= 0) {\n            return 2;\n        }\n        // Return the highest inferred type\n        return (types.pop());\n    }\n    /**\n     *  Validates the explicit properties and returns a list of compatible\n     *  transaction types.\n     */\n    inferTypes() {\n        // Checks that there are no conflicting properties set\n        const hasGasPrice = this.gasPrice != null;\n        const hasFee = (this.maxFeePerGas != null || this.maxPriorityFeePerGas != null);\n        const hasAccessList = (this.accessList != null);\n        const hasBlob = (this.#maxFeePerBlobGas != null || this.#blobVersionedHashes);\n        //if (hasGasPrice && hasFee) {\n        //    throw new Error(\"transaction cannot have gasPrice and maxFeePerGas\");\n        //}\n        if (this.maxFeePerGas != null && this.maxPriorityFeePerGas != null) {\n            (0, index_js_3.assert)(this.maxFeePerGas >= this.maxPriorityFeePerGas, \"priorityFee cannot be more than maxFee\", \"BAD_DATA\", { value: this });\n        }\n        //if (this.type === 2 && hasGasPrice) {\n        //    throw new Error(\"eip-1559 transaction cannot have gasPrice\");\n        //}\n        (0, index_js_3.assert)(!hasFee || (this.type !== 0 && this.type !== 1), \"transaction type cannot have maxFeePerGas or maxPriorityFeePerGas\", \"BAD_DATA\", { value: this });\n        (0, index_js_3.assert)(this.type !== 0 || !hasAccessList, \"legacy transaction cannot have accessList\", \"BAD_DATA\", { value: this });\n        const types = [];\n        // Explicit type\n        if (this.type != null) {\n            types.push(this.type);\n        }\n        else {\n            if (hasFee) {\n                types.push(2);\n            }\n            else if (hasGasPrice) {\n                types.push(1);\n                if (!hasAccessList) {\n                    types.push(0);\n                }\n            }\n            else if (hasAccessList) {\n                types.push(1);\n                types.push(2);\n            }\n            else if (hasBlob && this.to) {\n                types.push(3);\n            }\n            else {\n                types.push(0);\n                types.push(1);\n                types.push(2);\n                types.push(3);\n            }\n        }\n        types.sort();\n        return types;\n    }\n    /**\n     *  Returns true if this transaction is a legacy transaction (i.e.\n     *  ``type === 0``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isLegacy() {\n        return (this.type === 0);\n    }\n    /**\n     *  Returns true if this transaction is berlin hardform transaction (i.e.\n     *  ``type === 1``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isBerlin() {\n        return (this.type === 1);\n    }\n    /**\n     *  Returns true if this transaction is london hardform transaction (i.e.\n     *  ``type === 2``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isLondon() {\n        return (this.type === 2);\n    }\n    /**\n     *  Returns true if this transaction is an [[link-eip-4844]] BLOB\n     *  transaction.\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isCancun() {\n        return (this.type === 3);\n    }\n    /**\n     *  Create a copy of this transaciton.\n     */\n    clone() {\n        return Transaction.from(this);\n    }\n    /**\n     *  Return a JSON-friendly object.\n     */\n    toJSON() {\n        const s = (v) => {\n            if (v == null) {\n                return null;\n            }\n            return v.toString();\n        };\n        return {\n            type: this.type,\n            to: this.to,\n            //            from: this.from,\n            data: this.data,\n            nonce: this.nonce,\n            gasLimit: s(this.gasLimit),\n            gasPrice: s(this.gasPrice),\n            maxPriorityFeePerGas: s(this.maxPriorityFeePerGas),\n            maxFeePerGas: s(this.maxFeePerGas),\n            value: s(this.value),\n            chainId: s(this.chainId),\n            sig: this.signature ? this.signature.toJSON() : null,\n            accessList: this.accessList\n        };\n    }\n    /**\n     *  Create a **Transaction** from a serialized transaction or a\n     *  Transaction-like object.\n     */\n    static from(tx) {\n        if (tx == null) {\n            return new Transaction();\n        }\n        if (typeof (tx) === \"string\") {\n            const payload = (0, index_js_3.getBytes)(tx);\n            if (payload[0] >= 0x7f) { // @TODO: > vs >= ??\n                return Transaction.from(_parseLegacy(payload));\n            }\n            switch (payload[0]) {\n                case 1: return Transaction.from(_parseEip2930(payload));\n                case 2: return Transaction.from(_parseEip1559(payload));\n                case 3: return Transaction.from(_parseEip4844(payload));\n            }\n            (0, index_js_3.assert)(false, \"unsupported transaction type\", \"UNSUPPORTED_OPERATION\", { operation: \"from\" });\n        }\n        const result = new Transaction();\n        if (tx.type != null) {\n            result.type = tx.type;\n        }\n        if (tx.to != null) {\n            result.to = tx.to;\n        }\n        if (tx.nonce != null) {\n            result.nonce = tx.nonce;\n        }\n        if (tx.gasLimit != null) {\n            result.gasLimit = tx.gasLimit;\n        }\n        if (tx.gasPrice != null) {\n            result.gasPrice = tx.gasPrice;\n        }\n        if (tx.maxPriorityFeePerGas != null) {\n            result.maxPriorityFeePerGas = tx.maxPriorityFeePerGas;\n        }\n        if (tx.maxFeePerGas != null) {\n            result.maxFeePerGas = tx.maxFeePerGas;\n        }\n        if (tx.maxFeePerBlobGas != null) {\n            result.maxFeePerBlobGas = tx.maxFeePerBlobGas;\n        }\n        if (tx.data != null) {\n            result.data = tx.data;\n        }\n        if (tx.value != null) {\n            result.value = tx.value;\n        }\n        if (tx.chainId != null) {\n            result.chainId = tx.chainId;\n        }\n        if (tx.signature != null) {\n            result.signature = index_js_2.Signature.from(tx.signature);\n        }\n        if (tx.accessList != null) {\n            result.accessList = tx.accessList;\n        }\n        // This will get overwritten by blobs, if present\n        if (tx.blobVersionedHashes != null) {\n            result.blobVersionedHashes = tx.blobVersionedHashes;\n        }\n        // Make sure we assign the kzg before assigning blobs, which\n        // require the library in the event raw blob data is provided.\n        if (tx.kzg != null) {\n            result.kzg = tx.kzg;\n        }\n        if (tx.blobs != null) {\n            result.blobs = tx.blobs;\n        }\n        if (tx.hash != null) {\n            (0, index_js_3.assertArgument)(result.isSigned(), \"unsigned transaction cannot define '.hash'\", \"tx\", tx);\n            (0, index_js_3.assertArgument)(result.hash === tx.hash, \"hash mismatch\", \"tx\", tx);\n        }\n        if (tx.from != null) {\n            (0, index_js_3.assertArgument)(result.isSigned(), \"unsigned transaction cannot define '.from'\", \"tx\", tx);\n            (0, index_js_3.assertArgument)(result.from.toLowerCase() === (tx.from || \"\").toLowerCase(), \"from mismatch\", \"tx\", tx);\n        }\n        return result;\n    }\n}\nexports.Transaction = Transaction;\n//# sourceMappingURL=transaction.js.map","\"use strict\";\n/**\n *  The [Base58 Encoding](link-base58) scheme allows a **numeric** value\n *  to be encoded as a compact string using a radix of 58 using only\n *  alpha-numeric characters. Confusingly similar characters are omitted\n *  (i.e. ``\"l0O\"``).\n *\n *  Note that Base58 encodes a **numeric** value, not arbitrary bytes,\n *  since any zero-bytes on the left would get removed. To mitigate this\n *  issue most schemes that use Base58 choose specific high-order values\n *  to ensure non-zero prefixes.\n *\n *  @_subsection: api/utils:Base58 Encoding [about-base58]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeBase58 = exports.encodeBase58 = void 0;\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nconst maths_js_1 = require(\"./maths.js\");\nconst Alphabet = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\nlet Lookup = null;\nfunction getAlpha(letter) {\n    if (Lookup == null) {\n        Lookup = {};\n        for (let i = 0; i < Alphabet.length; i++) {\n            Lookup[Alphabet[i]] = BigInt(i);\n        }\n    }\n    const result = Lookup[letter];\n    (0, errors_js_1.assertArgument)(result != null, `invalid base58 value`, \"letter\", letter);\n    return result;\n}\nconst BN_0 = BigInt(0);\nconst BN_58 = BigInt(58);\n/**\n *  Encode %%value%% as a Base58-encoded string.\n */\nfunction encodeBase58(_value) {\n    const bytes = (0, data_js_1.getBytes)(_value);\n    let value = (0, maths_js_1.toBigInt)(bytes);\n    let result = \"\";\n    while (value) {\n        result = Alphabet[Number(value % BN_58)] + result;\n        value /= BN_58;\n    }\n    // Account for leading padding zeros\n    for (let i = 0; i < bytes.length; i++) {\n        if (bytes[i]) {\n            break;\n        }\n        result = Alphabet[0] + result;\n    }\n    return result;\n}\nexports.encodeBase58 = encodeBase58;\n/**\n *  Decode the Base58-encoded %%value%%.\n */\nfunction decodeBase58(value) {\n    let result = BN_0;\n    for (let i = 0; i < value.length; i++) {\n        result *= BN_58;\n        result += getAlpha(value[i]);\n    }\n    return result;\n}\nexports.decodeBase58 = decodeBase58;\n//# sourceMappingURL=base58.js.map","\"use strict\";\n// utils/base64-browser\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeBase64 = exports.decodeBase64 = void 0;\nconst data_js_1 = require(\"./data.js\");\nfunction decodeBase64(textData) {\n    textData = atob(textData);\n    const data = new Uint8Array(textData.length);\n    for (let i = 0; i < textData.length; i++) {\n        data[i] = textData.charCodeAt(i);\n    }\n    return (0, data_js_1.getBytes)(data);\n}\nexports.decodeBase64 = decodeBase64;\nfunction encodeBase64(_data) {\n    const data = (0, data_js_1.getBytes)(_data);\n    let textData = \"\";\n    for (let i = 0; i < data.length; i++) {\n        textData += String.fromCharCode(data[i]);\n    }\n    return btoa(textData);\n}\nexports.encodeBase64 = encodeBase64;\n//# sourceMappingURL=base64-browser.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.zeroPadBytes = exports.zeroPadValue = exports.stripZerosLeft = exports.dataSlice = exports.dataLength = exports.concat = exports.hexlify = exports.isBytesLike = exports.isHexString = exports.getBytesCopy = exports.getBytes = void 0;\n/**\n *  Some data helpers.\n *\n *\n *  @_subsection api/utils:Data Helpers  [about-data]\n */\nconst errors_js_1 = require(\"./errors.js\");\nfunction _getBytes(value, name, copy) {\n    if (value instanceof Uint8Array) {\n        if (copy) {\n            return new Uint8Array(value);\n        }\n        return value;\n    }\n    if (typeof (value) === \"string\" && value.match(/^0x(?:[0-9a-f][0-9a-f])*$/i)) {\n        const result = new Uint8Array((value.length - 2) / 2);\n        let offset = 2;\n        for (let i = 0; i < result.length; i++) {\n            result[i] = parseInt(value.substring(offset, offset + 2), 16);\n            offset += 2;\n        }\n        return result;\n    }\n    (0, errors_js_1.assertArgument)(false, \"invalid BytesLike value\", name || \"value\", value);\n}\n/**\n *  Get a typed Uint8Array for %%value%%. If already a Uint8Array\n *  the original %%value%% is returned; if a copy is required use\n *  [[getBytesCopy]].\n *\n *  @see: getBytesCopy\n */\nfunction getBytes(value, name) {\n    return _getBytes(value, name, false);\n}\nexports.getBytes = getBytes;\n/**\n *  Get a typed Uint8Array for %%value%%, creating a copy if necessary\n *  to prevent any modifications of the returned value from being\n *  reflected elsewhere.\n *\n *  @see: getBytes\n */\nfunction getBytesCopy(value, name) {\n    return _getBytes(value, name, true);\n}\nexports.getBytesCopy = getBytesCopy;\n/**\n *  Returns true if %%value%% is a valid [[HexString]].\n *\n *  If %%length%% is ``true`` or a //number//, it also checks that\n *  %%value%% is a valid [[DataHexString]] of %%length%% (if a //number//)\n *  bytes of data (e.g. ``0x1234`` is 2 bytes).\n */\nfunction isHexString(value, length) {\n    if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n        return false;\n    }\n    if (typeof (length) === \"number\" && value.length !== 2 + 2 * length) {\n        return false;\n    }\n    if (length === true && (value.length % 2) !== 0) {\n        return false;\n    }\n    return true;\n}\nexports.isHexString = isHexString;\n/**\n *  Returns true if %%value%% is a valid representation of arbitrary\n *  data (i.e. a valid [[DataHexString]] or a Uint8Array).\n */\nfunction isBytesLike(value) {\n    return (isHexString(value, true) || (value instanceof Uint8Array));\n}\nexports.isBytesLike = isBytesLike;\nconst HexCharacters = \"0123456789abcdef\";\n/**\n *  Returns a [[DataHexString]] representation of %%data%%.\n */\nfunction hexlify(data) {\n    const bytes = getBytes(data);\n    let result = \"0x\";\n    for (let i = 0; i < bytes.length; i++) {\n        const v = bytes[i];\n        result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n    }\n    return result;\n}\nexports.hexlify = hexlify;\n/**\n *  Returns a [[DataHexString]] by concatenating all values\n *  within %%data%%.\n */\nfunction concat(datas) {\n    return \"0x\" + datas.map((d) => hexlify(d).substring(2)).join(\"\");\n}\nexports.concat = concat;\n/**\n *  Returns the length of %%data%%, in bytes.\n */\nfunction dataLength(data) {\n    if (isHexString(data, true)) {\n        return (data.length - 2) / 2;\n    }\n    return getBytes(data).length;\n}\nexports.dataLength = dataLength;\n/**\n *  Returns a [[DataHexString]] by slicing %%data%% from the %%start%%\n *  offset to the %%end%% offset.\n *\n *  By default %%start%% is 0 and %%end%% is the length of %%data%%.\n */\nfunction dataSlice(data, start, end) {\n    const bytes = getBytes(data);\n    if (end != null && end > bytes.length) {\n        (0, errors_js_1.assert)(false, \"cannot slice beyond data bounds\", \"BUFFER_OVERRUN\", {\n            buffer: bytes, length: bytes.length, offset: end\n        });\n    }\n    return hexlify(bytes.slice((start == null) ? 0 : start, (end == null) ? bytes.length : end));\n}\nexports.dataSlice = dataSlice;\n/**\n *  Return the [[DataHexString]] result by stripping all **leading**\n ** zero bytes from %%data%%.\n */\nfunction stripZerosLeft(data) {\n    let bytes = hexlify(data).substring(2);\n    while (bytes.startsWith(\"00\")) {\n        bytes = bytes.substring(2);\n    }\n    return \"0x\" + bytes;\n}\nexports.stripZerosLeft = stripZerosLeft;\nfunction zeroPad(data, length, left) {\n    const bytes = getBytes(data);\n    (0, errors_js_1.assert)(length >= bytes.length, \"padding exceeds data length\", \"BUFFER_OVERRUN\", {\n        buffer: new Uint8Array(bytes),\n        length: length,\n        offset: length + 1\n    });\n    const result = new Uint8Array(length);\n    result.fill(0);\n    if (left) {\n        result.set(bytes, length - bytes.length);\n    }\n    else {\n        result.set(bytes, 0);\n    }\n    return hexlify(result);\n}\n/**\n *  Return the [[DataHexString]] of %%data%% padded on the **left**\n *  to %%length%% bytes.\n *\n *  If %%data%% already exceeds %%length%%, a [[BufferOverrunError]] is\n *  thrown.\n *\n *  This pads data the same as **values** are in Solidity\n *  (e.g. ``uint128``).\n */\nfunction zeroPadValue(data, length) {\n    return zeroPad(data, length, true);\n}\nexports.zeroPadValue = zeroPadValue;\n/**\n *  Return the [[DataHexString]] of %%data%% padded on the **right**\n *  to %%length%% bytes.\n *\n *  If %%data%% already exceeds %%length%%, a [[BufferOverrunError]] is\n *  thrown.\n *\n *  This pads data the same as **bytes** are in Solidity\n *  (e.g. ``bytes16``).\n */\nfunction zeroPadBytes(data, length) {\n    return zeroPad(data, length, false);\n}\nexports.zeroPadBytes = zeroPadBytes;\n//# sourceMappingURL=data.js.map","\"use strict\";\n/**\n *  All errors in ethers include properties to ensure they are both\n *  human-readable (i.e. ``.message``) and machine-readable (i.e. ``.code``).\n *\n *  The [[isError]] function can be used to check the error ``code`` and\n *  provide a type guard for the properties present on that error interface.\n *\n *  @_section: api/utils/errors:Errors  [about-errors]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.assertPrivate = exports.assertNormalize = exports.assertArgumentCount = exports.assertArgument = exports.assert = exports.makeError = exports.isCallException = exports.isError = void 0;\nconst _version_js_1 = require(\"../_version.js\");\nconst properties_js_1 = require(\"./properties.js\");\nfunction stringify(value) {\n    if (value == null) {\n        return \"null\";\n    }\n    if (Array.isArray(value)) {\n        return \"[ \" + (value.map(stringify)).join(\", \") + \" ]\";\n    }\n    if (value instanceof Uint8Array) {\n        const HEX = \"0123456789abcdef\";\n        let result = \"0x\";\n        for (let i = 0; i < value.length; i++) {\n            result += HEX[value[i] >> 4];\n            result += HEX[value[i] & 0xf];\n        }\n        return result;\n    }\n    if (typeof (value) === \"object\" && typeof (value.toJSON) === \"function\") {\n        return stringify(value.toJSON());\n    }\n    switch (typeof (value)) {\n        case \"boolean\":\n        case \"symbol\":\n            return value.toString();\n        case \"bigint\":\n            return BigInt(value).toString();\n        case \"number\":\n            return (value).toString();\n        case \"string\":\n            return JSON.stringify(value);\n        case \"object\": {\n            const keys = Object.keys(value);\n            keys.sort();\n            return \"{ \" + keys.map((k) => `${stringify(k)}: ${stringify(value[k])}`).join(\", \") + \" }\";\n        }\n    }\n    return `[ COULD NOT SERIALIZE ]`;\n}\n/**\n *  Returns true if the %%error%% matches an error thrown by ethers\n *  that matches the error %%code%%.\n *\n *  In TypeScript environments, this can be used to check that %%error%%\n *  matches an EthersError type, which means the expected properties will\n *  be set.\n *\n *  @See [ErrorCodes](api:ErrorCode)\n *  @example\n *    try {\n *      // code....\n *    } catch (e) {\n *      if (isError(e, \"CALL_EXCEPTION\")) {\n *          // The Type Guard has validated this object\n *          console.log(e.data);\n *      }\n *    }\n */\nfunction isError(error, code) {\n    return (error && error.code === code);\n}\nexports.isError = isError;\n/**\n *  Returns true if %%error%% is a [[CallExceptionError].\n */\nfunction isCallException(error) {\n    return isError(error, \"CALL_EXCEPTION\");\n}\nexports.isCallException = isCallException;\n/**\n *  Returns a new Error configured to the format ethers emits errors, with\n *  the %%message%%, [[api:ErrorCode]] %%code%% and additional properties\n *  for the corresponding EthersError.\n *\n *  Each error in ethers includes the version of ethers, a\n *  machine-readable [[ErrorCode]], and depending on %%code%%, additional\n *  required properties. The error message will also include the %%message%%,\n *  ethers version, %%code%% and all additional properties, serialized.\n */\nfunction makeError(message, code, info) {\n    let shortMessage = message;\n    {\n        const details = [];\n        if (info) {\n            if (\"message\" in info || \"code\" in info || \"name\" in info) {\n                throw new Error(`value will overwrite populated values: ${stringify(info)}`);\n            }\n            for (const key in info) {\n                if (key === \"shortMessage\") {\n                    continue;\n                }\n                const value = (info[key]);\n                //                try {\n                details.push(key + \"=\" + stringify(value));\n                //                } catch (error: any) {\n                //                console.log(\"MMM\", error.message);\n                //                    details.push(key + \"=[could not serialize object]\");\n                //                }\n            }\n        }\n        details.push(`code=${code}`);\n        details.push(`version=${_version_js_1.version}`);\n        if (details.length) {\n            message += \" (\" + details.join(\", \") + \")\";\n        }\n    }\n    let error;\n    switch (code) {\n        case \"INVALID_ARGUMENT\":\n            error = new TypeError(message);\n            break;\n        case \"NUMERIC_FAULT\":\n        case \"BUFFER_OVERRUN\":\n            error = new RangeError(message);\n            break;\n        default:\n            error = new Error(message);\n    }\n    (0, properties_js_1.defineProperties)(error, { code });\n    if (info) {\n        Object.assign(error, info);\n    }\n    if (error.shortMessage == null) {\n        (0, properties_js_1.defineProperties)(error, { shortMessage });\n    }\n    return error;\n}\nexports.makeError = makeError;\n/**\n *  Throws an EthersError with %%message%%, %%code%% and additional error\n *  %%info%% when %%check%% is falsish..\n *\n *  @see [[api:makeError]]\n */\nfunction assert(check, message, code, info) {\n    if (!check) {\n        throw makeError(message, code, info);\n    }\n}\nexports.assert = assert;\n/**\n *  A simple helper to simply ensuring provided arguments match expected\n *  constraints, throwing if not.\n *\n *  In TypeScript environments, the %%check%% has been asserted true, so\n *  any further code does not need additional compile-time checks.\n */\nfunction assertArgument(check, message, name, value) {\n    assert(check, message, \"INVALID_ARGUMENT\", { argument: name, value: value });\n}\nexports.assertArgument = assertArgument;\nfunction assertArgumentCount(count, expectedCount, message) {\n    if (message == null) {\n        message = \"\";\n    }\n    if (message) {\n        message = \": \" + message;\n    }\n    assert(count >= expectedCount, \"missing arguemnt\" + message, \"MISSING_ARGUMENT\", {\n        count: count,\n        expectedCount: expectedCount\n    });\n    assert(count <= expectedCount, \"too many arguments\" + message, \"UNEXPECTED_ARGUMENT\", {\n        count: count,\n        expectedCount: expectedCount\n    });\n}\nexports.assertArgumentCount = assertArgumentCount;\nconst _normalizeForms = [\"NFD\", \"NFC\", \"NFKD\", \"NFKC\"].reduce((accum, form) => {\n    try {\n        // General test for normalize\n        /* c8 ignore start */\n        if (\"test\".normalize(form) !== \"test\") {\n            throw new Error(\"bad\");\n        }\n        ;\n        /* c8 ignore stop */\n        if (form === \"NFD\") {\n            const check = String.fromCharCode(0xe9).normalize(\"NFD\");\n            const expected = String.fromCharCode(0x65, 0x0301);\n            /* c8 ignore start */\n            if (check !== expected) {\n                throw new Error(\"broken\");\n            }\n            /* c8 ignore stop */\n        }\n        accum.push(form);\n    }\n    catch (error) { }\n    return accum;\n}, []);\n/**\n *  Throws if the normalization %%form%% is not supported.\n */\nfunction assertNormalize(form) {\n    assert(_normalizeForms.indexOf(form) >= 0, \"platform missing String.prototype.normalize\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"String.prototype.normalize\", info: { form }\n    });\n}\nexports.assertNormalize = assertNormalize;\n/**\n *  Many classes use file-scoped values to guard the constructor,\n *  making it effectively private. This facilitates that pattern\n *  by ensuring the %%givenGaurd%% matches the file-scoped %%guard%%,\n *  throwing if not, indicating the %%className%% if provided.\n */\nfunction assertPrivate(givenGuard, guard, className) {\n    if (className == null) {\n        className = \"\";\n    }\n    if (givenGuard !== guard) {\n        let method = className, operation = \"new\";\n        if (className) {\n            method += \".\";\n            operation += \" \" + className;\n        }\n        assert(false, `private constructor; use ${method}from* methods`, \"UNSUPPORTED_OPERATION\", {\n            operation\n        });\n    }\n}\nexports.assertPrivate = assertPrivate;\n//# sourceMappingURL=errors.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EventPayload = void 0;\n/**\n *  Events allow for applications to use the observer pattern, which\n *  allows subscribing and publishing events, outside the normal\n *  execution paths.\n *\n *  @_section api/utils/events:Events  [about-events]\n */\nconst properties_js_1 = require(\"./properties.js\");\n/**\n *  When an [[EventEmitterable]] triggers a [[Listener]], the\n *  callback always ahas one additional argument passed, which is\n *  an **EventPayload**.\n */\nclass EventPayload {\n    /**\n     *  The event filter.\n     */\n    filter;\n    /**\n     *  The **EventEmitterable**.\n     */\n    emitter;\n    #listener;\n    /**\n     *  Create a new **EventPayload** for %%emitter%% with\n     *  the %%listener%% and for %%filter%%.\n     */\n    constructor(emitter, listener, filter) {\n        this.#listener = listener;\n        (0, properties_js_1.defineProperties)(this, { emitter, filter });\n    }\n    /**\n     *  Unregister the triggered listener for future events.\n     */\n    async removeListener() {\n        if (this.#listener == null) {\n            return;\n        }\n        await this.emitter.off(this.filter, this.#listener);\n    }\n}\nexports.EventPayload = EventPayload;\n//# sourceMappingURL=events.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FetchResponse = exports.FetchRequest = exports.FetchCancelSignal = void 0;\n/**\n *  Fetching content from the web is environment-specific, so Ethers\n *  provides an abstraction that each environment can implement to provide\n *  this service.\n *\n *  On [Node.js](link-node), the ``http`` and ``https`` libs are used to\n *  create a request object, register event listeners and process data\n *  and populate the [[FetchResponse]].\n *\n *  In a browser, the [DOM fetch](link-js-fetch) is used, and the resulting\n *  ``Promise`` is waited on to retrieve the payload.\n *\n *  The [[FetchRequest]] is responsible for handling many common situations,\n *  such as redirects, server throttling, authentication, etc.\n *\n *  It also handles common gateways, such as IPFS and data URIs.\n *\n *  @_section api/utils/fetching:Fetching Web Content  [about-fetch]\n */\nconst base64_js_1 = require(\"./base64.js\");\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nconst properties_js_1 = require(\"./properties.js\");\nconst utf8_js_1 = require(\"./utf8.js\");\nconst geturl_js_1 = require(\"./geturl.js\");\nconst MAX_ATTEMPTS = 12;\nconst SLOT_INTERVAL = 250;\n// The global FetchGetUrlFunc implementation.\nlet defaultGetUrlFunc = (0, geturl_js_1.createGetUrl)();\nconst reData = new RegExp(\"^data:([^;:]*)?(;base64)?,(.*)$\", \"i\");\nconst reIpfs = new RegExp(\"^ipfs:/\\/(ipfs/)?(.*)$\", \"i\");\n// If locked, new Gateways cannot be added\nlet locked = false;\n// https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Data_URLs\nasync function dataGatewayFunc(url, signal) {\n    try {\n        const match = url.match(reData);\n        if (!match) {\n            throw new Error(\"invalid data\");\n        }\n        return new FetchResponse(200, \"OK\", {\n            \"content-type\": (match[1] || \"text/plain\"),\n        }, (match[2] ? (0, base64_js_1.decodeBase64)(match[3]) : unpercent(match[3])));\n    }\n    catch (error) {\n        return new FetchResponse(599, \"BAD REQUEST (invalid data: URI)\", {}, null, new FetchRequest(url));\n    }\n}\n/**\n *  Returns a [[FetchGatewayFunc]] for fetching content from a standard\n *  IPFS gateway hosted at %%baseUrl%%.\n */\nfunction getIpfsGatewayFunc(baseUrl) {\n    async function gatewayIpfs(url, signal) {\n        try {\n            const match = url.match(reIpfs);\n            if (!match) {\n                throw new Error(\"invalid link\");\n            }\n            return new FetchRequest(`${baseUrl}${match[2]}`);\n        }\n        catch (error) {\n            return new FetchResponse(599, \"BAD REQUEST (invalid IPFS URI)\", {}, null, new FetchRequest(url));\n        }\n    }\n    return gatewayIpfs;\n}\nconst Gateways = {\n    \"data\": dataGatewayFunc,\n    \"ipfs\": getIpfsGatewayFunc(\"https:/\\/gateway.ipfs.io/ipfs/\")\n};\nconst fetchSignals = new WeakMap();\n/**\n *  @_ignore\n */\nclass FetchCancelSignal {\n    #listeners;\n    #cancelled;\n    constructor(request) {\n        this.#listeners = [];\n        this.#cancelled = false;\n        fetchSignals.set(request, () => {\n            if (this.#cancelled) {\n                return;\n            }\n            this.#cancelled = true;\n            for (const listener of this.#listeners) {\n                setTimeout(() => { listener(); }, 0);\n            }\n            this.#listeners = [];\n        });\n    }\n    addListener(listener) {\n        (0, errors_js_1.assert)(!this.#cancelled, \"singal already cancelled\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fetchCancelSignal.addCancelListener\"\n        });\n        this.#listeners.push(listener);\n    }\n    get cancelled() { return this.#cancelled; }\n    checkSignal() {\n        (0, errors_js_1.assert)(!this.cancelled, \"cancelled\", \"CANCELLED\", {});\n    }\n}\nexports.FetchCancelSignal = FetchCancelSignal;\n// Check the signal, throwing if it is cancelled\nfunction checkSignal(signal) {\n    if (signal == null) {\n        throw new Error(\"missing signal; should not happen\");\n    }\n    signal.checkSignal();\n    return signal;\n}\n/**\n *  Represents a request for a resource using a URI.\n *\n *  By default, the supported schemes are ``HTTP``, ``HTTPS``, ``data:``,\n *  and ``IPFS:``.\n *\n *  Additional schemes can be added globally using [[registerGateway]].\n *\n *  @example:\n *    req = new FetchRequest(\"https://www.ricmoo.com\")\n *    resp = await req.send()\n *    resp.body.length\n *    //_result:\n */\nclass FetchRequest {\n    #allowInsecure;\n    #gzip;\n    #headers;\n    #method;\n    #timeout;\n    #url;\n    #body;\n    #bodyType;\n    #creds;\n    // Hooks\n    #preflight;\n    #process;\n    #retry;\n    #signal;\n    #throttle;\n    #getUrlFunc;\n    /**\n     *  The fetch URL to request.\n     */\n    get url() { return this.#url; }\n    set url(url) {\n        this.#url = String(url);\n    }\n    /**\n     *  The fetch body, if any, to send as the request body. //(default: null)//\n     *\n     *  When setting a body, the intrinsic ``Content-Type`` is automatically\n     *  set and will be used if **not overridden** by setting a custom\n     *  header.\n     *\n     *  If %%body%% is null, the body is cleared (along with the\n     *  intrinsic ``Content-Type``).\n     *\n     *  If %%body%% is a string, the intrinsic ``Content-Type`` is set to\n     *  ``text/plain``.\n     *\n     *  If %%body%% is a Uint8Array, the intrinsic ``Content-Type`` is set to\n     *  ``application/octet-stream``.\n     *\n     *  If %%body%% is any other object, the intrinsic ``Content-Type`` is\n     *  set to ``application/json``.\n     */\n    get body() {\n        if (this.#body == null) {\n            return null;\n        }\n        return new Uint8Array(this.#body);\n    }\n    set body(body) {\n        if (body == null) {\n            this.#body = undefined;\n            this.#bodyType = undefined;\n        }\n        else if (typeof (body) === \"string\") {\n            this.#body = (0, utf8_js_1.toUtf8Bytes)(body);\n            this.#bodyType = \"text/plain\";\n        }\n        else if (body instanceof Uint8Array) {\n            this.#body = body;\n            this.#bodyType = \"application/octet-stream\";\n        }\n        else if (typeof (body) === \"object\") {\n            this.#body = (0, utf8_js_1.toUtf8Bytes)(JSON.stringify(body));\n            this.#bodyType = \"application/json\";\n        }\n        else {\n            throw new Error(\"invalid body\");\n        }\n    }\n    /**\n     *  Returns true if the request has a body.\n     */\n    hasBody() {\n        return (this.#body != null);\n    }\n    /**\n     *  The HTTP method to use when requesting the URI. If no method\n     *  has been explicitly set, then ``GET`` is used if the body is\n     *  null and ``POST`` otherwise.\n     */\n    get method() {\n        if (this.#method) {\n            return this.#method;\n        }\n        if (this.hasBody()) {\n            return \"POST\";\n        }\n        return \"GET\";\n    }\n    set method(method) {\n        if (method == null) {\n            method = \"\";\n        }\n        this.#method = String(method).toUpperCase();\n    }\n    /**\n     *  The headers that will be used when requesting the URI. All\n     *  keys are lower-case.\n     *\n     *  This object is a copy, so any changes will **NOT** be reflected\n     *  in the ``FetchRequest``.\n     *\n     *  To set a header entry, use the ``setHeader`` method.\n     */\n    get headers() {\n        const headers = Object.assign({}, this.#headers);\n        if (this.#creds) {\n            headers[\"authorization\"] = `Basic ${(0, base64_js_1.encodeBase64)((0, utf8_js_1.toUtf8Bytes)(this.#creds))}`;\n        }\n        ;\n        if (this.allowGzip) {\n            headers[\"accept-encoding\"] = \"gzip\";\n        }\n        if (headers[\"content-type\"] == null && this.#bodyType) {\n            headers[\"content-type\"] = this.#bodyType;\n        }\n        if (this.body) {\n            headers[\"content-length\"] = String(this.body.length);\n        }\n        return headers;\n    }\n    /**\n     *  Get the header for %%key%%, ignoring case.\n     */\n    getHeader(key) {\n        return this.headers[key.toLowerCase()];\n    }\n    /**\n     *  Set the header for %%key%% to %%value%%. All values are coerced\n     *  to a string.\n     */\n    setHeader(key, value) {\n        this.#headers[String(key).toLowerCase()] = String(value);\n    }\n    /**\n     *  Clear all headers, resetting all intrinsic headers.\n     */\n    clearHeaders() {\n        this.#headers = {};\n    }\n    [Symbol.iterator]() {\n        const headers = this.headers;\n        const keys = Object.keys(headers);\n        let index = 0;\n        return {\n            next: () => {\n                if (index < keys.length) {\n                    const key = keys[index++];\n                    return {\n                        value: [key, headers[key]], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The value that will be sent for the ``Authorization`` header.\n     *\n     *  To set the credentials, use the ``setCredentials`` method.\n     */\n    get credentials() {\n        return this.#creds || null;\n    }\n    /**\n     *  Sets an ``Authorization`` for %%username%% with %%password%%.\n     */\n    setCredentials(username, password) {\n        (0, errors_js_1.assertArgument)(!username.match(/:/), \"invalid basic authentication username\", \"username\", \"[REDACTED]\");\n        this.#creds = `${username}:${password}`;\n    }\n    /**\n     *  Enable and request gzip-encoded responses. The response will\n     *  automatically be decompressed. //(default: true)//\n     */\n    get allowGzip() {\n        return this.#gzip;\n    }\n    set allowGzip(value) {\n        this.#gzip = !!value;\n    }\n    /**\n     *  Allow ``Authentication`` credentials to be sent over insecure\n     *  channels. //(default: false)//\n     */\n    get allowInsecureAuthentication() {\n        return !!this.#allowInsecure;\n    }\n    set allowInsecureAuthentication(value) {\n        this.#allowInsecure = !!value;\n    }\n    /**\n     *  The timeout (in milliseconds) to wait for a complete response.\n     *  //(default: 5 minutes)//\n     */\n    get timeout() { return this.#timeout; }\n    set timeout(timeout) {\n        (0, errors_js_1.assertArgument)(timeout >= 0, \"timeout must be non-zero\", \"timeout\", timeout);\n        this.#timeout = timeout;\n    }\n    /**\n     *  This function is called prior to each request, for example\n     *  during a redirection or retry in case of server throttling.\n     *\n     *  This offers an opportunity to populate headers or update\n     *  content before sending a request.\n     */\n    get preflightFunc() {\n        return this.#preflight || null;\n    }\n    set preflightFunc(preflight) {\n        this.#preflight = preflight;\n    }\n    /**\n     *  This function is called after each response, offering an\n     *  opportunity to provide client-level throttling or updating\n     *  response data.\n     *\n     *  Any error thrown in this causes the ``send()`` to throw.\n     *\n     *  To schedule a retry attempt (assuming the maximum retry limit\n     *  has not been reached), use [[response.throwThrottleError]].\n     */\n    get processFunc() {\n        return this.#process || null;\n    }\n    set processFunc(process) {\n        this.#process = process;\n    }\n    /**\n     *  This function is called on each retry attempt.\n     */\n    get retryFunc() {\n        return this.#retry || null;\n    }\n    set retryFunc(retry) {\n        this.#retry = retry;\n    }\n    /**\n     *  This function is called to fetch content from HTTP and\n     *  HTTPS URLs and is platform specific (e.g. nodejs vs\n     *  browsers).\n     *\n     *  This is by default the currently registered global getUrl\n     *  function, which can be changed using [[registerGetUrl]].\n     *  If this has been set, setting is to ``null`` will cause\n     *  this FetchRequest (and any future clones) to revert back to\n     *  using the currently registered global getUrl function.\n     *\n     *  Setting this is generally not necessary, but may be useful\n     *  for developers that wish to intercept requests or to\n     *  configurege a proxy or other agent.\n     */\n    get getUrlFunc() {\n        return this.#getUrlFunc || defaultGetUrlFunc;\n    }\n    set getUrlFunc(value) {\n        this.#getUrlFunc = value;\n    }\n    /**\n     *  Create a new FetchRequest instance with default values.\n     *\n     *  Once created, each property may be set before issuing a\n     *  ``.send()`` to make the request.\n     */\n    constructor(url) {\n        this.#url = String(url);\n        this.#allowInsecure = false;\n        this.#gzip = true;\n        this.#headers = {};\n        this.#method = \"\";\n        this.#timeout = 300000;\n        this.#throttle = {\n            slotInterval: SLOT_INTERVAL,\n            maxAttempts: MAX_ATTEMPTS\n        };\n        this.#getUrlFunc = null;\n    }\n    toString() {\n        return `<FetchRequest method=${JSON.stringify(this.method)} url=${JSON.stringify(this.url)} headers=${JSON.stringify(this.headers)} body=${this.#body ? (0, data_js_1.hexlify)(this.#body) : \"null\"}>`;\n    }\n    /**\n     *  Update the throttle parameters used to determine maximum\n     *  attempts and exponential-backoff properties.\n     */\n    setThrottleParams(params) {\n        if (params.slotInterval != null) {\n            this.#throttle.slotInterval = params.slotInterval;\n        }\n        if (params.maxAttempts != null) {\n            this.#throttle.maxAttempts = params.maxAttempts;\n        }\n    }\n    async #send(attempt, expires, delay, _request, _response) {\n        if (attempt >= this.#throttle.maxAttempts) {\n            return _response.makeServerError(\"exceeded maximum retry limit\");\n        }\n        (0, errors_js_1.assert)(getTime() <= expires, \"timeout\", \"TIMEOUT\", {\n            operation: \"request.send\", reason: \"timeout\", request: _request\n        });\n        if (delay > 0) {\n            await wait(delay);\n        }\n        let req = this.clone();\n        const scheme = (req.url.split(\":\")[0] || \"\").toLowerCase();\n        // Process any Gateways\n        if (scheme in Gateways) {\n            const result = await Gateways[scheme](req.url, checkSignal(_request.#signal));\n            if (result instanceof FetchResponse) {\n                let response = result;\n                if (this.processFunc) {\n                    checkSignal(_request.#signal);\n                    try {\n                        response = await this.processFunc(req, response);\n                    }\n                    catch (error) {\n                        // Something went wrong during processing; throw a 5xx server error\n                        if (error.throttle == null || typeof (error.stall) !== \"number\") {\n                            response.makeServerError(\"error in post-processing function\", error).assertOk();\n                        }\n                        // Ignore throttling\n                    }\n                }\n                return response;\n            }\n            req = result;\n        }\n        // We have a preflight function; update the request\n        if (this.preflightFunc) {\n            req = await this.preflightFunc(req);\n        }\n        const resp = await this.getUrlFunc(req, checkSignal(_request.#signal));\n        let response = new FetchResponse(resp.statusCode, resp.statusMessage, resp.headers, resp.body, _request);\n        if (response.statusCode === 301 || response.statusCode === 302) {\n            // Redirect\n            try {\n                const location = response.headers.location || \"\";\n                return req.redirect(location).#send(attempt + 1, expires, 0, _request, response);\n            }\n            catch (error) { }\n            // Things won't get any better on another attempt; abort\n            return response;\n        }\n        else if (response.statusCode === 429) {\n            // Throttle\n            if (this.retryFunc == null || (await this.retryFunc(req, response, attempt))) {\n                const retryAfter = response.headers[\"retry-after\"];\n                let delay = this.#throttle.slotInterval * Math.trunc(Math.random() * Math.pow(2, attempt));\n                if (typeof (retryAfter) === \"string\" && retryAfter.match(/^[1-9][0-9]*$/)) {\n                    delay = parseInt(retryAfter);\n                }\n                return req.clone().#send(attempt + 1, expires, delay, _request, response);\n            }\n        }\n        if (this.processFunc) {\n            checkSignal(_request.#signal);\n            try {\n                response = await this.processFunc(req, response);\n            }\n            catch (error) {\n                // Something went wrong during processing; throw a 5xx server error\n                if (error.throttle == null || typeof (error.stall) !== \"number\") {\n                    response.makeServerError(\"error in post-processing function\", error).assertOk();\n                }\n                // Throttle\n                let delay = this.#throttle.slotInterval * Math.trunc(Math.random() * Math.pow(2, attempt));\n                ;\n                if (error.stall >= 0) {\n                    delay = error.stall;\n                }\n                return req.clone().#send(attempt + 1, expires, delay, _request, response);\n            }\n        }\n        return response;\n    }\n    /**\n     *  Resolves to the response by sending the request.\n     */\n    send() {\n        (0, errors_js_1.assert)(this.#signal == null, \"request already sent\", \"UNSUPPORTED_OPERATION\", { operation: \"fetchRequest.send\" });\n        this.#signal = new FetchCancelSignal(this);\n        return this.#send(0, getTime() + this.timeout, 0, this, new FetchResponse(0, \"\", {}, null, this));\n    }\n    /**\n     *  Cancels the inflight response, causing a ``CANCELLED``\n     *  error to be rejected from the [[send]].\n     */\n    cancel() {\n        (0, errors_js_1.assert)(this.#signal != null, \"request has not been sent\", \"UNSUPPORTED_OPERATION\", { operation: \"fetchRequest.cancel\" });\n        const signal = fetchSignals.get(this);\n        if (!signal) {\n            throw new Error(\"missing signal; should not happen\");\n        }\n        signal();\n    }\n    /**\n     *  Returns a new [[FetchRequest]] that represents the redirection\n     *  to %%location%%.\n     */\n    redirect(location) {\n        // Redirection; for now we only support absolute locations\n        const current = this.url.split(\":\")[0].toLowerCase();\n        const target = location.split(\":\")[0].toLowerCase();\n        // Don't allow redirecting:\n        // - non-GET requests\n        // - downgrading the security (e.g. https => http)\n        // - to non-HTTP (or non-HTTPS) protocols [this could be relaxed?]\n        (0, errors_js_1.assert)(this.method === \"GET\" && (current !== \"https\" || target !== \"http\") && location.match(/^https?:/), `unsupported redirect`, \"UNSUPPORTED_OPERATION\", {\n            operation: `redirect(${this.method} ${JSON.stringify(this.url)} => ${JSON.stringify(location)})`\n        });\n        // Create a copy of this request, with a new URL\n        const req = new FetchRequest(location);\n        req.method = \"GET\";\n        req.allowGzip = this.allowGzip;\n        req.timeout = this.timeout;\n        req.#headers = Object.assign({}, this.#headers);\n        if (this.#body) {\n            req.#body = new Uint8Array(this.#body);\n        }\n        req.#bodyType = this.#bodyType;\n        // Do not forward credentials unless on the same domain; only absolute\n        //req.allowInsecure = false;\n        // paths are currently supported; may want a way to specify to forward?\n        //setStore(req.#props, \"creds\", getStore(this.#pros, \"creds\"));\n        return req;\n    }\n    /**\n     *  Create a new copy of this request.\n     */\n    clone() {\n        const clone = new FetchRequest(this.url);\n        // Preserve \"default method\" (i.e. null)\n        clone.#method = this.#method;\n        // Preserve \"default body\" with type, copying the Uint8Array is present\n        if (this.#body) {\n            clone.#body = this.#body;\n        }\n        clone.#bodyType = this.#bodyType;\n        // Preserve \"default headers\"\n        clone.#headers = Object.assign({}, this.#headers);\n        // Credentials is readonly, so we copy internally\n        clone.#creds = this.#creds;\n        if (this.allowGzip) {\n            clone.allowGzip = true;\n        }\n        clone.timeout = this.timeout;\n        if (this.allowInsecureAuthentication) {\n            clone.allowInsecureAuthentication = true;\n        }\n        clone.#preflight = this.#preflight;\n        clone.#process = this.#process;\n        clone.#retry = this.#retry;\n        clone.#throttle = Object.assign({}, this.#throttle);\n        clone.#getUrlFunc = this.#getUrlFunc;\n        return clone;\n    }\n    /**\n     *  Locks all static configuration for gateways and FetchGetUrlFunc\n     *  registration.\n     */\n    static lockConfig() {\n        locked = true;\n    }\n    /**\n     *  Get the current Gateway function for %%scheme%%.\n     */\n    static getGateway(scheme) {\n        return Gateways[scheme.toLowerCase()] || null;\n    }\n    /**\n     *  Use the %%func%% when fetching URIs using %%scheme%%.\n     *\n     *  This method affects all requests globally.\n     *\n     *  If [[lockConfig]] has been called, no change is made and this\n     *  throws.\n     */\n    static registerGateway(scheme, func) {\n        scheme = scheme.toLowerCase();\n        if (scheme === \"http\" || scheme === \"https\") {\n            throw new Error(`cannot intercept ${scheme}; use registerGetUrl`);\n        }\n        if (locked) {\n            throw new Error(\"gateways locked\");\n        }\n        Gateways[scheme] = func;\n    }\n    /**\n     *  Use %%getUrl%% when fetching URIs over HTTP and HTTPS requests.\n     *\n     *  This method affects all requests globally.\n     *\n     *  If [[lockConfig]] has been called, no change is made and this\n     *  throws.\n     */\n    static registerGetUrl(getUrl) {\n        if (locked) {\n            throw new Error(\"gateways locked\");\n        }\n        defaultGetUrlFunc = getUrl;\n    }\n    /**\n     *  Creates a getUrl function that fetches content from HTTP and\n     *  HTTPS URLs.\n     *\n     *  The available %%options%% are dependent on the platform\n     *  implementation of the default getUrl function.\n     *\n     *  This is not generally something that is needed, but is useful\n     *  when trying to customize simple behaviour when fetching HTTP\n     *  content.\n     */\n    static createGetUrlFunc(options) {\n        return (0, geturl_js_1.createGetUrl)(options);\n    }\n    /**\n     *  Creates a function that can \"fetch\" data URIs.\n     *\n     *  Note that this is automatically done internally to support\n     *  data URIs, so it is not necessary to register it.\n     *\n     *  This is not generally something that is needed, but may\n     *  be useful in a wrapper to perfom custom data URI functionality.\n     */\n    static createDataGateway() {\n        return dataGatewayFunc;\n    }\n    /**\n     *  Creates a function that will fetch IPFS (unvalidated) from\n     *  a custom gateway baseUrl.\n     *\n     *  The default IPFS gateway used internally is\n     *  ``\"https:/\\/gateway.ipfs.io/ipfs/\"``.\n     */\n    static createIpfsGatewayFunc(baseUrl) {\n        return getIpfsGatewayFunc(baseUrl);\n    }\n}\nexports.FetchRequest = FetchRequest;\n;\n/**\n *  The response for a FetchRequest.\n */\nclass FetchResponse {\n    #statusCode;\n    #statusMessage;\n    #headers;\n    #body;\n    #request;\n    #error;\n    toString() {\n        return `<FetchResponse status=${this.statusCode} body=${this.#body ? (0, data_js_1.hexlify)(this.#body) : \"null\"}>`;\n    }\n    /**\n     *  The response status code.\n     */\n    get statusCode() { return this.#statusCode; }\n    /**\n     *  The response status message.\n     */\n    get statusMessage() { return this.#statusMessage; }\n    /**\n     *  The response headers. All keys are lower-case.\n     */\n    get headers() { return Object.assign({}, this.#headers); }\n    /**\n     *  The response body, or ``null`` if there was no body.\n     */\n    get body() {\n        return (this.#body == null) ? null : new Uint8Array(this.#body);\n    }\n    /**\n     *  The response body as a UTF-8 encoded string, or the empty\n     *  string (i.e. ``\"\"``) if there was no body.\n     *\n     *  An error is thrown if the body is invalid UTF-8 data.\n     */\n    get bodyText() {\n        try {\n            return (this.#body == null) ? \"\" : (0, utf8_js_1.toUtf8String)(this.#body);\n        }\n        catch (error) {\n            (0, errors_js_1.assert)(false, \"response body is not valid UTF-8 data\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"bodyText\", info: { response: this }\n            });\n        }\n    }\n    /**\n     *  The response body, decoded as JSON.\n     *\n     *  An error is thrown if the body is invalid JSON-encoded data\n     *  or if there was no body.\n     */\n    get bodyJson() {\n        try {\n            return JSON.parse(this.bodyText);\n        }\n        catch (error) {\n            (0, errors_js_1.assert)(false, \"response body is not valid JSON\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"bodyJson\", info: { response: this }\n            });\n        }\n    }\n    [Symbol.iterator]() {\n        const headers = this.headers;\n        const keys = Object.keys(headers);\n        let index = 0;\n        return {\n            next: () => {\n                if (index < keys.length) {\n                    const key = keys[index++];\n                    return {\n                        value: [key, headers[key]], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    constructor(statusCode, statusMessage, headers, body, request) {\n        this.#statusCode = statusCode;\n        this.#statusMessage = statusMessage;\n        this.#headers = Object.keys(headers).reduce((accum, k) => {\n            accum[k.toLowerCase()] = String(headers[k]);\n            return accum;\n        }, {});\n        this.#body = ((body == null) ? null : new Uint8Array(body));\n        this.#request = (request || null);\n        this.#error = { message: \"\" };\n    }\n    /**\n     *  Return a Response with matching headers and body, but with\n     *  an error status code (i.e. 599) and %%message%% with an\n     *  optional %%error%%.\n     */\n    makeServerError(message, error) {\n        let statusMessage;\n        if (!message) {\n            message = `${this.statusCode} ${this.statusMessage}`;\n            statusMessage = `CLIENT ESCALATED SERVER ERROR (${message})`;\n        }\n        else {\n            statusMessage = `CLIENT ESCALATED SERVER ERROR (${this.statusCode} ${this.statusMessage}; ${message})`;\n        }\n        const response = new FetchResponse(599, statusMessage, this.headers, this.body, this.#request || undefined);\n        response.#error = { message, error };\n        return response;\n    }\n    /**\n     *  If called within a [request.processFunc](FetchRequest-processFunc)\n     *  call, causes the request to retry as if throttled for %%stall%%\n     *  milliseconds.\n     */\n    throwThrottleError(message, stall) {\n        if (stall == null) {\n            stall = -1;\n        }\n        else {\n            (0, errors_js_1.assertArgument)(Number.isInteger(stall) && stall >= 0, \"invalid stall timeout\", \"stall\", stall);\n        }\n        const error = new Error(message || \"throttling requests\");\n        (0, properties_js_1.defineProperties)(error, { stall, throttle: true });\n        throw error;\n    }\n    /**\n     *  Get the header value for %%key%%, ignoring case.\n     */\n    getHeader(key) {\n        return this.headers[key.toLowerCase()];\n    }\n    /**\n     *  Returns true if the response has a body.\n     */\n    hasBody() {\n        return (this.#body != null);\n    }\n    /**\n     *  The request made for this response.\n     */\n    get request() { return this.#request; }\n    /**\n     *  Returns true if this response was a success statusCode.\n     */\n    ok() {\n        return (this.#error.message === \"\" && this.statusCode >= 200 && this.statusCode < 300);\n    }\n    /**\n     *  Throws a ``SERVER_ERROR`` if this response is not ok.\n     */\n    assertOk() {\n        if (this.ok()) {\n            return;\n        }\n        let { message, error } = this.#error;\n        if (message === \"\") {\n            message = `server response ${this.statusCode} ${this.statusMessage}`;\n        }\n        let requestUrl = null;\n        if (this.request) {\n            requestUrl = this.request.url;\n        }\n        let responseBody = null;\n        try {\n            if (this.#body) {\n                responseBody = (0, utf8_js_1.toUtf8String)(this.#body);\n            }\n        }\n        catch (e) { }\n        (0, errors_js_1.assert)(false, message, \"SERVER_ERROR\", {\n            request: (this.request || \"unknown request\"), response: this, error,\n            info: {\n                requestUrl, responseBody,\n                responseStatus: `${this.statusCode} ${this.statusMessage}`\n            }\n        });\n    }\n}\nexports.FetchResponse = FetchResponse;\nfunction getTime() { return (new Date()).getTime(); }\nfunction unpercent(value) {\n    return (0, utf8_js_1.toUtf8Bytes)(value.replace(/%([0-9a-f][0-9a-f])/gi, (all, code) => {\n        return String.fromCharCode(parseInt(code, 16));\n    }));\n}\nfunction wait(delay) {\n    return new Promise((resolve) => setTimeout(resolve, delay));\n}\n//# sourceMappingURL=fetch.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FixedNumber = void 0;\n/**\n *  The **FixedNumber** class permits using values with decimal places,\n *  using fixed-pont math.\n *\n *  Fixed-point math is still based on integers under-the-hood, but uses an\n *  internal offset to store fractional components below, and each operation\n *  corrects for this after each operation.\n *\n *  @_section: api/utils/fixed-point-math:Fixed-Point Maths  [about-fixed-point-math]\n */\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nconst maths_js_1 = require(\"./maths.js\");\nconst properties_js_1 = require(\"./properties.js\");\nconst BN_N1 = BigInt(-1);\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_5 = BigInt(5);\nconst _guard = {};\n// Constant to pull zeros from for multipliers\nlet Zeros = \"0000\";\nwhile (Zeros.length < 80) {\n    Zeros += Zeros;\n}\n// Returns a string \"1\" followed by decimal \"0\"s\nfunction getTens(decimals) {\n    let result = Zeros;\n    while (result.length < decimals) {\n        result += result;\n    }\n    return BigInt(\"1\" + result.substring(0, decimals));\n}\nfunction checkValue(val, format, safeOp) {\n    const width = BigInt(format.width);\n    if (format.signed) {\n        const limit = (BN_1 << (width - BN_1));\n        (0, errors_js_1.assert)(safeOp == null || (val >= -limit && val < limit), \"overflow\", \"NUMERIC_FAULT\", {\n            operation: safeOp, fault: \"overflow\", value: val\n        });\n        if (val > BN_0) {\n            val = (0, maths_js_1.fromTwos)((0, maths_js_1.mask)(val, width), width);\n        }\n        else {\n            val = -(0, maths_js_1.fromTwos)((0, maths_js_1.mask)(-val, width), width);\n        }\n    }\n    else {\n        const limit = (BN_1 << width);\n        (0, errors_js_1.assert)(safeOp == null || (val >= 0 && val < limit), \"overflow\", \"NUMERIC_FAULT\", {\n            operation: safeOp, fault: \"overflow\", value: val\n        });\n        val = (((val % limit) + limit) % limit) & (limit - BN_1);\n    }\n    return val;\n}\nfunction getFormat(value) {\n    if (typeof (value) === \"number\") {\n        value = `fixed128x${value}`;\n    }\n    let signed = true;\n    let width = 128;\n    let decimals = 18;\n    if (typeof (value) === \"string\") {\n        // Parse the format string\n        if (value === \"fixed\") {\n            // defaults...\n        }\n        else if (value === \"ufixed\") {\n            signed = false;\n        }\n        else {\n            const match = value.match(/^(u?)fixed([0-9]+)x([0-9]+)$/);\n            (0, errors_js_1.assertArgument)(match, \"invalid fixed format\", \"format\", value);\n            signed = (match[1] !== \"u\");\n            width = parseInt(match[2]);\n            decimals = parseInt(match[3]);\n        }\n    }\n    else if (value) {\n        // Extract the values from the object\n        const v = value;\n        const check = (key, type, defaultValue) => {\n            if (v[key] == null) {\n                return defaultValue;\n            }\n            (0, errors_js_1.assertArgument)(typeof (v[key]) === type, \"invalid fixed format (\" + key + \" not \" + type + \")\", \"format.\" + key, v[key]);\n            return v[key];\n        };\n        signed = check(\"signed\", \"boolean\", signed);\n        width = check(\"width\", \"number\", width);\n        decimals = check(\"decimals\", \"number\", decimals);\n    }\n    (0, errors_js_1.assertArgument)((width % 8) === 0, \"invalid FixedNumber width (not byte aligned)\", \"format.width\", width);\n    (0, errors_js_1.assertArgument)(decimals <= 80, \"invalid FixedNumber decimals (too large)\", \"format.decimals\", decimals);\n    const name = (signed ? \"\" : \"u\") + \"fixed\" + String(width) + \"x\" + String(decimals);\n    return { signed, width, decimals, name };\n}\nfunction toString(val, decimals) {\n    let negative = \"\";\n    if (val < BN_0) {\n        negative = \"-\";\n        val *= BN_N1;\n    }\n    let str = val.toString();\n    // No decimal point for whole values\n    if (decimals === 0) {\n        return (negative + str);\n    }\n    // Pad out to the whole component (including a whole digit)\n    while (str.length <= decimals) {\n        str = Zeros + str;\n    }\n    // Insert the decimal point\n    const index = str.length - decimals;\n    str = str.substring(0, index) + \".\" + str.substring(index);\n    // Trim the whole component (leaving at least one 0)\n    while (str[0] === \"0\" && str[1] !== \".\") {\n        str = str.substring(1);\n    }\n    // Trim the decimal component (leaving at least one 0)\n    while (str[str.length - 1] === \"0\" && str[str.length - 2] !== \".\") {\n        str = str.substring(0, str.length - 1);\n    }\n    return (negative + str);\n}\n/**\n *  A FixedNumber represents a value over its [[FixedFormat]]\n *  arithmetic field.\n *\n *  A FixedNumber can be used to perform math, losslessly, on\n *  values which have decmial places.\n *\n *  A FixedNumber has a fixed bit-width to store values in, and stores all\n *  values internally by multiplying the value by 10 raised to the power of\n *  %%decimals%%.\n *\n *  If operations are performed that cause a value to grow too high (close to\n *  positive infinity) or too low (close to negative infinity), the value\n *  is said to //overflow//.\n *\n *  For example, an 8-bit signed value, with 0 decimals may only be within\n *  the range ``-128`` to ``127``; so ``-128 - 1`` will overflow and become\n *  ``127``. Likewise, ``127 + 1`` will overflow and become ``-127``.\n *\n *  Many operation have a normal and //unsafe// variant. The normal variant\n *  will throw a [[NumericFaultError]] on any overflow, while the //unsafe//\n *  variant will silently allow overflow, corrupting its value value.\n *\n *  If operations are performed that cause a value to become too small\n *  (close to zero), the value loses precison and is said to //underflow//.\n *\n *  For example, an value with 1 decimal place may store a number as small\n *  as ``0.1``, but the value of ``0.1 / 2`` is ``0.05``, which cannot fit\n *  into 1 decimal place, so underflow occurs which means precision is lost\n *  and the value becomes ``0``.\n *\n *  Some operations have a normal and //signalling// variant. The normal\n *  variant will silently ignore underflow, while the //signalling// variant\n *  will thow a [[NumericFaultError]] on underflow.\n */\nclass FixedNumber {\n    /**\n     *  The specific fixed-point arithmetic field for this value.\n     */\n    format;\n    #format;\n    // The actual value (accounting for decimals)\n    #val;\n    // A base-10 value to multiple values by to maintain the magnitude\n    #tens;\n    /**\n     *  This is a property so console.log shows a human-meaningful value.\n     *\n     *  @private\n     */\n    _value;\n    // Use this when changing this file to get some typing info,\n    // but then switch to any to mask the internal type\n    //constructor(guard: any, value: bigint, format: _FixedFormat) {\n    /**\n     *  @private\n     */\n    constructor(guard, value, format) {\n        (0, errors_js_1.assertPrivate)(guard, _guard, \"FixedNumber\");\n        this.#val = value;\n        this.#format = format;\n        const _value = toString(value, format.decimals);\n        (0, properties_js_1.defineProperties)(this, { format: format.name, _value });\n        this.#tens = getTens(format.decimals);\n    }\n    /**\n     *  If true, negative values are permitted, otherwise only\n     *  positive values and zero are allowed.\n     */\n    get signed() { return this.#format.signed; }\n    /**\n     *  The number of bits available to store the value.\n     */\n    get width() { return this.#format.width; }\n    /**\n     *  The number of decimal places in the fixed-point arithment field.\n     */\n    get decimals() { return this.#format.decimals; }\n    /**\n     *  The value as an integer, based on the smallest unit the\n     *  [[decimals]] allow.\n     */\n    get value() { return this.#val; }\n    #checkFormat(other) {\n        (0, errors_js_1.assertArgument)(this.format === other.format, \"incompatible format; use fixedNumber.toFormat\", \"other\", other);\n    }\n    #checkValue(val, safeOp) {\n        /*\n                const width = BigInt(this.width);\n                if (this.signed) {\n                    const limit = (BN_1 << (width - BN_1));\n                    assert(safeOp == null || (val >= -limit  && val < limit), \"overflow\", \"NUMERIC_FAULT\", {\n                        operation: <string>safeOp, fault: \"overflow\", value: val\n                    });\n        \n                    if (val > BN_0) {\n                        val = fromTwos(mask(val, width), width);\n                    } else {\n                        val = -fromTwos(mask(-val, width), width);\n                    }\n        \n                } else {\n                    const masked = mask(val, width);\n                    assert(safeOp == null || (val >= 0 && val === masked), \"overflow\", \"NUMERIC_FAULT\", {\n                        operation: <string>safeOp, fault: \"overflow\", value: val\n                    });\n                    val = masked;\n                }\n        */\n        val = checkValue(val, this.#format, safeOp);\n        return new FixedNumber(_guard, val, this.#format);\n    }\n    #add(o, safeOp) {\n        this.#checkFormat(o);\n        return this.#checkValue(this.#val + o.#val, safeOp);\n    }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% added\n     *  to %%other%%, ignoring overflow.\n     */\n    addUnsafe(other) { return this.#add(other); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% added\n     *  to %%other%%. A [[NumericFaultError]] is thrown if overflow\n     *  occurs.\n     */\n    add(other) { return this.#add(other, \"add\"); }\n    #sub(o, safeOp) {\n        this.#checkFormat(o);\n        return this.#checkValue(this.#val - o.#val, safeOp);\n    }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%other%% subtracted\n     *  from %%this%%, ignoring overflow.\n     */\n    subUnsafe(other) { return this.#sub(other); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%other%% subtracted\n     *  from %%this%%. A [[NumericFaultError]] is thrown if overflow\n     *  occurs.\n     */\n    sub(other) { return this.#sub(other, \"sub\"); }\n    #mul(o, safeOp) {\n        this.#checkFormat(o);\n        return this.#checkValue((this.#val * o.#val) / this.#tens, safeOp);\n    }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% multiplied\n     *  by %%other%%, ignoring overflow and underflow (precision loss).\n     */\n    mulUnsafe(other) { return this.#mul(other); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% multiplied\n     *  by %%other%%. A [[NumericFaultError]] is thrown if overflow\n     *  occurs.\n     */\n    mul(other) { return this.#mul(other, \"mul\"); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% multiplied\n     *  by %%other%%. A [[NumericFaultError]] is thrown if overflow\n     *  occurs or if underflow (precision loss) occurs.\n     */\n    mulSignal(other) {\n        this.#checkFormat(other);\n        const value = this.#val * other.#val;\n        (0, errors_js_1.assert)((value % this.#tens) === BN_0, \"precision lost during signalling mul\", \"NUMERIC_FAULT\", {\n            operation: \"mulSignal\", fault: \"underflow\", value: this\n        });\n        return this.#checkValue(value / this.#tens, \"mulSignal\");\n    }\n    #div(o, safeOp) {\n        (0, errors_js_1.assert)(o.#val !== BN_0, \"division by zero\", \"NUMERIC_FAULT\", {\n            operation: \"div\", fault: \"divide-by-zero\", value: this\n        });\n        this.#checkFormat(o);\n        return this.#checkValue((this.#val * this.#tens) / o.#val, safeOp);\n    }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% divided\n     *  by %%other%%, ignoring underflow (precision loss). A\n     *  [[NumericFaultError]] is thrown if overflow occurs.\n     */\n    divUnsafe(other) { return this.#div(other); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% divided\n     *  by %%other%%, ignoring underflow (precision loss). A\n     *  [[NumericFaultError]] is thrown if overflow occurs.\n     */\n    div(other) { return this.#div(other, \"div\"); }\n    /**\n     *  Returns a new [[FixedNumber]] with the result of %%this%% divided\n     *  by %%other%%. A [[NumericFaultError]] is thrown if underflow\n     *  (precision loss) occurs.\n     */\n    divSignal(other) {\n        (0, errors_js_1.assert)(other.#val !== BN_0, \"division by zero\", \"NUMERIC_FAULT\", {\n            operation: \"div\", fault: \"divide-by-zero\", value: this\n        });\n        this.#checkFormat(other);\n        const value = (this.#val * this.#tens);\n        (0, errors_js_1.assert)((value % other.#val) === BN_0, \"precision lost during signalling div\", \"NUMERIC_FAULT\", {\n            operation: \"divSignal\", fault: \"underflow\", value: this\n        });\n        return this.#checkValue(value / other.#val, \"divSignal\");\n    }\n    /**\n     *  Returns a comparison result between %%this%% and %%other%%.\n     *\n     *  This is suitable for use in sorting, where ``-1`` implies %%this%%\n     *  is smaller, ``1`` implies %%this%% is larger and ``0`` implies\n     *  both are equal.\n     */\n    cmp(other) {\n        let a = this.value, b = other.value;\n        // Coerce a and b to the same magnitude\n        const delta = this.decimals - other.decimals;\n        if (delta > 0) {\n            b *= getTens(delta);\n        }\n        else if (delta < 0) {\n            a *= getTens(-delta);\n        }\n        // Comnpare\n        if (a < b) {\n            return -1;\n        }\n        if (a > b) {\n            return 1;\n        }\n        return 0;\n    }\n    /**\n     *  Returns true if %%other%% is equal to %%this%%.\n     */\n    eq(other) { return this.cmp(other) === 0; }\n    /**\n     *  Returns true if %%other%% is less than to %%this%%.\n     */\n    lt(other) { return this.cmp(other) < 0; }\n    /**\n     *  Returns true if %%other%% is less than or equal to %%this%%.\n     */\n    lte(other) { return this.cmp(other) <= 0; }\n    /**\n     *  Returns true if %%other%% is greater than to %%this%%.\n     */\n    gt(other) { return this.cmp(other) > 0; }\n    /**\n     *  Returns true if %%other%% is greater than or equal to %%this%%.\n     */\n    gte(other) { return this.cmp(other) >= 0; }\n    /**\n     *  Returns a new [[FixedNumber]] which is the largest **integer**\n     *  that is less than or equal to %%this%%.\n     *\n     *  The decimal component of the result will always be ``0``.\n     */\n    floor() {\n        let val = this.#val;\n        if (this.#val < BN_0) {\n            val -= this.#tens - BN_1;\n        }\n        val = (this.#val / this.#tens) * this.#tens;\n        return this.#checkValue(val, \"floor\");\n    }\n    /**\n     *  Returns a new [[FixedNumber]] which is the smallest **integer**\n     *  that is greater than or equal to %%this%%.\n     *\n     *  The decimal component of the result will always be ``0``.\n     */\n    ceiling() {\n        let val = this.#val;\n        if (this.#val > BN_0) {\n            val += this.#tens - BN_1;\n        }\n        val = (this.#val / this.#tens) * this.#tens;\n        return this.#checkValue(val, \"ceiling\");\n    }\n    /**\n     *  Returns a new [[FixedNumber]] with the decimal component\n     *  rounded up on ties at %%decimals%% places.\n     */\n    round(decimals) {\n        if (decimals == null) {\n            decimals = 0;\n        }\n        // Not enough precision to not already be rounded\n        if (decimals >= this.decimals) {\n            return this;\n        }\n        const delta = this.decimals - decimals;\n        const bump = BN_5 * getTens(delta - 1);\n        let value = this.value + bump;\n        const tens = getTens(delta);\n        value = (value / tens) * tens;\n        checkValue(value, this.#format, \"round\");\n        return new FixedNumber(_guard, value, this.#format);\n    }\n    /**\n     *  Returns true if %%this%% is equal to ``0``.\n     */\n    isZero() { return (this.#val === BN_0); }\n    /**\n     *  Returns true if %%this%% is less than ``0``.\n     */\n    isNegative() { return (this.#val < BN_0); }\n    /**\n     *  Returns the string representation of %%this%%.\n     */\n    toString() { return this._value; }\n    /**\n     *  Returns a float approximation.\n     *\n     *  Due to IEEE 754 precission (or lack thereof), this function\n     *  can only return an approximation and most values will contain\n     *  rounding errors.\n     */\n    toUnsafeFloat() { return parseFloat(this.toString()); }\n    /**\n     *  Return a new [[FixedNumber]] with the same value but has had\n     *  its field set to %%format%%.\n     *\n     *  This will throw if the value cannot fit into %%format%%.\n     */\n    toFormat(format) {\n        return FixedNumber.fromString(this.toString(), format);\n    }\n    /**\n     *  Creates a new [[FixedNumber]] for %%value%% divided by\n     *  %%decimal%% places with %%format%%.\n     *\n     *  This will throw a [[NumericFaultError]] if %%value%% (once adjusted\n     *  for %%decimals%%) cannot fit in %%format%%, either due to overflow\n     *  or underflow (precision loss).\n     */\n    static fromValue(_value, _decimals, _format) {\n        const decimals = (_decimals == null) ? 0 : (0, maths_js_1.getNumber)(_decimals);\n        const format = getFormat(_format);\n        let value = (0, maths_js_1.getBigInt)(_value, \"value\");\n        const delta = decimals - format.decimals;\n        if (delta > 0) {\n            const tens = getTens(delta);\n            (0, errors_js_1.assert)((value % tens) === BN_0, \"value loses precision for format\", \"NUMERIC_FAULT\", {\n                operation: \"fromValue\", fault: \"underflow\", value: _value\n            });\n            value /= tens;\n        }\n        else if (delta < 0) {\n            value *= getTens(-delta);\n        }\n        checkValue(value, format, \"fromValue\");\n        return new FixedNumber(_guard, value, format);\n    }\n    /**\n     *  Creates a new [[FixedNumber]] for %%value%% with %%format%%.\n     *\n     *  This will throw a [[NumericFaultError]] if %%value%% cannot fit\n     *  in %%format%%, either due to overflow or underflow (precision loss).\n     */\n    static fromString(_value, _format) {\n        const match = _value.match(/^(-?)([0-9]*)\\.?([0-9]*)$/);\n        (0, errors_js_1.assertArgument)(match && (match[2].length + match[3].length) > 0, \"invalid FixedNumber string value\", \"value\", _value);\n        const format = getFormat(_format);\n        let whole = (match[2] || \"0\"), decimal = (match[3] || \"\");\n        // Pad out the decimals\n        while (decimal.length < format.decimals) {\n            decimal += Zeros;\n        }\n        // Check precision is safe\n        (0, errors_js_1.assert)(decimal.substring(format.decimals).match(/^0*$/), \"too many decimals for format\", \"NUMERIC_FAULT\", {\n            operation: \"fromString\", fault: \"underflow\", value: _value\n        });\n        // Remove extra padding\n        decimal = decimal.substring(0, format.decimals);\n        const value = BigInt(match[1] + whole + decimal);\n        checkValue(value, format, \"fromString\");\n        return new FixedNumber(_guard, value, format);\n    }\n    /**\n     *  Creates a new [[FixedNumber]] with the big-endian representation\n     *  %%value%% with %%format%%.\n     *\n     *  This will throw a [[NumericFaultError]] if %%value%% cannot fit\n     *  in %%format%% due to overflow.\n     */\n    static fromBytes(_value, _format) {\n        let value = (0, maths_js_1.toBigInt)((0, data_js_1.getBytes)(_value, \"value\"));\n        const format = getFormat(_format);\n        if (format.signed) {\n            value = (0, maths_js_1.fromTwos)(value, format.width);\n        }\n        checkValue(value, format, \"fromBytes\");\n        return new FixedNumber(_guard, value, format);\n    }\n}\nexports.FixedNumber = FixedNumber;\n//const f1 = FixedNumber.fromString(\"12.56\", \"fixed16x2\");\n//const f2 = FixedNumber.fromString(\"0.3\", \"fixed16x2\");\n//console.log(f1.divSignal(f2));\n//const BUMP = FixedNumber.from(\"0.5\");\n//# sourceMappingURL=fixednumber.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getUrl = exports.createGetUrl = void 0;\nconst errors_js_1 = require(\"./errors.js\");\nfunction createGetUrl(options) {\n    async function getUrl(req, _signal) {\n        (0, errors_js_1.assert)(_signal == null || !_signal.cancelled, \"request cancelled before sending\", \"CANCELLED\");\n        const protocol = req.url.split(\":\")[0].toLowerCase();\n        (0, errors_js_1.assert)(protocol === \"http\" || protocol === \"https\", `unsupported protocol ${protocol}`, \"UNSUPPORTED_OPERATION\", {\n            info: { protocol },\n            operation: \"request\"\n        });\n        (0, errors_js_1.assert)(protocol === \"https\" || !req.credentials || req.allowInsecureAuthentication, \"insecure authorized connections unsupported\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"request\"\n        });\n        let error = null;\n        const controller = new AbortController();\n        const timer = setTimeout(() => {\n            error = (0, errors_js_1.makeError)(\"request timeout\", \"TIMEOUT\");\n            controller.abort();\n        }, req.timeout);\n        if (_signal) {\n            _signal.addListener(() => {\n                error = (0, errors_js_1.makeError)(\"request cancelled\", \"CANCELLED\");\n                controller.abort();\n            });\n        }\n        const init = {\n            method: req.method,\n            headers: new Headers(Array.from(req)),\n            body: req.body || undefined,\n            signal: controller.signal\n        };\n        let resp;\n        try {\n            resp = await fetch(req.url, init);\n        }\n        catch (_error) {\n            clearTimeout(timer);\n            if (error) {\n                throw error;\n            }\n            throw _error;\n        }\n        clearTimeout(timer);\n        const headers = {};\n        resp.headers.forEach((value, key) => {\n            headers[key.toLowerCase()] = value;\n        });\n        const respBody = await resp.arrayBuffer();\n        const body = (respBody == null) ? null : new Uint8Array(respBody);\n        return {\n            statusCode: resp.status,\n            statusMessage: resp.statusText,\n            headers, body\n        };\n    }\n    return getUrl;\n}\nexports.createGetUrl = createGetUrl;\n// @TODO: remove in v7; provided for backwards compat\nconst defaultGetUrl = createGetUrl({});\nasync function getUrl(req, _signal) {\n    return defaultGetUrl(req, _signal);\n}\nexports.getUrl = getUrl;\n//# sourceMappingURL=geturl-browser.js.map","\"use strict\";\n/**\n *  There are many simple utilities required to interact with\n *  Ethereum and to simplify the library, without increasing\n *  the library dependencies for simple functions.\n *\n *  @_section api/utils:Utilities  [about-utils]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toUtf8String = exports.toUtf8CodePoints = exports.toUtf8Bytes = exports.parseUnits = exports.formatUnits = exports.parseEther = exports.formatEther = exports.encodeRlp = exports.decodeRlp = exports.defineProperties = exports.resolveProperties = exports.toQuantity = exports.toBeArray = exports.toBeHex = exports.toNumber = exports.toBigInt = exports.getUint = exports.getNumber = exports.getBigInt = exports.mask = exports.toTwos = exports.fromTwos = exports.FixedNumber = exports.FetchCancelSignal = exports.FetchResponse = exports.FetchRequest = exports.EventPayload = exports.makeError = exports.assertNormalize = exports.assertPrivate = exports.assertArgumentCount = exports.assertArgument = exports.assert = exports.isError = exports.isCallException = exports.zeroPadBytes = exports.zeroPadValue = exports.stripZerosLeft = exports.dataSlice = exports.dataLength = exports.concat = exports.hexlify = exports.isBytesLike = exports.isHexString = exports.getBytesCopy = exports.getBytes = exports.encodeBase64 = exports.decodeBase64 = exports.encodeBase58 = exports.decodeBase58 = void 0;\nexports.uuidV4 = exports.Utf8ErrorFuncs = void 0;\nvar base58_js_1 = require(\"./base58.js\");\nObject.defineProperty(exports, \"decodeBase58\", { enumerable: true, get: function () { return base58_js_1.decodeBase58; } });\nObject.defineProperty(exports, \"encodeBase58\", { enumerable: true, get: function () { return base58_js_1.encodeBase58; } });\nvar base64_js_1 = require(\"./base64.js\");\nObject.defineProperty(exports, \"decodeBase64\", { enumerable: true, get: function () { return base64_js_1.decodeBase64; } });\nObject.defineProperty(exports, \"encodeBase64\", { enumerable: true, get: function () { return base64_js_1.encodeBase64; } });\nvar data_js_1 = require(\"./data.js\");\nObject.defineProperty(exports, \"getBytes\", { enumerable: true, get: function () { return data_js_1.getBytes; } });\nObject.defineProperty(exports, \"getBytesCopy\", { enumerable: true, get: function () { return data_js_1.getBytesCopy; } });\nObject.defineProperty(exports, \"isHexString\", { enumerable: true, get: function () { return data_js_1.isHexString; } });\nObject.defineProperty(exports, \"isBytesLike\", { enumerable: true, get: function () { return data_js_1.isBytesLike; } });\nObject.defineProperty(exports, \"hexlify\", { enumerable: true, get: function () { return data_js_1.hexlify; } });\nObject.defineProperty(exports, \"concat\", { enumerable: true, get: function () { return data_js_1.concat; } });\nObject.defineProperty(exports, \"dataLength\", { enumerable: true, get: function () { return data_js_1.dataLength; } });\nObject.defineProperty(exports, \"dataSlice\", { enumerable: true, get: function () { return data_js_1.dataSlice; } });\nObject.defineProperty(exports, \"stripZerosLeft\", { enumerable: true, get: function () { return data_js_1.stripZerosLeft; } });\nObject.defineProperty(exports, \"zeroPadValue\", { enumerable: true, get: function () { return data_js_1.zeroPadValue; } });\nObject.defineProperty(exports, \"zeroPadBytes\", { enumerable: true, get: function () { return data_js_1.zeroPadBytes; } });\nvar errors_js_1 = require(\"./errors.js\");\nObject.defineProperty(exports, \"isCallException\", { enumerable: true, get: function () { return errors_js_1.isCallException; } });\nObject.defineProperty(exports, \"isError\", { enumerable: true, get: function () { return errors_js_1.isError; } });\nObject.defineProperty(exports, \"assert\", { enumerable: true, get: function () { return errors_js_1.assert; } });\nObject.defineProperty(exports, \"assertArgument\", { enumerable: true, get: function () { return errors_js_1.assertArgument; } });\nObject.defineProperty(exports, \"assertArgumentCount\", { enumerable: true, get: function () { return errors_js_1.assertArgumentCount; } });\nObject.defineProperty(exports, \"assertPrivate\", { enumerable: true, get: function () { return errors_js_1.assertPrivate; } });\nObject.defineProperty(exports, \"assertNormalize\", { enumerable: true, get: function () { return errors_js_1.assertNormalize; } });\nObject.defineProperty(exports, \"makeError\", { enumerable: true, get: function () { return errors_js_1.makeError; } });\nvar events_js_1 = require(\"./events.js\");\nObject.defineProperty(exports, \"EventPayload\", { enumerable: true, get: function () { return events_js_1.EventPayload; } });\nvar fetch_js_1 = require(\"./fetch.js\");\nObject.defineProperty(exports, \"FetchRequest\", { enumerable: true, get: function () { return fetch_js_1.FetchRequest; } });\nObject.defineProperty(exports, \"FetchResponse\", { enumerable: true, get: function () { return fetch_js_1.FetchResponse; } });\nObject.defineProperty(exports, \"FetchCancelSignal\", { enumerable: true, get: function () { return fetch_js_1.FetchCancelSignal; } });\nvar fixednumber_js_1 = require(\"./fixednumber.js\");\nObject.defineProperty(exports, \"FixedNumber\", { enumerable: true, get: function () { return fixednumber_js_1.FixedNumber; } });\nvar maths_js_1 = require(\"./maths.js\");\nObject.defineProperty(exports, \"fromTwos\", { enumerable: true, get: function () { return maths_js_1.fromTwos; } });\nObject.defineProperty(exports, \"toTwos\", { enumerable: true, get: function () { return maths_js_1.toTwos; } });\nObject.defineProperty(exports, \"mask\", { enumerable: true, get: function () { return maths_js_1.mask; } });\nObject.defineProperty(exports, \"getBigInt\", { enumerable: true, get: function () { return maths_js_1.getBigInt; } });\nObject.defineProperty(exports, \"getNumber\", { enumerable: true, get: function () { return maths_js_1.getNumber; } });\nObject.defineProperty(exports, \"getUint\", { enumerable: true, get: function () { return maths_js_1.getUint; } });\nObject.defineProperty(exports, \"toBigInt\", { enumerable: true, get: function () { return maths_js_1.toBigInt; } });\nObject.defineProperty(exports, \"toNumber\", { enumerable: true, get: function () { return maths_js_1.toNumber; } });\nObject.defineProperty(exports, \"toBeHex\", { enumerable: true, get: function () { return maths_js_1.toBeHex; } });\nObject.defineProperty(exports, \"toBeArray\", { enumerable: true, get: function () { return maths_js_1.toBeArray; } });\nObject.defineProperty(exports, \"toQuantity\", { enumerable: true, get: function () { return maths_js_1.toQuantity; } });\nvar properties_js_1 = require(\"./properties.js\");\nObject.defineProperty(exports, \"resolveProperties\", { enumerable: true, get: function () { return properties_js_1.resolveProperties; } });\nObject.defineProperty(exports, \"defineProperties\", { enumerable: true, get: function () { return properties_js_1.defineProperties; } });\nvar rlp_decode_js_1 = require(\"./rlp-decode.js\");\nObject.defineProperty(exports, \"decodeRlp\", { enumerable: true, get: function () { return rlp_decode_js_1.decodeRlp; } });\nvar rlp_encode_js_1 = require(\"./rlp-encode.js\");\nObject.defineProperty(exports, \"encodeRlp\", { enumerable: true, get: function () { return rlp_encode_js_1.encodeRlp; } });\nvar units_js_1 = require(\"./units.js\");\nObject.defineProperty(exports, \"formatEther\", { enumerable: true, get: function () { return units_js_1.formatEther; } });\nObject.defineProperty(exports, \"parseEther\", { enumerable: true, get: function () { return units_js_1.parseEther; } });\nObject.defineProperty(exports, \"formatUnits\", { enumerable: true, get: function () { return units_js_1.formatUnits; } });\nObject.defineProperty(exports, \"parseUnits\", { enumerable: true, get: function () { return units_js_1.parseUnits; } });\nvar utf8_js_1 = require(\"./utf8.js\");\nObject.defineProperty(exports, \"toUtf8Bytes\", { enumerable: true, get: function () { return utf8_js_1.toUtf8Bytes; } });\nObject.defineProperty(exports, \"toUtf8CodePoints\", { enumerable: true, get: function () { return utf8_js_1.toUtf8CodePoints; } });\nObject.defineProperty(exports, \"toUtf8String\", { enumerable: true, get: function () { return utf8_js_1.toUtf8String; } });\nObject.defineProperty(exports, \"Utf8ErrorFuncs\", { enumerable: true, get: function () { return utf8_js_1.Utf8ErrorFuncs; } });\nvar uuid_js_1 = require(\"./uuid.js\");\nObject.defineProperty(exports, \"uuidV4\", { enumerable: true, get: function () { return uuid_js_1.uuidV4; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toQuantity = exports.toBeArray = exports.toBeHex = exports.toNumber = exports.getNumber = exports.toBigInt = exports.getUint = exports.getBigInt = exports.mask = exports.toTwos = exports.fromTwos = void 0;\n/**\n *  Some mathematic operations.\n *\n *  @_subsection: api/utils:Math Helpers  [about-maths]\n */\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\n//const BN_Max256 = (BN_1 << BigInt(256)) - BN_1;\n// IEEE 754 support 53-bits of mantissa\nconst maxValue = 0x1fffffffffffff;\n/**\n *  Convert %%value%% from a twos-compliment representation of %%width%%\n *  bits to its value.\n *\n *  If the highest bit is ``1``, the result will be negative.\n */\nfunction fromTwos(_value, _width) {\n    const value = getUint(_value, \"value\");\n    const width = BigInt(getNumber(_width, \"width\"));\n    (0, errors_js_1.assert)((value >> width) === BN_0, \"overflow\", \"NUMERIC_FAULT\", {\n        operation: \"fromTwos\", fault: \"overflow\", value: _value\n    });\n    // Top bit set; treat as a negative value\n    if (value >> (width - BN_1)) {\n        const mask = (BN_1 << width) - BN_1;\n        return -(((~value) & mask) + BN_1);\n    }\n    return value;\n}\nexports.fromTwos = fromTwos;\n/**\n *  Convert %%value%% to a twos-compliment representation of\n *  %%width%% bits.\n *\n *  The result will always be positive.\n */\nfunction toTwos(_value, _width) {\n    let value = getBigInt(_value, \"value\");\n    const width = BigInt(getNumber(_width, \"width\"));\n    const limit = (BN_1 << (width - BN_1));\n    if (value < BN_0) {\n        value = -value;\n        (0, errors_js_1.assert)(value <= limit, \"too low\", \"NUMERIC_FAULT\", {\n            operation: \"toTwos\", fault: \"overflow\", value: _value\n        });\n        const mask = (BN_1 << width) - BN_1;\n        return ((~value) & mask) + BN_1;\n    }\n    else {\n        (0, errors_js_1.assert)(value < limit, \"too high\", \"NUMERIC_FAULT\", {\n            operation: \"toTwos\", fault: \"overflow\", value: _value\n        });\n    }\n    return value;\n}\nexports.toTwos = toTwos;\n/**\n *  Mask %%value%% with a bitmask of %%bits%% ones.\n */\nfunction mask(_value, _bits) {\n    const value = getUint(_value, \"value\");\n    const bits = BigInt(getNumber(_bits, \"bits\"));\n    return value & ((BN_1 << bits) - BN_1);\n}\nexports.mask = mask;\n/**\n *  Gets a BigInt from %%value%%. If it is an invalid value for\n *  a BigInt, then an ArgumentError will be thrown for %%name%%.\n */\nfunction getBigInt(value, name) {\n    switch (typeof (value)) {\n        case \"bigint\": return value;\n        case \"number\":\n            (0, errors_js_1.assertArgument)(Number.isInteger(value), \"underflow\", name || \"value\", value);\n            (0, errors_js_1.assertArgument)(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return BigInt(value);\n        case \"string\":\n            try {\n                if (value === \"\") {\n                    throw new Error(\"empty string\");\n                }\n                if (value[0] === \"-\" && value[1] !== \"-\") {\n                    return -BigInt(value.substring(1));\n                }\n                return BigInt(value);\n            }\n            catch (e) {\n                (0, errors_js_1.assertArgument)(false, `invalid BigNumberish string: ${e.message}`, name || \"value\", value);\n            }\n    }\n    (0, errors_js_1.assertArgument)(false, \"invalid BigNumberish value\", name || \"value\", value);\n}\nexports.getBigInt = getBigInt;\n/**\n *  Returns %%value%% as a bigint, validating it is valid as a bigint\n *  value and that it is positive.\n */\nfunction getUint(value, name) {\n    const result = getBigInt(value, name);\n    (0, errors_js_1.assert)(result >= BN_0, \"unsigned value cannot be negative\", \"NUMERIC_FAULT\", {\n        fault: \"overflow\", operation: \"getUint\", value\n    });\n    return result;\n}\nexports.getUint = getUint;\nconst Nibbles = \"0123456789abcdef\";\n/*\n * Converts %%value%% to a BigInt. If %%value%% is a Uint8Array, it\n * is treated as Big Endian data.\n */\nfunction toBigInt(value) {\n    if (value instanceof Uint8Array) {\n        let result = \"0x0\";\n        for (const v of value) {\n            result += Nibbles[v >> 4];\n            result += Nibbles[v & 0x0f];\n        }\n        return BigInt(result);\n    }\n    return getBigInt(value);\n}\nexports.toBigInt = toBigInt;\n/**\n *  Gets a //number// from %%value%%. If it is an invalid value for\n *  a //number//, then an ArgumentError will be thrown for %%name%%.\n */\nfunction getNumber(value, name) {\n    switch (typeof (value)) {\n        case \"bigint\":\n            (0, errors_js_1.assertArgument)(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return Number(value);\n        case \"number\":\n            (0, errors_js_1.assertArgument)(Number.isInteger(value), \"underflow\", name || \"value\", value);\n            (0, errors_js_1.assertArgument)(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return value;\n        case \"string\":\n            try {\n                if (value === \"\") {\n                    throw new Error(\"empty string\");\n                }\n                return getNumber(BigInt(value), name);\n            }\n            catch (e) {\n                (0, errors_js_1.assertArgument)(false, `invalid numeric string: ${e.message}`, name || \"value\", value);\n            }\n    }\n    (0, errors_js_1.assertArgument)(false, \"invalid numeric value\", name || \"value\", value);\n}\nexports.getNumber = getNumber;\n/**\n *  Converts %%value%% to a number. If %%value%% is a Uint8Array, it\n *  is treated as Big Endian data. Throws if the value is not safe.\n */\nfunction toNumber(value) {\n    return getNumber(toBigInt(value));\n}\nexports.toNumber = toNumber;\n/**\n *  Converts %%value%% to a Big Endian hexstring, optionally padded to\n *  %%width%% bytes.\n */\nfunction toBeHex(_value, _width) {\n    const value = getUint(_value, \"value\");\n    let result = value.toString(16);\n    if (_width == null) {\n        // Ensure the value is of even length\n        if (result.length % 2) {\n            result = \"0\" + result;\n        }\n    }\n    else {\n        const width = getNumber(_width, \"width\");\n        (0, errors_js_1.assert)(width * 2 >= result.length, `value exceeds width (${width} bytes)`, \"NUMERIC_FAULT\", {\n            operation: \"toBeHex\",\n            fault: \"overflow\",\n            value: _value\n        });\n        // Pad the value to the required width\n        while (result.length < (width * 2)) {\n            result = \"0\" + result;\n        }\n    }\n    return \"0x\" + result;\n}\nexports.toBeHex = toBeHex;\n/**\n *  Converts %%value%% to a Big Endian Uint8Array.\n */\nfunction toBeArray(_value) {\n    const value = getUint(_value, \"value\");\n    if (value === BN_0) {\n        return new Uint8Array([]);\n    }\n    let hex = value.toString(16);\n    if (hex.length % 2) {\n        hex = \"0\" + hex;\n    }\n    const result = new Uint8Array(hex.length / 2);\n    for (let i = 0; i < result.length; i++) {\n        const offset = i * 2;\n        result[i] = parseInt(hex.substring(offset, offset + 2), 16);\n    }\n    return result;\n}\nexports.toBeArray = toBeArray;\n/**\n *  Returns a [[HexString]] for %%value%% safe to use as a //Quantity//.\n *\n *  A //Quantity// does not have and leading 0 values unless the value is\n *  the literal value `0x0`. This is most commonly used for JSSON-RPC\n *  numeric values.\n */\nfunction toQuantity(value) {\n    let result = (0, data_js_1.hexlify)((0, data_js_1.isBytesLike)(value) ? value : toBeArray(value)).substring(2);\n    while (result.startsWith(\"0\")) {\n        result = result.substring(1);\n    }\n    if (result === \"\") {\n        result = \"0\";\n    }\n    return \"0x\" + result;\n}\nexports.toQuantity = toQuantity;\n//# sourceMappingURL=maths.js.map","\"use strict\";\n/**\n *  Property helper functions.\n *\n *  @_subsection api/utils:Properties  [about-properties]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.defineProperties = exports.resolveProperties = void 0;\nfunction checkType(value, type, name) {\n    const types = type.split(\"|\").map(t => t.trim());\n    for (let i = 0; i < types.length; i++) {\n        switch (type) {\n            case \"any\":\n                return;\n            case \"bigint\":\n            case \"boolean\":\n            case \"number\":\n            case \"string\":\n                if (typeof (value) === type) {\n                    return;\n                }\n        }\n    }\n    const error = new Error(`invalid value for type ${type}`);\n    error.code = \"INVALID_ARGUMENT\";\n    error.argument = `value.${name}`;\n    error.value = value;\n    throw error;\n}\n/**\n *  Resolves to a new object that is a copy of %%value%%, but with all\n *  values resolved.\n */\nasync function resolveProperties(value) {\n    const keys = Object.keys(value);\n    const results = await Promise.all(keys.map((k) => Promise.resolve(value[k])));\n    return results.reduce((accum, v, index) => {\n        accum[keys[index]] = v;\n        return accum;\n    }, {});\n}\nexports.resolveProperties = resolveProperties;\n/**\n *  Assigns the %%values%% to %%target%% as read-only values.\n *\n *  It %%types%% is specified, the values are checked.\n */\nfunction defineProperties(target, values, types) {\n    for (let key in values) {\n        let value = values[key];\n        const type = (types ? types[key] : null);\n        if (type) {\n            checkType(value, type, key);\n        }\n        Object.defineProperty(target, key, { enumerable: true, value, writable: false });\n    }\n}\nexports.defineProperties = defineProperties;\n//# sourceMappingURL=properties.js.map","\"use strict\";\n//See: https://github.com/ethereum/wiki/wiki/RLP\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeRlp = void 0;\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nconst data_js_2 = require(\"./data.js\");\nfunction hexlifyByte(value) {\n    let result = value.toString(16);\n    while (result.length < 2) {\n        result = \"0\" + result;\n    }\n    return \"0x\" + result;\n}\nfunction unarrayifyInteger(data, offset, length) {\n    let result = 0;\n    for (let i = 0; i < length; i++) {\n        result = (result * 256) + data[offset + i];\n    }\n    return result;\n}\nfunction _decodeChildren(data, offset, childOffset, length) {\n    const result = [];\n    while (childOffset < offset + 1 + length) {\n        const decoded = _decode(data, childOffset);\n        result.push(decoded.result);\n        childOffset += decoded.consumed;\n        (0, errors_js_1.assert)(childOffset <= offset + 1 + length, \"child data too short\", \"BUFFER_OVERRUN\", {\n            buffer: data, length, offset\n        });\n    }\n    return { consumed: (1 + length), result: result };\n}\n// returns { consumed: number, result: Object }\nfunction _decode(data, offset) {\n    (0, errors_js_1.assert)(data.length !== 0, \"data too short\", \"BUFFER_OVERRUN\", {\n        buffer: data, length: 0, offset: 1\n    });\n    const checkOffset = (offset) => {\n        (0, errors_js_1.assert)(offset <= data.length, \"data short segment too short\", \"BUFFER_OVERRUN\", {\n            buffer: data, length: data.length, offset\n        });\n    };\n    // Array with extra length prefix\n    if (data[offset] >= 0xf8) {\n        const lengthLength = data[offset] - 0xf7;\n        checkOffset(offset + 1 + lengthLength);\n        const length = unarrayifyInteger(data, offset + 1, lengthLength);\n        checkOffset(offset + 1 + lengthLength + length);\n        return _decodeChildren(data, offset, offset + 1 + lengthLength, lengthLength + length);\n    }\n    else if (data[offset] >= 0xc0) {\n        const length = data[offset] - 0xc0;\n        checkOffset(offset + 1 + length);\n        return _decodeChildren(data, offset, offset + 1, length);\n    }\n    else if (data[offset] >= 0xb8) {\n        const lengthLength = data[offset] - 0xb7;\n        checkOffset(offset + 1 + lengthLength);\n        const length = unarrayifyInteger(data, offset + 1, lengthLength);\n        checkOffset(offset + 1 + lengthLength + length);\n        const result = (0, data_js_1.hexlify)(data.slice(offset + 1 + lengthLength, offset + 1 + lengthLength + length));\n        return { consumed: (1 + lengthLength + length), result: result };\n    }\n    else if (data[offset] >= 0x80) {\n        const length = data[offset] - 0x80;\n        checkOffset(offset + 1 + length);\n        const result = (0, data_js_1.hexlify)(data.slice(offset + 1, offset + 1 + length));\n        return { consumed: (1 + length), result: result };\n    }\n    return { consumed: 1, result: hexlifyByte(data[offset]) };\n}\n/**\n *  Decodes %%data%% into the structured data it represents.\n */\nfunction decodeRlp(_data) {\n    const data = (0, data_js_2.getBytes)(_data, \"data\");\n    const decoded = _decode(data, 0);\n    (0, errors_js_1.assertArgument)(decoded.consumed === data.length, \"unexpected junk after rlp payload\", \"data\", _data);\n    return decoded.result;\n}\nexports.decodeRlp = decodeRlp;\n//# sourceMappingURL=rlp-decode.js.map","\"use strict\";\n//See: https://github.com/ethereum/wiki/wiki/RLP\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encodeRlp = void 0;\nconst data_js_1 = require(\"./data.js\");\nfunction arrayifyInteger(value) {\n    const result = [];\n    while (value) {\n        result.unshift(value & 0xff);\n        value >>= 8;\n    }\n    return result;\n}\nfunction _encode(object) {\n    if (Array.isArray(object)) {\n        let payload = [];\n        object.forEach(function (child) {\n            payload = payload.concat(_encode(child));\n        });\n        if (payload.length <= 55) {\n            payload.unshift(0xc0 + payload.length);\n            return payload;\n        }\n        const length = arrayifyInteger(payload.length);\n        length.unshift(0xf7 + length.length);\n        return length.concat(payload);\n    }\n    const data = Array.prototype.slice.call((0, data_js_1.getBytes)(object, \"object\"));\n    if (data.length === 1 && data[0] <= 0x7f) {\n        return data;\n    }\n    else if (data.length <= 55) {\n        data.unshift(0x80 + data.length);\n        return data;\n    }\n    const length = arrayifyInteger(data.length);\n    length.unshift(0xb7 + length.length);\n    return length.concat(data);\n}\nconst nibbles = \"0123456789abcdef\";\n/**\n *  Encodes %%object%% as an RLP-encoded [[DataHexString]].\n */\nfunction encodeRlp(object) {\n    let result = \"0x\";\n    for (const v of _encode(object)) {\n        result += nibbles[v >> 4];\n        result += nibbles[v & 0xf];\n    }\n    return result;\n}\nexports.encodeRlp = encodeRlp;\n//# sourceMappingURL=rlp-encode.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.parseEther = exports.formatEther = exports.parseUnits = exports.formatUnits = void 0;\n/**\n *  Most interactions with Ethereum requires integer values, which use\n *  the smallest magnitude unit.\n *\n *  For example, imagine dealing with dollars and cents. Since dollars\n *  are divisible, non-integer values are possible, such as ``$10.77``.\n *  By using the smallest indivisible unit (i.e. cents), the value can\n *  be kept as the integer ``1077``.\n *\n *  When receiving decimal input from the user (as a decimal string),\n *  the value should be converted to an integer and when showing a user\n *  a value, the integer value should be converted to a decimal string.\n *\n *  This creates a clear distinction, between values to be used by code\n *  (integers) and values used for display logic to users (decimals).\n *\n *  The native unit in Ethereum, //ether// is divisible to 18 decimal places,\n *  where each individual unit is called a //wei//.\n *\n *  @_subsection api/utils:Unit Conversion  [about-units]\n */\nconst errors_js_1 = require(\"./errors.js\");\nconst fixednumber_js_1 = require(\"./fixednumber.js\");\nconst maths_js_1 = require(\"./maths.js\");\nconst names = [\n    \"wei\",\n    \"kwei\",\n    \"mwei\",\n    \"gwei\",\n    \"szabo\",\n    \"finney\",\n    \"ether\",\n];\n/**\n *  Converts %%value%% into a //decimal string//, assuming %%unit%% decimal\n *  places. The %%unit%% may be the number of decimal places or the name of\n *  a unit (e.g. ``\"gwei\"`` for 9 decimal places).\n *\n */\nfunction formatUnits(value, unit) {\n    let decimals = 18;\n    if (typeof (unit) === \"string\") {\n        const index = names.indexOf(unit);\n        (0, errors_js_1.assertArgument)(index >= 0, \"invalid unit\", \"unit\", unit);\n        decimals = 3 * index;\n    }\n    else if (unit != null) {\n        decimals = (0, maths_js_1.getNumber)(unit, \"unit\");\n    }\n    return fixednumber_js_1.FixedNumber.fromValue(value, decimals, { decimals, width: 512 }).toString();\n}\nexports.formatUnits = formatUnits;\n/**\n *  Converts the //decimal string// %%value%% to a BigInt, assuming\n *  %%unit%% decimal places. The %%unit%% may the number of decimal places\n *  or the name of a unit (e.g. ``\"gwei\"`` for 9 decimal places).\n */\nfunction parseUnits(value, unit) {\n    (0, errors_js_1.assertArgument)(typeof (value) === \"string\", \"value must be a string\", \"value\", value);\n    let decimals = 18;\n    if (typeof (unit) === \"string\") {\n        const index = names.indexOf(unit);\n        (0, errors_js_1.assertArgument)(index >= 0, \"invalid unit\", \"unit\", unit);\n        decimals = 3 * index;\n    }\n    else if (unit != null) {\n        decimals = (0, maths_js_1.getNumber)(unit, \"unit\");\n    }\n    return fixednumber_js_1.FixedNumber.fromString(value, { decimals, width: 512 }).value;\n}\nexports.parseUnits = parseUnits;\n/**\n *  Converts %%value%% into a //decimal string// using 18 decimal places.\n */\nfunction formatEther(wei) {\n    return formatUnits(wei, 18);\n}\nexports.formatEther = formatEther;\n/**\n *  Converts the //decimal string// %%ether%% to a BigInt, using 18\n *  decimal places.\n */\nfunction parseEther(ether) {\n    return parseUnits(ether, 18);\n}\nexports.parseEther = parseEther;\n//# sourceMappingURL=units.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.toUtf8CodePoints = exports.toUtf8String = exports.toUtf8Bytes = exports.Utf8ErrorFuncs = void 0;\n/**\n *  Using strings in Ethereum (or any security-basd system) requires\n *  additional care. These utilities attempt to mitigate some of the\n *  safety issues as well as provide the ability to recover and analyse\n *  strings.\n *\n *  @_subsection api/utils:Strings and UTF-8  [about-strings]\n */\nconst data_js_1 = require(\"./data.js\");\nconst errors_js_1 = require(\"./errors.js\");\nfunction errorFunc(reason, offset, bytes, output, badCodepoint) {\n    (0, errors_js_1.assertArgument)(false, `invalid codepoint at offset ${offset}; ${reason}`, \"bytes\", bytes);\n}\nfunction ignoreFunc(reason, offset, bytes, output, badCodepoint) {\n    // If there is an invalid prefix (including stray continuation), skip any additional continuation bytes\n    if (reason === \"BAD_PREFIX\" || reason === \"UNEXPECTED_CONTINUE\") {\n        let i = 0;\n        for (let o = offset + 1; o < bytes.length; o++) {\n            if (bytes[o] >> 6 !== 0x02) {\n                break;\n            }\n            i++;\n        }\n        return i;\n    }\n    // This byte runs us past the end of the string, so just jump to the end\n    // (but the first byte was read already read and therefore skipped)\n    if (reason === \"OVERRUN\") {\n        return bytes.length - offset - 1;\n    }\n    // Nothing to skip\n    return 0;\n}\nfunction replaceFunc(reason, offset, bytes, output, badCodepoint) {\n    // Overlong representations are otherwise \"valid\" code points; just non-deistingtished\n    if (reason === \"OVERLONG\") {\n        (0, errors_js_1.assertArgument)(typeof (badCodepoint) === \"number\", \"invalid bad code point for replacement\", \"badCodepoint\", badCodepoint);\n        output.push(badCodepoint);\n        return 0;\n    }\n    // Put the replacement character into the output\n    output.push(0xfffd);\n    // Otherwise, process as if ignoring errors\n    return ignoreFunc(reason, offset, bytes, output, badCodepoint);\n}\n/**\n *  A handful of popular, built-in UTF-8 error handling strategies.\n *\n *  **``\"error\"``** - throws on ANY illegal UTF-8 sequence or\n *  non-canonical (overlong) codepoints (this is the default)\n *\n *  **``\"ignore\"``** - silently drops any illegal UTF-8 sequence\n *  and accepts non-canonical (overlong) codepoints\n *\n *  **``\"replace\"``** - replace any illegal UTF-8 sequence with the\n *  UTF-8 replacement character (i.e. ``\"\\\\ufffd\"``) and accepts\n *  non-canonical (overlong) codepoints\n *\n *  @returns: Record<\"error\" | \"ignore\" | \"replace\", Utf8ErrorFunc>\n */\nexports.Utf8ErrorFuncs = Object.freeze({\n    error: errorFunc,\n    ignore: ignoreFunc,\n    replace: replaceFunc\n});\n// http://stackoverflow.com/questions/13356493/decode-utf-8-with-javascript#13691499\nfunction getUtf8CodePoints(_bytes, onError) {\n    if (onError == null) {\n        onError = exports.Utf8ErrorFuncs.error;\n    }\n    const bytes = (0, data_js_1.getBytes)(_bytes, \"bytes\");\n    const result = [];\n    let i = 0;\n    // Invalid bytes are ignored\n    while (i < bytes.length) {\n        const c = bytes[i++];\n        // 0xxx xxxx\n        if (c >> 7 === 0) {\n            result.push(c);\n            continue;\n        }\n        // Multibyte; how many bytes left for this character?\n        let extraLength = null;\n        let overlongMask = null;\n        // 110x xxxx 10xx xxxx\n        if ((c & 0xe0) === 0xc0) {\n            extraLength = 1;\n            overlongMask = 0x7f;\n            // 1110 xxxx 10xx xxxx 10xx xxxx\n        }\n        else if ((c & 0xf0) === 0xe0) {\n            extraLength = 2;\n            overlongMask = 0x7ff;\n            // 1111 0xxx 10xx xxxx 10xx xxxx 10xx xxxx\n        }\n        else if ((c & 0xf8) === 0xf0) {\n            extraLength = 3;\n            overlongMask = 0xffff;\n        }\n        else {\n            if ((c & 0xc0) === 0x80) {\n                i += onError(\"UNEXPECTED_CONTINUE\", i - 1, bytes, result);\n            }\n            else {\n                i += onError(\"BAD_PREFIX\", i - 1, bytes, result);\n            }\n            continue;\n        }\n        // Do we have enough bytes in our data?\n        if (i - 1 + extraLength >= bytes.length) {\n            i += onError(\"OVERRUN\", i - 1, bytes, result);\n            continue;\n        }\n        // Remove the length prefix from the char\n        let res = c & ((1 << (8 - extraLength - 1)) - 1);\n        for (let j = 0; j < extraLength; j++) {\n            let nextChar = bytes[i];\n            // Invalid continuation byte\n            if ((nextChar & 0xc0) != 0x80) {\n                i += onError(\"MISSING_CONTINUE\", i, bytes, result);\n                res = null;\n                break;\n            }\n            ;\n            res = (res << 6) | (nextChar & 0x3f);\n            i++;\n        }\n        // See above loop for invalid continuation byte\n        if (res === null) {\n            continue;\n        }\n        // Maximum code point\n        if (res > 0x10ffff) {\n            i += onError(\"OUT_OF_RANGE\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        // Reserved for UTF-16 surrogate halves\n        if (res >= 0xd800 && res <= 0xdfff) {\n            i += onError(\"UTF16_SURROGATE\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        // Check for overlong sequences (more bytes than needed)\n        if (res <= overlongMask) {\n            i += onError(\"OVERLONG\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        result.push(res);\n    }\n    return result;\n}\n// http://stackoverflow.com/questions/18729405/how-to-convert-utf8-string-to-byte-array\n/**\n *  Returns the UTF-8 byte representation of %%str%%.\n *\n *  If %%form%% is specified, the string is normalized.\n */\nfunction toUtf8Bytes(str, form) {\n    (0, errors_js_1.assertArgument)(typeof (str) === \"string\", \"invalid string value\", \"str\", str);\n    if (form != null) {\n        (0, errors_js_1.assertNormalize)(form);\n        str = str.normalize(form);\n    }\n    let result = [];\n    for (let i = 0; i < str.length; i++) {\n        const c = str.charCodeAt(i);\n        if (c < 0x80) {\n            result.push(c);\n        }\n        else if (c < 0x800) {\n            result.push((c >> 6) | 0xc0);\n            result.push((c & 0x3f) | 0x80);\n        }\n        else if ((c & 0xfc00) == 0xd800) {\n            i++;\n            const c2 = str.charCodeAt(i);\n            (0, errors_js_1.assertArgument)(i < str.length && ((c2 & 0xfc00) === 0xdc00), \"invalid surrogate pair\", \"str\", str);\n            // Surrogate Pair\n            const pair = 0x10000 + ((c & 0x03ff) << 10) + (c2 & 0x03ff);\n            result.push((pair >> 18) | 0xf0);\n            result.push(((pair >> 12) & 0x3f) | 0x80);\n            result.push(((pair >> 6) & 0x3f) | 0x80);\n            result.push((pair & 0x3f) | 0x80);\n        }\n        else {\n            result.push((c >> 12) | 0xe0);\n            result.push(((c >> 6) & 0x3f) | 0x80);\n            result.push((c & 0x3f) | 0x80);\n        }\n    }\n    return new Uint8Array(result);\n}\nexports.toUtf8Bytes = toUtf8Bytes;\n;\n//export \nfunction _toUtf8String(codePoints) {\n    return codePoints.map((codePoint) => {\n        if (codePoint <= 0xffff) {\n            return String.fromCharCode(codePoint);\n        }\n        codePoint -= 0x10000;\n        return String.fromCharCode((((codePoint >> 10) & 0x3ff) + 0xd800), ((codePoint & 0x3ff) + 0xdc00));\n    }).join(\"\");\n}\n/**\n *  Returns the string represented by the UTF-8 data %%bytes%%.\n *\n *  When %%onError%% function is specified, it is called on UTF-8\n *  errors allowing recovery using the [[Utf8ErrorFunc]] API.\n *  (default: [error](Utf8ErrorFuncs))\n */\nfunction toUtf8String(bytes, onError) {\n    return _toUtf8String(getUtf8CodePoints(bytes, onError));\n}\nexports.toUtf8String = toUtf8String;\n/**\n *  Returns the UTF-8 code-points for %%str%%.\n *\n *  If %%form%% is specified, the string is normalized.\n */\nfunction toUtf8CodePoints(str, form) {\n    return getUtf8CodePoints(toUtf8Bytes(str, form));\n}\nexports.toUtf8CodePoints = toUtf8CodePoints;\n//# sourceMappingURL=utf8.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.uuidV4 = void 0;\n/**\n *  Explain UUID and link to RFC here.\n *\n *  @_subsection: api/utils:UUID  [about-uuid]\n */\nconst data_js_1 = require(\"./data.js\");\n/**\n *  Returns the version 4 [[link-uuid]] for the %%randomBytes%%.\n *\n *  @see: https://www.ietf.org/rfc/rfc4122.txt (Section 4.4)\n */\nfunction uuidV4(randomBytes) {\n    const bytes = (0, data_js_1.getBytes)(randomBytes, \"randomBytes\");\n    // Section: 4.1.3:\n    // - time_hi_and_version[12:16] = 0b0100\n    bytes[6] = (bytes[6] & 0x0f) | 0x40;\n    // Section 4.4\n    // - clock_seq_hi_and_reserved[6] = 0b0\n    // - clock_seq_hi_and_reserved[7] = 0b1\n    bytes[8] = (bytes[8] & 0x3f) | 0x80;\n    const value = (0, data_js_1.hexlify)(bytes);\n    return [\n        value.substring(2, 10),\n        value.substring(10, 14),\n        value.substring(14, 18),\n        value.substring(18, 22),\n        value.substring(22, 34),\n    ].join(\"-\");\n}\nexports.uuidV4 = uuidV4;\n//# sourceMappingURL=uuid.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.BaseWallet = void 0;\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../hash/index.js\");\nconst index_js_3 = require(\"../providers/index.js\");\nconst index_js_4 = require(\"../transaction/index.js\");\nconst index_js_5 = require(\"../utils/index.js\");\n/**\n *  The **BaseWallet** is a stream-lined implementation of a\n *  [[Signer]] that operates with a private key.\n *\n *  It is preferred to use the [[Wallet]] class, as it offers\n *  additional functionality and simplifies loading a variety\n *  of JSON formats, Mnemonic Phrases, etc.\n *\n *  This class may be of use for those attempting to implement\n *  a minimal Signer.\n */\nclass BaseWallet extends index_js_3.AbstractSigner {\n    /**\n     *  The wallet address.\n     */\n    address;\n    #signingKey;\n    /**\n     *  Creates a new BaseWallet for %%privateKey%%, optionally\n     *  connected to %%provider%%.\n     *\n     *  If %%provider%% is not specified, only offline methods can\n     *  be used.\n     */\n    constructor(privateKey, provider) {\n        super(provider);\n        (0, index_js_5.assertArgument)(privateKey && typeof (privateKey.sign) === \"function\", \"invalid private key\", \"privateKey\", \"[ REDACTED ]\");\n        this.#signingKey = privateKey;\n        const address = (0, index_js_4.computeAddress)(this.signingKey.publicKey);\n        (0, index_js_5.defineProperties)(this, { address });\n    }\n    // Store private values behind getters to reduce visibility\n    // in console.log\n    /**\n     *  The [[SigningKey]] used for signing payloads.\n     */\n    get signingKey() { return this.#signingKey; }\n    /**\n     *  The private key for this wallet.\n     */\n    get privateKey() { return this.signingKey.privateKey; }\n    async getAddress() { return this.address; }\n    connect(provider) {\n        return new BaseWallet(this.#signingKey, provider);\n    }\n    async signTransaction(tx) {\n        // Replace any Addressable or ENS name with an address\n        const { to, from } = await (0, index_js_5.resolveProperties)({\n            to: (tx.to ? (0, index_js_1.resolveAddress)(tx.to, this.provider) : undefined),\n            from: (tx.from ? (0, index_js_1.resolveAddress)(tx.from, this.provider) : undefined)\n        });\n        if (to != null) {\n            tx.to = to;\n        }\n        if (from != null) {\n            tx.from = from;\n        }\n        if (tx.from != null) {\n            (0, index_js_5.assertArgument)((0, index_js_1.getAddress)((tx.from)) === this.address, \"transaction from address mismatch\", \"tx.from\", tx.from);\n            delete tx.from;\n        }\n        // Build the transaction\n        const btx = index_js_4.Transaction.from(tx);\n        btx.signature = this.signingKey.sign(btx.unsignedHash);\n        return btx.serialized;\n    }\n    async signMessage(message) {\n        return this.signMessageSync(message);\n    }\n    // @TODO: Add a secialized signTx and signTyped sync that enforces\n    // all parameters are known?\n    /**\n     *  Returns the signature for %%message%% signed with this wallet.\n     */\n    signMessageSync(message) {\n        return this.signingKey.sign((0, index_js_2.hashMessage)(message)).serialized;\n    }\n    async signTypedData(domain, types, value) {\n        // Populate any ENS names\n        const populated = await index_js_2.TypedDataEncoder.resolveNames(domain, types, value, async (name) => {\n            // @TODO: this should use resolveName; addresses don't\n            //        need a provider\n            (0, index_js_5.assert)(this.provider != null, \"cannot resolve ENS names without a provider\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"resolveName\",\n                info: { name }\n            });\n            const address = await this.provider.resolveName(name);\n            (0, index_js_5.assert)(address != null, \"unconfigured ENS name\", \"UNCONFIGURED_NAME\", {\n                value: name\n            });\n            return address;\n        });\n        return this.signingKey.sign(index_js_2.TypedDataEncoder.hash(populated.domain, types, populated.value)).serialized;\n    }\n}\nexports.BaseWallet = BaseWallet;\n//# sourceMappingURL=base-wallet.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getIndexedAccountPath = exports.getAccountPath = exports.HDNodeVoidWallet = exports.HDNodeWallet = exports.defaultPath = void 0;\n/**\n *  Explain HD Wallets..\n *\n *  @_subsection: api/wallet:HD Wallets  [hd-wallets]\n */\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../providers/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst lang_en_js_1 = require(\"../wordlists/lang-en.js\");\nconst base_wallet_js_1 = require(\"./base-wallet.js\");\nconst mnemonic_js_1 = require(\"./mnemonic.js\");\nconst json_keystore_js_1 = require(\"./json-keystore.js\");\n/**\n *  The default derivation path for Ethereum HD Nodes. (i.e. ``\"m/44'/60'/0'/0/0\"``)\n */\nexports.defaultPath = \"m/44'/60'/0'/0/0\";\n// \"Bitcoin seed\"\nconst MasterSecret = new Uint8Array([66, 105, 116, 99, 111, 105, 110, 32, 115, 101, 101, 100]);\nconst HardenedBit = 0x80000000;\nconst N = BigInt(\"0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141\");\nconst Nibbles = \"0123456789abcdef\";\nfunction zpad(value, length) {\n    let result = \"\";\n    while (value) {\n        result = Nibbles[value % 16] + result;\n        value = Math.trunc(value / 16);\n    }\n    while (result.length < length * 2) {\n        result = \"0\" + result;\n    }\n    return \"0x\" + result;\n}\nfunction encodeBase58Check(_value) {\n    const value = (0, index_js_4.getBytes)(_value);\n    const check = (0, index_js_4.dataSlice)((0, index_js_1.sha256)((0, index_js_1.sha256)(value)), 0, 4);\n    const bytes = (0, index_js_4.concat)([value, check]);\n    return (0, index_js_4.encodeBase58)(bytes);\n}\nconst _guard = {};\nfunction ser_I(index, chainCode, publicKey, privateKey) {\n    const data = new Uint8Array(37);\n    if (index & HardenedBit) {\n        (0, index_js_4.assert)(privateKey != null, \"cannot derive child of neutered node\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"deriveChild\"\n        });\n        // Data = 0x00 || ser_256(k_par)\n        data.set((0, index_js_4.getBytes)(privateKey), 1);\n    }\n    else {\n        // Data = ser_p(point(k_par))\n        data.set((0, index_js_4.getBytes)(publicKey));\n    }\n    // Data += ser_32(i)\n    for (let i = 24; i >= 0; i -= 8) {\n        data[33 + (i >> 3)] = ((index >> (24 - i)) & 0xff);\n    }\n    const I = (0, index_js_4.getBytes)((0, index_js_1.computeHmac)(\"sha512\", chainCode, data));\n    return { IL: I.slice(0, 32), IR: I.slice(32) };\n}\nfunction derivePath(node, path) {\n    const components = path.split(\"/\");\n    (0, index_js_4.assertArgument)(components.length > 0, \"invalid path\", \"path\", path);\n    if (components[0] === \"m\") {\n        (0, index_js_4.assertArgument)(node.depth === 0, `cannot derive root path (i.e. path starting with \"m/\") for a node at non-zero depth ${node.depth}`, \"path\", path);\n        components.shift();\n    }\n    let result = node;\n    for (let i = 0; i < components.length; i++) {\n        const component = components[i];\n        if (component.match(/^[0-9]+'$/)) {\n            const index = parseInt(component.substring(0, component.length - 1));\n            (0, index_js_4.assertArgument)(index < HardenedBit, \"invalid path index\", `path[${i}]`, component);\n            result = result.deriveChild(HardenedBit + index);\n        }\n        else if (component.match(/^[0-9]+$/)) {\n            const index = parseInt(component);\n            (0, index_js_4.assertArgument)(index < HardenedBit, \"invalid path index\", `path[${i}]`, component);\n            result = result.deriveChild(index);\n        }\n        else {\n            (0, index_js_4.assertArgument)(false, \"invalid path component\", `path[${i}]`, component);\n        }\n    }\n    return result;\n}\n/**\n *  An **HDNodeWallet** is a [[Signer]] backed by the private key derived\n *  from an HD Node using the [[link-bip-32]] stantard.\n *\n *  An HD Node forms a hierarchal structure with each HD Node having a\n *  private key and the ability to derive child HD Nodes, defined by\n *  a path indicating the index of each child.\n */\nclass HDNodeWallet extends base_wallet_js_1.BaseWallet {\n    /**\n     *  The compressed public key.\n     */\n    publicKey;\n    /**\n     *  The fingerprint.\n     *\n     *  A fingerprint allows quick qay to detect parent and child nodes,\n     *  but developers should be prepared to deal with collisions as it\n     *  is only 4 bytes.\n     */\n    fingerprint;\n    /**\n     *  The parent fingerprint.\n     */\n    parentFingerprint;\n    /**\n     *  The mnemonic used to create this HD Node, if available.\n     *\n     *  Sources such as extended keys do not encode the mnemonic, in\n     *  which case this will be ``null``.\n     */\n    mnemonic;\n    /**\n     *  The chaincode, which is effectively a public key used\n     *  to derive children.\n     */\n    chainCode;\n    /**\n     *  The derivation path of this wallet.\n     *\n     *  Since extended keys do not provide full path details, this\n     *  may be ``null``, if instantiated from a source that does not\n     *  encode it.\n     */\n    path;\n    /**\n     *  The child index of this wallet. Values over ``2 *\\* 31`` indicate\n     *  the node is hardened.\n     */\n    index;\n    /**\n     *  The depth of this wallet, which is the number of components\n     *  in its path.\n     */\n    depth;\n    /**\n     *  @private\n     */\n    constructor(guard, signingKey, parentFingerprint, chainCode, path, index, depth, mnemonic, provider) {\n        super(signingKey, provider);\n        (0, index_js_4.assertPrivate)(guard, _guard, \"HDNodeWallet\");\n        (0, index_js_4.defineProperties)(this, { publicKey: signingKey.compressedPublicKey });\n        const fingerprint = (0, index_js_4.dataSlice)((0, index_js_1.ripemd160)((0, index_js_1.sha256)(this.publicKey)), 0, 4);\n        (0, index_js_4.defineProperties)(this, {\n            parentFingerprint, fingerprint,\n            chainCode, path, index, depth\n        });\n        (0, index_js_4.defineProperties)(this, { mnemonic });\n    }\n    connect(provider) {\n        return new HDNodeWallet(_guard, this.signingKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, this.mnemonic, provider);\n    }\n    #account() {\n        const account = { address: this.address, privateKey: this.privateKey };\n        const m = this.mnemonic;\n        if (this.path && m && m.wordlist.locale === \"en\" && m.password === \"\") {\n            account.mnemonic = {\n                path: this.path,\n                locale: \"en\",\n                entropy: m.entropy\n            };\n        }\n        return account;\n    }\n    /**\n     *  Resolves to a [JSON Keystore Wallet](json-wallets) encrypted with\n     *  %%password%%.\n     *\n     *  If %%progressCallback%% is specified, it will receive periodic\n     *  updates as the encryption process progreses.\n     */\n    async encrypt(password, progressCallback) {\n        return await (0, json_keystore_js_1.encryptKeystoreJson)(this.#account(), password, { progressCallback });\n    }\n    /**\n     *  Returns a [JSON Keystore Wallet](json-wallets) encryped with\n     *  %%password%%.\n     *\n     *  It is preferred to use the [async version](encrypt) instead,\n     *  which allows a [[ProgressCallback]] to keep the user informed.\n     *\n     *  This method will block the event loop (freezing all UI) until\n     *  it is complete, which may be a non-trivial duration.\n     */\n    encryptSync(password) {\n        return (0, json_keystore_js_1.encryptKeystoreJsonSync)(this.#account(), password);\n    }\n    /**\n     *  The extended key.\n     *\n     *  This key will begin with the prefix ``xpriv`` and can be used to\n     *  reconstruct this HD Node to derive its children.\n     */\n    get extendedKey() {\n        // We only support the mainnet values for now, but if anyone needs\n        // testnet values, let me know. I believe current sentiment is that\n        // we should always use mainnet, and use BIP-44 to derive the network\n        //   - Mainnet: public=0x0488B21E, private=0x0488ADE4\n        //   - Testnet: public=0x043587CF, private=0x04358394\n        (0, index_js_4.assert)(this.depth < 256, \"Depth too deep\", \"UNSUPPORTED_OPERATION\", { operation: \"extendedKey\" });\n        return encodeBase58Check((0, index_js_4.concat)([\n            \"0x0488ADE4\", zpad(this.depth, 1), this.parentFingerprint,\n            zpad(this.index, 4), this.chainCode,\n            (0, index_js_4.concat)([\"0x00\", this.privateKey])\n        ]));\n    }\n    /**\n     *  Returns true if this wallet has a path, providing a Type Guard\n     *  that the path is non-null.\n     */\n    hasPath() { return (this.path != null); }\n    /**\n     *  Returns a neutered HD Node, which removes the private details\n     *  of an HD Node.\n     *\n     *  A neutered node has no private key, but can be used to derive\n     *  child addresses and other public data about the HD Node.\n     */\n    neuter() {\n        return new HDNodeVoidWallet(_guard, this.address, this.publicKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, this.provider);\n    }\n    /**\n     *  Return the child for %%index%%.\n     */\n    deriveChild(_index) {\n        const index = (0, index_js_4.getNumber)(_index, \"index\");\n        (0, index_js_4.assertArgument)(index <= 0xffffffff, \"invalid index\", \"index\", index);\n        // Base path\n        let path = this.path;\n        if (path) {\n            path += \"/\" + (index & ~HardenedBit);\n            if (index & HardenedBit) {\n                path += \"'\";\n            }\n        }\n        const { IR, IL } = ser_I(index, this.chainCode, this.publicKey, this.privateKey);\n        const ki = new index_js_1.SigningKey((0, index_js_4.toBeHex)(((0, index_js_4.toBigInt)(IL) + BigInt(this.privateKey)) % N, 32));\n        return new HDNodeWallet(_guard, ki, this.fingerprint, (0, index_js_4.hexlify)(IR), path, index, this.depth + 1, this.mnemonic, this.provider);\n    }\n    /**\n     *  Return the HDNode for %%path%% from this node.\n     */\n    derivePath(path) {\n        return derivePath(this, path);\n    }\n    static #fromSeed(_seed, mnemonic) {\n        (0, index_js_4.assertArgument)((0, index_js_4.isBytesLike)(_seed), \"invalid seed\", \"seed\", \"[REDACTED]\");\n        const seed = (0, index_js_4.getBytes)(_seed, \"seed\");\n        (0, index_js_4.assertArgument)(seed.length >= 16 && seed.length <= 64, \"invalid seed\", \"seed\", \"[REDACTED]\");\n        const I = (0, index_js_4.getBytes)((0, index_js_1.computeHmac)(\"sha512\", MasterSecret, seed));\n        const signingKey = new index_js_1.SigningKey((0, index_js_4.hexlify)(I.slice(0, 32)));\n        return new HDNodeWallet(_guard, signingKey, \"0x00000000\", (0, index_js_4.hexlify)(I.slice(32)), \"m\", 0, 0, mnemonic, null);\n    }\n    /**\n     *  Creates a new HD Node from %%extendedKey%%.\n     *\n     *  If the %%extendedKey%% will either have a prefix or ``xpub`` or\n     *  ``xpriv``, returning a neutered HD Node ([[HDNodeVoidWallet]])\n     *  or full HD Node ([[HDNodeWallet) respectively.\n     */\n    static fromExtendedKey(extendedKey) {\n        const bytes = (0, index_js_4.toBeArray)((0, index_js_4.decodeBase58)(extendedKey)); // @TODO: redact\n        (0, index_js_4.assertArgument)(bytes.length === 82 || encodeBase58Check(bytes.slice(0, 78)) === extendedKey, \"invalid extended key\", \"extendedKey\", \"[ REDACTED ]\");\n        const depth = bytes[4];\n        const parentFingerprint = (0, index_js_4.hexlify)(bytes.slice(5, 9));\n        const index = parseInt((0, index_js_4.hexlify)(bytes.slice(9, 13)).substring(2), 16);\n        const chainCode = (0, index_js_4.hexlify)(bytes.slice(13, 45));\n        const key = bytes.slice(45, 78);\n        switch ((0, index_js_4.hexlify)(bytes.slice(0, 4))) {\n            // Public Key\n            case \"0x0488b21e\":\n            case \"0x043587cf\": {\n                const publicKey = (0, index_js_4.hexlify)(key);\n                return new HDNodeVoidWallet(_guard, (0, index_js_3.computeAddress)(publicKey), publicKey, parentFingerprint, chainCode, null, index, depth, null);\n            }\n            // Private Key\n            case \"0x0488ade4\":\n            case \"0x04358394 \":\n                if (key[0] !== 0) {\n                    break;\n                }\n                return new HDNodeWallet(_guard, new index_js_1.SigningKey(key.slice(1)), parentFingerprint, chainCode, null, index, depth, null, null);\n        }\n        (0, index_js_4.assertArgument)(false, \"invalid extended key prefix\", \"extendedKey\", \"[ REDACTED ]\");\n    }\n    /**\n     *  Creates a new random HDNode.\n     */\n    static createRandom(password, path, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (path == null) {\n            path = exports.defaultPath;\n        }\n        if (wordlist == null) {\n            wordlist = lang_en_js_1.LangEn.wordlist();\n        }\n        const mnemonic = mnemonic_js_1.Mnemonic.fromEntropy((0, index_js_1.randomBytes)(16), password, wordlist);\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Create an HD Node from %%mnemonic%%.\n     */\n    static fromMnemonic(mnemonic, path) {\n        if (!path) {\n            path = exports.defaultPath;\n        }\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Creates an HD Node from a mnemonic %%phrase%%.\n     */\n    static fromPhrase(phrase, password, path, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (path == null) {\n            path = exports.defaultPath;\n        }\n        if (wordlist == null) {\n            wordlist = lang_en_js_1.LangEn.wordlist();\n        }\n        const mnemonic = mnemonic_js_1.Mnemonic.fromPhrase(phrase, password, wordlist);\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Creates an HD Node from a %%seed%%.\n     */\n    static fromSeed(seed) {\n        return HDNodeWallet.#fromSeed(seed, null);\n    }\n}\nexports.HDNodeWallet = HDNodeWallet;\n/**\n *  A **HDNodeVoidWallet** cannot sign, but provides access to\n *  the children nodes of a [[link-bip-32]] HD wallet addresses.\n *\n *  The can be created by using an extended ``xpub`` key to\n *  [[HDNodeWallet_fromExtendedKey]] or by\n *  [nuetering](HDNodeWallet-neuter) a [[HDNodeWallet]].\n */\nclass HDNodeVoidWallet extends index_js_2.VoidSigner {\n    /**\n     *  The compressed public key.\n     */\n    publicKey;\n    /**\n     *  The fingerprint.\n     *\n     *  A fingerprint allows quick qay to detect parent and child nodes,\n     *  but developers should be prepared to deal with collisions as it\n     *  is only 4 bytes.\n     */\n    fingerprint;\n    /**\n     *  The parent node fingerprint.\n     */\n    parentFingerprint;\n    /**\n     *  The chaincode, which is effectively a public key used\n     *  to derive children.\n     */\n    chainCode;\n    /**\n     *  The derivation path of this wallet.\n     *\n     *  Since extended keys do not provider full path details, this\n     *  may be ``null``, if instantiated from a source that does not\n     *  enocde it.\n     */\n    path;\n    /**\n     *  The child index of this wallet. Values over ``2 *\\* 31`` indicate\n     *  the node is hardened.\n     */\n    index;\n    /**\n     *  The depth of this wallet, which is the number of components\n     *  in its path.\n     */\n    depth;\n    /**\n     *  @private\n     */\n    constructor(guard, address, publicKey, parentFingerprint, chainCode, path, index, depth, provider) {\n        super(address, provider);\n        (0, index_js_4.assertPrivate)(guard, _guard, \"HDNodeVoidWallet\");\n        (0, index_js_4.defineProperties)(this, { publicKey });\n        const fingerprint = (0, index_js_4.dataSlice)((0, index_js_1.ripemd160)((0, index_js_1.sha256)(publicKey)), 0, 4);\n        (0, index_js_4.defineProperties)(this, {\n            publicKey, fingerprint, parentFingerprint, chainCode, path, index, depth\n        });\n    }\n    connect(provider) {\n        return new HDNodeVoidWallet(_guard, this.address, this.publicKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, provider);\n    }\n    /**\n     *  The extended key.\n     *\n     *  This key will begin with the prefix ``xpub`` and can be used to\n     *  reconstruct this neutered key to derive its children addresses.\n     */\n    get extendedKey() {\n        // We only support the mainnet values for now, but if anyone needs\n        // testnet values, let me know. I believe current sentiment is that\n        // we should always use mainnet, and use BIP-44 to derive the network\n        //   - Mainnet: public=0x0488B21E, private=0x0488ADE4\n        //   - Testnet: public=0x043587CF, private=0x04358394\n        (0, index_js_4.assert)(this.depth < 256, \"Depth too deep\", \"UNSUPPORTED_OPERATION\", { operation: \"extendedKey\" });\n        return encodeBase58Check((0, index_js_4.concat)([\n            \"0x0488B21E\",\n            zpad(this.depth, 1),\n            this.parentFingerprint,\n            zpad(this.index, 4),\n            this.chainCode,\n            this.publicKey,\n        ]));\n    }\n    /**\n     *  Returns true if this wallet has a path, providing a Type Guard\n     *  that the path is non-null.\n     */\n    hasPath() { return (this.path != null); }\n    /**\n     *  Return the child for %%index%%.\n     */\n    deriveChild(_index) {\n        const index = (0, index_js_4.getNumber)(_index, \"index\");\n        (0, index_js_4.assertArgument)(index <= 0xffffffff, \"invalid index\", \"index\", index);\n        // Base path\n        let path = this.path;\n        if (path) {\n            path += \"/\" + (index & ~HardenedBit);\n            if (index & HardenedBit) {\n                path += \"'\";\n            }\n        }\n        const { IR, IL } = ser_I(index, this.chainCode, this.publicKey, null);\n        const Ki = index_js_1.SigningKey.addPoints(IL, this.publicKey, true);\n        const address = (0, index_js_3.computeAddress)(Ki);\n        return new HDNodeVoidWallet(_guard, address, Ki, this.fingerprint, (0, index_js_4.hexlify)(IR), path, index, this.depth + 1, this.provider);\n    }\n    /**\n     *  Return the signer for %%path%% from this node.\n     */\n    derivePath(path) {\n        return derivePath(this, path);\n    }\n}\nexports.HDNodeVoidWallet = HDNodeVoidWallet;\n/*\nexport class HDNodeWalletManager {\n    #root: HDNodeWallet;\n\n    constructor(phrase: string, password?: null | string, path?: null | string, locale?: null | Wordlist) {\n        if (password == null) { password = \"\"; }\n        if (path == null) { path = \"m/44'/60'/0'/0\"; }\n        if (locale == null) { locale = LangEn.wordlist(); }\n        this.#root = HDNodeWallet.fromPhrase(phrase, password, path, locale);\n    }\n\n    getSigner(index?: number): HDNodeWallet {\n        return this.#root.deriveChild((index == null) ? 0: index);\n    }\n}\n*/\n/**\n *  Returns the [[link-bip-32]] path for the account at %%index%%.\n *\n *  This is the pattern used by wallets like Ledger.\n *\n *  There is also an [alternate pattern](getIndexedAccountPath) used by\n *  some software.\n */\nfunction getAccountPath(_index) {\n    const index = (0, index_js_4.getNumber)(_index, \"index\");\n    (0, index_js_4.assertArgument)(index >= 0 && index < HardenedBit, \"invalid account index\", \"index\", index);\n    return `m/44'/60'/${index}'/0/0`;\n}\nexports.getAccountPath = getAccountPath;\n/**\n *  Returns the path using an alternative pattern for deriving accounts,\n *  at %%index%%.\n *\n *  This derivation path uses the //index// component rather than the\n *  //account// component to derive sequential accounts.\n *\n *  This is the pattern used by wallets like MetaMask.\n */\nfunction getIndexedAccountPath(_index) {\n    const index = (0, index_js_4.getNumber)(_index, \"index\");\n    (0, index_js_4.assertArgument)(index >= 0 && index < HardenedBit, \"invalid account index\", \"index\", index);\n    return `m/44'/60'/0'/0/${index}`;\n}\nexports.getIndexedAccountPath = getIndexedAccountPath;\n//# sourceMappingURL=hdwallet.js.map","\"use strict\";\n/**\n *  When interacting with Ethereum, it is necessary to use a private\n *  key authenticate actions by signing a payload.\n *\n *  Wallets are the simplest way to expose the concept of an\n *  //Externally Owner Account// (EOA) as it wraps a private key\n *  and supports high-level methods to sign common types of interaction\n *  and send transactions.\n *\n *  The class most developers will want to use is [[Wallet]], which\n *  can load a private key directly or from any common wallet format.\n *\n *  The [[HDNodeWallet]] can be used when it is necessary to access\n *  low-level details of how an HD wallets are derived, exported\n *  or imported.\n *\n *  @_section: api/wallet:Wallets  [about-wallets]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Wallet = exports.Mnemonic = exports.encryptKeystoreJsonSync = exports.encryptKeystoreJson = exports.decryptKeystoreJson = exports.decryptKeystoreJsonSync = exports.isKeystoreJson = exports.decryptCrowdsaleJson = exports.isCrowdsaleJson = exports.HDNodeVoidWallet = exports.HDNodeWallet = exports.getIndexedAccountPath = exports.getAccountPath = exports.defaultPath = exports.BaseWallet = void 0;\nvar base_wallet_js_1 = require(\"./base-wallet.js\");\nObject.defineProperty(exports, \"BaseWallet\", { enumerable: true, get: function () { return base_wallet_js_1.BaseWallet; } });\nvar hdwallet_js_1 = require(\"./hdwallet.js\");\nObject.defineProperty(exports, \"defaultPath\", { enumerable: true, get: function () { return hdwallet_js_1.defaultPath; } });\nObject.defineProperty(exports, \"getAccountPath\", { enumerable: true, get: function () { return hdwallet_js_1.getAccountPath; } });\nObject.defineProperty(exports, \"getIndexedAccountPath\", { enumerable: true, get: function () { return hdwallet_js_1.getIndexedAccountPath; } });\nObject.defineProperty(exports, \"HDNodeWallet\", { enumerable: true, get: function () { return hdwallet_js_1.HDNodeWallet; } });\nObject.defineProperty(exports, \"HDNodeVoidWallet\", { enumerable: true, get: function () { return hdwallet_js_1.HDNodeVoidWallet; } });\nvar json_crowdsale_js_1 = require(\"./json-crowdsale.js\");\nObject.defineProperty(exports, \"isCrowdsaleJson\", { enumerable: true, get: function () { return json_crowdsale_js_1.isCrowdsaleJson; } });\nObject.defineProperty(exports, \"decryptCrowdsaleJson\", { enumerable: true, get: function () { return json_crowdsale_js_1.decryptCrowdsaleJson; } });\nvar json_keystore_js_1 = require(\"./json-keystore.js\");\nObject.defineProperty(exports, \"isKeystoreJson\", { enumerable: true, get: function () { return json_keystore_js_1.isKeystoreJson; } });\nObject.defineProperty(exports, \"decryptKeystoreJsonSync\", { enumerable: true, get: function () { return json_keystore_js_1.decryptKeystoreJsonSync; } });\nObject.defineProperty(exports, \"decryptKeystoreJson\", { enumerable: true, get: function () { return json_keystore_js_1.decryptKeystoreJson; } });\nObject.defineProperty(exports, \"encryptKeystoreJson\", { enumerable: true, get: function () { return json_keystore_js_1.encryptKeystoreJson; } });\nObject.defineProperty(exports, \"encryptKeystoreJsonSync\", { enumerable: true, get: function () { return json_keystore_js_1.encryptKeystoreJsonSync; } });\nvar mnemonic_js_1 = require(\"./mnemonic.js\");\nObject.defineProperty(exports, \"Mnemonic\", { enumerable: true, get: function () { return mnemonic_js_1.Mnemonic; } });\nvar wallet_js_1 = require(\"./wallet.js\");\nObject.defineProperty(exports, \"Wallet\", { enumerable: true, get: function () { return wallet_js_1.Wallet; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\n/**\n *  @_subsection: api/wallet:JSON Wallets  [json-wallets]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decryptCrowdsaleJson = exports.isCrowdsaleJson = void 0;\nconst aes_js_1 = require(\"aes-js\");\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../hash/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst utils_js_1 = require(\"./utils.js\");\n/**\n *  Returns true if %%json%% is a valid JSON Crowdsale wallet.\n */\nfunction isCrowdsaleJson(json) {\n    try {\n        const data = JSON.parse(json);\n        if (data.encseed) {\n            return true;\n        }\n    }\n    catch (error) { }\n    return false;\n}\nexports.isCrowdsaleJson = isCrowdsaleJson;\n// See: https://github.com/ethereum/pyethsaletool\n/**\n *  Before Ethereum launched, it was necessary to create a wallet\n *  format for backers to use, which would be used to receive ether\n *  as a reward for contributing to the project.\n *\n *  The [[link-crowdsale]] format is now obsolete, but it is still\n *  useful to support and the additional code is fairly trivial as\n *  all the primitives required are used through core portions of\n *  the library.\n */\nfunction decryptCrowdsaleJson(json, _password) {\n    const data = JSON.parse(json);\n    const password = (0, utils_js_1.getPassword)(_password);\n    // Ethereum Address\n    const address = (0, index_js_1.getAddress)((0, utils_js_1.spelunk)(data, \"ethaddr:string!\"));\n    // Encrypted Seed\n    const encseed = (0, utils_js_1.looseArrayify)((0, utils_js_1.spelunk)(data, \"encseed:string!\"));\n    (0, index_js_4.assertArgument)(encseed && (encseed.length % 16) === 0, \"invalid encseed\", \"json\", json);\n    const key = (0, index_js_4.getBytes)((0, index_js_2.pbkdf2)(password, password, 2000, 32, \"sha256\")).slice(0, 16);\n    const iv = encseed.slice(0, 16);\n    const encryptedSeed = encseed.slice(16);\n    // Decrypt the seed\n    const aesCbc = new aes_js_1.CBC(key, iv);\n    const seed = (0, aes_js_1.pkcs7Strip)((0, index_js_4.getBytes)(aesCbc.decrypt(encryptedSeed)));\n    // This wallet format is weird... Convert the binary encoded hex to a string.\n    let seedHex = \"\";\n    for (let i = 0; i < seed.length; i++) {\n        seedHex += String.fromCharCode(seed[i]);\n    }\n    return { address, privateKey: (0, index_js_3.id)(seedHex) };\n}\nexports.decryptCrowdsaleJson = decryptCrowdsaleJson;\n//# sourceMappingURL=json-crowdsale.js.map","\"use strict\";\n/**\n *  The JSON Wallet formats allow a simple way to store the private\n *  keys needed in Ethereum along with related information and allows\n *  for extensible forms of encryption.\n *\n *  These utilities facilitate decrypting and encrypting the most common\n *  JSON Wallet formats.\n *\n *  @_subsection: api/wallet:JSON Wallets  [json-wallets]\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.encryptKeystoreJson = exports.encryptKeystoreJsonSync = exports.decryptKeystoreJson = exports.decryptKeystoreJsonSync = exports.isKeystoreJson = void 0;\nconst aes_js_1 = require(\"aes-js\");\nconst index_js_1 = require(\"../address/index.js\");\nconst index_js_2 = require(\"../crypto/index.js\");\nconst index_js_3 = require(\"../transaction/index.js\");\nconst index_js_4 = require(\"../utils/index.js\");\nconst utils_js_1 = require(\"./utils.js\");\nconst _version_js_1 = require(\"../_version.js\");\nconst defaultPath = \"m/44'/60'/0'/0/0\";\n/**\n *  Returns true if %%json%% is a valid JSON Keystore Wallet.\n */\nfunction isKeystoreJson(json) {\n    try {\n        const data = JSON.parse(json);\n        const version = ((data.version != null) ? parseInt(data.version) : 0);\n        if (version === 3) {\n            return true;\n        }\n    }\n    catch (error) { }\n    return false;\n}\nexports.isKeystoreJson = isKeystoreJson;\nfunction decrypt(data, key, ciphertext) {\n    const cipher = (0, utils_js_1.spelunk)(data, \"crypto.cipher:string\");\n    if (cipher === \"aes-128-ctr\") {\n        const iv = (0, utils_js_1.spelunk)(data, \"crypto.cipherparams.iv:data!\");\n        const aesCtr = new aes_js_1.CTR(key, iv);\n        return (0, index_js_4.hexlify)(aesCtr.decrypt(ciphertext));\n    }\n    (0, index_js_4.assert)(false, \"unsupported cipher\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"decrypt\"\n    });\n}\nfunction getAccount(data, _key) {\n    const key = (0, index_js_4.getBytes)(_key);\n    const ciphertext = (0, utils_js_1.spelunk)(data, \"crypto.ciphertext:data!\");\n    const computedMAC = (0, index_js_4.hexlify)((0, index_js_2.keccak256)((0, index_js_4.concat)([key.slice(16, 32), ciphertext]))).substring(2);\n    (0, index_js_4.assertArgument)(computedMAC === (0, utils_js_1.spelunk)(data, \"crypto.mac:string!\").toLowerCase(), \"incorrect password\", \"password\", \"[ REDACTED ]\");\n    const privateKey = decrypt(data, key.slice(0, 16), ciphertext);\n    const address = (0, index_js_3.computeAddress)(privateKey);\n    if (data.address) {\n        let check = data.address.toLowerCase();\n        if (!check.startsWith(\"0x\")) {\n            check = \"0x\" + check;\n        }\n        (0, index_js_4.assertArgument)((0, index_js_1.getAddress)(check) === address, \"keystore address/privateKey mismatch\", \"address\", data.address);\n    }\n    const account = { address, privateKey };\n    // Version 0.1 x-ethers metadata must contain an encrypted mnemonic phrase\n    const version = (0, utils_js_1.spelunk)(data, \"x-ethers.version:string\");\n    if (version === \"0.1\") {\n        const mnemonicKey = key.slice(32, 64);\n        const mnemonicCiphertext = (0, utils_js_1.spelunk)(data, \"x-ethers.mnemonicCiphertext:data!\");\n        const mnemonicIv = (0, utils_js_1.spelunk)(data, \"x-ethers.mnemonicCounter:data!\");\n        const mnemonicAesCtr = new aes_js_1.CTR(mnemonicKey, mnemonicIv);\n        account.mnemonic = {\n            path: ((0, utils_js_1.spelunk)(data, \"x-ethers.path:string\") || defaultPath),\n            locale: ((0, utils_js_1.spelunk)(data, \"x-ethers.locale:string\") || \"en\"),\n            entropy: (0, index_js_4.hexlify)((0, index_js_4.getBytes)(mnemonicAesCtr.decrypt(mnemonicCiphertext)))\n        };\n    }\n    return account;\n}\nfunction getDecryptKdfParams(data) {\n    const kdf = (0, utils_js_1.spelunk)(data, \"crypto.kdf:string\");\n    if (kdf && typeof (kdf) === \"string\") {\n        if (kdf.toLowerCase() === \"scrypt\") {\n            const salt = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.salt:data!\");\n            const N = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.n:int!\");\n            const r = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.r:int!\");\n            const p = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.p:int!\");\n            // Make sure N is a power of 2\n            (0, index_js_4.assertArgument)(N > 0 && (N & (N - 1)) === 0, \"invalid kdf.N\", \"kdf.N\", N);\n            (0, index_js_4.assertArgument)(r > 0 && p > 0, \"invalid kdf\", \"kdf\", kdf);\n            const dkLen = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.dklen:int!\");\n            (0, index_js_4.assertArgument)(dkLen === 32, \"invalid kdf.dklen\", \"kdf.dflen\", dkLen);\n            return { name: \"scrypt\", salt, N, r, p, dkLen: 64 };\n        }\n        else if (kdf.toLowerCase() === \"pbkdf2\") {\n            const salt = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.salt:data!\");\n            const prf = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.prf:string!\");\n            const algorithm = prf.split(\"-\").pop();\n            (0, index_js_4.assertArgument)(algorithm === \"sha256\" || algorithm === \"sha512\", \"invalid kdf.pdf\", \"kdf.pdf\", prf);\n            const count = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.c:int!\");\n            const dkLen = (0, utils_js_1.spelunk)(data, \"crypto.kdfparams.dklen:int!\");\n            (0, index_js_4.assertArgument)(dkLen === 32, \"invalid kdf.dklen\", \"kdf.dklen\", dkLen);\n            return { name: \"pbkdf2\", salt, count, dkLen, algorithm };\n        }\n    }\n    (0, index_js_4.assertArgument)(false, \"unsupported key-derivation function\", \"kdf\", kdf);\n}\n/**\n *  Returns the account details for the JSON Keystore Wallet %%json%%\n *  using %%password%%.\n *\n *  It is preferred to use the [async version](decryptKeystoreJson)\n *  instead, which allows a [[ProgressCallback]] to keep the user informed\n *  as to the decryption status.\n *\n *  This method will block the event loop (freezing all UI) until decryption\n *  is complete, which can take quite some time, depending on the wallet\n *  paramters and platform.\n */\nfunction decryptKeystoreJsonSync(json, _password) {\n    const data = JSON.parse(json);\n    const password = (0, utils_js_1.getPassword)(_password);\n    const params = getDecryptKdfParams(data);\n    if (params.name === \"pbkdf2\") {\n        const { salt, count, dkLen, algorithm } = params;\n        const key = (0, index_js_2.pbkdf2)(password, salt, count, dkLen, algorithm);\n        return getAccount(data, key);\n    }\n    (0, index_js_4.assert)(params.name === \"scrypt\", \"cannot be reached\", \"UNKNOWN_ERROR\", { params });\n    const { salt, N, r, p, dkLen } = params;\n    const key = (0, index_js_2.scryptSync)(password, salt, N, r, p, dkLen);\n    return getAccount(data, key);\n}\nexports.decryptKeystoreJsonSync = decryptKeystoreJsonSync;\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(() => { resolve(); }, duration); });\n}\n/**\n *  Resolves to the decrypted JSON Keystore Wallet %%json%% using the\n *  %%password%%.\n *\n *  If provided, %%progress%% will be called periodically during the\n *  decrpytion to provide feedback, and if the function returns\n *  ``false`` will halt decryption.\n *\n *  The %%progressCallback%% will **always** receive ``0`` before\n *  decryption begins and ``1`` when complete.\n */\nasync function decryptKeystoreJson(json, _password, progress) {\n    const data = JSON.parse(json);\n    const password = (0, utils_js_1.getPassword)(_password);\n    const params = getDecryptKdfParams(data);\n    if (params.name === \"pbkdf2\") {\n        if (progress) {\n            progress(0);\n            await stall(0);\n        }\n        const { salt, count, dkLen, algorithm } = params;\n        const key = (0, index_js_2.pbkdf2)(password, salt, count, dkLen, algorithm);\n        if (progress) {\n            progress(1);\n            await stall(0);\n        }\n        return getAccount(data, key);\n    }\n    (0, index_js_4.assert)(params.name === \"scrypt\", \"cannot be reached\", \"UNKNOWN_ERROR\", { params });\n    const { salt, N, r, p, dkLen } = params;\n    const key = await (0, index_js_2.scrypt)(password, salt, N, r, p, dkLen, progress);\n    return getAccount(data, key);\n}\nexports.decryptKeystoreJson = decryptKeystoreJson;\nfunction getEncryptKdfParams(options) {\n    // Check/generate the salt\n    const salt = (options.salt != null) ? (0, index_js_4.getBytes)(options.salt, \"options.salt\") : (0, index_js_2.randomBytes)(32);\n    // Override the scrypt password-based key derivation function parameters\n    let N = (1 << 17), r = 8, p = 1;\n    if (options.scrypt) {\n        if (options.scrypt.N) {\n            N = options.scrypt.N;\n        }\n        if (options.scrypt.r) {\n            r = options.scrypt.r;\n        }\n        if (options.scrypt.p) {\n            p = options.scrypt.p;\n        }\n    }\n    (0, index_js_4.assertArgument)(typeof (N) === \"number\" && N > 0 && Number.isSafeInteger(N) && (BigInt(N) & BigInt(N - 1)) === BigInt(0), \"invalid scrypt N parameter\", \"options.N\", N);\n    (0, index_js_4.assertArgument)(typeof (r) === \"number\" && r > 0 && Number.isSafeInteger(r), \"invalid scrypt r parameter\", \"options.r\", r);\n    (0, index_js_4.assertArgument)(typeof (p) === \"number\" && p > 0 && Number.isSafeInteger(p), \"invalid scrypt p parameter\", \"options.p\", p);\n    return { name: \"scrypt\", dkLen: 32, salt, N, r, p };\n}\nfunction _encryptKeystore(key, kdf, account, options) {\n    const privateKey = (0, index_js_4.getBytes)(account.privateKey, \"privateKey\");\n    // Override initialization vector\n    const iv = (options.iv != null) ? (0, index_js_4.getBytes)(options.iv, \"options.iv\") : (0, index_js_2.randomBytes)(16);\n    (0, index_js_4.assertArgument)(iv.length === 16, \"invalid options.iv length\", \"options.iv\", options.iv);\n    // Override the uuid\n    const uuidRandom = (options.uuid != null) ? (0, index_js_4.getBytes)(options.uuid, \"options.uuid\") : (0, index_js_2.randomBytes)(16);\n    (0, index_js_4.assertArgument)(uuidRandom.length === 16, \"invalid options.uuid length\", \"options.uuid\", options.iv);\n    // This will be used to encrypt the wallet (as per Web3 secret storage)\n    // - 32 bytes   As normal for the Web3 secret storage (derivedKey, macPrefix)\n    // - 32 bytes   AES key to encrypt mnemonic with (required here to be Ethers Wallet)\n    const derivedKey = key.slice(0, 16);\n    const macPrefix = key.slice(16, 32);\n    // Encrypt the private key\n    const aesCtr = new aes_js_1.CTR(derivedKey, iv);\n    const ciphertext = (0, index_js_4.getBytes)(aesCtr.encrypt(privateKey));\n    // Compute the message authentication code, used to check the password\n    const mac = (0, index_js_2.keccak256)((0, index_js_4.concat)([macPrefix, ciphertext]));\n    // See: https://github.com/ethereum/wiki/wiki/Web3-Secret-Storage-Definition\n    const data = {\n        address: account.address.substring(2).toLowerCase(),\n        id: (0, index_js_4.uuidV4)(uuidRandom),\n        version: 3,\n        Crypto: {\n            cipher: \"aes-128-ctr\",\n            cipherparams: {\n                iv: (0, index_js_4.hexlify)(iv).substring(2),\n            },\n            ciphertext: (0, index_js_4.hexlify)(ciphertext).substring(2),\n            kdf: \"scrypt\",\n            kdfparams: {\n                salt: (0, index_js_4.hexlify)(kdf.salt).substring(2),\n                n: kdf.N,\n                dklen: 32,\n                p: kdf.p,\n                r: kdf.r\n            },\n            mac: mac.substring(2)\n        }\n    };\n    // If we have a mnemonic, encrypt it into the JSON wallet\n    if (account.mnemonic) {\n        const client = (options.client != null) ? options.client : `ethers/${_version_js_1.version}`;\n        const path = account.mnemonic.path || defaultPath;\n        const locale = account.mnemonic.locale || \"en\";\n        const mnemonicKey = key.slice(32, 64);\n        const entropy = (0, index_js_4.getBytes)(account.mnemonic.entropy, \"account.mnemonic.entropy\");\n        const mnemonicIv = (0, index_js_2.randomBytes)(16);\n        const mnemonicAesCtr = new aes_js_1.CTR(mnemonicKey, mnemonicIv);\n        const mnemonicCiphertext = (0, index_js_4.getBytes)(mnemonicAesCtr.encrypt(entropy));\n        const now = new Date();\n        const timestamp = (now.getUTCFullYear() + \"-\" +\n            (0, utils_js_1.zpad)(now.getUTCMonth() + 1, 2) + \"-\" +\n            (0, utils_js_1.zpad)(now.getUTCDate(), 2) + \"T\" +\n            (0, utils_js_1.zpad)(now.getUTCHours(), 2) + \"-\" +\n            (0, utils_js_1.zpad)(now.getUTCMinutes(), 2) + \"-\" +\n            (0, utils_js_1.zpad)(now.getUTCSeconds(), 2) + \".0Z\");\n        const gethFilename = (\"UTC--\" + timestamp + \"--\" + data.address);\n        data[\"x-ethers\"] = {\n            client, gethFilename, path, locale,\n            mnemonicCounter: (0, index_js_4.hexlify)(mnemonicIv).substring(2),\n            mnemonicCiphertext: (0, index_js_4.hexlify)(mnemonicCiphertext).substring(2),\n            version: \"0.1\"\n        };\n    }\n    return JSON.stringify(data);\n}\n/**\n *  Return the JSON Keystore Wallet for %%account%% encrypted with\n *  %%password%%.\n *\n *  The %%options%% can be used to tune the password-based key\n *  derivation function parameters, explicitly set the random values\n *  used. Any provided [[ProgressCallback]] is ignord.\n */\nfunction encryptKeystoreJsonSync(account, password, options) {\n    if (options == null) {\n        options = {};\n    }\n    const passwordBytes = (0, utils_js_1.getPassword)(password);\n    const kdf = getEncryptKdfParams(options);\n    const key = (0, index_js_2.scryptSync)(passwordBytes, kdf.salt, kdf.N, kdf.r, kdf.p, 64);\n    return _encryptKeystore((0, index_js_4.getBytes)(key), kdf, account, options);\n}\nexports.encryptKeystoreJsonSync = encryptKeystoreJsonSync;\n/**\n *  Resolved to the JSON Keystore Wallet for %%account%% encrypted\n *  with %%password%%.\n *\n *  The %%options%% can be used to tune the password-based key\n *  derivation function parameters, explicitly set the random values\n *  used and provide a [[ProgressCallback]] to receive periodic updates\n *  on the completion status..\n */\nasync function encryptKeystoreJson(account, password, options) {\n    if (options == null) {\n        options = {};\n    }\n    const passwordBytes = (0, utils_js_1.getPassword)(password);\n    const kdf = getEncryptKdfParams(options);\n    const key = await (0, index_js_2.scrypt)(passwordBytes, kdf.salt, kdf.N, kdf.r, kdf.p, 64, options.progressCallback);\n    return _encryptKeystore((0, index_js_4.getBytes)(key), kdf, account, options);\n}\nexports.encryptKeystoreJson = encryptKeystoreJson;\n//# sourceMappingURL=json-keystore.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Mnemonic = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst lang_en_js_1 = require(\"../wordlists/lang-en.js\");\n// Returns a byte with the MSB bits set\nfunction getUpperMask(bits) {\n    return ((1 << bits) - 1) << (8 - bits) & 0xff;\n}\n// Returns a byte with the LSB bits set\nfunction getLowerMask(bits) {\n    return ((1 << bits) - 1) & 0xff;\n}\nfunction mnemonicToEntropy(mnemonic, wordlist) {\n    (0, index_js_2.assertNormalize)(\"NFKD\");\n    if (wordlist == null) {\n        wordlist = lang_en_js_1.LangEn.wordlist();\n    }\n    const words = wordlist.split(mnemonic);\n    (0, index_js_2.assertArgument)((words.length % 3) === 0 && words.length >= 12 && words.length <= 24, \"invalid mnemonic length\", \"mnemonic\", \"[ REDACTED ]\");\n    const entropy = new Uint8Array(Math.ceil(11 * words.length / 8));\n    let offset = 0;\n    for (let i = 0; i < words.length; i++) {\n        let index = wordlist.getWordIndex(words[i].normalize(\"NFKD\"));\n        (0, index_js_2.assertArgument)(index >= 0, `invalid mnemonic word at index ${i}`, \"mnemonic\", \"[ REDACTED ]\");\n        for (let bit = 0; bit < 11; bit++) {\n            if (index & (1 << (10 - bit))) {\n                entropy[offset >> 3] |= (1 << (7 - (offset % 8)));\n            }\n            offset++;\n        }\n    }\n    const entropyBits = 32 * words.length / 3;\n    const checksumBits = words.length / 3;\n    const checksumMask = getUpperMask(checksumBits);\n    const checksum = (0, index_js_2.getBytes)((0, index_js_1.sha256)(entropy.slice(0, entropyBits / 8)))[0] & checksumMask;\n    (0, index_js_2.assertArgument)(checksum === (entropy[entropy.length - 1] & checksumMask), \"invalid mnemonic checksum\", \"mnemonic\", \"[ REDACTED ]\");\n    return (0, index_js_2.hexlify)(entropy.slice(0, entropyBits / 8));\n}\nfunction entropyToMnemonic(entropy, wordlist) {\n    (0, index_js_2.assertArgument)((entropy.length % 4) === 0 && entropy.length >= 16 && entropy.length <= 32, \"invalid entropy size\", \"entropy\", \"[ REDACTED ]\");\n    if (wordlist == null) {\n        wordlist = lang_en_js_1.LangEn.wordlist();\n    }\n    const indices = [0];\n    let remainingBits = 11;\n    for (let i = 0; i < entropy.length; i++) {\n        // Consume the whole byte (with still more to go)\n        if (remainingBits > 8) {\n            indices[indices.length - 1] <<= 8;\n            indices[indices.length - 1] |= entropy[i];\n            remainingBits -= 8;\n            // This byte will complete an 11-bit index\n        }\n        else {\n            indices[indices.length - 1] <<= remainingBits;\n            indices[indices.length - 1] |= entropy[i] >> (8 - remainingBits);\n            // Start the next word\n            indices.push(entropy[i] & getLowerMask(8 - remainingBits));\n            remainingBits += 3;\n        }\n    }\n    // Compute the checksum bits\n    const checksumBits = entropy.length / 4;\n    const checksum = parseInt((0, index_js_1.sha256)(entropy).substring(2, 4), 16) & getUpperMask(checksumBits);\n    // Shift the checksum into the word indices\n    indices[indices.length - 1] <<= checksumBits;\n    indices[indices.length - 1] |= (checksum >> (8 - checksumBits));\n    return wordlist.join(indices.map((index) => wordlist.getWord(index)));\n}\nconst _guard = {};\n/**\n *  A **Mnemonic** wraps all properties required to compute [[link-bip-39]]\n *  seeds and convert between phrases and entropy.\n */\nclass Mnemonic {\n    /**\n     *  The mnemonic phrase of 12, 15, 18, 21 or 24 words.\n     *\n     *  Use the [[wordlist]] ``split`` method to get the individual words.\n     */\n    phrase;\n    /**\n     *  The password used for this mnemonic. If no password is used this\n     *  is the empty string (i.e. ``\"\"``) as per the specification.\n     */\n    password;\n    /**\n     *  The wordlist for this mnemonic.\n     */\n    wordlist;\n    /**\n     *  The underlying entropy which the mnemonic encodes.\n     */\n    entropy;\n    /**\n     *  @private\n     */\n    constructor(guard, entropy, phrase, password, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (wordlist == null) {\n            wordlist = lang_en_js_1.LangEn.wordlist();\n        }\n        (0, index_js_2.assertPrivate)(guard, _guard, \"Mnemonic\");\n        (0, index_js_2.defineProperties)(this, { phrase, password, wordlist, entropy });\n    }\n    /**\n     *  Returns the seed for the mnemonic.\n     */\n    computeSeed() {\n        const salt = (0, index_js_2.toUtf8Bytes)(\"mnemonic\" + this.password, \"NFKD\");\n        return (0, index_js_1.pbkdf2)((0, index_js_2.toUtf8Bytes)(this.phrase, \"NFKD\"), salt, 2048, 64, \"sha512\");\n    }\n    /**\n     *  Creates a new Mnemonic for the %%phrase%%.\n     *\n     *  The default %%password%% is the empty string and the default\n     *  wordlist is the [English wordlists](LangEn).\n     */\n    static fromPhrase(phrase, password, wordlist) {\n        // Normalize the case and space; throws if invalid\n        const entropy = mnemonicToEntropy(phrase, wordlist);\n        phrase = entropyToMnemonic((0, index_js_2.getBytes)(entropy), wordlist);\n        return new Mnemonic(_guard, entropy, phrase, password, wordlist);\n    }\n    /**\n     *  Create a new **Mnemonic** from the %%entropy%%.\n     *\n     *  The default %%password%% is the empty string and the default\n     *  wordlist is the [English wordlists](LangEn).\n     */\n    static fromEntropy(_entropy, password, wordlist) {\n        const entropy = (0, index_js_2.getBytes)(_entropy, \"entropy\");\n        const phrase = entropyToMnemonic(entropy, wordlist);\n        return new Mnemonic(_guard, (0, index_js_2.hexlify)(entropy), phrase, password, wordlist);\n    }\n    /**\n     *  Returns the phrase for %%mnemonic%%.\n     */\n    static entropyToPhrase(_entropy, wordlist) {\n        const entropy = (0, index_js_2.getBytes)(_entropy, \"entropy\");\n        return entropyToMnemonic(entropy, wordlist);\n    }\n    /**\n     *  Returns the entropy for %%phrase%%.\n     */\n    static phraseToEntropy(phrase, wordlist) {\n        return mnemonicToEntropy(phrase, wordlist);\n    }\n    /**\n     *  Returns true if %%phrase%% is a valid [[link-bip-39]] phrase.\n     *\n     *  This checks all the provided words belong to the %%wordlist%%,\n     *  that the length is valid and the checksum is correct.\n     */\n    static isValidMnemonic(phrase, wordlist) {\n        try {\n            mnemonicToEntropy(phrase, wordlist);\n            return true;\n        }\n        catch (error) { }\n        return false;\n    }\n}\nexports.Mnemonic = Mnemonic;\n//# sourceMappingURL=mnemonic.js.map","\"use strict\";\n/**\n *  @_ignore\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.spelunk = exports.getPassword = exports.zpad = exports.looseArrayify = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nfunction looseArrayify(hexString) {\n    if (typeof (hexString) === \"string\" && !hexString.startsWith(\"0x\")) {\n        hexString = \"0x\" + hexString;\n    }\n    return (0, index_js_1.getBytesCopy)(hexString);\n}\nexports.looseArrayify = looseArrayify;\nfunction zpad(value, length) {\n    value = String(value);\n    while (value.length < length) {\n        value = '0' + value;\n    }\n    return value;\n}\nexports.zpad = zpad;\nfunction getPassword(password) {\n    if (typeof (password) === 'string') {\n        return (0, index_js_1.toUtf8Bytes)(password, \"NFKC\");\n    }\n    return (0, index_js_1.getBytesCopy)(password);\n}\nexports.getPassword = getPassword;\nfunction spelunk(object, _path) {\n    const match = _path.match(/^([a-z0-9$_.-]*)(:([a-z]+))?(!)?$/i);\n    (0, index_js_1.assertArgument)(match != null, \"invalid path\", \"path\", _path);\n    const path = match[1];\n    const type = match[3];\n    const reqd = (match[4] === \"!\");\n    let cur = object;\n    for (const comp of path.toLowerCase().split('.')) {\n        // Search for a child object with a case-insensitive matching key\n        if (Array.isArray(cur)) {\n            if (!comp.match(/^[0-9]+$/)) {\n                break;\n            }\n            cur = cur[parseInt(comp)];\n        }\n        else if (typeof (cur) === \"object\") {\n            let found = null;\n            for (const key in cur) {\n                if (key.toLowerCase() === comp) {\n                    found = cur[key];\n                    break;\n                }\n            }\n            cur = found;\n        }\n        else {\n            cur = null;\n        }\n        if (cur == null) {\n            break;\n        }\n    }\n    (0, index_js_1.assertArgument)(!reqd || cur != null, \"missing required value\", \"path\", path);\n    if (type && cur != null) {\n        if (type === \"int\") {\n            if (typeof (cur) === \"string\" && cur.match(/^-?[0-9]+$/)) {\n                return parseInt(cur);\n            }\n            else if (Number.isSafeInteger(cur)) {\n                return cur;\n            }\n        }\n        if (type === \"number\") {\n            if (typeof (cur) === \"string\" && cur.match(/^-?[0-9.]*$/)) {\n                return parseFloat(cur);\n            }\n        }\n        if (type === \"data\") {\n            if (typeof (cur) === \"string\") {\n                return looseArrayify(cur);\n            }\n        }\n        if (type === \"array\" && Array.isArray(cur)) {\n            return cur;\n        }\n        if (type === typeof (cur)) {\n            return cur;\n        }\n        (0, index_js_1.assertArgument)(false, `wrong type found for ${type} `, \"path\", path);\n    }\n    return cur;\n}\nexports.spelunk = spelunk;\n/*\nexport function follow(object: any, path: string): null | string {\n    let currentChild = object;\n\n    for (const comp of path.toLowerCase().split('/')) {\n\n        // Search for a child object with a case-insensitive matching key\n        let matchingChild = null;\n        for (const key in currentChild) {\n             if (key.toLowerCase() === comp) {\n                 matchingChild = currentChild[key];\n                 break;\n             }\n        }\n\n        if (matchingChild === null) { return null; }\n\n        currentChild = matchingChild;\n    }\n\n    return currentChild;\n}\n\n// \"path/to/something:type!\"\nexport function followRequired(data: any, path: string): string {\n    const value = follow(data, path);\n    if (value != null) { return value; }\n    return logger.throwArgumentError(\"invalid value\", `data:${ path }`,\n    JSON.stringify(data));\n}\n*/\n// See: https://www.ietf.org/rfc/rfc4122.txt (Section 4.4)\n/*\nexport function uuidV4(randomBytes: BytesLike): string {\n    const bytes = getBytes(randomBytes, \"randomBytes\");\n\n    // Section: 4.1.3:\n    // - time_hi_and_version[12:16] = 0b0100\n    bytes[6] = (bytes[6] & 0x0f) | 0x40;\n\n    // Section 4.4\n    // - clock_seq_hi_and_reserved[6] = 0b0\n    // - clock_seq_hi_and_reserved[7] = 0b1\n    bytes[8] = (bytes[8] & 0x3f) | 0x80;\n\n    const value = hexlify(bytes);\n\n    return [\n       value.substring(2, 10),\n       value.substring(10, 14),\n       value.substring(14, 18),\n       value.substring(18, 22),\n       value.substring(22, 34),\n    ].join(\"-\");\n}\n*/\n//# sourceMappingURL=utils.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Wallet = void 0;\nconst index_js_1 = require(\"../crypto/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst base_wallet_js_1 = require(\"./base-wallet.js\");\nconst hdwallet_js_1 = require(\"./hdwallet.js\");\nconst json_crowdsale_js_1 = require(\"./json-crowdsale.js\");\nconst json_keystore_js_1 = require(\"./json-keystore.js\");\nconst mnemonic_js_1 = require(\"./mnemonic.js\");\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(() => { resolve(); }, duration); });\n}\n/**\n *  A **Wallet** manages a single private key which is used to sign\n *  transactions, messages and other common payloads.\n *\n *  This class is generally the main entry point for developers\n *  that wish to use a private key directly, as it can create\n *  instances from a large variety of common sources, including\n *  raw private key, [[link-bip-39]] mnemonics and encrypte JSON\n *  wallets.\n */\nclass Wallet extends base_wallet_js_1.BaseWallet {\n    /**\n     *  Create a new wallet for the private %%key%%, optionally connected\n     *  to %%provider%%.\n     */\n    constructor(key, provider) {\n        if (typeof (key) === \"string\" && !key.startsWith(\"0x\")) {\n            key = \"0x\" + key;\n        }\n        let signingKey = (typeof (key) === \"string\") ? new index_js_1.SigningKey(key) : key;\n        super(signingKey, provider);\n    }\n    connect(provider) {\n        return new Wallet(this.signingKey, provider);\n    }\n    /**\n     *  Resolves to a [JSON Keystore Wallet](json-wallets) encrypted with\n     *  %%password%%.\n     *\n     *  If %%progressCallback%% is specified, it will receive periodic\n     *  updates as the encryption process progreses.\n     */\n    async encrypt(password, progressCallback) {\n        const account = { address: this.address, privateKey: this.privateKey };\n        return await (0, json_keystore_js_1.encryptKeystoreJson)(account, password, { progressCallback });\n    }\n    /**\n     *  Returns a [JSON Keystore Wallet](json-wallets) encryped with\n     *  %%password%%.\n     *\n     *  It is preferred to use the [async version](encrypt) instead,\n     *  which allows a [[ProgressCallback]] to keep the user informed.\n     *\n     *  This method will block the event loop (freezing all UI) until\n     *  it is complete, which may be a non-trivial duration.\n     */\n    encryptSync(password) {\n        const account = { address: this.address, privateKey: this.privateKey };\n        return (0, json_keystore_js_1.encryptKeystoreJsonSync)(account, password);\n    }\n    static #fromAccount(account) {\n        (0, index_js_2.assertArgument)(account, \"invalid JSON wallet\", \"json\", \"[ REDACTED ]\");\n        if (\"mnemonic\" in account && account.mnemonic && account.mnemonic.locale === \"en\") {\n            const mnemonic = mnemonic_js_1.Mnemonic.fromEntropy(account.mnemonic.entropy);\n            const wallet = hdwallet_js_1.HDNodeWallet.fromMnemonic(mnemonic, account.mnemonic.path);\n            if (wallet.address === account.address && wallet.privateKey === account.privateKey) {\n                return wallet;\n            }\n            console.log(\"WARNING: JSON mismatch address/privateKey != mnemonic; fallback onto private key\");\n        }\n        const wallet = new Wallet(account.privateKey);\n        (0, index_js_2.assertArgument)(wallet.address === account.address, \"address/privateKey mismatch\", \"json\", \"[ REDACTED ]\");\n        return wallet;\n    }\n    /**\n     *  Creates (asynchronously) a **Wallet** by decrypting the %%json%%\n     *  with %%password%%.\n     *\n     *  If %%progress%% is provided, it is called periodically during\n     *  decryption so that any UI can be updated.\n     */\n    static async fromEncryptedJson(json, password, progress) {\n        let account = null;\n        if ((0, json_keystore_js_1.isKeystoreJson)(json)) {\n            account = await (0, json_keystore_js_1.decryptKeystoreJson)(json, password, progress);\n        }\n        else if ((0, json_crowdsale_js_1.isCrowdsaleJson)(json)) {\n            if (progress) {\n                progress(0);\n                await stall(0);\n            }\n            account = (0, json_crowdsale_js_1.decryptCrowdsaleJson)(json, password);\n            if (progress) {\n                progress(1);\n                await stall(0);\n            }\n        }\n        return Wallet.#fromAccount(account);\n    }\n    /**\n     *  Creates a **Wallet** by decrypting the %%json%% with %%password%%.\n     *\n     *  The [[fromEncryptedJson]] method is preferred, as this method\n     *  will lock up and freeze the UI during decryption, which may take\n     *  some time.\n     */\n    static fromEncryptedJsonSync(json, password) {\n        let account = null;\n        if ((0, json_keystore_js_1.isKeystoreJson)(json)) {\n            account = (0, json_keystore_js_1.decryptKeystoreJsonSync)(json, password);\n        }\n        else if ((0, json_crowdsale_js_1.isCrowdsaleJson)(json)) {\n            account = (0, json_crowdsale_js_1.decryptCrowdsaleJson)(json, password);\n        }\n        else {\n            (0, index_js_2.assertArgument)(false, \"invalid JSON wallet\", \"json\", \"[ REDACTED ]\");\n        }\n        return Wallet.#fromAccount(account);\n    }\n    /**\n     *  Creates a new random [[HDNodeWallet]] using the available\n     *  [cryptographic random source](randomBytes).\n     *\n     *  If there is no crytographic random source, this will throw.\n     */\n    static createRandom(provider) {\n        const wallet = hdwallet_js_1.HDNodeWallet.createRandom();\n        if (provider) {\n            return wallet.connect(provider);\n        }\n        return wallet;\n    }\n    /**\n     *  Creates a [[HDNodeWallet]] for %%phrase%%.\n     */\n    static fromPhrase(phrase, provider) {\n        const wallet = hdwallet_js_1.HDNodeWallet.fromPhrase(phrase);\n        if (provider) {\n            return wallet.connect(provider);\n        }\n        return wallet;\n    }\n}\nexports.Wallet = Wallet;\n//# sourceMappingURL=wallet.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeBits = void 0;\nconst Base64 = \")!@#$%^&*(ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_\";\n/**\n *  @_ignore\n */\nfunction decodeBits(width, data) {\n    const maxValue = (1 << width) - 1;\n    const result = [];\n    let accum = 0, bits = 0, flood = 0;\n    for (let i = 0; i < data.length; i++) {\n        // Accumulate 6 bits of data\n        accum = ((accum << 6) | Base64.indexOf(data[i]));\n        bits += 6;\n        // While we have enough for a word...\n        while (bits >= width) {\n            // ...read the word\n            const value = (accum >> (bits - width));\n            accum &= (1 << (bits - width)) - 1;\n            bits -= width;\n            // A value of 0 indicates we exceeded maxValue, it\n            // floods over into the next value\n            if (value === 0) {\n                flood += maxValue;\n            }\n            else {\n                result.push(value + flood);\n                flood = 0;\n            }\n        }\n    }\n    return result;\n}\nexports.decodeBits = decodeBits;\n//# sourceMappingURL=bit-reader.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeOwl = exports.decode = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst subsChrs = \" !#$%&'()*+,-./<=>?@[]^_`{|}~\";\nconst Word = /^[a-z]*$/i;\nfunction unfold(words, sep) {\n    let initial = 97;\n    return words.reduce((accum, word) => {\n        if (word === sep) {\n            initial++;\n        }\n        else if (word.match(Word)) {\n            accum.push(String.fromCharCode(initial) + word);\n        }\n        else {\n            initial = 97;\n            accum.push(word);\n        }\n        return accum;\n    }, []);\n}\n/**\n *  @_ignore\n */\nfunction decode(data, subs) {\n    // Replace all the substitutions with their expanded form\n    for (let i = subsChrs.length - 1; i >= 0; i--) {\n        data = data.split(subsChrs[i]).join(subs.substring(2 * i, 2 * i + 2));\n    }\n    // Get all tle clumps; each suffix, first-increment and second-increment\n    const clumps = [];\n    const leftover = data.replace(/(:|([0-9])|([A-Z][a-z]*))/g, (all, item, semi, word) => {\n        if (semi) {\n            for (let i = parseInt(semi); i >= 0; i--) {\n                clumps.push(\";\");\n            }\n        }\n        else {\n            clumps.push(item.toLowerCase());\n        }\n        return \"\";\n    });\n    /* c8 ignore start */\n    if (leftover) {\n        throw new Error(`leftovers: ${JSON.stringify(leftover)}`);\n    }\n    /* c8 ignore stop */\n    return unfold(unfold(clumps, \";\"), \":\");\n}\nexports.decode = decode;\n/**\n *  @_ignore\n */\nfunction decodeOwl(data) {\n    (0, index_js_1.assertArgument)(data[0] === \"0\", \"unsupported auwl data\", \"data\", data);\n    return decode(data.substring(1 + 2 * subsChrs.length), data.substring(1, 1 + 2 * subsChrs.length));\n}\nexports.decodeOwl = decodeOwl;\n//# sourceMappingURL=decode-owl.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeOwlA = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\nconst bit_reader_js_1 = require(\"./bit-reader.js\");\nconst decode_owl_js_1 = require(\"./decode-owl.js\");\n/**\n *  @_ignore\n */\nfunction decodeOwlA(data, accents) {\n    let words = (0, decode_owl_js_1.decodeOwl)(data).join(\",\");\n    // Inject the accents\n    accents.split(/,/g).forEach((accent) => {\n        const match = accent.match(/^([a-z]*)([0-9]+)([0-9])(.*)$/);\n        (0, index_js_1.assertArgument)(match !== null, \"internal error parsing accents\", \"accents\", accents);\n        let posOffset = 0;\n        const positions = (0, bit_reader_js_1.decodeBits)(parseInt(match[3]), match[4]);\n        const charCode = parseInt(match[2]);\n        const regex = new RegExp(`([${match[1]}])`, \"g\");\n        words = words.replace(regex, (all, letter) => {\n            const rem = --positions[posOffset];\n            if (rem === 0) {\n                letter = String.fromCharCode(letter.charCodeAt(0), charCode);\n                posOffset++;\n            }\n            return letter;\n        });\n    });\n    return words.split(\",\");\n}\nexports.decodeOwlA = decodeOwlA;\n//# sourceMappingURL=decode-owla.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.wordlists = exports.WordlistOwlA = exports.WordlistOwl = exports.LangEn = exports.Wordlist = void 0;\n/**\n *  A Wordlist is a set of 2048 words used to encode private keys\n *  (or other binary data) that is easier for humans to write down,\n *  transcribe and dictate.\n *\n *  The [[link-bip-39]] standard includes several checksum bits,\n *  depending on the size of the mnemonic phrase.\n *\n *  A mnemonic phrase may be 12, 15, 18, 21 or 24 words long. For\n *  most purposes 12 word mnemonics should be used, as including\n *  additional words increases the difficulty and potential for\n *  mistakes and does not offer any effective improvement on security.\n *\n *  There are a variety of [[link-bip39-wordlists]] for different\n *  languages, but for maximal compatibility, the\n *  [English Wordlist](LangEn) is recommended.\n *\n *  @_section: api/wordlists:Wordlists [about-wordlists]\n */\nvar wordlist_js_1 = require(\"./wordlist.js\");\nObject.defineProperty(exports, \"Wordlist\", { enumerable: true, get: function () { return wordlist_js_1.Wordlist; } });\nvar lang_en_js_1 = require(\"./lang-en.js\");\nObject.defineProperty(exports, \"LangEn\", { enumerable: true, get: function () { return lang_en_js_1.LangEn; } });\nvar wordlist_owl_js_1 = require(\"./wordlist-owl.js\");\nObject.defineProperty(exports, \"WordlistOwl\", { enumerable: true, get: function () { return wordlist_owl_js_1.WordlistOwl; } });\nvar wordlist_owla_js_1 = require(\"./wordlist-owla.js\");\nObject.defineProperty(exports, \"WordlistOwlA\", { enumerable: true, get: function () { return wordlist_owla_js_1.WordlistOwlA; } });\nvar wordlists_js_1 = require(\"./wordlists.js\");\nObject.defineProperty(exports, \"wordlists\", { enumerable: true, get: function () { return wordlists_js_1.wordlists; } });\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LangEn = void 0;\nconst wordlist_owl_js_1 = require(\"./wordlist-owl.js\");\nconst words = \"0erleonalorenseinceregesticitStanvetearctssi#ch2Athck&tneLl0And#Il.yLeOutO=S|S%b/ra@SurdU'0Ce[Cid|CountCu'Hie=IdOu,-Qui*Ro[TT]T%T*[Tu$0AptDD-tD*[Ju,M.UltV<)Vi)0Rob-0FairF%dRaid0A(EEntRee0Ead0MRRp%tS!_rmBumCoholErtI&LLeyLowMo,O}PhaReadySoT Ways0A>urAz(gOngOuntU'd0Aly,Ch%Ci|G G!GryIm$K!Noun)Nu$O` Sw T&naTiqueXietyY1ArtOlogyPe?P!Pro=Ril1ChCt-EaEnaGueMMedM%MyOundR<+Re,Ri=RowTTefa@Ti,Tw%k0KPe@SaultSetSi,SumeThma0H!>OmTa{T&dT.udeTra@0Ct]D.Gu,NtTh%ToTumn0Era+OcadoOid0AkeA*AyEsomeFulKw?d0Is:ByChel%C#D+GL<)Lc#y~MbooN<aNn RRelyRga(R*lSeS-SketTt!3A^AnAutyCau'ComeEfF%eG(Ha=H(dLie=LowLtN^Nef./TrayTt Twe&Y#d3Cyc!DKeNdOlogyRdR`Tt _{AdeAmeAnketA,EakE[IndOodO[omOu'UeUrUsh_rdAtDyIlMbNeNusOkO,Rd R(gRrowSsTtomUn)XY_{etA(AndA[A=EadEezeI{Id+IefIghtIngIskOccoliOk&OnzeOomO` OwnUsh2Bb!DdyD+tFf$oIldLbLkL!tNd!Nk Rd&Rg R,SS(e[SyTt Y Zz:Bba+B(B!CtusGeKe~LmM aMpNN$N)lNdyNn#NoeNvasNy#Pab!P.$Pta(RRb#RdRgoRpetRryRtSeShS(o/!Su$TT$ogT^Teg%yTt!UghtU'Ut]Ve3Il(gL yM|NsusNturyRe$Rta(_irAlkAmp]An+AosApt Ar+A'AtEapE{Ee'EfErryE,I{&IefIldIm}yOi)Oo'R#-U{!UnkUrn0G?Nnam#Rc!Tiz&TyVil_imApArifyAwAyE<ErkEv I{I|IffImbIn-IpO{OgO'O`OudOwnUbUmpU, Ut^_^A,C#utDeFfeeIlInL!@L%LumnMb(eMeMf%tM-Mm#Mp<yNc tNdu@NfirmNg*[N}@Nsid NtrolNv()OkOlPp PyR$ReRnR*@/Tt#U^UntryUp!Ur'Us(V Yo>_{Ad!AftAmA}AshAt AwlAzyEamEd.EekEwI{etImeIspIt-OpO[Ou^OwdUci$UelUi'Umb!Un^UshYY,$2BeLtu*PPbo?dRiousRr|Rta(R=Sh]/omTe3C!:DMa+MpN)Ng R(gShUght WnY3AlBa>BrisCadeCemb CideCl(eC%a>C*a'ErF&'F(eFyG*eLayLiv M<dMi'Ni$Nti,NyP?tP&dPos.P`PutyRi=ScribeS tSignSkSpair/royTailTe@VelopVi)Vo>3AgramAlAm#dAryCeE'lEtFf G.$Gn.yLemmaNn NosaurRe@RtSag*eScov Sea'ShSmi[S%d Splay/<)V tVideV%)Zzy5Ct%Cum|G~Lph(Ma(Na>NkeyN%OrSeUb!Ve_ftAg#AmaA,-AwEamE[IftIllInkIpI=OpUmY2CkMbNeR(g/T^Ty1Arf1Nam-:G G!RlyRnR`Sily/Sy1HoOlogyOnomy0GeItUca>1F%t0G1GhtTh 2BowD E@r-Eg<tEm|Eph<tEvat%I>Se0B?kBodyBra)Er+Ot]PloyPow Pty0Ab!A@DD![D%'EmyErgyF%)Ga+G(eH<)JoyLi,OughR-hRollSu*T Ti*TryVelope1Isode0U$Uip0AA'OdeOs]R%Upt0CapeSayS&)Ta>0Ern$H-s1Id&)IlOkeOl=1A@Amp!Ce[Ch<+C.eCludeCu'Ecu>Erci'Hau,Hib.I!I,ItOt-P<dPe@Pi*Pla(Po'P*[T&dTra0EEbrow:Br-CeCultyDeIntI`~L'MeMilyMousNNcyNtasyRmSh]TT$Th TigueUltV%.e3Atu*Bru?yD $EEdElMa!N)/iv$T^V W3B Ct]EldGu*LeLmLt N$NdNeNg NishReRmR,Sc$ShTT}[X_gAmeAshAtAv%EeIghtIpOatO{O%Ow UidUshY_mCusGIlLd~owOdOtR)Re,R+tRkRtu}RumRw?dSsil/ UndX_gi!AmeEqu|EshI&dIn+OgOntO,OwnOz&U.2ElNNnyRna)RyTu*:D+tInLaxy~ yMePRa+Rba+Rd&Rl-Rm|SSpTeTh U+Ze3N $NiusN*Nt!Nu(e/u*2O,0AntFtGg!Ng RaffeRlVe_dAn)A*A[IdeImp'ObeOomOryO=OwUe_tDde[LdOdO'RillaSpelSsipV nWn_bA)A(AntApeA[Av.yEatE&IdIefItOc yOupOwUnt_rdE[IdeIltIt?N3M:B.IrLfMm M, NdPpyRb%RdRshR=,TVeWkZ?d3AdAl`ArtAvyD+hogIght~oLmetLpNRo3Dd&Gh~NtPRe/%y5BbyCkeyLdLeLiday~owMeNeyOdPeRnRr%R'Sp.$/TelUrV 5BGeM<Mb!M%Nd*dNgryNtRd!RryRtSb<d3Brid:1EOn0EaEntifyLe2N%e4LLeg$L}[0A+Ita>M&'Mu}Pa@Po'Pro=Pul'0ChCludeComeC*a'DexD-a>Do%Du,ryF<tFl-tF%mHa!H .Iti$Je@JuryMa>N Noc|PutQuiryS<eSe@SideSpi*/$lTa@T e,ToVe,V.eVol=3On0L<dOla>Sue0Em1Ory:CketGu?RZz3AlousAns~yWel9BInKeUr}yY5D+I)MpNg!Ni%Nk/:Ng?oo3EnEpT^upY3CkDD}yNdNgdomSsTT^&TeTt&Wi4EeIfeO{Ow:BBelB%Dd DyKeMpNgua+PtopR+T T(UghUndryVaWWnWsu.Y Zy3Ad AfArnA=Ctu*FtGG$G&dIsu*M#NdNg`NsOp?dSs#Tt Vel3ArB tyBr?yC&'FeFtGhtKeMbM.NkOnQuid/Tt!VeZ?d5AdAnB, C$CkG-NelyNgOpTt yUdUn+VeY$5CkyGga+Mb N?N^Xury3R-s:Ch(eDG-G}tIdIlInJ%KeMm$NNa+Nda>NgoNs]Nu$P!Rb!R^Rg(R(eRketRria+SkSs/ T^T i$ThTrixTt XimumZe3AdowAnAsu*AtCh<-D$DiaLodyLtMb M%yNt]NuRcyR+R.RryShSsa+T$Thod3Dd!DnightLk~]M-NdNimumN%Nu>Rac!Rr%S ySs/akeXXedXtu*5Bi!DelDifyMM|N.%NkeyN, N`OnR$ReRn(gSqu.oTh T]T%Unta(U'VeVie5ChFf(LeLtiplySc!SeumShroomS-/Tu$3Self/ yTh:I=MePk(Rrow/yT]Tu*3ArCkEdGati=G!@I` PhewR=/TTw%kUtr$V WsXt3CeGht5B!I'M(eeOd!Rm$R`SeTab!TeTh(gTi)VelW5C!?Mb R'T:K0EyJe@Li+Scu*S =Ta(Vious0CurE<Tob 0Or1FF Fi)T&2L1Ay0DI=Ymp-0It0CeEI#L(eLy1EnEraIn]Po'T]1An+B.Ch?dD D(?yG<I|Ig($Ph<0Tr-h0H 0Tdo%T TputTside0AlEnEr0NN 0Yg&0/ 0O}:CtDd!GeIrLa)LmNdaNelN-N` P RadeR|RkRrotRtySsT^ThTi|TrolTt nU'VeYm|3A)AnutArAs<tL-<NN$tyNcilOp!Pp Rfe@Rm.Rs#T2O}OtoRa'Ys-$0AnoCn-Ctu*E)GGe#~LotNkO} Pe/olT^Zza_)A}tA,-A>AyEa'Ed+U{UgUn+2EmEtIntL?LeLi)NdNyOlPul?Rt]S.]Ssib!/TatoTt yV tyWd W _@i)Ai'Ed-tEf Epa*Es|EttyEv|I)IdeIm?yIntI%.yIs#Iva>IzeOb!mO)[Odu)Of.OgramOje@Omo>OofOp tyOsp O>@OudOvide2Bl-Dd(g~LpL'Mpk(N^PilPpyR^a'R.yRpo'R'ShTZz!3Ramid:99Al.yAntumArt E,]I{ItIzO>:Bb.Cco#CeCkD?DioIlInI'~yMpN^NdomN+PidReTeTh V&WZ%3AdyAlAs#BelBuildC$lCei=CipeC%dCyc!Du)F!@F%mFu'G]G*tGul?Je@LaxLea'LiefLyMa(Memb M(dMo=Nd NewNtOp&PairPeatPla)P%tQui*ScueSemb!Si,Sour)Sp#'SultTi*T*atTurnUn]Ve$ViewW?d2Y`m0BBb#CeChDeD+F!GhtGidNgOtPp!SkTu$V$V 5AdA,BotBu,CketM<)OfOkieOmSeTa>UghUndU>Y$5Bb DeGLeNNwayR$:DDd!D}[FeIlLadLm#L#LtLu>MeMp!NdTisfyToshiU)Usa+VeY1A!AnA*Att E}HemeHoolI&)I[%sOrp]OutRapRe&RiptRub1AAr^As#AtC#dC*tCt]Cur.yEdEkGm|Le@~M(?Ni%N'Nt&)RiesRvi)Ss]Tt!TupV&_dowAftAllowA*EdEllEriffIeldIftI}IpIv O{OeOotOpOrtOuld O=RimpRugUff!Y0Bl(gCkDeE+GhtGnL|Lk~yLv Mil?Mp!N)NgR&/ Tua>XZe1A>Et^IIllInIrtUll0AbAmEepEnd I)IdeIghtImOg<OtOwUsh0AllArtI!OkeOo`0A{AkeApIffOw0ApCc Ci$CkDaFtL?Ldi LidLut]L=Me#eNgOnRryRtUlUndUpUr)U`0A)A*Ati$AwnEakEci$EedEllEndH eI)Id IkeInIr.L.OilOns%O#OrtOtRayReadR(gY0Ua*UeezeUir*l_b!AdiumAffA+AirsAmpAndArtA>AyEakEelEmEpE*oI{IllIngO{Oma^O}OolOryO=Ra>gyReetRikeR#gRugg!Ud|UffUmb!Y!0Bje@Bm.BwayC)[ChDd&Ff G?G+,ItMm NNnyN'tP PplyP*meReRfa)R+Rpri'RroundR=ySpe@/a(1AllowAmpApArmE?EetIftImIngIt^Ord1MbolMptomRup/em:B!Ck!GIlL|LkNkPeR+tSk/eTtooXi3A^Am~NN<tNnisNtRm/Xt_nkAtEmeEnE%yE*EyIngIsOughtReeRi=RowUmbUnd 0CketDeG LtMb MeNyPRedSsueT!5A,BaccoDayDdl EGe` I!tK&MatoM%rowNeNgueNightOlO`PP-Pp!R^RnadoRtoi'SsT$Uri,W?dW WnY_{AdeAff-Ag-A(Ansf ApAshA=lAyEatEeEndI$IbeI{Igg ImIpOphyOub!U{UeUlyUmpetU,U`Y2BeIt]Mb!NaN}lRkeyRnRt!1El=EntyI)InI,O1PeP-$:5Ly5B*lla0Ab!Awa*C!Cov D DoFairFoldHappyIf%mIqueItIv 'KnownLo{TilUsu$Veil1Da>GradeHoldOnP Set1B<Ge0A+EEdEfulE![U$0Il.y:C<tCuumGueLidL!yL=NNishP%Rious/Ult3H-!L=tNd%Ntu*NueRbRifyRs]RyS'lT <3Ab!Br<tCiousCt%yDeoEw~a+Nta+Ol(Rtu$RusSaS.Su$T$Vid5C$I)IdLc<oLumeTeYa+:GeG#ItLk~LnutNtRfa*RmRri%ShSp/eT VeY3Al`Ap#ArA'lA` BDd(gEk&dIrdLcome/T_!AtEatEelEnE*IpIsp 0DeD`FeLd~NNdowNeNgNkNn Nt ReSdomSeShT}[5LfM<Nd OdOlRdRkRldRryR`_pE{E,!I,I>Ong::Rd3Ar~ow9UUngU`:3BraRo9NeO\";\nconst checksum = \"0x3c8acc1e7b08d8e76f9fda015ef48dc8c710a73cb7e0f77b2c18a9b5a7adde60\";\nlet wordlist = null;\n/**\n *  The [[link-bip39-en]] for [mnemonic phrases](link-bip-39).\n *\n *  @_docloc: api/wordlists\n */\nclass LangEn extends wordlist_owl_js_1.WordlistOwl {\n    /**\n     *  Creates a new instance of the English language Wordlist.\n     *\n     *  This should be unnecessary most of the time as the exported\n     *  [[langEn]] should suffice.\n     *\n     *  @_ignore:\n     */\n    constructor() { super(\"en\", words, checksum); }\n    /**\n     *  Returns a singleton instance of a ``LangEn``, creating it\n     *  if this is the first time being called.\n     */\n    static wordlist() {\n        if (wordlist == null) {\n            wordlist = new LangEn();\n        }\n        return wordlist;\n    }\n}\nexports.LangEn = LangEn;\n//# sourceMappingURL=lang-en.js.map","\"use strict\";\n// Use the encode-latin.js script to create the necessary\n// data files to be consumed by this class\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WordlistOwl = void 0;\nconst index_js_1 = require(\"../hash/index.js\");\nconst index_js_2 = require(\"../utils/index.js\");\nconst decode_owl_js_1 = require(\"./decode-owl.js\");\nconst wordlist_js_1 = require(\"./wordlist.js\");\n/**\n *  An OWL format Wordlist is an encoding method that exploits\n *  the general locality of alphabetically sorted words to\n *  achieve a simple but effective means of compression.\n *\n *  This class is generally not useful to most developers as\n *  it is used mainly internally to keep Wordlists for languages\n *  based on ASCII-7 small.\n *\n *  If necessary, there are tools within the ``generation/`` folder\n *  to create the necessary data.\n */\nclass WordlistOwl extends wordlist_js_1.Wordlist {\n    #data;\n    #checksum;\n    /**\n     *  Creates a new Wordlist for %%locale%% using the OWL %%data%%\n     *  and validated against the %%checksum%%.\n     */\n    constructor(locale, data, checksum) {\n        super(locale);\n        this.#data = data;\n        this.#checksum = checksum;\n        this.#words = null;\n    }\n    /**\n     *  The OWL-encoded data.\n     */\n    get _data() { return this.#data; }\n    /**\n     *  Decode all the words for the wordlist.\n     */\n    _decodeWords() {\n        return (0, decode_owl_js_1.decodeOwl)(this.#data);\n    }\n    #words;\n    #loadWords() {\n        if (this.#words == null) {\n            const words = this._decodeWords();\n            // Verify the computed list matches the official list\n            const checksum = (0, index_js_1.id)(words.join(\"\\n\") + \"\\n\");\n            /* c8 ignore start */\n            if (checksum !== this.#checksum) {\n                throw new Error(`BIP39 Wordlist for ${this.locale} FAILED`);\n            }\n            /* c8 ignore stop */\n            this.#words = words;\n        }\n        return this.#words;\n    }\n    getWord(index) {\n        const words = this.#loadWords();\n        (0, index_js_2.assertArgument)(index >= 0 && index < words.length, `invalid word index: ${index}`, \"index\", index);\n        return words[index];\n    }\n    getWordIndex(word) {\n        return this.#loadWords().indexOf(word);\n    }\n}\nexports.WordlistOwl = WordlistOwl;\n//# sourceMappingURL=wordlist-owl.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WordlistOwlA = void 0;\nconst wordlist_owl_js_1 = require(\"./wordlist-owl.js\");\nconst decode_owla_js_1 = require(\"./decode-owla.js\");\n/**\n *  An OWL-A format Wordlist extends the OWL format to add an\n *  overlay onto an OWL format Wordlist to support diacritic\n *  marks.\n *\n *  This class is generally not useful to most developers as\n *  it is used mainly internally to keep Wordlists for languages\n *  based on latin-1 small.\n *\n *  If necessary, there are tools within the ``generation/`` folder\n *  to create the necessary data.\n */\nclass WordlistOwlA extends wordlist_owl_js_1.WordlistOwl {\n    #accent;\n    /**\n     *  Creates a new Wordlist for %%locale%% using the OWLA %%data%%\n     *  and %%accent%% data and validated against the %%checksum%%.\n     */\n    constructor(locale, data, accent, checksum) {\n        super(locale, data, checksum);\n        this.#accent = accent;\n    }\n    /**\n     *  The OWLA-encoded accent data.\n     */\n    get _accent() { return this.#accent; }\n    /**\n     *  Decode all the words for the wordlist.\n     */\n    _decodeWords() {\n        return (0, decode_owla_js_1.decodeOwlA)(this._data, this._accent);\n    }\n}\nexports.WordlistOwlA = WordlistOwlA;\n//# sourceMappingURL=wordlist-owla.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Wordlist = void 0;\nconst index_js_1 = require(\"../utils/index.js\");\n/**\n *  A Wordlist represents a collection of language-specific\n *  words used to encode and devoce [[link-bip-39]] encoded data\n *  by mapping words to 11-bit values and vice versa.\n */\nclass Wordlist {\n    locale;\n    /**\n     *  Creates a new Wordlist instance.\n     *\n     *  Sub-classes MUST call this if they provide their own constructor,\n     *  passing in the locale string of the language.\n     *\n     *  Generally there is no need to create instances of a Wordlist,\n     *  since each language-specific Wordlist creates an instance and\n     *  there is no state kept internally, so they are safe to share.\n     */\n    constructor(locale) {\n        (0, index_js_1.defineProperties)(this, { locale });\n    }\n    /**\n     *  Sub-classes may override this to provide a language-specific\n     *  method for spliting %%phrase%% into individual words.\n     *\n     *  By default, %%phrase%% is split using any sequences of\n     *  white-space as defined by regular expressions (i.e. ``/\\s+/``).\n     */\n    split(phrase) {\n        return phrase.toLowerCase().split(/\\s+/g);\n    }\n    /**\n     *  Sub-classes may override this to provider a language-specific\n     *  method for joining %%words%% into a phrase.\n     *\n     *  By default, %%words%% are joined by a single space.\n     */\n    join(words) {\n        return words.join(\" \");\n    }\n}\nexports.Wordlist = Wordlist;\n//# sourceMappingURL=wordlist.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.wordlists = void 0;\nconst lang_en_js_1 = require(\"./lang-en.js\");\nexports.wordlists = {\n    en: lang_en_js_1.LangEn.wordlist(),\n};\n//# sourceMappingURL=wordlists-browser.js.map","'use strict';\n\n// created 2023-09-25T01:01:55.148Z\n// compressed base64-encoded blob for include-ens data\n// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js\n// see: https://github.com/adraffy/ens-normalize.js#security\n// SHA-256: 0565ed049b9cf1614bb9e11ba7d8ac6a6fb96c893253d890f7e2b2884b9ded32\nvar COMPRESSED$1 = 'AEEUdwmgDS8BxQKKAP4BOgDjATAAngDUAIMAoABoAOAAagCOAEQAhABMAHIAOwA9ACsANgAmAGIAHgAuACgAJwAXAC0AGgAjAB8ALwAUACkAEgAeAAkAGwARABkAFgA5ACgALQArADcAFQApABAAHgAiABAAGgAeABMAGAUhBe8BFxREN8sF2wC5AK5HAW8ArQkDzQCuhzc3NzcBP68NEfMABQdHBuw5BV8FYAA9MzkI9r4ZBg7QyQAWA9CeOwLNCjcCjqkChuA/lm+RAsXTAoP6ASfnEQDytQFJAjWVCkeXAOsA6godAB/cwdAUE0WlBCN/AQUCQRjFD/MRBjHxDQSJbw0jBzUAswBxme+tnIcAYwabAysG8QAjAEMMmxcDqgPKQyDXCMMxA7kUQwD3NXOrAKmFIAAfBC0D3x4BJQDBGdUFAhEgVD8JnwmQJiNWYUzrg0oAGwAUAB0AFnNcACkAFgBP9h3gPfsDOWDKneY2ChglX1UDYD30ABsAFAAdABZzIGRAnwDD8wAjAEEMzRbDqgMB2sAFYwXqAtCnAsS4AwpUJKRtFHsadUz9AMMVbwLpABM1NJEX0ZkCgYMBEyMAxRVvAukAEzUBUFAtmUwSAy4DBTER33EftQHfSwB5MxJ/AjkWKQLzL8E/cwBB6QH9LQDPDtO9ASNriQC5DQANAwCK21EFI91zHwCoL9kBqQcHBwcHKzUDowBvAQohPvU3fAQgHwCyAc8CKQMA5zMSezr7ULgFmDp/LzVQBgEGAi8FYQVgt8AFcTtlQhpCWEmfe5tmZ6IAExsDzQ8t+X8rBKtTAltbAn0jsy8Bl6utPWMDTR8Ei2kRANkDBrNHNysDBzECQWUAcwFpJ3kAiyUhAJ0BUb8AL3EfAbfNAz81KUsFWwF3YQZtAm0A+VEfAzEJDQBRSQCzAQBlAHsAM70GD/v3IZWHBwARKQAxALsjTwHZAeMPEzmXgIHwABIAGQA8AEUAQDt3gdvIEGcQZAkGTRFMdEIVEwK0D64L7REdDNkq09PgADSxB/MDWwfzA1sDWwfzB/MDWwfzA1sDWwNbA1scEvAi28gQZw9QBHUFlgWTBN4IiyZREYkHMAjaVBV0JhxPA00BBCMtSSQ7mzMTJUpMFE0LCAQ2SmyvfUADTzGzVP2QqgPTMlc5dAkGHnkSqAAyD3skNb1OhnpPcagKU0+2tYdJak5vAsY6sEAACikJm2/Dd1YGRRAfJ6kQ+ww3AbkBPw3xS9wE9QY/BM0fgRkdD9GVoAipLeEM8SbnLqWAXiP5KocF8Uv4POELUVFsD10LaQnnOmeBUgMlAREijwrhDT0IcRD3Cs1vDekRSQc9A9lJngCpBwULFR05FbkmFGKwCw05ewb/GvoLkyazEy17AAXXGiUGUQEtGwMA0y7rhbRaNVwgT2MGBwspI8sUrFAkDSlAu3hMGh8HGSWtApVDdEqLUToelyH6PEENai4XUYAH+TwJGVMLhTyiRq9FEhHWPpE9TCJNTDAEOYMsMyePCdMPiQy9fHYBXQklCbUMdRM1ERs3yQg9Bx0xlygnGQglRplgngT7owP3E9UDDwVDCUUHFwO5HDETMhUtBRGBKNsC9zbZLrcCk1aEARsFzw8pH+MQVEfkDu0InwJpA4cl7wAxFSUAGyKfCEdnAGOP3FMJLs8Iy2pwI3gDaxTrZRF3B5UOWwerHDcVwxzlcMxeD4YMKKezCV8BeQmdAWME5wgNNV+MpCBFZ1eLXBifIGVBQ14AAjUMaRWjRMGHfAKPD28SHwE5AXcHPQ0FAnsR8RFvEJkI74YINbkz/DopBFMhhyAVCisDU2zSCysm/Qz8bQGnEmYDEDRBd/Jnr2C6KBgBBx0yyUFkIfULlk/RDKAaxRhGVDIZ6AfDA/ca9yfuQVsGAwOnBxc6UTPyBMELbQiPCUMATQ6nGwfbGG4KdYzUATWPAbudA1uVhwJzkwY7Bw8Aaw+LBX3pACECqwinAAkA0wNbAD0CsQehAB0AiUUBQQMrMwEl6QKTA5cINc8BmTMB9y0EH8cMGQD7O25OAsO1AoBuZqYF4VwCkgJNOQFRKQQJUktVA7N15QDfAE8GF+NLARmvTs8e50cB43MvAMsA/wAJOQcJRQHRAfdxALsBYws1Caa3uQFR7S0AhwAZbwHbAo0A4QA5AIP1AVcAUQVd/QXXAlNNARU1HC9bZQG/AyMBNwERAH0Gz5GpzQsjBHEH1wIQHxXlAu8yB7kFAyLjE9FCyQK94lkAMhoKPAqrCqpgX2Q3CjV2PVQAEh+sPss/UgVVO1c7XDtXO1w7VztcO1c7XDtXO1wDm8Pmw+YKcF9JYe8Mqg3YRMw6TRPfYFVgNhPMLbsUxRXSJVoZQRrAJwkl6FUNDwgt12Y0CDA0eRfAAEMpbINFY4oeNApPHOtTlVT8LR8AtUumM7MNsBsZREQFS3XxYi4WEgomAmSFAmJGX1GzAV83JAKh+wJonAJmDQKfiDgfDwJmPwJmKgRyBIMDfxcDfpY5Cjl7GzmGOicnAmwhAjI6OA4CbcsCbbLzjgM3a0kvAWsA4gDlAE4JB5wMkQECD8YAEbkCdzMCdqZDAnlPRwJ4viFg30WyRvcCfEMCeswCfQ0CfPRIBEiBZygALxlJXEpfGRtK0ALRBQLQ0EsrA4hTA4fqRMmRNgLypV0HAwOyS9JMMSkH001QTbMCi0MCitzFHwshR2sJuwKOOwKOYESbhQKO3QKOYHxRuFM5AQ5S2FSJApP/ApMQAO0AIFUiVbNV1AosHymZijLleGpFPz0Cl6MC77ZYJawAXSkClpMCloCgAK1ZsFoNhVEAPwKWuQKWUlxIXNUCmc8CmWhczl0LHQKcnznGOqECnBoCn58CnryOACETNS4TAp31Ap6WALlBYThh8wKe1wKgcgGtAp6jIwKeUqljzGQrKS8CJ7MCJoICoP8CoFDbAqYzAqXSAqgDAIECp/ZogGi1AAdNaiBq1QKs5wKssgKtawKtBgJXIQJV4AKx5dsDH1JsmwKywRECsuwbbORtZ21MYwMl0QK2YD9DbpQDKUkCuGICuUsZArkue3A6cOUCvR0DLbYDMhUCvoxyBgMzdQK+HnMmc1MCw88CwwhzhnRPOUl05AM8qwEDPJ4DPcMCxYACxksCxhSNAshtVQLISALJUwLJMgJkoQLd1nh9ZXiyeSlL1AMYp2cGAmH4GfeVKHsPXpZevxUCz28Cz3AzT1fW9xejAMqxAs93AS3uA04Wfk8JAtwrAtuOAtJTA1JgA1NjAQUDVZCAjUMEzxrxZEl5A4LSg5EC2ssC2eKEFIRNp0ADhqkAMwNkEoZ1Xf0AWQLfaQLevHd7AuIz7RgB8zQrAfSfAfLWiwLr9wLpdH0DAur9AuroAP1LAb0C7o0C66CWrpcHAu5DA4XkmH1w5HGlAvMHAG0DjhqZlwL3FwORcgOSiwL3nAL53QL4apogmq+/O5siA52HAv7+AR8APZ8gAZ+3AwWRA6ZuA6bdANXJAwZuoYyiCQ0DDE0BEwEjB3EGZb1rCQC/BG/DFY8etxEAG3k9ACcDNxJRA42DAWcrJQCM8wAlAOanC6OVCLsGI6fJBgCvBRnDBvElRUYFFoAFcD9GSDNCKUK8X3kZX8QAls0FOgCQVCGbwTsuYDoZutcONxjOGJHJ/gVfBWAFXwVgBWsFYAVfBWAFXwVgBV8FYAVfBWBOHQjfjW8KCgoKbF7xMwTRA7kGN8PDAMMEr8MA70gxFroFTj5xPnhCR0K+X30/X/AAWBkzswCNBsxzzASm70aCRS4rDDMeLz49fnXfcsH5GcoscQFz13Y4HwVnBXLJycnACNdRYwgICAqEXoWTxgA7P4kACxbZBu21Kw0AjMsTAwkVAOVtJUUsJ1JCuULESUArXy9gPi9AKwnJRQYKTD9LPoA+iT54PnkCkULEUUpDX9NWV3JVEjQAc1w3A3IBE3YnX+g7QiMJb6MKaiszRCUuQrNCxDPMCcwEX9EWJzYREBEEBwIHKn6l33JCNVIfybPJtAltydPUCmhBZw/tEKsZAJOVJU1CLRuxbUHOQAo7P0s+eEJHHA8SJVRPdGM0NVrpvBoKhfUlM0JHHGUQUhEWO1xLSj8MO0ucNAqJIzVCRxv9EFsqKyA4OQgNj2nwZgp5ZNFgE2A1K3YHS2AhQQojJmC7DgpzGG1WYFUZCQYHZO9gHWCdYIVgu2BTYJlwFh8GvRbcXbG8YgtDHrMBwzPVyQonHQgkCyYBgQJ0Ajc4nVqIAwGSCsBPIgDsK3SWEtIVBa5N8gGjAo+kVwVIZwD/AEUSCDweX4ITrRQsJ8K3TwBXFDwEAB0TvzVcAtoTS20RIwDgVgZ9BBImYgA5AL4Coi8LFnezOkCnIQFjAY4KBAPh9RcGsgZSBsEAJctdsWIRu2kTkQstRw7DAcMBKgpPBGIGMDAwKCYnKTQaLg4AKRSVAFwCdl+YUZ0JdicFD3lPAdt1F9ZZKCGxuE3yBxkFVGcA/wBFEgiCBwAOLHQSjxOtQDg1z7deFRMAZ8QTAGtKb1ApIiPHADkAvgKiLy1DFtYCmBiDAlDDWNB0eo7fpaMO/aEVRRv0ATEQZBIODyMEAc8JQhCbDRgzFD4TAEMAu9YBCgCsAOkAm5I3ABwAYxvONnR+MhXJAxgKQyxL2+kkJhMbhQKDBMkSsvF0AD9BNQ6uQC7WqSQHwxEAEEIu1hkhAH2z4iQPwyJPHNWpdyYBRSpnJALzoBAEVPPsH20MxA0CCEQKRgAFyAtFAlMNwwjEDUQJRArELtapMg7DDZgJIw+TGukEIwvDFkMAqAtDEMMMBhioe+QAO3MMRAACrgnEBSPY9Q0FDnbSBoMAB8MSYxkSxAEJAPIJAAB8FWMOFtMc/HcXwxhDAC7DAvOowwAewwJdKDKHAAHDAALrFUQVwwAbwyvzpWMWv8wA/ABpAy++bcYDUKPD0KhDCwKmJ1MAAmMA5+UZwxAagwipBRL/eADfw6fDGOMCGsOjk3l6BwOpo4sAEsMOGxMAA5sAbcMOAAvDp0MJGkMDwgipnNIPAwfIqUMGAOGDAAPzABXDAAcDAAnDAGmTABrDAA7DChjDjnEWAwABYwAOcwAuUyYABsMAF8MIKQANUgC6wy4AA8MADqMq8wCyYgAcIwAB8wqpAAXOCx0V4wAHowBCwwEKAGnDAAuDAB3DAAjDCakABdIAbqcZ3QCZCCkABdIAAAFDAAfjAB2jCCkABqIACYMAGzMAbSMA5sOIAAhjAAhDABTDBAkpAAbSAOOTAAlDC6kOzPtnAAdDAG6kQFAATwAKwwwAA0MACbUDPwAHIwAZgwACE6cDAAojAApDAAoDp/MGwwAJIwADEwAQQwgAFEMAEXMAD5MADfMADcMAGRMOFiMAFUMAbqMWuwHDAMIAE0MLAGkzEgDhUwACQwAEWgAXgwUjAAbYABjDBSYBgzBaAEFNALcQBxUMegAwMngBrA0IZgJ0KxQHBREPd1N0ZzKRJwaIHAZqNT4DqQq8BwngAB4DAwt2AX56T1ocKQNXAh1GATQGC3tOxYNagkgAMQA5CQADAQEAWxLjAIOYNAEzAH7tFRk6TglSAF8NAAlYAQ+S1ACAQwQorQBiAN4dAJ1wPyeTANVzuQDX3AIeEMp9eyMgXiUAEdkBkJizKltbVVAaRMqRAAEAhyQ/SDEz6BmfVwB6ATEsOClKIRcDOF0E/832AFNt5AByAnkCRxGCOs94NjXdAwINGBonDBwPALW2AwICAgAAAAAAAAYDBQMDARrUAwAtAAAAAgEGBgYGBgYFBQUFBQUEBQYHCAkEBQUFBQQAAAICAAAAIgCNAJAAlT0A6gC7ANwApEQAwgCyAK0AqADuAKYA2gCjAOcBCAEDAMcAgQBiANIA1AEDAN4A8gCQAKkBMQDqAN8A3AsBCQ8yO9ra2tq8xuLT1tRJOB0BUgFcNU0BWgFpAWgBWwFMUUlLbhMBUxsNEAs6PhMOACcUKy0vMj5AQENDQ0RFFEYGJFdXV1dZWVhZL1pbXVxcI2NnZ2ZoZypsbnZ1eHh4eHh4enp6enp6enp6enp8fH18e2IARPIASQCaAHgAMgBm+ACOAFcAVwA3AnbvAIsABfj4AGQAk/IAnwBPAGIAZP//sACFAIUAaQBWALEAJAC2AIMCQAJDAPwA5wD+AP4A6AD/AOkA6QDoAOYALwJ7AVEBQAE+AVQBPgE+AT4BOQE4ATgBOAEcAVgXADEQCAEAUx8SHgsdHhYAjgCWAKYAUQBqIAIxAHYAbwCXAxUDJzIDIUlGTzEAkQJPAMcCVwKkAMAClgKWApYClgKWApYCiwKWApYClgKWApYClgKVApUCmAKgApcClgKWApQClAKUApQCkgKVAnUB1AKXAp8ClgKWApUeAIETBQD+DQOfAmECOh8BVBg9AuIZEjMbAU4/G1WZAXusRAFpYQEFA0FPAQYAmTEeIJdyADFoAHEANgCRA5zMk/C2jGINwjMWygIZCaXdfDILBCs5dAE7YnQBugDlhoiHhoiGiYqKhouOjIaNkI6Ij4qQipGGkoaThpSSlYaWhpeKmIaZhpqGm4aci52QnoqfhuIC4XTpAt90AIp0LHSoAIsAdHQEQwRABEIERQRDBEkERgRBBEcESQRIBEQERgRJAJ5udACrA490ALxuAQ10ANFZdHQA13QCFHQA/mJ0AP4BIQD+APwA/AD9APwDhGZ03ASMK23HAP4A/AD8AP0A/CR0dACRYnQA/gCRASEA/gCRAvQA/gCRA4RmdNwEjCttxyR0AP9idAEhAP4A/gD8APwA/QD8AP8A/AD8AP0A/AOEZnTcBIwrbcckdHQAkWJ0ASEA/gCRAP4AkQL0AP4AkQOEZnTcBIwrbcckdAJLAT50AlIBQXQCU8l0dAJfdHQDpgL0A6YDpgOnA6cDpwOnA4RmdNwEjCttxyR0dACRYnQBIQOmAJEDpgCRAvQDpgCRA4RmdNwEjCttxyR0BDh0AJEEOQCRDpU5dSgCADR03gV2CwArdAEFAM5iCnR0AF1iAAYcOgp0dACRCnQAXAEIwWZ0CnRmdHQAkWZ0CnRmdEXgAFF03gp0dEY0tlT2u3SOAQTwscwhjZZKrhYcBSfFp9XNbKiVDOD2b+cpe4/Z17mQnbtzzhaeQtE2GGj0IDNTjRUSyTxxw/RPHW/+vS7d1NfRt9z9QPZg4X7QFfhCnkvgNPIItOsC2eV6hPannZNHlZ9xrwZXIMOlu3jSoQSq78WEjwLjw1ELSlF1aBvfzwk5ZX7AUvQzjPQKbDuQ+sm4wNOp4A6AdVuRS0t1y/DZpg4R6m7FNjM9HgvW7Bi88zaMjOo6lM8wtBBdj8LP4ylv3zCXPhebMKJc066o9sF71oFW/8JXu86HJbwDID5lzw5GWLR/LhT0Qqnp2JQxNZNfcbLIzPy+YypqRm/lBmGmex+82+PisxUumSeJkALIT6rJezxMH+CTJmQtt5uwTVbL3ptmjDUQzlSIvWi8Tl7ng1NpuRn1Ng4n14Qc+3Iil7OwkvNWogLSPkn3pihIFytyIGmMhOe3n1tWsuMy9BdKyqF4Z3v2SgggTL9KVvMXPnCbRe+oOuFFP3HejBG/w9gvmfNYvg6JuWia2lcSSN1uIjBktzoIazOHPJZ7kKHPz8mRWVdW3lA8WGF9dQF6Bm673boov3BUWDU2JNcahR23GtfHKLOz/viZ+rYnZFaIznXO67CYEJ1fXuTRpZhYZkKe54xeoagkNGLs+NTZHE0rX45/XvQ2RGADX6vcAvdxIUBV27wxGm2zjZo4X3ILgAlrOFheuZ6wtsvaIj4yLY7qqawlliaIcrz2G+c3vscAnCkCuMzMmZvMfu9lLwTvfX+3cVSyPdN9ZwgDZhfjRgNJcLiJ67b9xx8JHswprbiE3v9UphotAPIgnXVIN5KmMc0piXhc6cChPnN+MRhG9adtdttQTTwSIpl8I4/j//d3sz1326qTBTpPRM/Hgh3kzqEXs8ZAk4ErQhNO8hzrQ0DLkWMA/N+91tn2MdOJnWC2FCZehkQrwzwbKOjhvZsbM95QoeL9skYyMf4srVPVJSgg7pOLUtr/n9eT99oe9nLtFRpjA9okV2Kj8h9k5HaC0oivRD8VyXkJ81tcd4fHNXPCfloIQasxsuO18/46dR2jgul/UIet2G0kRvnyONMKhHs6J26FEoqSqd+rfYjeEGwHWVDpX1fh1jBBcKGMqRepju9Y00mDVHC+Xdij/j44rKfvfjGinNs1jO/0F3jB83XCDINN/HB84axlP+3E/klktRo+vl3U/aiyMJbIodE1XSsDn6UAzIoMtUObY2+k/4gY/l+AkZJ5Sj2vQrkyLm3FoxjhDX+31UXBFf9XrAH31fFqoBmDEZvhvvpnZ87N+oZEu7U9O/nnk+QWj3x8uyoRbEnf+O5UMr9i0nHP38IF5AvzrBW8YWBUR0mIAzIvndQq9N3v/Jto3aPjPXUPl8ASdPPyAp7jENf8bk7VMM9ol9XGmlBmeDMuGqt+WzuL6CXAxXjIhCPM5vACchgMJ/8XBGLO/D1isVvGhwwHHr1DLaI5mn2Jr/b1pUD90uciDaS8cXNDzCWvNmT/PhQe5e8nTnnnkt8Ds/SIjibcum/fqDhKopxAY8AkSrPn+IGDEKOO+U3XOP6djFs2H5N9+orhOahiQk5KnEUWa+CzkVzhp8bMHRbg81qhjjXuIKbHjSLSIBKWqockGtKinY+z4/RdBUF6pcc3JmnlxVcNgrI4SEzKUZSwcD2QCyxzKve+gAmg6ZuSRkpPFa6mfThu7LJNu3H5K42uCpNvPAsoedolKV/LHe/eJ+BbaG5MG0NaSGVPRUmNFMFFSSpXEcXwbVh7UETOZZtoVNRGOIbbkig3McEtR68cG0RZAoJevWYo7Dg/lZ1CQzblWeUvVHmr8fY4Nqd9JJiH/zEX24mJviH60fAyFr0A3c4bC1j3yZU60VgJxXn8JgJXLUIsiBnmKmMYz+7yBQFBvqb2eYnuW59joZBf56/wXvWIR4R8wTmV80i1mZy+S4+BUES+hzjk0uXpC///z/IlqHZ1monzlXp8aCfhGKMti73FI1KbL1q6IKO4fuBuZ59gagjn5xU79muMpHXg6S+e+gDM/U9BKLHbl9l6o8czQKl4RUkJJiqftQG2i3BMg/TQlUYFkJDYBOOvAugYuzYSDnZbDDd/aSd9x0Oe6F+bJcHfl9+gp6L5/TgA+BdFFovbfCrQ40s5vMPw8866pNX8zyFGeFWdxIpPVp9Rg1UPOVFbFZrvaFq/YAzHQgqMWpahMYfqHpmwXfHL1/kpYmGuHFwT55mQu0dylfNuq2Oq0hTMCPwqfxnuBIPLXfci4Y1ANy+1CUipQxld/izVh16WyG2Q0CQQ9NqtAnx1HCHwDj7sYxOSB0wopZSnOzxQOcExmxrVTF2BkOthVpGfuhaGECfCJpJKpjnihY+xOT2QJxN61+9K6QSqtv2Shr82I3jgJrqBg0wELFZPjvHpvzTtaJnLK6Vb97Yn933koO/saN7fsjwNKzp4l2lJVx2orjCGzC/4ZL4zCver6aQYtC5sdoychuFE6ufOiog+VWi5UDkbmvmtah/3aArEBIi39s5ILUnlFLgilcGuz9CQshEY7fw2ouoILAYPVT/gyAIq3TFAIwVsl+ktkRz/qGfnCDGrm5gsl/l9QdvCWGsjPz3dU7XuqKfdUrr/6XIgjp4rey6AJBmCmUJMjITHVdFb5m1p+dLMCL8t55zD42cmftmLEJC0Da04YiRCVUBLLa8D071/N5UBNBXDh0LFsmhV/5B5ExOB4j3WVG/S3lfK5o+V6ELHvy6RR9n4ac+VsK4VE4yphPvV+kG9FegTBH4ZRXL2HytUHCduJazB/KykjfetYxOXTLws267aGOd+I+JhKP//+VnXmS90OD/jvLcVu0asyqcuYN1mSb6XTlCkqv1vigZPIYwNF/zpWcT1GR/6aEIRjkh0yhg4LXJfaGobYJTY4JI58KiAKgmmgAKWdl5nYCeLqavRJGQNuYuZtZFGx+IkI4w4NS2xwbetNMunOjBu/hmKCI/w7tfiiyUd//4rbTeWt4izBY8YvGIN6vyKYmP/8X8wHKCeN+WRcKM70+tXKNGyevU9H2Dg5BsljnTf8YbsJ1TmMs74Ce2XlHisleguhyeg44rQOHZuw/6HTkhnnurK2d62q6yS7210SsAIaR+jXMQA+svkrLpsUY+F30Uw89uOdGAR6vo4FIME0EfVVeHTu6eKicfhSqOeXJhbftcd08sWEnNUL1C9fnprTgd83IMut8onVUF0hvqzZfHduPjbjwEXIcoYmy+P6tcJZHmeOv6VrvEdkHDJecjHuHeWANe79VG662qTjA/HCvumVv3qL+LrOcpqGps2ZGwQdFJ7PU4iuyRlBrwfO+xnPyr47s2cXVbWzAyznDiBGjCM3ksxjjqM62GE9C8f5U38kB3VjtabKp/nRdvMESPGDG90bWRLAt1Qk5DyLuazRR1YzdC1c+hZXvAWV8xA72S4A8B67vjVhbba3MMop293FeEXpe7zItMWrJG/LOH9ByOXmYnNJfjmfuX9KbrpgLOba4nZ+fl8Gbdv/ihv+6wFGKHCYrVwmhFC0J3V2bn2tIB1wCc1CST3d3X2OyxhguXcs4sm679UngzofuSeBewMFJboIQHbUh/m2JhW2hG9DIvG2t7yZIzKBTz9wBtnNC+2pCRYhSIuQ1j8xsz5VvqnyUIthvuoyyu7fNIrg/KQUVmGQaqkqZk/Vx5b33/gsEs8yX7SC1J+NV4icz6bvIE7C5G6McBaI8rVg56q5QBJWxn/87Q1sPK4+sQa8fLU5gXo4paaq4cOcQ4wR0VBHPGjKh+UlPCbA1nLXyEUX45qZ8J7/Ln4FPJE2TdzD0Z8MLSNQiykMMmSyOCiFfy84Rq60emYB2vD09KjYwsoIpeDcBDTElBbXxND72yhd9pC/1CMid/5HUMvAL27OtcIJDzNKpRPNqPOpyt2aPGz9QWIs9hQ9LiX5s8m9hjTUu/f7MyIatjjd+tSfQ3ufZxPpmJhTaBtZtKLUcfOCUqADuO+QoH8B9v6U+P0HV1GLQmtoNFTb3s74ivZgjES0qfK+8RdGgBbcCMSy8eBvh98+et1KIFqSe1KQPyXULBMTsIYnysIwiZBJYdI20vseV+wuJkcqGemehKjaAb9L57xZm3g2zX0bZ2xk/fU+bCo7TlnbW7JuF1YdURo/2Gw7VclDG1W7LOtas2LX4upifZ/23rzpsnY/ALfRgrcWP5hYmV9VxVOQA1fZvp9F2UNU+7d7xRyVm5wiLp3/0dlV7vdw1PMiZrbDAYzIVqEjRY2YU03sJhPnlwIPcZUG5ltL6S8XCxU1eYS5cjr34veBmXAvy7yN4ZjArIG0dfD/5UpBNlX1ZPoxJOwyqRi3wQWtOzd4oNKh0LkoTm8cwqgIfKhqqGOhwo71I+zXnMemTv2B2AUzABWyFztGgGULjDDzWYwJUVBTjKCn5K2QGMK1CQT7SzziOjo+BhAmqBjzuc3xYym2eedGeOIRJVyTwDw37iCMe4g5Vbnsb5ZBdxOAnMT7HU4DHpxWGuQ7GeiY30Cpbvzss55+5Km1YsbD5ea3NI9QNYIXol5apgSu9dZ8f8xS5dtHpido5BclDuLWY4lhik0tbJa07yJhH0BOyEut/GRbYTS6RfiTYWGMCkNpfSHi7HvdiTglEVHKZXaVhezH4kkXiIvKopYAlPusftpE4a5IZwvw1x/eLvoDIh/zpo9FiQInsTb2SAkKHV42XYBjpJDg4374XiVb3ws4qM0s9eSQ5HzsMU4OZJKuopFjBM+dAZEl8RUMx5uU2N486Kr141tVsGQfGjORYMCJAMsxELeNT4RmWjRcpdTGBwcx6XN9drWqPmJzcrGrH4+DRc7+n1w3kPZwu0BkNr6hQrqgo7JTB9A5kdJ/H7P4cWBMwsmuixAzJB3yrQpnGIq90lxAXLzDCdn1LPibsRt7rHNjgQBklRgPZ8vTbjXdgXrTWQsK5MdrXXQVPp0Rinq3frzZKJ0qD6Qhc40VzAraUXlob1gvkhK3vpmHgI6FRlQZNx6eRqkp0zy4AQlX813fAPtL3jMRaitGFFjo0zmErloC+h+YYdVQ6k4F/epxAoF0BmqEoKNTt6j4vQZNQ2BoqF9Vj53TOIoNmDiu9Xp15RkIgQIGcoLpfoIbenzpGUAtqFJp5W+LLnx38jHeECTJ/navKY1NWfN0sY1T8/pB8kIH3DU3DX+u6W3YwpypBMYOhbSxGjq84RZ84fWJow8pyHqn4S/9J15EcCMsXqrfwyd9mhiu3+rEo9pPpoJkdZqHjra4NvzFwuThNKy6hao/SlLw3ZADUcUp3w3SRVfW2rhl80zOgTYnKE0Hs2qp1J6H3xqPqIkvUDRMFDYyRbsFI3M9MEyovPk8rlw7/0a81cDVLmBsR2ze2pBuKb23fbeZC0uXoIvDppfTwIDxk1Oq2dGesGc+oJXWJLGkOha3CX+DUnzgAp9HGH9RsPZN63Hn4RMA5eSVhPHO+9RcRb/IOgtW31V1Q5IPGtoxPjC+MEJbVlIMYADd9aHYWUIQKopuPOHmoqSkubnAKnzgKHqgIOfW5RdAgotN6BN+O2ZYHkuemLnvQ8U9THVrS1RtLmKbcC7PeeDsYznvqzeg6VCNwmr0Yyx1wnLjyT84BZz3EJyCptD3yeueAyDWIs0L2qs/VQ3HUyqfrja0V1LdDzqAikeWuV4sc7RLIB69jEIBjCkyZedoUHqCrOvShVzyd73OdrJW0hPOuQv2qOoHDc9xVb6Yu6uq3Xqp2ZaH46A7lzevbxQEmfrzvAYSJuZ4WDk1Hz3QX1LVdiUK0EvlAGAYlG3Md30r7dcPN63yqBCIj25prpvZP0nI4+EgWoFG95V596CurXpKRBGRjQlHCvy5Ib/iW8nZJWwrET3mgd6mEhfP4KCuaLjopWs7h+MdXFdIv8dHQJgg1xi1eYqB0uDYjxwVmri0Sv5XKut/onqapC+FQiC2C1lvYJ9MVco6yDYsS3AANUfMtvtbYI2hfwZatiSsnoUeMZd34GVjkMMKA+XnjJpXgRW2SHTZplVowPmJsvXy6w3cfO1AK2dvtZEKTkC/TY9LFiKHCG0DnrMQdGm2lzlBHM9iEYynH2UcVMhUEjsc0oDBTgo2ZSQ1gzkAHeWeBXYFjYLuuf8yzTCy7/RFR81WDjXMbq2BOH5dURnxo6oivmxL3cKzKInlZkD31nvpHB9Kk7GfcfE1t+1V64b9LtgeJGlpRFxQCAqWJ5DoY77ski8gsOEOr2uywZaoO/NGa0X0y1pNQHBi3b2SUGNpcZxDT7rLbBf1FSnQ8guxGW3W+36BW0gBje4DOz6Ba6SVk0xiKgt+q2JOFyr4SYfnu+Ic1QZYIuwHBrgzr6UvOcSCzPTOo7D6IC4ISeS7zkl4h+2VoeHpnG/uWR3+ysNgPcOIXQbv0n4mr3BwQcdKJxgPSeyuP/z1Jjg4e9nUvoXegqQVIE30EHx5GHv+FAVUNTowYDJgyFhf5IvlYmEqRif6+WN1MkEJmDcQITx9FX23a4mxy1AQRsOHO/+eImX9l8EMJI3oPWzVXxSOeHU1dUWYr2uAA7AMb+vAEZSbU3qob9ibCyXeypEMpZ6863o6QPqlqGHZkuWABSTVNd4cOh9hv3qEpSx2Zy/DJMP6cItEmiBJ5PFqQnDEIt3NrA3COlOSgz43D7gpNFNJ5MBh4oFzhDPiglC2ypsNU4ISywY2erkyb1NC3Qh/IfWj0eDgZI4/ln8WPfBsT3meTjq1Uqt1E7Zl/qftqkx6aM9KueMCekSnMrcHj1CqTWWzEzPsZGcDe3Ue4Ws+XFYVxNbOFF8ezkvQGR6ZOtOLU2lQEnMBStx47vE6Pb7AYMBRj2OOfZXfisjJnpTfSNjo6sZ6qSvNxZNmDeS7Gk3yYyCk1HtKN2UnhMIjOXUzAqDv90lx9O/q/AT1ZMnit5XQe9wmQxnE/WSH0CqZ9/2Hy+Sfmpeg8RwsHI5Z8kC8H293m/LHVVM/BA7HaTJYg5Enk7M/xWpq0192ACfBai2LA/qrCjCr6Dh1BIMzMXINBmX96MJ5Hn2nxln/RXPFhwHxUmSV0EV2V0jm86/dxxuYSU1W7sVkEbN9EzkG0QFwPhyHKyb3t+Fj5WoUUTErcazE/N6EW6Lvp0d//SDPj7EV9UdJN+Amnf3Wwk3A0SlJ9Z00yvXZ7n3z70G47Hfsow8Wq1JXcfwnA+Yxa5mFsgV464KKP4T31wqIgzFPd3eCe3j5ory5fBF2hgCFyVFrLzI9eetNXvM7oQqyFgDo4CTp/hDV9NMX9JDHQ/nyHTLvZLNLF6ftn2OxjGm8+PqOwhxnPHWipkE/8wbtyri80Sr7pMNkQGMfo4ZYK9OcCC4ESVFFbLMIvlxSoRqWie0wxqnLfcLSXMSpMMQEJYDVObYsXIQNv4TGNwjq1kvT1UOkicTrG3IaBZ3XdScS3u8sgeZPVpOLkbiF940FjbCeNRINNvDbd01EPBrTCPpm12m43ze1bBB59Ia6Ovhnur/Nvx3IxwSWol+3H2qfCJR8df6aQf4v6WiONxkK+IqT4pKQrZK/LplgDI/PJZbOep8dtbV7oCr6CgfpWa8NczOkPx81iSHbsNhVSJBOtrLIMrL31LK9TqHqAbAHe0RLmmV806kRLDLNEhUEJfm9u0sxpkL93Zgd6rw+tqBfTMi59xqXHLXSHwSbSBl0EK0+loECOPtrl+/nsaFe197di4yUgoe4jKoAJDXc6DGDjrQOoFDWZJ9HXwt8xDrQP+7aRwWKWI1GF8s8O4KzxWBBcwnl3vnl1Oez3oh6Ea1vjR7/z7DDTrFtqU2W/KAEzAuXDNZ7MY73MF216dzdSbWmUp4lcm7keJfWaMHgut9x5C9mj66Z0lJ+yhsjVvyiWrfk1lzPOTdhG15Y7gQlXtacvI7qv/XNSscDwqkgwHT/gUsD5yB7LdRRvJxQGYINn9hTpodKFVSTPrtGvyQw+HlRFXIkodErAGu9Iy1YpfSPc3jkFh5CX3lPxv7aqjE/JAfTIpEjGb/H7MO0e2vsViSW1qa/Lmi4/n4DEI3g7lYrcanspDfEpKkdV1OjSLOy0BCUqVoECaB55vs06rXl4jqmLsPsFM/7vYJ0vrBhDCm/00A/H81l1uekJ/6Lml3Hb9+NKiLqATJmDpyzfYZFHumEjC662L0Bwkxi7E9U4cQA0XMVDuMYAIeLMPgQaMVOd8fmt5SflFIfuBoszeAw7ow5gXPE2Y/yBc/7jExARUf/BxIHQBF5Sn3i61w4z5xJdCyO1F1X3+3ax+JSvMeZ7S6QSKp1Fp/sjYz6Z+VgCZzibGeEoujryfMulH7Rai5kAft9ebcW50DyJr2uo2z97mTWIu45YsSnNSMrrNUuG1XsYBtD9TDYzQffKB87vWbkM4EbPAFgoBV4GQS+vtFDUqOFAoi1nTtmIOvg38N4hT2Sn8r8clmBCXspBlMBYTnrqFJGBT3wZOzAyJDre9dHH7+x7qaaKDOB4UQALD5ecS0DE4obubQEiuJZ0EpBVpLuYcce8Aa4PYd/V4DLDAJBYKQPCWTcrEaZ5HYbJi11Gd6hjGom1ii18VHYnG28NKpkz2UKVPxlhYSp8uZr367iOmoy7zsxehW9wzcy2zG0a80PBMCRQMb32hnaHeOR8fnNDzZhaNYhkOdDsBUZ3loDMa1YP0uS0cjUP3b/6DBlqmZOeNABDsLl5BI5QJups8uxAuWJdkUB/pO6Zax6tsg7fN5mjjDgMGngO+DPcKqiHIDbFIGudxtPTIyDi9SFMKBDcfdGQRv41q1AqmxgkVfJMnP8w/Bc7N9/TR6C7mGObFqFkIEom8sKi2xYqJLTCHK7cxzaZvqODo22c3wisBCP4HeAgcRbNPAsBkNRhSmD48dHupdBRw4mIvtS5oeF6zeT1KMCyhMnmhpkFAGWnGscoNkwvQ8ZM5lE/vgTHFYL99OuNxdFBxTEDd5v2qLR8y9WkXsWgG6kZNndFG+pO/UAkOCipqIhL3hq7cRSdrCq7YhUsTocEcnaFa6nVkhnSeRYUA1YO0z5itF9Sly3VlxYDw239TJJH6f3EUfYO5lb7bcFcz8Bp7Oo8QmnsUHOz/fagVUBtKEw1iT88j+aKkv8cscKNkMxjYr8344D1kFoZ7/td1W6LCNYN594301tUGRmFjAzeRg5vyoM1F6+bJZ/Q54jN/k8SFd3DxPTYaAUsivsBfgTn7Mx8H2SpPt4GOdYRnEJOH6jHM2p6SgB0gzIRq6fHxGMmSmqaPCmlfwxiuloaVIitLGN8wie2CDWhkzLoCJcODh7KIOAqbHEvXdUxaS4TTTs07Clzj/6GmVs9kiZDerMxEnhUB6QQPlcfqkG9882RqHoLiHGBoHfQuXIsAG8GTAtao2KVwRnvvam8jo1e312GQAKWEa4sUVEAMG4G6ckcONDwRcg1e2D3+ohXgY4UAWF8wHKQMrSnzCgfFpsxh+aHXMGtPQroQasRY4U6UdG0rz1Vjbka0MekOGRZQEvqQFlxseFor8zWFgHek3v29+WqN6gaK5gZOTOMZzpQIC1201LkMCXild3vWXSc5UX9xcFYfbRPzGFa1FDcPfPB/jUEq/FeGt419CI3YmBlVoHsa4KdcwQP5ZSwHHhFJ7/Ph/Rap/4vmG91eDwPP0lDfCDRCLszTqfzM71xpmiKi2HwS4WlqvGNwtvwF5Dqpn6KTq8ax00UMPkxDcZrEEEsIvHiUXXEphdb4GB4FymlPwBz4Gperqq5pW7TQ6/yNRhW8VT5NhuP0udlxo4gILq5ZxAZk8ZGh3g4CqxJlPKY7AQxupfUcVpWT5VItp1+30UqoyP4wWsRo3olRRgkWZZ2ZN6VC3OZFeXB8NbnUrSdikNptD1QiGuKkr8EmSR/AK9Rw+FF3s5uwuPbvHGiPeFOViltMK7AUaOsq9+x9cndk3iJEE5LKZRlWJbKOZweROzmPNVPkjE3K/TyA57Rs68TkZ3MR8akKpm7cFjnjPd/DdkWjgYoKHSr5Wu5ssoBYU4acRs5g2DHxUmdq8VXOXRbunD8QN0LhgkssgahcdoYsNvuXGUK/KXD/7oFb+VGdhqIn02veuM5bLudJOc2Ky0GMaG4W/xWBxIJcL7yliJOXOpx0AkBqUgzlDczmLT4iILXDxxtRR1oZa2JWFgiAb43obrJnG/TZC2KSK2wqOzRZTXavZZFMb1f3bXvVaNaK828w9TO610gk8JNf3gMfETzXXsbcvRGCG9JWQZ6+cDPqc4466Yo2RcKH+PILeKOqtnlbInR3MmBeGG3FH10yzkybuqEC2HSQwpA0An7d9+73BkDUTm30bZmoP/RGbgFN+GrCOfADgqr0WbI1a1okpFms8iHYw9hm0zUvlEMivBRxModrbJJ+9/p3jUdQQ9BCtQdxnOGrT5dzRUmw0593/mbRSdBg0nRvRZM5/E16m7ZHmDEtWhwvfdZCZ8J8M12W0yRMszXamWfQTwIZ4ayYktrnscQuWr8idp3PjT2eF/jmtdhIfcpMnb+IfZY2FebW6UY/AK3jP4u3Tu4zE4qlnQgLFbM19EBIsNf7KhjdbqQ/D6yiDb+NlEi2SKD+ivXVUK8ib0oBo366gXkR8ZxGjpJIDcEgZPa9TcYe0TIbiPl/rPUQDu3XBJ9X/GNq3FAUsKsll57DzaGMrjcT+gctp+9MLYXCq+sqP81eVQ0r9lt+gcQfZbACRbEjvlMskztZG8gbC8Qn9tt26Q7y7nDrbZq/LEz7kR6Jc6pg3N9rVX8Y5MJrGlML9p9lU4jbTkKqCveeZUJjHB03m2KRKR2TytoFkTXOLg7keU1s1lrPMQJpoOKLuAAC+y1HlJucU6ysB5hsXhvSPPLq5J7JtnqHKZ4vYjC4Vy8153QY+6780xDuGARsGbOs1WqzH0QS765rnSKEbbKlkO8oI/VDwUd0is13tKpqILu1mDJFNy/iJAWcvDgjxvusIT+PGz3ST/J9r9Mtfd0jpaGeiLYIqXc7DiHSS8TcjFVksi66PEkxW1z6ujbLLUGNNYnzOWpH8BZGK4bCK7iR+MbIv8ncDAz1u4StN3vTTzewr9IQjk9wxFxn+6N1ddKs0vffJiS08N3a4G1SVrlZ97Q/M+8G9fe5AP6d9/Qq4WRnORVhofPIKEdCr3llspUfE0oKIIYoByBRPh+bX1HLS3JWGJRhIvE1aW4NTd8ePi4Z+kXb+Z8snYfSNcqijhAgVsx4RCM54cXUiYkjeBmmC4ajOHrChoELscJJC7+9jjMjw5BagZKlgRMiSNYz7h7vvZIoQqbtQmspc0cUk1G/73iXtSpROl5wtLgQi0mW2Ex8i3WULhcggx6E1LMVHUsdc9GHI1PH3U2Ko0PyGdn9KdVOLm7FPBui0i9a0HpA60MsewVE4z8CAt5d401Gv6zXlIT5Ybit1VIA0FCs7wtvYreru1fUyW3oLAZ/+aTnZrOcYRNVA8spoRtlRoWflsRClFcgzkqiHOrf0/SVw+EpVaFlJ0g4Kxq1MMOmiQdpMNpte8lMMQqm6cIFXlnGbfJllysKDi+0JJMotkqgIxOSQgU9dn/lWkeVf8nUm3iwX2Nl3WDw9i6AUK3vBAbZZrcJpDQ/N64AVwjT07Jef30GSSmtNu2WlW7YoyW2FlWfZFQUwk867EdLYKk9VG6JgEnBiBxkY7LMo4YLQJJlAo9l/oTvJkSARDF/XtyAzM8O2t3eT/iXa6wDN3WewNmQHdPfsxChU/KtLG2Mn8i4ZqKdSlIaBZadxJmRzVS/o4yA65RTSViq60oa395Lqw0pzY4SipwE0SXXsKV+GZraGSkr/RW08wPRvqvSUkYBMA9lPx4m24az+IHmCbXA+0faxTRE9wuGeO06DIXa6QlKJ3puIyiuAVfPr736vzo2pBirS+Vxel3TMm3JKhz9o2ZoRvaFVpIkykb0Hcm4oHFBMcNSNj7/4GJt43ogonY2Vg4nsDQIWxAcorpXACzgBqQPjYsE/VUpXpwNManEru4NwMCFPkXvMoqvoeLN3qyu/N1eWEHttMD65v19l/0kH2mR35iv/FI+yjoHJ9gPMz67af3Mq/BoWXqu3rphiWMXVkmnPSEkpGpUI2h1MThideGFEOK6YZHPwYzMBvpNC7+ZHxPb7epfefGyIB4JzO9DTNEYnDLVVHdQyvOEVefrk6Uv5kTQYVYWWdqrdcIl7yljwwIWdfQ/y+2QB3eR/qxYObuYyB4gTbo2in4PzarU1sO9nETkmj9/AoxDA+JM3GMqQtJR4jtduHtnoCLxd1gQUscHRB/MoRYIEsP2pDZ9KvHgtlk1iTbWWbHhohwFEYX7y51fUV2nuUmnoUcqnWIQAAgl9LTVX+Bc0QGNEhChxHR4YjfE51PUdGfsSFE6ck7BL3/hTf9jLq4G1IafINxOLKeAtO7quulYvH5YOBc+zX7CrMgWnW47/jfRsWnJjYYoE7xMfWV2HN2iyIqLI';\nconst FENCED = new Map([[8217,\"apostrophe\"],[8260,\"fraction slash\"],[12539,\"middle dot\"]]);\nconst NSM_MAX = 4;\n\nfunction decode_arithmetic(bytes) {\r\n\tlet pos = 0;\r\n\tfunction u16() { return (bytes[pos++] << 8) | bytes[pos++]; }\r\n\t\r\n\t// decode the frequency table\r\n\tlet symbol_count = u16();\r\n\tlet total = 1;\r\n\tlet acc = [0, 1]; // first symbol has frequency 1\r\n\tfor (let i = 1; i < symbol_count; i++) {\r\n\t\tacc.push(total += u16());\r\n\t}\r\n\r\n\t// skip the sized-payload that the last 3 symbols index into\r\n\tlet skip = u16();\r\n\tlet pos_payload = pos;\r\n\tpos += skip;\r\n\r\n\tlet read_width = 0;\r\n\tlet read_buffer = 0; \r\n\tfunction read_bit() {\r\n\t\tif (read_width == 0) {\r\n\t\t\t// this will read beyond end of buffer\r\n\t\t\t// but (undefined|0) => zero pad\r\n\t\t\tread_buffer = (read_buffer << 8) | bytes[pos++];\r\n\t\t\tread_width = 8;\r\n\t\t}\r\n\t\treturn (read_buffer >> --read_width) & 1;\r\n\t}\r\n\r\n\tconst N = 31;\r\n\tconst FULL = 2**N;\r\n\tconst HALF = FULL >>> 1;\r\n\tconst QRTR = HALF >> 1;\r\n\tconst MASK = FULL - 1;\r\n\r\n\t// fill register\r\n\tlet register = 0;\r\n\tfor (let i = 0; i < N; i++) register = (register << 1) | read_bit();\r\n\r\n\tlet symbols = [];\r\n\tlet low = 0;\r\n\tlet range = FULL; // treat like a float\r\n\twhile (true) {\r\n\t\tlet value = Math.floor((((register - low + 1) * total) - 1) / range);\r\n\t\tlet start = 0;\r\n\t\tlet end = symbol_count;\r\n\t\twhile (end - start > 1) { // binary search\r\n\t\t\tlet mid = (start + end) >>> 1;\r\n\t\t\tif (value < acc[mid]) {\r\n\t\t\t\tend = mid;\r\n\t\t\t} else {\r\n\t\t\t\tstart = mid;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (start == 0) break; // first symbol is end mark\r\n\t\tsymbols.push(start);\r\n\t\tlet a = low + Math.floor(range * acc[start]   / total);\r\n\t\tlet b = low + Math.floor(range * acc[start+1] / total) - 1;\r\n\t\twhile (((a ^ b) & HALF) == 0) {\r\n\t\t\tregister = (register << 1) & MASK | read_bit();\r\n\t\t\ta = (a << 1) & MASK;\r\n\t\t\tb = (b << 1) & MASK | 1;\r\n\t\t}\r\n\t\twhile (a & ~b & QRTR) {\r\n\t\t\tregister = (register & HALF) | ((register << 1) & (MASK >>> 1)) | read_bit();\r\n\t\t\ta = (a << 1) ^ HALF;\r\n\t\t\tb = ((b ^ HALF) << 1) | HALF | 1;\r\n\t\t}\r\n\t\tlow = a;\r\n\t\trange = 1 + b - a;\r\n\t}\r\n\tlet offset = symbol_count - 4;\r\n\treturn symbols.map(x => { // index into payload\r\n\t\tswitch (x - offset) {\r\n\t\t\tcase 3: return offset + 0x10100 + ((bytes[pos_payload++] << 16) | (bytes[pos_payload++] << 8) | bytes[pos_payload++]);\r\n\t\t\tcase 2: return offset + 0x100 + ((bytes[pos_payload++] << 8) | bytes[pos_payload++]);\r\n\t\t\tcase 1: return offset + bytes[pos_payload++];\r\n\t\t\tdefault: return x - 1;\r\n\t\t}\r\n\t});\r\n}\t\r\n\r\n// returns an iterator which returns the next symbol\r\nfunction read_payload(v) {\r\n\tlet pos = 0;\r\n\treturn () => v[pos++];\r\n}\r\nfunction read_compressed_payload(s) {\r\n\treturn read_payload(decode_arithmetic(unsafe_atob(s)));\r\n}\r\n\r\n// unsafe in the sense:\r\n// expected well-formed Base64 w/o padding \r\n// 20220922: added for https://github.com/adraffy/ens-normalize.js/issues/4\r\nfunction unsafe_atob(s) {\r\n\tlet lookup = [];\r\n\t[...'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'].forEach((c, i) => lookup[c.charCodeAt(0)] = i);\r\n\tlet n = s.length;\r\n\tlet ret = new Uint8Array((6 * n) >> 3);\r\n\tfor (let i = 0, pos = 0, width = 0, carry = 0; i < n; i++) {\r\n\t\tcarry = (carry << 6) | lookup[s.charCodeAt(i)];\r\n\t\twidth += 6;\r\n\t\tif (width >= 8) {\r\n\t\t\tret[pos++] = (carry >> (width -= 8));\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n// eg. [0,1,2,3...] => [0,-1,1,-2,...]\r\nfunction signed(i) { \r\n\treturn (i & 1) ? (~i >> 1) : (i >> 1);\r\n}\r\n\r\nfunction read_deltas(n, next) {\r\n\tlet v = Array(n);\r\n\tfor (let i = 0, x = 0; i < n; i++) v[i] = x += signed(next());\r\n\treturn v;\r\n}\r\n\r\n// [123][5] => [0 3] [1 1] [0 0]\r\nfunction read_sorted(next, prev = 0) {\r\n\tlet ret = [];\r\n\twhile (true) {\r\n\t\tlet x = next();\r\n\t\tlet n = next();\r\n\t\tif (!n) break;\r\n\t\tprev += x;\r\n\t\tfor (let i = 0; i < n; i++) {\r\n\t\t\tret.push(prev + i);\r\n\t\t}\r\n\t\tprev += n + 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction read_sorted_arrays(next) {\r\n\treturn read_array_while(() => { \r\n\t\tlet v = read_sorted(next);\r\n\t\tif (v.length) return v;\r\n\t});\r\n}\r\n\r\n// returns map of x => ys\r\nfunction read_mapped(next) {\r\n\tlet ret = [];\r\n\twhile (true) {\r\n\t\tlet w = next();\r\n\t\tif (w == 0) break;\r\n\t\tret.push(read_linear_table(w, next));\r\n\t}\r\n\twhile (true) {\r\n\t\tlet w = next() - 1;\r\n\t\tif (w < 0) break;\r\n\t\tret.push(read_replacement_table(w, next));\r\n\t}\r\n\treturn ret.flat();\r\n}\r\n\r\n// read until next is falsy\r\n// return array of read values\r\nfunction read_array_while(next) {\r\n\tlet v = [];\r\n\twhile (true) {\r\n\t\tlet x = next(v.length);\r\n\t\tif (!x) break;\r\n\t\tv.push(x);\r\n\t}\r\n\treturn v;\r\n}\r\n\r\n// read w columns of length n\r\n// return as n rows of length w\r\nfunction read_transposed(n, w, next) {\r\n\tlet m = Array(n).fill().map(() => []);\r\n\tfor (let i = 0; i < w; i++) {\r\n\t\tread_deltas(n, next).forEach((x, j) => m[j].push(x));\r\n\t}\r\n\treturn m;\r\n}\r\n \r\n// returns [[x, ys], [x+dx, ys+dy], [x+2*dx, ys+2*dy], ...]\r\n// where dx/dy = steps, n = run size, w = length of y\r\nfunction read_linear_table(w, next) {\r\n\tlet dx = 1 + next();\r\n\tlet dy = next();\r\n\tlet vN = read_array_while(next);\r\n\tlet m = read_transposed(vN.length, 1+w, next);\r\n\treturn m.flatMap((v, i) => {\r\n\t\tlet [x, ...ys] = v;\r\n\t\treturn Array(vN[i]).fill().map((_, j) => {\r\n\t\t\tlet j_dy = j * dy;\r\n\t\t\treturn [x + j * dx, ys.map(y => y + j_dy)];\r\n\t\t});\r\n\t});\r\n}\r\n\r\n// return [[x, ys...], ...]\r\n// where w = length of y\r\nfunction read_replacement_table(w, next) { \r\n\tlet n = 1 + next();\r\n\tlet m = read_transposed(n, 1+w, next);\r\n\treturn m.map(v => [v[0], v.slice(1)]);\r\n}\r\n\r\n\r\nfunction read_trie(next) {\r\n\tlet ret = [];\r\n\tlet sorted = read_sorted(next); \r\n\texpand(decode([]), []);\r\n\treturn ret; // not sorted\r\n\tfunction decode(Q) { // characters that lead into this node\r\n\t\tlet S = next(); // state: valid, save, check\r\n\t\tlet B = read_array_while(() => { // buckets leading to new nodes\r\n\t\t\tlet cps = read_sorted(next).map(i => sorted[i]);\r\n\t\t\tif (cps.length) return decode(cps);\r\n\t\t});\r\n\t\treturn {S, B, Q};\r\n\t}\r\n\tfunction expand({S, B}, cps, saved) {\r\n\t\tif (S & 4 && saved === cps[cps.length-1]) return;\r\n\t\tif (S & 2) saved = cps[cps.length-1];\r\n\t\tif (S & 1) ret.push(cps); \r\n\t\tfor (let br of B) {\r\n\t\t\tfor (let cp of br.Q) {\r\n\t\t\t\texpand(br, [...cps, cp], saved);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\n\nfunction hex_cp(cp) {\r\n\treturn cp.toString(16).toUpperCase().padStart(2, '0');\r\n}\r\n\r\nfunction quote_cp(cp) {\r\n\treturn `{${hex_cp(cp)}}`; // raffy convention: like \"\\u{X}\" w/o the \"\\u\"\r\n}\r\n\r\n/*\r\nexport function explode_cp(s) {\r\n\treturn [...s].map(c => c.codePointAt(0));\r\n}\r\n*/\r\nfunction explode_cp(s) { // this is about 2x faster\r\n\tlet cps = [];\r\n\tfor (let pos = 0, len = s.length; pos < len; ) {\r\n\t\tlet cp = s.codePointAt(pos);\r\n\t\tpos += cp < 0x10000 ? 1 : 2;\r\n\t\tcps.push(cp);\r\n\t}\r\n\treturn cps;\r\n}\r\n\r\nfunction str_from_cps(cps) {\r\n\tconst chunk = 4096;\r\n\tlet len = cps.length;\r\n\tif (len < chunk) return String.fromCodePoint(...cps);\r\n\tlet buf = [];\r\n\tfor (let i = 0; i < len; ) {\r\n\t\tbuf.push(String.fromCodePoint(...cps.slice(i, i += chunk)));\r\n\t}\r\n\treturn buf.join('');\r\n}\r\n\r\nfunction compare_arrays(a, b) {\r\n\tlet n = a.length;\r\n\tlet c = n - b.length;\r\n\tfor (let i = 0; c == 0 && i < n; i++) c = a[i] - b[i];\r\n\treturn c;\r\n}\n\n// created 2023-09-25T01:01:55.148Z\n// compressed base64-encoded blob for include-nf data\n// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js\n// see: https://github.com/adraffy/ens-normalize.js#security\n// SHA-256: a974b6f8541fc29d919bc85118af0a44015851fab5343f8679cb31be2bdb209e\nvar COMPRESSED = 'AEUDTAHBCFQATQDRADAAcgAgADQAFAAsABQAHwAOACQADQARAAoAFwAHABIACAAPAAUACwAFAAwABAAQAAMABwAEAAoABQAIAAIACgABAAQAFAALAAIACwABAAIAAQAHAAMAAwAEAAsADAAMAAwACgANAA0AAwAKAAkABAAdAAYAZwDSAdsDJgC0CkMB8xhZAqfoC190UGcThgBurwf7PT09Pb09AjgJum8OjDllxHYUKXAPxzq6tABAxgK8ysUvWAgMPT09PT09PSs6LT2HcgWXWwFLoSMEEEl5RFVMKvO0XQ8ExDdJMnIgsj26PTQyy8FfEQ8AY8IPAGcEbwRwBHEEcgRzBHQEdQR2BHcEeAR6BHsEfAR+BIAEgfndBQoBYgULAWIFDAFiBNcE2ATZBRAFEQUvBdALFAsVDPcNBw13DYcOMA4xDjMB4BllHI0B2grbAMDpHLkQ7QHVAPRNQQFnGRUEg0yEB2uaJF8AJpIBpob5AERSMAKNoAXqaQLUBMCzEiACnwRZEkkVsS7tANAsBG0RuAQLEPABv9HICTUBXigPZwRBApMDOwAamhtaABqEAY8KvKx3LQ4ArAB8UhwEBAVSagD8AEFZADkBIadVj2UMUgx5Il4ANQC9AxIB1BlbEPMAs30CGxlXAhwZKQIECBc6EbsCoxngzv7UzRQA8M0BawL6ZwkN7wABAD33OQRcsgLJCjMCjqUChtw/km+NAsXPAoP2BT84PwURAK0RAvptb6cApQS/OMMey5HJS84UdxpxTPkCogVFITaTOwERAK5pAvkNBOVyA7q3BKlOJSALAgUIBRcEdASpBXqzABXFSWZOawLCOqw//AolCZdvv3dSBkEQGyelEPcMMwG1ATsN7UvYBPEGOwTJH30ZGQ/NlZwIpS3dDO0m4y6hgFoj9SqDBe1L9DzdC01RaA9ZC2UJ4zpjgU4DIQENIosK3Q05CG0Q8wrJaw3lEUUHOQPVSZoApQcBCxEdNRW1JhBirAsJOXcG+xr2C48mrxMpevwF0xohBk0BKRr/AM8u54WwWjFcHE9fBgMLJSPHFKhQIA0lQLd4SBobBxUlqQKRQ3BKh1E2HpMh9jw9DWYuE1F8B/U8BRlPC4E8nkarRQ4R0j6NPUgiSUwsBDV/LC8niwnPD4UMuXxyAVkJIQmxDHETMREXN8UIOQcZLZckJxUIIUaVYJoE958D8xPRAwsFPwlBBxMDtRwtEy4VKQUNgSTXAvM21S6zAo9WgAEXBcsPJR/fEFBH4A7pCJsCZQODJesALRUhABcimwhDYwBfj9hTBS7LCMdqbCN0A2cU52ERcweRDlcHpxwzFb8c4XDIXguGCCijrwlbAXUJmQFfBOMICTVbjKAgQWdTi1gYmyBhQT9d/AIxDGUVn0S9h3gCiw9rEhsBNQFzBzkNAQJ3Ee0RaxCVCOuGBDW1M/g6JQRPIYMgEQonA09szgsnJvkM+GkBoxJiAww0PXfuZ6tgtiQX/QcZMsVBYCHxC5JPzQycGsEYQlQuGeQHvwPzGvMn6kFXBf8DowMTOk0z7gS9C2kIiwk/AEkOoxcH1xhqCnGM0AExiwG3mQNXkYMCb48GNwcLAGcLhwV55QAdAqcIowAFAM8DVwA5Aq0HnQAZAIVBAT0DJy8BIeUCjwOTCDHLAZUvAfMpBBvDDBUA9zduSgLDsQKAamaiBd1YAo4CSTUBTSUEBU5HUQOvceEA2wBLBhPfRwEVq0rLGuNDAd9vKwDHAPsABTUHBUEBzQHzbQC3AV8LMQmis7UBTekpAIMAFWsB1wKJAN0ANQB/8QFTAE0FWfkF0wJPSQERMRgrV2EBuwMfATMBDQB5BsuNpckHHwRtB9MCEBsV4QLvLge1AQMi3xPNQsUCvd5VoWACZIECYkJbTa9bNyACofcCaJgCZgkCn4Q4GwsCZjsCZiYEbgR/A38TA36SOQY5dxc5gjojIwJsHQIyNjgKAm3HAm2u74ozZ0UrAWcA3gDhAEoFB5gMjQD+C8IADbUCdy8CdqI/AnlLQwJ4uh1c20WuRtcCfD8CesgCfQkCfPAFWQUgSABIfWMkAoFtAoAAAoAFAn+uSVhKWxUXSswC0QEC0MxLJwOITwOH5kTFkTIC8qFdAwMDrkvOTC0lA89NTE2vAos/AorYwRsHHUNnBbcCjjcCjlxAl4ECjtkCjlx4UbRTNQpS1FSFApP7ApMMAOkAHFUeVa9V0AYsGymVhjLheGZFOzkCl58C77JYIagAWSUClo8ClnycAKlZrFoJgU0AOwKWtQKWTlxEXNECmcsCmWRcyl0HGQKcmznCOp0CnBYCn5sCnriKAB0PMSoPAp3xAp6SALU9YTRh7wKe0wKgbgGpAp6fHwKeTqVjyGQnJSsCJ68CJn4CoPsCoEwCot0CocQCpi8Cpc4Cp/8AfQKn8mh8aLEAA0lqHGrRAqzjAqyuAq1nAq0CAlcdAlXcArHh1wMfTmyXArK9DQKy6Bds4G1jbUhfAyXNArZcOz9ukAMpRQK4XgK5RxUCuSp3cDZw4QK9GQK72nCWAzIRAr6IcgIDM3ECvhpzInNPAsPLAsMEc4J0SzVFdOADPKcDPJoDPb8CxXwCxkcCxhCJAshpUQLIRALJTwLJLgJknQLd0nh5YXiueSVL0AMYo2cCAmH0GfOVJHsLXpJeuxECz2sCz2wvS1PS8xOfAMatAs9zASnqA04SfksFAtwnAtuKAtJPA1JcA1NfAQEDVYyAiT8AyxbtYEWCHILTgs6DjQLaxwLZ3oQQhEmnPAOGpQAvA2QOhnFZ+QBVAt9lAt64c3cC4i/tFAHzMCcB9JsB8tKHAuvzAulweQLq+QLq5AD5RwG5Au6JAuuclqqXAwLuPwOF4Jh5cOBxoQLzAwBpA44WmZMC9xMDkW4DkocC95gC+dkC+GaaHJqruzebHgOdgwL++gEbADmfHJ+zAwWNA6ZqA6bZANHFAwZqoYiiBQkDDEkCwAA/AwDhQRdTARHzA2sHl2cFAJMtK7evvdsBiZkUfxEEOQH7KQUhDp0JnwCS/SlXxQL3AZ0AtwW5AG8LbUEuFCaNLgFDAYD8AbUmAHUDDgRtACwCFgyhAAAKAj0CagPdA34EkQEgRQUhfAoABQBEABMANhICdwEABdUDa+8KxQIA9wqfJ7+xt+UBkSFBQgHpFH8RNMCJAAQAGwBaAkUChIsABjpTOpSNbQC4Oo860ACNOME63AClAOgAywE6gTo7Ofw5+Tt2iTpbO56JOm85GAFWATMBbAUvNV01njWtNWY1dTW2NcU1gjWRNdI14TWeNa017jX9NbI1wTYCNhE1xjXVNhY2JzXeNe02LjY9Ni41LSE2OjY9Njw2yTcIBJA8VzY4Nt03IDcPNsogN4k3MAoEsDxnNiQ3GTdsOo03IULUQwdC4EMLHA8PCZsobShRVQYA6X8A6bABFCnXAukBowC9BbcAbwNzBL8MDAMMAQgDAAkKCwsLCQoGBAVVBI/DvwDz9b29kaUCb0QtsRTNLt4eGBcSHAMZFhYZEhYEARAEBUEcQRxBHEEcQRxBHEEaQRxBHEFCSTxBPElISUhBNkM2QTYbNklISVmBVIgBFLWZAu0BhQCjBcEAbykBvwGJAaQcEZ0ePCklMAAhMvAIMAL54gC7Bm8EescjzQMpARQpKgDUABavAj626xQAJP0A3etzuf4NNRA7efy2Z9NQrCnC0OSyANz5BBIbJ5IFDR6miIavYS6tprjjmuKebxm5C74Q225X1pkaYYPb6f1DK4k3xMEBb9S2WMjEibTNWhsRJIA+vwNVEiXTE5iXs/wezV66oFLfp9NZGYW+Gk19J2+bCT6Ye2w6LDYdgzKMUabk595eLBCXANz9HUpWbATq9vqXVx9XDg+Pc9Xp4+bsS005SVM/BJBM4687WUuf+Uj9dEi8aDNaPxtpbDxcG1THTImUMZq4UCaaNYpsVqraNyKLJXDYsFZ/5jl7bLRtO88t7P3xZaAxhb5OdPMXqsSkp1WCieG8jXm1U99+blvLlXzPCS+M93VnJCiK+09LfaSaBAVBomyDgJua8dfUzR7ga34IvR2Nvj+A9heJ6lsl1KG4NkI1032Cnff1m1wof2B9oHJK4bi6JkEdSqeNeiuo6QoZZincoc73/TH9SXF8sCE7XyuYyW8WSgbGFCjPV0ihLKhdPs08Tx82fYAkLLc4I2wdl4apY7GU5lHRFzRWJep7Ww3wbeA3qmd59/86P4xuNaqDpygXt6M85glSBHOCGgJDnt+pN9bK7HApMguX6+06RZNjzVmcZJ+wcUrJ9//bpRNxNuKpNl9uFds+S9tdx7LaM5ZkIrPj6nIU9mnbFtVbs9s/uLgl8MVczAwet+iOEzzBlYW7RCMgE6gyNLeq6+1tIx4dpgZnd0DksJS5f+JNDpwwcPNXaaVspq1fbQajOrJgK0ofKtJ1Ne90L6VO4MOl5S886p7u6xo7OLjG8TGL+HU1JXGJgppg4nNbNJ5nlzSpuPYy21JUEcUA94PoFiZfjZue+QnyQ80ekOuZVkxx4g+cvhJfHgNl4hy1/a6+RKcKlar/J29y//EztlbVPHVUeQ1zX86eQVAjR/M3dA9w4W8LfaXp4EgM85wOWasli837PzVMOnsLzR+k3o75/lRPAJSE1xAKQzEi5v10ke+VBvRt1cwQRMd+U5mLCTGVd6XiZtgBG5cDi0w22GKcVNvHiu5LQbZEDVtz0onn7k5+heuKXVsZtSzilkLRAUmjMXEMB3J9YC50XBxPiz53SC+EhnPl9WsKCv92SM/OFFIMJZYfl0WW8tIO3UxYcwdMAj7FSmgrsZ2aAZO03BOhP1bNNZItyXYQFTpC3SG1VuPDqH9GkiCDmE+JwxyIVSO5siDErAOpEXFgjy6PQtOVDj+s6e1r8heWVvmZnTciuf4EiNZzCAd7SOMhXERIOlsHIMG399i9aLTy3m2hRLZjJVDNLS53iGIK11dPqQt0zBDyg6qc7YqkDm2M5Ve6dCWCaCbTXX2rToaIgz6+zh4lYUi/+6nqcFMAkQJKHYLK0wYk5N9szV6xihDbDDFr45lN1K4aCXBq/FitPSud9gLt5ZVn+ZqGX7cwm2z5EGMgfFpIFyhGGuDPmso6TItTMwny+7uPnLCf4W6goFQFV0oQSsc9VfMmVLcLr6ZetDZbaSFTLqnSO/bIPjA3/zAUoqgGFAEQS4IhuMzEp2I3jJzbzkk/IEmyax+rhZTwd6f+CGtwPixu8IvzACquPWPREu9ZvGkUzpRwvRRuaNN6cr0W1wWits9ICdYJ7ltbgMiSL3sTPeufgNcVqMVWFkCPDH4jG2jA0XcVgQj62Cb29v9f/z/+2KbYvIv/zzjpQAPkliaVDzNrW57TZ/ZOyZD0nlfMmAIBIAGAI0D3k/mdN4xr9v85ZbZbbqfH2jGd5hUqNZWwl5SPfoGmfElmazUIeNL1j/mkF7VNAzTq4jNt8JoQ11NQOcmhprXoxSxfRGJ9LDEOAQ+dmxAQH90iti9e2u/MoeuaGcDTHoC+xsmEeWmxEKefQuIzHbpw5Tc5cEocboAD09oipWQhtTO1wivf/O+DRe2rpl/E9wlrzBorjJsOeG1B/XPW4EaJEFdNlECEZga5ZoGRHXgYouGRuVkm8tDESiEyFNo+3s5M5puSdTyUL2llnINVHEt91XUNW4ewdMgJ4boJfEyt/iY5WXqbA+A2Fkt5Z0lutiWhe9nZIyIUjyXDC3UsaG1t+eNx6z4W/OYoTB7A6x+dNSTOi9AInctbESqm5gvOLww7OWXPrmHwVZasrl4eD113pm+JtT7JVOvnCXqdzzdTRHgJ0PiGTFYW5Gvt9R9LD6Lzfs0v/TZZHSmyVNq7viIHE6DBK7Qp07Iz55EM8SYtQvZf/obBniTWi5C2/ovHfw4VndkE5XYdjOhCMRjDeOEfXeN/CwfGduiUIfsoFeUxXeQXba7c7972XNv8w+dTjjUM0QeNAReW+J014dKAD/McQYXT7c0GQPIkn3Ll6R7gGjuiQoZD0TEeEqQpKoZ15g/0OPQI17QiSv9AUROa/V/TQN3dvLArec3RrsYlvBm1b8LWzltdugsC50lNKYLEp2a+ZZYqPejULRlOJh5zj/LVMyTDvwKhMxxwuDkxJ1QpoNI0OTWLom4Z71SNzI9TV1iXJrIu9Wcnd+MCaAw8o1jSXd94YU/1gnkrC9BUEOtQvEIQ7g0i6h+KL2JKk8Ydl7HruvgWMSAmNe+LshGhV4qnWHhO9/RIPQzY1tHRj2VqOyNsDpK0cww+56AdDC4gsWwY0XxoucIWIqs/GcwnWqlaT0KPr8mbK5U94/301i1WLt4YINTVvCFBrFZbIbY8eycOdeJ2teD5IfPLCRg7jjcFTwlMFNl9zdh/o3E/hHPwj7BWg0MU09pPrBLbrCgm54A6H+I6v27+jL5gkjWg/iYdks9jbfVP5y/n0dlgWEMlKasl7JvFZd56LfybW1eeaVO0gxTfXZwD8G4SI116yx7UKVRgui6Ya1YpixqXeNLc8IxtAwCU5IhwQgn+NqHnRaDv61CxKhOq4pOX7M6pkA+Pmpd4j1vn6ACUALoLLc4vpXci8VidLxzm7qFBe7s+quuJs6ETYmnpgS3LwSZxPIltgBDXz8M1k/W2ySNv2f9/NPhxLGK2D21dkHeSGmenRT3Yqcdl0m/h3OYr8V+lXNYGf8aCCpd4bWjE4QIPj7vUKN4Nrfs7ML6Y2OyS830JCnofg/k7lpFpt4SqZc5HGg1HCOrHvOdC8bP6FGDbE/VV0mX4IakzbdS/op+Kt3G24/8QbBV7y86sGSQ/vZzU8FXs7u6jIvwchsEP2BpIhW3G8uWNwa3HmjfH/ZjhhCWvluAcF+nMf14ClKg5hGgtPLJ98ueNAkc5Hs2WZlk2QHvfreCK1CCGO6nMZVSb99VM/ajr8WHTte9JSmkXq/i/U943HEbdzW6Re/S88dKgg8pGOLlAeNiqrcLkUR3/aClFpMXcOUP3rmETcWSfMXZE3TUOi8i+fqRnTYLflVx/Vb/6GJ7eIRZUA6k3RYR3iFSK9c4iDdNwJuZL2FKz/IK5VimcNWEqdXjSoxSgmF0UPlDoUlNrPcM7ftmA8Y9gKiqKEHuWN+AZRIwtVSxye2Kf8rM3lhJ5XcBXU9n4v0Oy1RU2M+4qM8AQPVwse8ErNSob5oFPWxuqZnVzo1qB/IBxkM3EVUKFUUlO3e51259GgNcJbCmlvrdjtoTW7rChm1wyCKzpCTwozUUEOIcWLneRLgMXh+SjGSFkAllzbGS5HK7LlfCMRNRDSvbQPjcXaenNYxCvu2Qyznz6StuxVj66SgI0T8B6/sfHAJYZaZ78thjOSIFumNWLQbeZixDCCC+v0YBtkxiBB3jefHqZ/dFHU+crbj6OvS1x/JDD7vlm7zOVPwpUC01nhxZuY/63E7g';\n\n// https://unicode.org/reports/tr15/\r\n// for reference implementation\r\n// see: /derive/nf.js\r\n\r\n\r\n// algorithmic hangul\r\n// https://www.unicode.org/versions/Unicode15.0.0/ch03.pdf (page 144)\r\nconst S0 = 0xAC00;\r\nconst L0 = 0x1100;\r\nconst V0 = 0x1161;\r\nconst T0 = 0x11A7;\r\nconst L_COUNT = 19;\r\nconst V_COUNT = 21;\r\nconst T_COUNT = 28;\r\nconst N_COUNT = V_COUNT * T_COUNT;\r\nconst S_COUNT = L_COUNT * N_COUNT;\r\nconst S1 = S0 + S_COUNT;\r\nconst L1 = L0 + L_COUNT;\r\nconst V1 = V0 + V_COUNT;\r\nconst T1 = T0 + T_COUNT;\r\n\r\nfunction unpack_cc(packed) {\r\n\treturn (packed >> 24) & 0xFF;\r\n}\r\nfunction unpack_cp(packed) {\r\n\treturn packed & 0xFFFFFF;\r\n}\r\n\r\nlet SHIFTED_RANK, EXCLUSIONS, DECOMP, RECOMP;\r\n\r\nfunction init$1() {\r\n\t//console.time('nf');\r\n\tlet r = read_compressed_payload(COMPRESSED);\r\n\tSHIFTED_RANK = new Map(read_sorted_arrays(r).flatMap((v, i) => v.map(x => [x, (i+1) << 24]))); // pre-shifted\r\n\tEXCLUSIONS = new Set(read_sorted(r));\r\n\tDECOMP = new Map();\r\n\tRECOMP = new Map();\r\n\tfor (let [cp, cps] of read_mapped(r)) {\r\n\t\tif (!EXCLUSIONS.has(cp) && cps.length == 2) {\r\n\t\t\tlet [a, b] = cps;\r\n\t\t\tlet bucket = RECOMP.get(a);\r\n\t\t\tif (!bucket) {\r\n\t\t\t\tbucket = new Map();\r\n\t\t\t\tRECOMP.set(a, bucket);\r\n\t\t\t}\r\n\t\t\tbucket.set(b, cp);\r\n\t\t}\r\n\t\tDECOMP.set(cp, cps.reverse()); // stored reversed\r\n\t}\r\n\t//console.timeEnd('nf');\r\n\t// 20230905: 11ms\r\n}\r\n\r\nfunction is_hangul(cp) {\r\n\treturn cp >= S0 && cp < S1;\r\n}\r\n\r\nfunction compose_pair(a, b) {\r\n\tif (a >= L0 && a < L1 && b >= V0 && b < V1) {\r\n\t\treturn S0 + (a - L0) * N_COUNT + (b - V0) * T_COUNT;\r\n\t} else if (is_hangul(a) && b > T0 && b < T1 && (a - S0) % T_COUNT == 0) {\r\n\t\treturn a + (b - T0);\r\n\t} else {\r\n\t\tlet recomp = RECOMP.get(a);\r\n\t\tif (recomp) {\r\n\t\t\trecomp = recomp.get(b);\r\n\t\t\tif (recomp) {\r\n\t\t\t\treturn recomp;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn -1;\r\n\t}\r\n}\r\n\r\nfunction decomposed(cps) {\r\n\tif (!SHIFTED_RANK) init$1();\r\n\tlet ret = [];\r\n\tlet buf = [];\r\n\tlet check_order = false;\r\n\tfunction add(cp) {\r\n\t\tlet cc = SHIFTED_RANK.get(cp);\r\n\t\tif (cc) {\r\n\t\t\tcheck_order = true;\r\n\t\t\tcp |= cc;\r\n\t\t}\r\n\t\tret.push(cp);\r\n\t}\r\n\tfor (let cp of cps) {\r\n\t\twhile (true) {\r\n\t\t\tif (cp < 0x80) {\r\n\t\t\t\tret.push(cp);\r\n\t\t\t} else if (is_hangul(cp)) {\r\n\t\t\t\tlet s_index = cp - S0;\r\n\t\t\t\tlet l_index = s_index / N_COUNT | 0;\r\n\t\t\t\tlet v_index = (s_index % N_COUNT) / T_COUNT | 0;\r\n\t\t\t\tlet t_index = s_index % T_COUNT;\r\n\t\t\t\tadd(L0 + l_index);\r\n\t\t\t\tadd(V0 + v_index);\r\n\t\t\t\tif (t_index > 0) add(T0 + t_index);\r\n\t\t\t} else {\r\n\t\t\t\tlet mapped = DECOMP.get(cp);\r\n\t\t\t\tif (mapped) {\r\n\t\t\t\t\tbuf.push(...mapped);\r\n\t\t\t\t} else {\r\n\t\t\t\t\tadd(cp);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (!buf.length) break;\r\n\t\t\tcp = buf.pop();\r\n\t\t}\r\n\t}\r\n\tif (check_order && ret.length > 1) {\r\n\t\tlet prev_cc = unpack_cc(ret[0]);\r\n\t\tfor (let i = 1; i < ret.length; i++) {\r\n\t\t\tlet cc = unpack_cc(ret[i]);\r\n\t\t\tif (cc == 0 || prev_cc <= cc) {\r\n\t\t\t\tprev_cc = cc;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tlet j = i-1;\r\n\t\t\twhile (true) {\r\n\t\t\t\tlet tmp = ret[j+1];\r\n\t\t\t\tret[j+1] = ret[j];\r\n\t\t\t\tret[j] = tmp;\r\n\t\t\t\tif (!j) break;\r\n\t\t\t\tprev_cc = unpack_cc(ret[--j]);\r\n\t\t\t\tif (prev_cc <= cc) break;\r\n\t\t\t}\r\n\t\t\tprev_cc = unpack_cc(ret[i]);\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction composed_from_decomposed(v) {\r\n\tlet ret = [];\r\n\tlet stack = [];\r\n\tlet prev_cp = -1;\r\n\tlet prev_cc = 0;\r\n\tfor (let packed of v) {\r\n\t\tlet cc = unpack_cc(packed);\r\n\t\tlet cp = unpack_cp(packed);\r\n\t\tif (prev_cp == -1) {\r\n\t\t\tif (cc == 0) {\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tret.push(cp);\r\n\t\t\t}\r\n\t\t} else if (prev_cc > 0 && prev_cc >= cc) {\r\n\t\t\tif (cc == 0) {\r\n\t\t\t\tret.push(prev_cp, ...stack);\r\n\t\t\t\tstack.length = 0;\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tstack.push(cp);\r\n\t\t\t}\r\n\t\t\tprev_cc = cc;\r\n\t\t} else {\r\n\t\t\tlet composed = compose_pair(prev_cp, cp);\r\n\t\t\tif (composed >= 0) {\r\n\t\t\t\tprev_cp = composed;\r\n\t\t\t} else if (prev_cc == 0 && cc == 0) {\r\n\t\t\t\tret.push(prev_cp);\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tstack.push(cp);\r\n\t\t\t\tprev_cc = cc;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (prev_cp >= 0) {\r\n\t\tret.push(prev_cp, ...stack);\t\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n// note: cps can be iterable\r\nfunction nfd(cps) {\r\n\treturn decomposed(cps).map(unpack_cp);\r\n}\r\nfunction nfc(cps) {\r\n\treturn composed_from_decomposed(decomposed(cps));\r\n}\n\nconst HYPHEN = 0x2D;\r\nconst STOP = 0x2E;\r\nconst STOP_CH = '.';\r\nconst FE0F = 0xFE0F;\r\nconst UNIQUE_PH = 1;\r\n\r\n// 20230913: replace [...v] with Array_from(v) to avoid large spreads\r\nconst Array_from = x => Array.from(x); // Array.from.bind(Array);\r\n\r\nfunction group_has_cp(g, cp) {\r\n\t// 20230913: keep primary and secondary distinct instead of creating valid union\r\n\treturn g.P.has(cp) || g.Q.has(cp);\r\n}\r\n\r\nclass Emoji extends Array {\r\n\tget is_emoji() { return true; } // free tagging system\r\n}\r\n\r\nlet MAPPED, IGNORED, CM, NSM, ESCAPE, NFC_CHECK, GROUPS, WHOLE_VALID, WHOLE_MAP, VALID, EMOJI_LIST, EMOJI_ROOT;\r\n\r\nfunction init() {\r\n\tif (MAPPED) return;\r\n\t\r\n\tlet r = read_compressed_payload(COMPRESSED$1);\r\n\tconst read_sorted_array = () => read_sorted(r);\r\n\tconst read_sorted_set = () => new Set(read_sorted_array());\r\n\tconst set_add_many = (set, v) => v.forEach(x => set.add(x));\r\n\r\n\tMAPPED = new Map(read_mapped(r)); \r\n\tIGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints\r\n\r\n\t/*\r\n\t// direct include from payload is smaller than the decompression code\r\n\tconst FENCED = new Map(read_array_while(() => {\r\n\t\tlet cp = r();\r\n\t\tif (cp) return [cp, read_str(r())];\r\n\t}));\r\n\t*/\r\n\t// 20230217: we still need all CM for proper error formatting\r\n\t// but norm only needs NSM subset that are potentially-valid\r\n\tCM = read_sorted_array();\r\n\tNSM = new Set(read_sorted_array().map(i => CM[i]));\r\n\tCM = new Set(CM);\r\n\t\r\n\tESCAPE = read_sorted_set(); // characters that should not be printed\r\n\tNFC_CHECK = read_sorted_set(); // only needed to illustrate ens_tokenize() transformations\r\n\r\n\tlet chunks = read_sorted_arrays(r);\r\n\tlet unrestricted = r();\r\n\t//const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));\r\n\tconst read_chunked = () => {\r\n\t\t// 20230921: build set in parts, 2x faster\r\n\t\tlet set = new Set();\r\n\t\tread_sorted_array().forEach(i => set_add_many(set, chunks[i]));\r\n\t\tset_add_many(set, read_sorted_array());\r\n\t\treturn set; \r\n\t};\r\n\tGROUPS = read_array_while(i => {\r\n\t\t// minifier property mangling seems unsafe\r\n\t\t// so these are manually renamed to single chars\r\n\t\tlet N = read_array_while(r).map(x => x+0x60);\r\n\t\tif (N.length) {\r\n\t\t\tlet R = i >= unrestricted; // unrestricted then restricted\r\n\t\t\tN[0] -= 32; // capitalize\r\n\t\t\tN = str_from_cps(N);\r\n\t\t\tif (R) N=`Restricted[${N}]`;\r\n\t\t\tlet P = read_chunked(); // primary\r\n\t\t\tlet Q = read_chunked(); // secondary\r\n\t\t\tlet M = !r(); // not-whitelisted, check for NSM\r\n\t\t\t// *** this code currently isn't needed ***\r\n\t\t\t/*\r\n\t\t\tlet V = [...P, ...Q].sort((a, b) => a-b); // derive: sorted valid\r\n\t\t\tlet M = r()-1; // number of combining mark\r\n\t\t\tif (M < 0) { // whitelisted\r\n\t\t\t\tM = new Map(read_array_while(() => {\r\n\t\t\t\t\tlet i = r();\r\n\t\t\t\t\tif (i) return [V[i-1], read_array_while(() => {\r\n\t\t\t\t\t\tlet v = read_array_while(r);\r\n\t\t\t\t\t\tif (v.length) return v.map(x => x-1);\r\n\t\t\t\t\t})];\r\n\t\t\t\t}));\r\n\t\t\t}*/\r\n\t\t\treturn {N, P, Q, M, R};\r\n\t\t}\r\n\t});\r\n\r\n\t// decode compressed wholes\r\n\tWHOLE_VALID = read_sorted_set();\r\n\tWHOLE_MAP = new Map();\r\n\tlet wholes = read_sorted_array().concat(Array_from(WHOLE_VALID)).sort((a, b) => a-b); // must be sorted\r\n\twholes.forEach((cp, i) => {\r\n\t\tlet d = r(); \r\n\t\tlet w = wholes[i] = d ? wholes[i-d] : {V: [], M: new Map()};\r\n\t\tw.V.push(cp); // add to member set\r\n\t\tif (!WHOLE_VALID.has(cp)) {\r\n\t\t\tWHOLE_MAP.set(cp, w);  // register with whole map\r\n\t\t}\r\n\t});\r\n\r\n\t// compute confusable-extent complements\r\n\t// usage: WHOLE_MAP.get(cp).M.get(cp) = complement set\r\n\tfor (let {V, M} of new Set(WHOLE_MAP.values())) {\r\n\t\t// connect all groups that have each whole character\r\n\t\tlet recs = [];\r\n\t\tfor (let cp of V) {\r\n\t\t\tlet gs = GROUPS.filter(g => group_has_cp(g, cp));\r\n\t\t\tlet rec = recs.find(({G}) => gs.some(g => G.has(g)));\r\n\t\t\tif (!rec) {\r\n\t\t\t\trec = {G: new Set(), V: []};\r\n\t\t\t\trecs.push(rec);\r\n\t\t\t}\r\n\t\t\trec.V.push(cp);\r\n\t\t\tset_add_many(rec.G, gs);\r\n\t\t}\r\n\t\t// per character cache groups which are not a member of the extent\r\n\t\tlet union = recs.flatMap(x => Array_from(x.G)); // all of the groups used by this whole\r\n\t\tfor (let {G, V} of recs) {\r\n\t\t\tlet complement = new Set(union.filter(g => !G.has(g))); // groups not covered by the extent\r\n\t\t\tfor (let cp of V) {\r\n\t\t\t\tM.set(cp, complement); // this is the same reference\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t// compute valid set\r\n\t// 20230924: VALID was union but can be re-used\r\n\tVALID = new Set(); // exists in 1+ groups\r\n\tlet multi = new Set(); // exists in 2+ groups\r\n\tconst add_to_union = cp => VALID.has(cp) ? multi.add(cp) : VALID.add(cp);\r\n\tfor (let g of GROUPS) {\r\n\t\tfor (let cp of g.P) add_to_union(cp);\r\n\t\tfor (let cp of g.Q) add_to_union(cp);\r\n\t}\r\n\t// dual purpose WHOLE_MAP: return placeholder if unique non-confusable\r\n\tfor (let cp of VALID) {\r\n\t\tif (!WHOLE_MAP.has(cp) && !multi.has(cp)) {\r\n\t\t\tWHOLE_MAP.set(cp, UNIQUE_PH);\r\n\t\t}\r\n\t}\r\n\t// add all decomposed parts\r\n\t// see derive: \"Valid is Closed (via Brute-force)\"\r\n\tset_add_many(VALID, nfd(VALID));\r\n\t\r\n\t// decode emoji\r\n\t// 20230719: emoji are now fully-expanded to avoid quirk logic \r\n\tEMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);\r\n\tEMOJI_ROOT = new Map(); // this has approx 7K nodes (2+ per emoji)\r\n\tfor (let cps of EMOJI_LIST) {\r\n\t\t// 20230719: change to *slightly* stricter algorithm which disallows \r\n\t\t// insertion of misplaced FE0F in emoji sequences (matching ENSIP-15)\r\n\t\t// example: beautified [A B] (eg. flag emoji) \r\n\t\t//  before: allow: [A FE0F B], error: [A FE0F FE0F B] \r\n\t\t//   after: error: both\r\n\t\t// note: this code now matches ENSNormalize.{cs,java} logic\r\n\t\tlet prev = [EMOJI_ROOT];\r\n\t\tfor (let cp of cps) {\r\n\t\t\tlet next = prev.map(node => {\r\n\t\t\t\tlet child = node.get(cp);\r\n\t\t\t\tif (!child) {\r\n\t\t\t\t\t// should this be object? \r\n\t\t\t\t\t// (most have 1-2 items, few have many)\r\n\t\t\t\t\t// 20230719: no, v8 default map is 4?\r\n\t\t\t\t\tchild = new Map();\r\n\t\t\t\t\tnode.set(cp, child);\r\n\t\t\t\t}\r\n\t\t\t\treturn child;\r\n\t\t\t});\r\n\t\t\tif (cp === FE0F) {\r\n\t\t\t\tprev.push(...next); // less than 20 elements\r\n\t\t\t} else {\r\n\t\t\t\tprev = next;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (let x of prev) {\r\n\t\t\tx.V = cps;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n// if escaped: {HEX}\r\n//       else: \"x\" {HEX}\r\nfunction quoted_cp(cp) {\r\n\treturn (should_escape(cp) ? '' : `${bidi_qq(safe_str_from_cps([cp]))} `) + quote_cp(cp);\r\n}\r\n\r\n// 20230211: some messages can be mixed-directional and result in spillover\r\n// use 200E after a quoted string to force the remainder of a string from \r\n// acquring the direction of the quote\r\n// https://www.w3.org/International/questions/qa-bidi-unicode-controls#exceptions\r\nfunction bidi_qq(s) {\r\n\treturn `\"${s}\"\\u200E`; // strong LTR\r\n}\r\n\r\nfunction check_label_extension(cps) {\r\n\tif (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {\r\n\t\tthrow new Error(`invalid label extension: \"${str_from_cps(cps.slice(0, 4))}\"`); // this can only be ascii so cant be bidi\r\n\t}\r\n}\r\nfunction check_leading_underscore(cps) {\r\n\tconst UNDERSCORE = 0x5F;\r\n\tfor (let i = cps.lastIndexOf(UNDERSCORE); i > 0; ) {\r\n\t\tif (cps[--i] !== UNDERSCORE) {\r\n\t\t\tthrow new Error('underscore allowed only at start');\r\n\t\t}\r\n\t}\r\n}\r\n// check that a fenced cp is not leading, trailing, or touching another fenced cp\r\nfunction check_fenced(cps) {\r\n\tlet cp = cps[0];\r\n\tlet prev = FENCED.get(cp);\r\n\tif (prev) throw error_placement(`leading ${prev}`);\r\n\tlet n = cps.length;\r\n\tlet last = -1; // prevents trailing from throwing\r\n\tfor (let i = 1; i < n; i++) {\r\n\t\tcp = cps[i];\r\n\t\tlet match = FENCED.get(cp);\r\n\t\tif (match) {\r\n\t\t\t// since cps[0] isn't fenced, cps[1] cannot throw\r\n\t\t\tif (last == i) throw error_placement(`${prev} + ${match}`);\r\n\t\t\tlast = i + 1;\r\n\t\t\tprev = match;\r\n\t\t}\r\n\t}\r\n\tif (last == n) throw error_placement(`trailing ${prev}`);\r\n}\r\n\r\n// create a safe to print string \r\n// invisibles are escaped\r\n// leading cm uses placeholder\r\n// if cps exceed max, middle truncate with ellipsis\r\n// quoter(cp) => string, eg. 3000 => \"{3000}\"\r\n// note: in html, you'd call this function then replace [<>&] with entities\r\nfunction safe_str_from_cps(cps, max = Infinity, quoter = quote_cp) {\r\n\t//if (Number.isInteger(cps)) cps = [cps];\r\n\t//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);\r\n\tlet buf = [];\r\n\tif (is_combining_mark(cps[0])) buf.push('◌');\r\n\tif (cps.length > max) {\r\n\t\tmax >>= 1;\r\n\t\tcps = [...cps.slice(0, max), 0x2026, ...cps.slice(-max)];\r\n\t}\r\n\tlet prev = 0;\r\n\tlet n = cps.length;\r\n\tfor (let i = 0; i < n; i++) {\r\n\t\tlet cp = cps[i];\r\n\t\tif (should_escape(cp)) {\r\n\t\t\tbuf.push(str_from_cps(cps.slice(prev, i)));\r\n\t\t\tbuf.push(quoter(cp));\r\n\t\t\tprev = i + 1;\r\n\t\t}\r\n\t}\r\n\tbuf.push(str_from_cps(cps.slice(prev, n)));\r\n\treturn buf.join('');\r\n}\r\n\r\n// note: set(s) cannot be exposed because they can be modified\r\n// note: Object.freeze() doesn't work\r\nfunction is_combining_mark(cp) {\r\n\tinit();\r\n\treturn CM.has(cp);\r\n}\r\nfunction should_escape(cp) {\r\n\tinit();\r\n\treturn ESCAPE.has(cp);\r\n}\r\n\r\n// return all supported emoji as fully-qualified emoji \r\n// ordered by length then lexicographic \r\nfunction ens_emoji() {\r\n\tinit();\r\n\treturn EMOJI_LIST.map(x => x.slice()); // emoji are exposed so copy\r\n}\r\n\r\nfunction ens_normalize_fragment(frag, decompose) {\r\n\tinit();\r\n\tlet nf = decompose ? nfd : nfc;\r\n\treturn frag.split(STOP_CH).map(label => str_from_cps(tokens_from_str(explode_cp(label), nf, filter_fe0f).flat())).join(STOP_CH);\r\n}\r\n\r\nfunction ens_normalize(name) {\r\n\treturn flatten(split(name, nfc, filter_fe0f));\r\n}\r\n\r\nfunction ens_beautify(name) {\r\n\tlet labels = split(name, nfc, x => x); // emoji not exposed\r\n\tfor (let {type, output, error} of labels) {\r\n\t\tif (error) break; // flatten will throw\r\n\r\n\t\t// replace leading/trailing hyphen\r\n\t\t// 20230121: consider beautifing all or leading/trailing hyphen to unicode variant\r\n\t\t// not exactly the same in every font, but very similar: \"-\" vs \"‐\"\r\n\t\t/*\r\n\t\tconst UNICODE_HYPHEN = 0x2010;\r\n\t\t// maybe this should replace all for visual consistancy?\r\n\t\t// `node tools/reg-count.js regex ^-\\{2,\\}` => 592\r\n\t\t//for (let i = 0; i < output.length; i++) if (output[i] == 0x2D) output[i] = 0x2010;\r\n\t\tif (output[0] == HYPHEN) output[0] = UNICODE_HYPHEN;\r\n\t\tlet end = output.length-1;\r\n\t\tif (output[end] == HYPHEN) output[end] = UNICODE_HYPHEN;\r\n\t\t*/\r\n\t\t// 20230123: WHATWG URL uses \"CheckHyphens\" false\r\n\t\t// https://url.spec.whatwg.org/#idna\r\n\r\n\t\t// update ethereum symbol\r\n\t\t// ξ => Ξ if not greek\r\n\t\tif (type !== 'Greek') array_replace(output, 0x3BE, 0x39E);\r\n\r\n\t\t// 20221213: fixes bidi subdomain issue, but breaks invariant (200E is disallowed)\r\n\t\t// could be fixed with special case for: 2D (.) + 200E (LTR)\r\n\t\t// https://discuss.ens.domains/t/bidi-label-ordering-spoof/15824\r\n\t\t//output.splice(0, 0, 0x200E);\r\n\t}\r\n\treturn flatten(labels);\r\n}\r\n\r\nfunction array_replace(v, a, b) {\r\n\tlet prev = 0;\r\n\twhile (true) {\r\n\t\tlet next = v.indexOf(a, prev);\r\n\t\tif (next < 0) break;\r\n\t\tv[next] = b; \r\n\t\tprev = next + 1;\r\n\t}\r\n}\r\n\r\nfunction ens_split(name, preserve_emoji) {\r\n\treturn split(name, nfc, preserve_emoji ? x => x.slice() : filter_fe0f); // emoji are exposed so copy\r\n}\r\n\r\nfunction split(name, nf, ef) {\r\n\tif (!name) return []; // 20230719: empty name allowance\r\n\tinit();\r\n\tlet offset = 0;\r\n\t// https://unicode.org/reports/tr46/#Validity_Criteria\r\n\t// 4.) \"The label must not contain a U+002E ( . ) FULL STOP.\"\r\n\treturn name.split(STOP_CH).map(label => {\r\n\t\tlet input = explode_cp(label);\r\n\t\tlet info = {\r\n\t\t\tinput,\r\n\t\t\toffset, // codepoint, not substring!\r\n\t\t};\r\n\t\toffset += input.length + 1; // + stop\r\n\t\ttry {\r\n\t\t\t// 1.) \"The label must be in Unicode Normalization Form NFC\"\r\n\t\t\tlet tokens = info.tokens = tokens_from_str(input, nf, ef);\r\n\t\t\tlet token_count = tokens.length;\r\n\t\t\tlet type;\r\n\t\t\tif (!token_count) { // the label was effectively empty (could of had ignored characters)\r\n\t\t\t\t//norm = [];\r\n\t\t\t\t//type = 'None'; // use this instead of next match, \"ASCII\"\r\n\t\t\t\t// 20230120: change to strict\r\n\t\t\t\t// https://discuss.ens.domains/t/ens-name-normalization-2nd/14564/59\r\n\t\t\t\tthrow new Error(`empty label`);\r\n\t\t\t} \r\n\t\t\tlet norm = info.output = tokens.flat();\r\n\t\t\tcheck_leading_underscore(norm);\r\n\t\t\tlet emoji = info.emoji = token_count > 1 || tokens[0].is_emoji; // same as: tokens.some(x => x.is_emoji);\r\n\t\t\tif (!emoji && norm.every(cp => cp < 0x80)) { // special case for ascii\r\n\t\t\t\t// 20230123: matches matches WHATWG, see note 3.3\r\n\t\t\t\tcheck_label_extension(norm); // only needed for ascii\r\n\t\t\t\t// cant have fenced\r\n\t\t\t\t// cant have cm\r\n\t\t\t\t// cant have wholes\r\n\t\t\t\t// see derive: \"Fastpath ASCII\"\r\n\t\t\t\ttype = 'ASCII';\r\n\t\t\t} else {\r\n\t\t\t\tlet chars = tokens.flatMap(x => x.is_emoji ? [] : x); // all of the nfc tokens concat together\r\n\t\t\t\tif (!chars.length) { // theres no text, just emoji\r\n\t\t\t\t\ttype = 'Emoji';\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// 5.) \"The label must not begin with a combining mark, that is: General_Category=Mark.\"\r\n\t\t\t\t\tif (CM.has(norm[0])) throw error_placement('leading combining mark');\r\n\t\t\t\t\tfor (let i = 1; i < token_count; i++) { // we've already checked the first token\r\n\t\t\t\t\t\tlet cps = tokens[i];\r\n\t\t\t\t\t\tif (!cps.is_emoji && CM.has(cps[0])) { // every text token has emoji neighbors, eg. EtEEEtEt...\r\n\t\t\t\t\t\t\t// bidi_qq() not needed since emoji is LTR and cps is a CM\r\n\t\t\t\t\t\t\tthrow error_placement(`emoji + combining mark: \"${str_from_cps(tokens[i-1])} + ${safe_str_from_cps([cps[0]])}\"`); \r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tcheck_fenced(norm);\r\n\t\t\t\t\tlet unique = Array_from(new Set(chars));\r\n\t\t\t\t\tlet [g] = determine_group(unique); // take the first match\r\n\t\t\t\t\t// see derive: \"Matching Groups have Same CM Style\"\r\n\t\t\t\t\t// alternative: could form a hybrid type: Latin/Japanese/...\t\r\n\t\t\t\t\tcheck_group(g, chars); // need text in order\r\n\t\t\t\t\tcheck_whole(g, unique); // only need unique text (order would be required for multiple-char confusables)\r\n\t\t\t\t\ttype = g.N;\r\n\t\t\t\t\t// 20230121: consider exposing restricted flag\r\n\t\t\t\t\t// it's simpler to just check for 'Restricted'\r\n\t\t\t\t\t// or even better: type.endsWith(']')\r\n\t\t\t\t\t//if (g.R) info.restricted = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tinfo.type = type;\r\n\t\t} catch (err) {\r\n\t\t\tinfo.error = err; // use full error object\r\n\t\t}\r\n\t\treturn info;\r\n\t});\r\n}\r\n\r\nfunction check_whole(group, unique) {\r\n\tlet maker;\r\n\tlet shared = [];\r\n\tfor (let cp of unique) {\r\n\t\tlet whole = WHOLE_MAP.get(cp);\r\n\t\tif (whole === UNIQUE_PH) return; // unique, non-confusable\r\n\t\tif (whole) {\r\n\t\t\tlet set = whole.M.get(cp); // groups which have a character that look-like this character\r\n\t\t\tmaker = maker ? maker.filter(g => set.has(g)) : Array_from(set);\r\n\t\t\tif (!maker.length) return; // confusable intersection is empty\r\n\t\t} else {\r\n\t\t\tshared.push(cp); \r\n\t\t}\r\n\t}\r\n\tif (maker) {\r\n\t\t// we have 1+ confusable\r\n\t\t// check if any of the remaining groups\r\n\t\t// contain the shared characters too\r\n\t\tfor (let g of maker) {\r\n\t\t\tif (shared.every(cp => group_has_cp(g, cp))) {\r\n\t\t\t\tthrow new Error(`whole-script confusable: ${group.N}/${g.N}`);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\n// assumption: unique.size > 0\r\n// returns list of matching groups\r\nfunction determine_group(unique) {\r\n\tlet groups = GROUPS;\r\n\tfor (let cp of unique) {\r\n\t\t// note: we need to dodge CM that are whitelisted\r\n\t\t// but that code isn't currently necessary\r\n\t\tlet gs = groups.filter(g => group_has_cp(g, cp));\r\n\t\tif (!gs.length) {\r\n\t\t\tif (!GROUPS.some(g => group_has_cp(g, cp))) { \r\n\t\t\t\t// the character was composed of valid parts\r\n\t\t\t\t// but it's NFC form is invalid\r\n\t\t\t\t// 20230716: change to more exact statement, see: ENSNormalize.{cs,java}\r\n\t\t\t\t// note: this doesn't have to be a composition\r\n\t\t\t\t// 20230720: change to full check\r\n\t\t\t\tthrow error_disallowed(cp); // this should be rare\r\n\t\t\t} else {\r\n\t\t\t\t// there is no group that contains all these characters\r\n\t\t\t\t// throw using the highest priority group that matched\r\n\t\t\t\t// https://www.unicode.org/reports/tr39/#mixed_script_confusables\r\n\t\t\t\tthrow error_group_member(groups[0], cp);\r\n\t\t\t}\r\n\t\t}\r\n\t\tgroups = gs;\r\n\t\tif (gs.length == 1) break; // there is only one group left\r\n\t}\r\n\t// there are at least 1 group(s) with all of these characters\r\n\treturn groups;\r\n}\r\n\r\n// throw on first error\r\nfunction flatten(split) {\r\n\treturn split.map(({input, error, output}) => {\r\n\t\tif (error) {\r\n\t\t\t// don't print label again if just a single label\r\n\t\t\tlet msg = error.message;\r\n\t\t\t// bidi_qq() only necessary if msg is digits\r\n\t\t\tthrow new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input, 63))}: ${msg}`); \r\n\t\t}\r\n\t\treturn str_from_cps(output);\r\n\t}).join(STOP_CH);\r\n}\r\n\r\nfunction error_disallowed(cp) {\r\n\t// TODO: add cp to error?\r\n\treturn new Error(`disallowed character: ${quoted_cp(cp)}`); \r\n}\r\nfunction error_group_member(g, cp) {\r\n\tlet quoted = quoted_cp(cp);\r\n\tlet gg = GROUPS.find(g => g.P.has(cp)); // only check primary\r\n\tif (gg) {\r\n\t\tquoted = `${gg.N} ${quoted}`;\r\n\t}\r\n\treturn new Error(`illegal mixture: ${g.N} + ${quoted}`);\r\n}\r\nfunction error_placement(where) {\r\n\treturn new Error(`illegal placement: ${where}`);\r\n}\r\n\r\n// assumption: cps.length > 0\r\n// assumption: cps[0] isn't a CM\r\n// assumption: the previous character isn't an emoji\r\nfunction check_group(g, cps) {\r\n\tfor (let cp of cps) {\r\n\t\tif (!group_has_cp(g, cp)) {\r\n\t\t\t// for whitelisted scripts, this will throw illegal mixture on invalid cm, eg. \"e{300}{300}\"\r\n\t\t\t// at the moment, it's unnecessary to introduce an extra error type\r\n\t\t\t// until there exists a whitelisted multi-character\r\n\t\t\t//   eg. if (M < 0 && is_combining_mark(cp)) { ... }\r\n\t\t\t// there are 3 cases:\r\n\t\t\t//   1. illegal cm for wrong group => mixture error\r\n\t\t\t//   2. illegal cm for same group => cm error\r\n\t\t\t//       requires set of whitelist cm per group: \r\n\t\t\t//        eg. new Set([...g.P, ...g.Q].flatMap(nfc).filter(cp => CM.has(cp)))\r\n\t\t\t//   3. wrong group => mixture error\r\n\t\t\tthrow error_group_member(g, cp);\r\n\t\t}\r\n\t}\r\n\t//if (M >= 0) { // we have a known fixed cm count\r\n\tif (g.M) { // we need to check for NSM\r\n\t\tlet decomposed = nfd(cps);\r\n\t\tfor (let i = 1, e = decomposed.length; i < e; i++) { // see: assumption\r\n\t\t\t// 20230210: bugfix: using cps instead of decomposed h/t Carbon225\r\n\t\t\t/*\r\n\t\t\tif (CM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\twhile (j < e && CM.has(decomposed[j])) j++;\r\n\t\t\t\tif (j - i > M) {\r\n\t\t\t\t\tthrow new Error(`too many combining marks: ${g.N} ${bidi_qq(str_from_cps(decomposed.slice(i-1, j)))} (${j-i}/${M})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t\t*/\r\n\t\t\t// 20230217: switch to NSM counting\r\n\t\t\t// https://www.unicode.org/reports/tr39/#Optional_Detection\r\n\t\t\tif (NSM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\tfor (let cp; j < e && NSM.has(cp = decomposed[j]); j++) {\r\n\t\t\t\t\t// a. Forbid sequences of the same nonspacing mark.\r\n\t\t\t\t\tfor (let k = i; k < j; k++) { // O(n^2) but n < 100\r\n\t\t\t\t\t\tif (decomposed[k] == cp) {\r\n\t\t\t\t\t\t\tthrow new Error(`duplicate non-spacing marks: ${quoted_cp(cp)}`);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t// parse to end so we have full nsm count\r\n\t\t\t\t// b. Forbid sequences of more than 4 nonspacing marks (gc=Mn or gc=Me).\r\n\t\t\t\tif (j - i > NSM_MAX) {\r\n\t\t\t\t\t// note: this slice starts with a base char or spacing-mark cm\r\n\t\t\t\t\tthrow new Error(`excessive non-spacing marks: ${bidi_qq(safe_str_from_cps(decomposed.slice(i-1, j)))} (${j-i}/${NSM_MAX})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t// *** this code currently isn't needed ***\r\n\t/*\r\n\tlet cm_whitelist = M instanceof Map;\r\n\tfor (let i = 0, e = cps.length; i < e; ) {\r\n\t\tlet cp = cps[i++];\r\n\t\tlet seqs = cm_whitelist && M.get(cp);\r\n\t\tif (seqs) { \r\n\t\t\t// list of codepoints that can follow\r\n\t\t\t// if this exists, this will always be 1+\r\n\t\t\tlet j = i;\r\n\t\t\twhile (j < e && CM.has(cps[j])) j++;\r\n\t\t\tlet cms = cps.slice(i, j);\r\n\t\t\tlet match = seqs.find(seq => !compare_arrays(seq, cms));\r\n\t\t\tif (!match) throw new Error(`disallowed combining mark sequence: \"${safe_str_from_cps([cp, ...cms])}\"`);\r\n\t\t\ti = j;\r\n\t\t} else if (!V.has(cp)) {\r\n\t\t\t// https://www.unicode.org/reports/tr39/#mixed_script_confusables\r\n\t\t\tlet quoted = quoted_cp(cp);\r\n\t\t\tfor (let cp of cps) {\r\n\t\t\t\tlet u = UNIQUE.get(cp);\r\n\t\t\t\tif (u && u !== g) {\r\n\t\t\t\t\t// if both scripts are restricted this error is confusing\r\n\t\t\t\t\t// because we don't differentiate RestrictedA from RestrictedB \r\n\t\t\t\t\tif (!u.R) quoted = `${quoted} is ${u.N}`;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tthrow new Error(`disallowed ${g.N} character: ${quoted}`);\r\n\t\t\t//throw new Error(`disallowed character: ${quoted} (expected ${g.N})`);\r\n\t\t\t//throw new Error(`${g.N} does not allow: ${quoted}`);\r\n\t\t}\r\n\t}\r\n\tif (!cm_whitelist) {\r\n\t\tlet decomposed = nfd(cps);\r\n\t\tfor (let i = 1, e = decomposed.length; i < e; i++) { // we know it can't be cm leading\r\n\t\t\tif (CM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\twhile (j < e && CM.has(decomposed[j])) j++;\r\n\t\t\t\tif (j - i > M) {\r\n\t\t\t\t\tthrow new Error(`too many combining marks: \"${str_from_cps(decomposed.slice(i-1, j))}\" (${j-i}/${M})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t*/\r\n}\r\n\r\n// given a list of codepoints\r\n// returns a list of lists, where emoji are a fully-qualified (as Array subclass)\r\n// eg. explode_cp(\"abc💩d\") => [[61, 62, 63], Emoji[1F4A9, FE0F], [64]]\r\n// 20230818: rename for 'process' name collision h/t Javarome\r\n// https://github.com/adraffy/ens-normalize.js/issues/23\r\nfunction tokens_from_str(input, nf, ef) {\r\n\tlet ret = [];\r\n\tlet chars = [];\r\n\tinput = input.slice().reverse(); // flip so we can pop\r\n\twhile (input.length) {\r\n\t\tlet emoji = consume_emoji_reversed(input);\r\n\t\tif (emoji) {\r\n\t\t\tif (chars.length) {\r\n\t\t\t\tret.push(nf(chars));\r\n\t\t\t\tchars = [];\r\n\t\t\t}\r\n\t\t\tret.push(ef(emoji));\r\n\t\t} else {\r\n\t\t\tlet cp = input.pop();\r\n\t\t\tif (VALID.has(cp)) {\r\n\t\t\t\tchars.push(cp);\r\n\t\t\t} else {\r\n\t\t\t\tlet cps = MAPPED.get(cp);\r\n\t\t\t\tif (cps) {\r\n\t\t\t\t\tchars.push(...cps); // less than 10 elements\r\n\t\t\t\t} else if (!IGNORED.has(cp)) {\r\n\t\t\t\t\t// 20230912: unicode 15.1 changed the order of processing such that\r\n\t\t\t\t\t// disallowed parts are only rejected after NFC\r\n\t\t\t\t\t// https://unicode.org/reports/tr46/#Validity_Criteria\r\n\t\t\t\t\t// this doesn't impact normalization as of today\r\n\t\t\t\t\t// technically, this error can be removed as the group logic will apply similar logic\r\n\t\t\t\t\t// however the error type might be less clear\r\n\t\t\t\t\tthrow error_disallowed(cp);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (chars.length) {\r\n\t\tret.push(nf(chars));\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction filter_fe0f(cps) {\r\n\treturn cps.filter(cp => cp != FE0F);\r\n}\r\n\r\n// given array of codepoints\r\n// returns the longest valid emoji sequence (or undefined if no match)\r\n// *MUTATES* the supplied array\r\n// disallows interleaved ignored characters\r\n// fills (optional) eaten array with matched codepoints\r\nfunction consume_emoji_reversed(cps, eaten) {\r\n\tlet node = EMOJI_ROOT;\r\n\tlet emoji;\r\n\tlet pos = cps.length;\r\n\twhile (pos) {\r\n\t\tnode = node.get(cps[--pos]);\r\n\t\tif (!node) break;\r\n\t\tlet {V} = node;\r\n\t\tif (V) { // this is a valid emoji (so far)\r\n\t\t\temoji = V;\r\n\t\t\tif (eaten) eaten.push(...cps.slice(pos).reverse()); // (optional) copy input, used for ens_tokenize()\r\n\t\t\tcps.length = pos; // truncate\r\n\t\t}\r\n\t}\r\n\treturn emoji;\r\n}\r\n\r\n// ************************************************************\r\n// tokenizer \r\n\r\nconst TY_VALID = 'valid';\r\nconst TY_MAPPED = 'mapped';\r\nconst TY_IGNORED = 'ignored';\r\nconst TY_DISALLOWED = 'disallowed';\r\nconst TY_EMOJI = 'emoji';\r\nconst TY_NFC = 'nfc';\r\nconst TY_STOP = 'stop';\r\n\r\nfunction ens_tokenize(name, {\r\n\tnf = true, // collapse unnormalized runs into a single token\r\n} = {}) {\r\n\tinit();\r\n\tlet input = explode_cp(name).reverse();\r\n\tlet eaten = [];\r\n\tlet tokens = [];\r\n\twhile (input.length) {\r\n\t\tlet emoji = consume_emoji_reversed(input, eaten);\r\n\t\tif (emoji) {\r\n\t\t\ttokens.push({\r\n\t\t\t\ttype: TY_EMOJI,\r\n\t\t\t\temoji: emoji.slice(), // copy emoji\r\n\t\t\t\tinput: eaten,\r\n\t\t\t\tcps: filter_fe0f(emoji)\r\n\t\t\t});\r\n\t\t\teaten = []; // reset buffer\r\n\t\t} else {\r\n\t\t\tlet cp = input.pop();\r\n\t\t\tif (cp == STOP) {\r\n\t\t\t\ttokens.push({type: TY_STOP, cp});\r\n\t\t\t} else if (VALID.has(cp)) {\r\n\t\t\t\ttokens.push({type: TY_VALID, cps: [cp]});\r\n\t\t\t} else if (IGNORED.has(cp)) {\r\n\t\t\t\ttokens.push({type: TY_IGNORED, cp});\r\n\t\t\t} else {\r\n\t\t\t\tlet cps = MAPPED.get(cp);\r\n\t\t\t\tif (cps) {\r\n\t\t\t\t\ttokens.push({type: TY_MAPPED, cp, cps: cps.slice()});\r\n\t\t\t\t} else {\r\n\t\t\t\t\ttokens.push({type: TY_DISALLOWED, cp});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (nf) {\r\n\t\tfor (let i = 0, start = -1; i < tokens.length; i++) {\r\n\t\t\tlet token = tokens[i];\r\n\t\t\tif (is_valid_or_mapped(token.type)) {\r\n\t\t\t\tif (requires_check(token.cps)) { // normalization might be needed\r\n\t\t\t\t\tlet end = i + 1;\r\n\t\t\t\t\tfor (let pos = end; pos < tokens.length; pos++) { // find adjacent text\r\n\t\t\t\t\t\tlet {type, cps} = tokens[pos];\r\n\t\t\t\t\t\tif (is_valid_or_mapped(type)) {\r\n\t\t\t\t\t\t\tif (!requires_check(cps)) break;\r\n\t\t\t\t\t\t\tend = pos + 1;\r\n\t\t\t\t\t\t} else if (type !== TY_IGNORED) { // || type !== TY_DISALLOWED) { \r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (start < 0) start = i;\r\n\t\t\t\t\tlet slice = tokens.slice(start, end);\r\n\t\t\t\t\tlet cps0 = slice.flatMap(x => is_valid_or_mapped(x.type) ? x.cps : []); // strip junk tokens\r\n\t\t\t\t\tlet cps = nfc(cps0);\r\n\t\t\t\t\tif (compare_arrays(cps, cps0)) { // bundle into an nfc token\r\n\t\t\t\t\t\ttokens.splice(start, end - start, {\r\n\t\t\t\t\t\t\ttype: TY_NFC, \r\n\t\t\t\t\t\t\tinput: cps0, // there are 3 states: tokens0 ==(process)=> input ==(nfc)=> tokens/cps\r\n\t\t\t\t\t\t\tcps, \r\n\t\t\t\t\t\t\ttokens0: collapse_valid_tokens(slice),\r\n\t\t\t\t\t\t\ttokens: ens_tokenize(str_from_cps(cps), {nf: false})\r\n\t\t\t\t\t\t});\r\n\t\t\t\t\t\ti = start;\r\n\t\t\t\t\t} else { \r\n\t\t\t\t\t\ti = end - 1; // skip to end of slice\r\n\t\t\t\t\t}\r\n\t\t\t\t\tstart = -1; // reset\r\n\t\t\t\t} else {\r\n\t\t\t\t\tstart = i; // remember last\r\n\t\t\t\t}\r\n\t\t\t} else if (token.type !== TY_IGNORED) { // 20221024: is this correct?\r\n\t\t\t\tstart = -1; // reset\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn collapse_valid_tokens(tokens);\r\n}\r\n\r\nfunction is_valid_or_mapped(type) {\r\n\treturn type == TY_VALID || type == TY_MAPPED;\r\n}\r\n\r\nfunction requires_check(cps) {\r\n\treturn cps.some(cp => NFC_CHECK.has(cp));\r\n}\r\n\r\nfunction collapse_valid_tokens(tokens) {\r\n\tfor (let i = 0; i < tokens.length; i++) {\r\n\t\tif (tokens[i].type == TY_VALID) {\r\n\t\t\tlet j = i + 1;\r\n\t\t\twhile (j < tokens.length && tokens[j].type == TY_VALID) j++;\r\n\t\t\ttokens.splice(i, j - i, {type: TY_VALID, cps: tokens.slice(i, j).flatMap(x => x.cps)});\r\n\t\t}\r\n\t}\r\n\treturn tokens;\r\n}\n\nexports.ens_beautify = ens_beautify;\nexports.ens_emoji = ens_emoji;\nexports.ens_normalize = ens_normalize;\nexports.ens_normalize_fragment = ens_normalize_fragment;\nexports.ens_split = ens_split;\nexports.ens_tokenize = ens_tokenize;\nexports.is_combining_mark = is_combining_mark;\nexports.nfc = nfc;\nexports.nfd = nfd;\nexports.safe_str_from_cps = safe_str_from_cps;\nexports.should_escape = should_escape;\n","const defaultErrorConfig = {\r\n    withStackTrace: false,\r\n};\r\n// Custom error object\r\n// Context / discussion: https://github.com/supermacro/neverthrow/pull/215\r\nconst createNeverThrowError = (message, result, config = defaultErrorConfig) => {\r\n    const data = result.isOk()\r\n        ? { type: 'Ok', value: result.value }\r\n        : { type: 'Err', value: result.error };\r\n    const maybeStack = config.withStackTrace ? new Error().stack : undefined;\r\n    return {\r\n        data,\r\n        message,\r\n        stack: maybeStack,\r\n    };\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\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}\r\n\r\nfunction __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nfunction __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nfunction __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nfunction __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nfunction __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\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);\r\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); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\n\nclass ResultAsync {\r\n    constructor(res) {\r\n        this._promise = res;\r\n    }\r\n    static fromSafePromise(promise) {\r\n        const newPromise = promise.then((value) => new Ok(value));\r\n        return new ResultAsync(newPromise);\r\n    }\r\n    static fromPromise(promise, errorFn) {\r\n        const newPromise = promise\r\n            .then((value) => new Ok(value))\r\n            .catch((e) => new Err(errorFn(e)));\r\n        return new ResultAsync(newPromise);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\r\n    static fromThrowable(fn, errorFn) {\r\n        return (...args) => {\r\n            return new ResultAsync((() => __awaiter(this, void 0, void 0, function* () {\r\n                try {\r\n                    return new Ok(yield fn(...args));\r\n                }\r\n                catch (error) {\r\n                    return new Err(errorFn ? errorFn(error) : error);\r\n                }\r\n            }))());\r\n        };\r\n    }\r\n    static combine(asyncResultList) {\r\n        return combineResultAsyncList(asyncResultList);\r\n    }\r\n    static combineWithAllErrors(asyncResultList) {\r\n        return combineResultAsyncListWithAllErrors(asyncResultList);\r\n    }\r\n    map(f) {\r\n        return new ResultAsync(this._promise.then((res) => __awaiter(this, void 0, void 0, function* () {\r\n            if (res.isErr()) {\r\n                return new Err(res.error);\r\n            }\r\n            return new Ok(yield f(res.value));\r\n        })));\r\n    }\r\n    mapErr(f) {\r\n        return new ResultAsync(this._promise.then((res) => __awaiter(this, void 0, void 0, function* () {\r\n            if (res.isOk()) {\r\n                return new Ok(res.value);\r\n            }\r\n            return new Err(yield f(res.error));\r\n        })));\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    andThen(f) {\r\n        return new ResultAsync(this._promise.then((res) => {\r\n            if (res.isErr()) {\r\n                return new Err(res.error);\r\n            }\r\n            const newValue = f(res.value);\r\n            return newValue instanceof ResultAsync ? newValue._promise : newValue;\r\n        }));\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    orElse(f) {\r\n        return new ResultAsync(this._promise.then((res) => __awaiter(this, void 0, void 0, function* () {\r\n            if (res.isErr()) {\r\n                return f(res.error);\r\n            }\r\n            return new Ok(res.value);\r\n        })));\r\n    }\r\n    match(ok, _err) {\r\n        return this._promise.then((res) => res.match(ok, _err));\r\n    }\r\n    unwrapOr(t) {\r\n        return this._promise.then((res) => res.unwrapOr(t));\r\n    }\r\n    /**\r\n     * Emulates Rust's `?` operator in `safeTry`'s body. See also `safeTry`.\r\n     */\r\n    safeUnwrap() {\r\n        return __asyncGenerator(this, arguments, function* safeUnwrap_1() {\r\n            return yield __await(yield __await(yield* __asyncDelegator(__asyncValues(yield __await(this._promise.then((res) => res.safeUnwrap()))))));\r\n        });\r\n    }\r\n    // Makes ResultAsync implement PromiseLike<Result>\r\n    then(successCallback, failureCallback) {\r\n        return this._promise.then(successCallback, failureCallback);\r\n    }\r\n}\r\nconst okAsync = (value) => new ResultAsync(Promise.resolve(new Ok(value)));\r\nconst errAsync = (err) => new ResultAsync(Promise.resolve(new Err(err)));\r\nconst fromPromise = ResultAsync.fromPromise;\r\nconst fromSafePromise = ResultAsync.fromSafePromise;\r\nconst fromAsyncThrowable = ResultAsync.fromThrowable;\n\n/**\r\n * Short circuits on the FIRST Err value that we find\r\n */\r\nconst combineResultList = (resultList) => {\r\n    let acc = ok([]);\r\n    for (const result of resultList) {\r\n        if (result.isErr()) {\r\n            acc = err(result.error);\r\n            break;\r\n        }\r\n        else {\r\n            acc.map((list) => list.push(result.value));\r\n        }\r\n    }\r\n    return acc;\r\n};\r\n/* This is the typesafe version of Promise.all\r\n *\r\n * Takes a list of ResultAsync<T, E> and success if all inner results are Ok values\r\n * or fails if one (or more) of the inner results are Err values\r\n */\r\nconst combineResultAsyncList = (asyncResultList) => ResultAsync.fromSafePromise(Promise.all(asyncResultList)).andThen(combineResultList);\r\n/**\r\n * Give a list of all the errors we find\r\n */\r\nconst combineResultListWithAllErrors = (resultList) => {\r\n    let acc = ok([]);\r\n    for (const result of resultList) {\r\n        if (result.isErr() && acc.isErr()) {\r\n            acc.error.push(result.error);\r\n        }\r\n        else if (result.isErr() && acc.isOk()) {\r\n            acc = err([result.error]);\r\n        }\r\n        else if (result.isOk() && acc.isOk()) {\r\n            acc.value.push(result.value);\r\n        }\r\n        // do nothing when result.isOk() && acc.isErr()\r\n    }\r\n    return acc;\r\n};\r\nconst combineResultAsyncListWithAllErrors = (asyncResultList) => ResultAsync.fromSafePromise(Promise.all(asyncResultList)).andThen(combineResultListWithAllErrors);\n\n// eslint-disable-next-line @typescript-eslint/no-namespace\r\nvar Result;\r\n(function (Result) {\r\n    /**\r\n     * Wraps a function with a try catch, creating a new function with the same\r\n     * arguments but returning `Ok` if successful, `Err` if the function throws\r\n     *\r\n     * @param fn function to wrap with ok on success or err on failure\r\n     * @param errorFn when an error is thrown, this will wrap the error result if provided\r\n     */\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\r\n    function fromThrowable(fn, errorFn) {\r\n        return (...args) => {\r\n            try {\r\n                const result = fn(...args);\r\n                return ok(result);\r\n            }\r\n            catch (e) {\r\n                return err(errorFn ? errorFn(e) : e);\r\n            }\r\n        };\r\n    }\r\n    Result.fromThrowable = fromThrowable;\r\n    function combine(resultList) {\r\n        return combineResultList(resultList);\r\n    }\r\n    Result.combine = combine;\r\n    function combineWithAllErrors(resultList) {\r\n        return combineResultListWithAllErrors(resultList);\r\n    }\r\n    Result.combineWithAllErrors = combineWithAllErrors;\r\n})(Result || (Result = {}));\r\nconst ok = (value) => new Ok(value);\r\nconst err = (err) => new Err(err);\r\nfunction safeTry(body) {\r\n    const n = body().next();\r\n    if (n instanceof Promise) {\r\n        return n.then((r) => r.value);\r\n    }\r\n    return n.value;\r\n}\r\nclass Ok {\r\n    constructor(value) {\r\n        this.value = value;\r\n    }\r\n    isOk() {\r\n        return true;\r\n    }\r\n    isErr() {\r\n        return !this.isOk();\r\n    }\r\n    map(f) {\r\n        return ok(f(this.value));\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    mapErr(_f) {\r\n        return ok(this.value);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    andThen(f) {\r\n        return f(this.value);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    orElse(_f) {\r\n        return ok(this.value);\r\n    }\r\n    asyncAndThen(f) {\r\n        return f(this.value);\r\n    }\r\n    asyncMap(f) {\r\n        return ResultAsync.fromSafePromise(f(this.value));\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    unwrapOr(_v) {\r\n        return this.value;\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    match(ok, _err) {\r\n        return ok(this.value);\r\n    }\r\n    safeUnwrap() {\r\n        const value = this.value;\r\n        /* eslint-disable-next-line require-yield */\r\n        return (function* () {\r\n            return value;\r\n        })();\r\n    }\r\n    _unsafeUnwrap(_) {\r\n        return this.value;\r\n    }\r\n    _unsafeUnwrapErr(config) {\r\n        throw createNeverThrowError('Called `_unsafeUnwrapErr` on an Ok', this, config);\r\n    }\r\n}\r\nclass Err {\r\n    constructor(error) {\r\n        this.error = error;\r\n    }\r\n    isOk() {\r\n        return false;\r\n    }\r\n    isErr() {\r\n        return !this.isOk();\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    map(_f) {\r\n        return err(this.error);\r\n    }\r\n    mapErr(f) {\r\n        return err(f(this.error));\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    andThen(_f) {\r\n        return err(this.error);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types\r\n    orElse(f) {\r\n        return f(this.error);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    asyncAndThen(_f) {\r\n        return errAsync(this.error);\r\n    }\r\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\r\n    asyncMap(_f) {\r\n        return errAsync(this.error);\r\n    }\r\n    unwrapOr(v) {\r\n        return v;\r\n    }\r\n    match(_ok, err) {\r\n        return err(this.error);\r\n    }\r\n    safeUnwrap() {\r\n        const error = this.error;\r\n        return (function* () {\r\n            yield err(error);\r\n            throw new Error('Do not use this generator out of `safeTry`');\r\n        })();\r\n    }\r\n    _unsafeUnwrap(config) {\r\n        throw createNeverThrowError('Called `_unsafeUnwrap` on an Err', this, config);\r\n    }\r\n    _unsafeUnwrapErr(_) {\r\n        return this.error;\r\n    }\r\n}\r\nconst fromThrowable = Result.fromThrowable;\r\n//#endregion\n\nexport { Err, Ok, Result, ResultAsync, err, errAsync, fromAsyncThrowable, fromPromise, fromSafePromise, fromThrowable, ok, okAsync, safeTry };\n","import { getChainContractAddress, } from '../../utils/chain/getChainContractAddress.js';\nimport { toHex } from '../../utils/encoding/toHex.js';\nimport { packetToBytes, } from '../../utils/ens/packetToBytes.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { readContract, } from '../public/readContract.js';\n/**\n * Gets resolver for ENS name.\n *\n * - Docs: https://viem.sh/docs/ens/actions/getEnsResolver\n * - Examples: https://stackblitz.com/github/wevm/viem/tree/main/examples/ens\n *\n * Calls `findResolver(bytes)` on ENS Universal Resolver Contract to retrieve the resolver of an ENS name.\n *\n * Since ENS names prohibit certain forbidden characters (e.g. underscore) and have other validation rules, you likely want to [normalize ENS names](https://docs.ens.domains/contract-api-reference/name-processing#normalising-names) with [UTS-46 normalization](https://unicode.org/reports/tr46) before passing them to `getEnsAddress`. You can use the built-in [`normalize`](https://viem.sh/docs/ens/utilities/normalize) function for this.\n *\n * @param client - Client to use\n * @param parameters - {@link GetEnsResolverParameters}\n * @returns Address for ENS resolver. {@link GetEnsResolverReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getEnsResolver, normalize } from 'viem/ens'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const resolverAddress = await getEnsResolver(client, {\n *   name: normalize('wevm.eth'),\n * })\n * // '0x4976fb03C32e5B8cfe2b6cCB31c09Ba78EBaBa41'\n */\nexport async function getEnsResolver(client, { blockNumber, blockTag, name, universalResolverAddress: universalResolverAddress_, }) {\n    let universalResolverAddress = universalResolverAddress_;\n    if (!universalResolverAddress) {\n        if (!client.chain)\n            throw new Error('client chain not configured. universalResolverAddress is required.');\n        universalResolverAddress = getChainContractAddress({\n            blockNumber,\n            chain: client.chain,\n            contract: 'ensUniversalResolver',\n        });\n    }\n    const [resolverAddress] = await getAction(client, readContract, 'readContract')({\n        address: universalResolverAddress,\n        abi: [\n            {\n                inputs: [{ type: 'bytes' }],\n                name: 'findResolver',\n                outputs: [{ type: 'address' }, { type: 'bytes32' }],\n                stateMutability: 'view',\n                type: 'function',\n            },\n        ],\n        functionName: 'findResolver',\n        args: [toHex(packetToBytes(name))],\n        blockNumber,\n        blockTag,\n    });\n    return resolverAddress;\n}\n//# sourceMappingURL=getEnsResolver.js.map","/**\n * Scopes `request` to the filter ID. If the client is a fallback, it will\n * listen for responses and scope the child transport `request` function\n * to the successful filter ID.\n */\nexport function createFilterRequestScope(client, { method }) {\n    const requestMap = {};\n    if (client.transport.type === 'fallback')\n        client.transport.onResponse?.(({ method: method_, response: id, status, transport, }) => {\n            if (status === 'success' && method === method_)\n                requestMap[id] = transport.request;\n        });\n    return ((id) => requestMap[id] || client.request);\n}\n//# sourceMappingURL=createFilterRequestScope.js.map","import { createFilterRequestScope } from '../../utils/filters/createFilterRequestScope.js';\n/**\n * Creates a [`Filter`](https://viem.sh/docs/glossary/types#filter) to listen for new block hashes that can be used with [`getFilterChanges`](https://viem.sh/docs/actions/public/getFilterChanges).\n *\n * - Docs: https://viem.sh/docs/actions/public/createBlockFilter\n * - JSON-RPC Methods: [`eth_newBlockFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_newBlockFilter)\n *\n * @param client - Client to use\n * @returns [`Filter`](https://viem.sh/docs/glossary/types#filter). {@link CreateBlockFilterReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createBlockFilter } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createBlockFilter(client)\n * // { id: \"0x345a6572337856574a76364e457a4366\", type: 'block' }\n */\nexport async function createBlockFilter(client) {\n    const getRequest = createFilterRequestScope(client, {\n        method: 'eth_newBlockFilter',\n    });\n    const id = await client.request({\n        method: 'eth_newBlockFilter',\n    });\n    return { id, request: getRequest(id), type: 'block' };\n}\n//# sourceMappingURL=createBlockFilter.js.map","import { BaseError } from './base.js';\nexport class FilterTypeNotSupportedError extends BaseError {\n    constructor(type) {\n        super(`Filter type \"${type}\" is not supported.`);\n        Object.defineProperty(this, \"name\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: 'FilterTypeNotSupportedError'\n        });\n    }\n}\n//# sourceMappingURL=log.js.map","import { AbiEventNotFoundError, } from '../../errors/abi.js';\nimport { FilterTypeNotSupportedError, } from '../../errors/log.js';\nimport { toBytes } from '../encoding/toBytes.js';\nimport { keccak256 } from '../hash/keccak256.js';\nimport { toEventSelector, } from '../hash/toEventSelector.js';\nimport { encodeAbiParameters, } from './encodeAbiParameters.js';\nimport { formatAbiItem } from './formatAbiItem.js';\nimport { getAbiItem } from './getAbiItem.js';\nconst docsPath = '/docs/contract/encodeEventTopics';\nexport function encodeEventTopics(parameters) {\n    const { abi, eventName, args } = parameters;\n    let abiItem = abi[0];\n    if (eventName) {\n        const item = getAbiItem({ abi, name: eventName });\n        if (!item)\n            throw new AbiEventNotFoundError(eventName, { docsPath });\n        abiItem = item;\n    }\n    if (abiItem.type !== 'event')\n        throw new AbiEventNotFoundError(undefined, { docsPath });\n    const definition = formatAbiItem(abiItem);\n    const signature = toEventSelector(definition);\n    let topics = [];\n    if (args && 'inputs' in abiItem) {\n        const indexedInputs = abiItem.inputs?.filter((param) => 'indexed' in param && param.indexed);\n        const args_ = Array.isArray(args)\n            ? args\n            : Object.values(args).length > 0\n                ? indexedInputs?.map((x) => args[x.name]) ?? []\n                : [];\n        if (args_.length > 0) {\n            topics =\n                indexedInputs?.map((param, i) => {\n                    if (Array.isArray(args_[i]))\n                        return args_[i].map((_, j) => encodeArg({ param, value: args_[i][j] }));\n                    return args_[i] ? encodeArg({ param, value: args_[i] }) : null;\n                }) ?? [];\n        }\n    }\n    return [signature, ...topics];\n}\nfunction encodeArg({ param, value, }) {\n    if (param.type === 'string' || param.type === 'bytes')\n        return keccak256(toBytes(value));\n    if (param.type === 'tuple' || param.type.match(/^(.*)\\[(\\d+)?\\]$/))\n        throw new FilterTypeNotSupportedError(param.type);\n    return encodeAbiParameters([param], [value]);\n}\n//# sourceMappingURL=encodeEventTopics.js.map","import { encodeEventTopics, } from '../../utils/abi/encodeEventTopics.js';\nimport { numberToHex, } from '../../utils/encoding/toHex.js';\nimport { createFilterRequestScope } from '../../utils/filters/createFilterRequestScope.js';\n/**\n * Creates a Filter to retrieve event logs that can be used with [`getFilterChanges`](https://viem.sh/docs/actions/public/getFilterChanges) or [`getFilterLogs`](https://viem.sh/docs/actions/public/getFilterLogs).\n *\n * - Docs: https://viem.sh/docs/contract/createContractEventFilter\n *\n * @param client - Client to use\n * @param parameters - {@link CreateContractEventFilterParameters}\n * @returns [`Filter`](https://viem.sh/docs/glossary/types#filter). {@link CreateContractEventFilterReturnType}\n *\n * @example\n * import { createPublicClient, http, parseAbi } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createContractEventFilter } from 'viem/contract'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createContractEventFilter(client, {\n *   abi: parseAbi(['event Transfer(address indexed, address indexed, uint256)']),\n * })\n */\nexport async function createContractEventFilter(client, parameters) {\n    const { address, abi, args, eventName, fromBlock, strict, toBlock } = parameters;\n    const getRequest = createFilterRequestScope(client, {\n        method: 'eth_newFilter',\n    });\n    const topics = eventName\n        ? encodeEventTopics({\n            abi,\n            args,\n            eventName,\n        })\n        : undefined;\n    const id = await client.request({\n        method: 'eth_newFilter',\n        params: [\n            {\n                address,\n                fromBlock: typeof fromBlock === 'bigint' ? numberToHex(fromBlock) : fromBlock,\n                toBlock: typeof toBlock === 'bigint' ? numberToHex(toBlock) : toBlock,\n                topics,\n            },\n        ],\n    });\n    return {\n        abi,\n        args,\n        eventName,\n        id,\n        request: getRequest(id),\n        strict: Boolean(strict),\n        type: 'event',\n    };\n}\n//# sourceMappingURL=createContractEventFilter.js.map","import { encodeEventTopics, } from '../../utils/abi/encodeEventTopics.js';\nimport { numberToHex, } from '../../utils/encoding/toHex.js';\nimport { createFilterRequestScope } from '../../utils/filters/createFilterRequestScope.js';\n/**\n * Creates a [`Filter`](https://viem.sh/docs/glossary/types#filter) to listen for new events that can be used with [`getFilterChanges`](https://viem.sh/docs/actions/public/getFilterChanges).\n *\n * - Docs: https://viem.sh/docs/actions/public/createEventFilter\n * - JSON-RPC Methods: [`eth_newFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_newfilter)\n *\n * @param client - Client to use\n * @param parameters - {@link CreateEventFilterParameters}\n * @returns [`Filter`](https://viem.sh/docs/glossary/types#filter). {@link CreateEventFilterReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createEventFilter } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createEventFilter(client, {\n *   address: '0xfba3912ca04dd458c843e2ee08967fc04f3579c2',\n * })\n */\nexport async function createEventFilter(client, { address, args, event, events: events_, fromBlock, strict, toBlock, } = {}) {\n    const events = events_ ?? (event ? [event] : undefined);\n    const getRequest = createFilterRequestScope(client, {\n        method: 'eth_newFilter',\n    });\n    let topics = [];\n    if (events) {\n        const encoded = events.flatMap((event) => encodeEventTopics({\n            abi: [event],\n            eventName: event.name,\n            args,\n        }));\n        // TODO: Clean up type casting\n        topics = [encoded];\n        if (event)\n            topics = topics[0];\n    }\n    const id = await client.request({\n        method: 'eth_newFilter',\n        params: [\n            {\n                address,\n                fromBlock: typeof fromBlock === 'bigint' ? numberToHex(fromBlock) : fromBlock,\n                toBlock: typeof toBlock === 'bigint' ? numberToHex(toBlock) : toBlock,\n                ...(topics.length ? { topics } : {}),\n            },\n        ],\n    });\n    return {\n        abi: events,\n        args,\n        eventName: event ? event.name : undefined,\n        fromBlock,\n        id,\n        request: getRequest(id),\n        strict: Boolean(strict),\n        toBlock,\n        type: 'event',\n    };\n}\n//# sourceMappingURL=createEventFilter.js.map","import { createFilterRequestScope } from '../../utils/filters/createFilterRequestScope.js';\n/**\n * Creates a Filter to listen for new pending transaction hashes that can be used with [`getFilterChanges`](https://viem.sh/docs/actions/public/getFilterChanges).\n *\n * - Docs: https://viem.sh/docs/actions/public/createPendingTransactionFilter\n * - JSON-RPC Methods: [`eth_newPendingTransactionFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_newpendingtransactionfilter)\n *\n * @param client - Client to use\n * @returns [`Filter`](https://viem.sh/docs/glossary/types#filter). {@link CreateBlockFilterReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createPendingTransactionFilter } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createPendingTransactionFilter(client)\n * // { id: \"0x345a6572337856574a76364e457a4366\", type: 'transaction' }\n */\nexport async function createPendingTransactionFilter(client) {\n    const getRequest = createFilterRequestScope(client, {\n        method: 'eth_newPendingTransactionFilter',\n    });\n    const id = await client.request({\n        method: 'eth_newPendingTransactionFilter',\n    });\n    return { id, request: getRequest(id), type: 'transaction' };\n}\n//# sourceMappingURL=createPendingTransactionFilter.js.map","import { parseAccount, } from '../../accounts/utils/parseAccount.js';\nimport { encodeFunctionData, } from '../../utils/abi/encodeFunctionData.js';\nimport { getContractError, } from '../../utils/errors/getContractError.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { estimateGas, } from './estimateGas.js';\n/**\n * Estimates the gas required to successfully execute a contract write function call.\n *\n * - Docs: https://viem.sh/docs/contract/estimateContractGas\n *\n * Internally, uses a [Public Client](https://viem.sh/docs/clients/public) to call the [`estimateGas` action](https://viem.sh/docs/actions/public/estimateGas) with [ABI-encoded `data`](https://viem.sh/docs/contract/encodeFunctionData).\n *\n * @param client - Client to use\n * @param parameters - {@link EstimateContractGasParameters}\n * @returns The gas estimate (in wei). {@link EstimateContractGasReturnType}\n *\n * @example\n * import { createPublicClient, http, parseAbi } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { estimateContractGas } from 'viem/contract'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const gas = await estimateContractGas(client, {\n *   address: '0xFBA3912Ca04dd458c843e2EE08967fC04f3579c2',\n *   abi: parseAbi(['function mint() public']),\n *   functionName: 'mint',\n *   account: '0xf39fd6e51aad88f6f4ce6ab8827279cfffb92266',\n * })\n */\nexport async function estimateContractGas(client, parameters) {\n    const { abi, address, args, functionName, ...request } = parameters;\n    const data = encodeFunctionData({\n        abi,\n        args,\n        functionName,\n    });\n    try {\n        const gas = await getAction(client, estimateGas, 'estimateGas')({\n            data,\n            to: address,\n            ...request,\n        });\n        return gas;\n    }\n    catch (error) {\n        const account = request.account ? parseAccount(request.account) : undefined;\n        throw getContractError(error, {\n            abi,\n            address,\n            args,\n            docsPath: '/docs/contract/estimateContractGas',\n            functionName,\n            sender: account?.address,\n        });\n    }\n}\n//# sourceMappingURL=estimateContractGas.js.map","/**\n * Returns the base fee per blob gas in wei.\n *\n * - Docs: https://viem.sh/docs/actions/public/getBlobBaseFee\n * - JSON-RPC Methods: [`eth_blobBaseFee`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_blobBaseFee)\n *\n * @param client - Client to use\n * @returns The blob base fee (in wei). {@link GetBlobBaseFeeReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getBlobBaseFee } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const blobBaseFee = await getBlobBaseFee(client)\n */\nexport async function getBlobBaseFee(client) {\n    const baseFee = await client.request({\n        method: 'eth_blobBaseFee',\n    });\n    return BigInt(baseFee);\n}\n//# sourceMappingURL=getBlobBaseFee.js.map","import { hexToNumber, } from '../../utils/encoding/fromHex.js';\nimport { numberToHex, } from '../../utils/encoding/toHex.js';\n/**\n * Returns the number of Transactions at a block number, hash, or tag.\n *\n * - Docs: https://viem.sh/docs/actions/public/getBlockTransactionCount\n * - JSON-RPC Methods:\n *   - Calls [`eth_getBlockTransactionCountByNumber`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getblocktransactioncountbynumber) for `blockNumber` & `blockTag`.\n *   - Calls [`eth_getBlockTransactionCountByHash`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getblocktransactioncountbyhash) for `blockHash`.\n *\n * @param client - Client to use\n * @param parameters - {@link GetBlockTransactionCountParameters}\n * @returns The block transaction count. {@link GetBlockTransactionCountReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getBlockTransactionCount } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const count = await getBlockTransactionCount(client)\n */\nexport async function getBlockTransactionCount(client, { blockHash, blockNumber, blockTag = 'latest', } = {}) {\n    const blockNumberHex = blockNumber !== undefined ? numberToHex(blockNumber) : undefined;\n    let count;\n    if (blockHash) {\n        count = await client.request({\n            method: 'eth_getBlockTransactionCountByHash',\n            params: [blockHash],\n        }, { dedupe: true });\n    }\n    else {\n        count = await client.request({\n            method: 'eth_getBlockTransactionCountByNumber',\n            params: [blockNumberHex || blockTag],\n        }, { dedupe: Boolean(blockNumberHex) });\n    }\n    return hexToNumber(count);\n}\n//# sourceMappingURL=getBlockTransactionCount.js.map","import { numberToHex, } from '../../utils/encoding/toHex.js';\n/**\n * Retrieves the bytecode at an address.\n *\n * - Docs: https://viem.sh/docs/contract/getCode\n * - JSON-RPC Methods: [`eth_getCode`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getcode)\n *\n * @param client - Client to use\n * @param parameters - {@link GetCodeParameters}\n * @returns The contract's bytecode. {@link GetCodeReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getCode } from 'viem/contract'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const code = await getCode(client, {\n *   address: '0xFBA3912Ca04dd458c843e2EE08967fC04f3579c2',\n * })\n */\nexport async function getCode(client, { address, blockNumber, blockTag = 'latest' }) {\n    const blockNumberHex = blockNumber !== undefined ? numberToHex(blockNumber) : undefined;\n    const hex = await client.request({\n        method: 'eth_getCode',\n        params: [address, blockNumberHex || blockTag],\n    }, { dedupe: Boolean(blockNumberHex) });\n    if (hex === '0x')\n        return undefined;\n    return hex;\n}\n//# sourceMappingURL=getCode.js.map","import { AbiDecodingDataSizeTooSmallError, AbiEventSignatureEmptyTopicsError, AbiEventSignatureNotFoundError, DecodeLogDataMismatch, DecodeLogTopicsMismatch, } from '../../errors/abi.js';\nimport { size } from '../data/size.js';\nimport { toEventSelector, } from '../hash/toEventSelector.js';\nimport { PositionOutOfBoundsError } from '../../errors/cursor.js';\nimport { decodeAbiParameters, } from './decodeAbiParameters.js';\nimport { formatAbiItem } from './formatAbiItem.js';\nconst docsPath = '/docs/contract/decodeEventLog';\nexport function decodeEventLog(parameters) {\n    const { abi, data, strict: strict_, topics, } = parameters;\n    const strict = strict_ ?? true;\n    const [signature, ...argTopics] = topics;\n    if (!signature)\n        throw new AbiEventSignatureEmptyTopicsError({ docsPath });\n    const abiItem = abi.find((x) => x.type === 'event' &&\n        signature === toEventSelector(formatAbiItem(x)));\n    if (!(abiItem && 'name' in abiItem) || abiItem.type !== 'event')\n        throw new AbiEventSignatureNotFoundError(signature, { docsPath });\n    const { name, inputs } = abiItem;\n    const isUnnamed = inputs?.some((x) => !('name' in x && x.name));\n    let args = isUnnamed ? [] : {};\n    // Decode topics (indexed args).\n    const indexedInputs = inputs.filter((x) => 'indexed' in x && x.indexed);\n    for (let i = 0; i < indexedInputs.length; i++) {\n        const param = indexedInputs[i];\n        const topic = argTopics[i];\n        if (!topic)\n            throw new DecodeLogTopicsMismatch({\n                abiItem,\n                param: param,\n            });\n        args[isUnnamed ? i : param.name || i] = decodeTopic({ param, value: topic });\n    }\n    // Decode data (non-indexed args).\n    const nonIndexedInputs = inputs.filter((x) => !('indexed' in x && x.indexed));\n    if (nonIndexedInputs.length > 0) {\n        if (data && data !== '0x') {\n            try {\n                const decodedData = decodeAbiParameters(nonIndexedInputs, data);\n                if (decodedData) {\n                    if (isUnnamed)\n                        args = [...args, ...decodedData];\n                    else {\n                        for (let i = 0; i < nonIndexedInputs.length; i++) {\n                            args[nonIndexedInputs[i].name] = decodedData[i];\n                        }\n                    }\n                }\n            }\n            catch (err) {\n                if (strict) {\n                    if (err instanceof AbiDecodingDataSizeTooSmallError ||\n                        err instanceof PositionOutOfBoundsError)\n                        throw new DecodeLogDataMismatch({\n                            abiItem,\n                            data: data,\n                            params: nonIndexedInputs,\n                            size: size(data),\n                        });\n                    throw err;\n                }\n            }\n        }\n        else if (strict) {\n            throw new DecodeLogDataMismatch({\n                abiItem,\n                data: '0x',\n                params: nonIndexedInputs,\n                size: 0,\n            });\n        }\n    }\n    return {\n        eventName: name,\n        args: Object.values(args).length > 0 ? args : undefined,\n    };\n}\nfunction decodeTopic({ param, value }) {\n    if (param.type === 'string' ||\n        param.type === 'bytes' ||\n        param.type === 'tuple' ||\n        param.type.match(/^(.*)\\[(\\d+)?\\]$/))\n        return value;\n    const decodedArg = decodeAbiParameters([param], value) || [];\n    return decodedArg[0];\n}\n//# sourceMappingURL=decodeEventLog.js.map","// TODO(v3): checksum address.\nimport { AbiEventSignatureNotFoundError, DecodeLogDataMismatch, DecodeLogTopicsMismatch, } from '../../errors/abi.js';\nimport { decodeEventLog, } from './decodeEventLog.js';\n/**\n * Extracts & decodes logs matching the provided signature(s) (`abi` + optional `eventName`)\n * from a set of opaque logs.\n *\n * @param parameters - {@link ParseEventLogsParameters}\n * @returns The logs. {@link ParseEventLogsReturnType}\n *\n * @example\n * import { createClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { parseEventLogs } from 'viem/op-stack'\n *\n * const client = createClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n *\n * const receipt = await getTransactionReceipt(client, {\n *   hash: '0xec23b2ba4bc59ba61554507c1b1bc91649e6586eb2dd00c728e8ed0db8bb37ea',\n * })\n *\n * const logs = parseEventLogs({ logs: receipt.logs })\n * // [{ args: { ... }, eventName: 'TransactionDeposited', ... }, ...]\n */\nexport function parseEventLogs({ abi, eventName, logs, strict = true, }) {\n    return logs\n        .map((log) => {\n        try {\n            const event = decodeEventLog({\n                ...log,\n                abi,\n                strict,\n            });\n            if (eventName && !eventName.includes(event.eventName))\n                return null;\n            return { ...event, ...log };\n        }\n        catch (err) {\n            let eventName;\n            let isUnnamed;\n            if (err instanceof AbiEventSignatureNotFoundError)\n                return null;\n            if (err instanceof DecodeLogDataMismatch ||\n                err instanceof DecodeLogTopicsMismatch) {\n                // If strict mode is on, and log data/topics do not match event definition, skip.\n                if (strict)\n                    return null;\n                eventName = err.abiItem.name;\n                isUnnamed = err.abiItem.inputs?.some((x) => !('name' in x && x.name));\n            }\n            // Set args to empty if there is an error decoding (e.g. indexed/non-indexed params mismatch).\n            return { ...log, args: isUnnamed ? [] : {}, eventName };\n        }\n    })\n        .filter(Boolean);\n}\n//# sourceMappingURL=parseEventLogs.js.map","import { encodeEventTopics, } from '../../utils/abi/encodeEventTopics.js';\nimport { parseEventLogs } from '../../utils/abi/parseEventLogs.js';\nimport { numberToHex, } from '../../utils/encoding/toHex.js';\nimport { formatLog, } from '../../utils/formatters/log.js';\n/**\n * Returns a list of event logs matching the provided parameters.\n *\n * - Docs: https://viem.sh/docs/actions/public/getLogs\n * - Examples: https://stackblitz.com/github/wevm/viem/tree/main/examples/filters-and-logs/event-logs\n * - JSON-RPC Methods: [`eth_getLogs`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getlogs)\n *\n * @param client - Client to use\n * @param parameters - {@link GetLogsParameters}\n * @returns A list of event logs. {@link GetLogsReturnType}\n *\n * @example\n * import { createPublicClient, http, parseAbiItem } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getLogs } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const logs = await getLogs(client)\n */\nexport async function getLogs(client, { address, blockHash, fromBlock, toBlock, event, events: events_, args, strict: strict_, } = {}) {\n    const strict = strict_ ?? false;\n    const events = events_ ?? (event ? [event] : undefined);\n    let topics = [];\n    if (events) {\n        const encoded = events.flatMap((event) => encodeEventTopics({\n            abi: [event],\n            eventName: event.name,\n            args,\n        }));\n        // TODO: Clean up type casting\n        topics = [encoded];\n        if (event)\n            topics = topics[0];\n    }\n    let logs;\n    if (blockHash) {\n        logs = await client.request({\n            method: 'eth_getLogs',\n            params: [{ address, topics, blockHash }],\n        });\n    }\n    else {\n        logs = await client.request({\n            method: 'eth_getLogs',\n            params: [\n                {\n                    address,\n                    topics,\n                    fromBlock: typeof fromBlock === 'bigint' ? numberToHex(fromBlock) : fromBlock,\n                    toBlock: typeof toBlock === 'bigint' ? numberToHex(toBlock) : toBlock,\n                },\n            ],\n        });\n    }\n    const formattedLogs = logs.map((log) => formatLog(log));\n    if (!events)\n        return formattedLogs;\n    return parseEventLogs({\n        abi: events,\n        logs: formattedLogs,\n        strict,\n    });\n}\n//# sourceMappingURL=getLogs.js.map","import { getAbiItem, } from '../../utils/abi/getAbiItem.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { getLogs, } from './getLogs.js';\n/**\n * Returns a list of event logs emitted by a contract.\n *\n * - Docs: https://viem.sh/docs/actions/public/getContractEvents\n * - JSON-RPC Methods: [`eth_getLogs`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getlogs)\n *\n * @param client - Client to use\n * @param parameters - {@link GetContractEventsParameters}\n * @returns A list of event logs. {@link GetContractEventsReturnType}\n *\n * @example\n * import { createClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getContractEvents } from 'viem/public'\n * import { wagmiAbi } from './abi'\n *\n * const client = createClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const logs = await getContractEvents(client, {\n *  address: '0xFBA3912Ca04dd458c843e2EE08967fC04f3579c2',\n *  abi: wagmiAbi,\n *  eventName: 'Transfer'\n * })\n */\nexport async function getContractEvents(client, parameters) {\n    const { abi, address, args, blockHash, eventName, fromBlock, toBlock, strict, } = parameters;\n    const event = eventName\n        ? getAbiItem({ abi, name: eventName })\n        : undefined;\n    const events = !event\n        ? abi.filter((x) => x.type === 'event')\n        : undefined;\n    return getAction(client, getLogs, 'getLogs')({\n        address,\n        args,\n        blockHash,\n        event,\n        events,\n        fromBlock,\n        toBlock,\n        strict,\n    });\n}\n//# sourceMappingURL=getContractEvents.js.map","import { BaseError } from './base.js';\nexport class Eip712DomainNotFoundError extends BaseError {\n    constructor({ address }) {\n        super(`No EIP-712 domain found on contract \"${address}\".`, {\n            metaMessages: [\n                'Ensure that:',\n                `- The contract is deployed at the address \"${address}\".`,\n                '- `eip712Domain()` function exists on the contract.',\n                '- `eip712Domain()` function matches signature to ERC-5267 specification.',\n            ],\n        });\n        Object.defineProperty(this, \"name\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: 'Eip712DomainNotFoundError'\n        });\n    }\n}\n//# sourceMappingURL=eip712.js.map","import { Eip712DomainNotFoundError, } from '../../errors/eip712.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { readContract, } from './readContract.js';\n/**\n * Reads the EIP-712 domain from a contract, based on the ERC-5267 specification.\n *\n * @param client - A {@link Client} instance.\n * @param parameters - The parameters of the action. {@link GetEip712DomainParameters}\n * @returns The EIP-712 domain, fields, and extensions. {@link GetEip712DomainReturnType}\n *\n * @example\n * ```ts\n * import { createPublicClient, http, getEip712Domain } from 'viem'\n * import { mainnet } from 'viem/chains'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n *\n * const domain = await getEip712Domain(client, {\n *   address: '0xA0b86991c6218b36c1d19D4a2e9Eb0cE3606eB48',\n * })\n * // {\n * //   domain: {\n * //     name: 'ExampleContract',\n * //     version: '1',\n * //     chainId: 1,\n * //     verifyingContract: '0xA0b86991c6218b36c1d19D4a2e9Eb0cE3606eB48',\n * //   },\n * //   fields: '0x0f',\n * //   extensions: [],\n * // }\n * ```\n */\nexport async function getEip712Domain(client, parameters) {\n    const { address, factory, factoryData } = parameters;\n    try {\n        const [fields, name, version, chainId, verifyingContract, salt, extensions,] = await getAction(client, readContract, 'readContract')({\n            abi,\n            address,\n            functionName: 'eip712Domain',\n            factory,\n            factoryData,\n        });\n        return {\n            domain: {\n                name,\n                version,\n                chainId: Number(chainId),\n                verifyingContract,\n                salt,\n            },\n            extensions,\n            fields,\n        };\n    }\n    catch (e) {\n        const error = e;\n        if (error.name === 'ContractFunctionExecutionError' &&\n            error.cause.name === 'ContractFunctionZeroDataError') {\n            throw new Eip712DomainNotFoundError({ address });\n        }\n        throw error;\n    }\n}\nconst abi = [\n    {\n        inputs: [],\n        name: 'eip712Domain',\n        outputs: [\n            { name: 'fields', type: 'bytes1' },\n            { name: 'name', type: 'string' },\n            { name: 'version', type: 'string' },\n            { name: 'chainId', type: 'uint256' },\n            { name: 'verifyingContract', type: 'address' },\n            { name: 'salt', type: 'bytes32' },\n            { name: 'extensions', type: 'uint256[]' },\n        ],\n        stateMutability: 'view',\n        type: 'function',\n    },\n];\n//# sourceMappingURL=getEip712Domain.js.map","export function formatFeeHistory(feeHistory) {\n    return {\n        baseFeePerGas: feeHistory.baseFeePerGas.map((value) => BigInt(value)),\n        gasUsedRatio: feeHistory.gasUsedRatio,\n        oldestBlock: BigInt(feeHistory.oldestBlock),\n        reward: feeHistory.reward?.map((reward) => reward.map((value) => BigInt(value))),\n    };\n}\n//# sourceMappingURL=feeHistory.js.map","import { numberToHex, } from '../../utils/encoding/toHex.js';\nimport { formatFeeHistory, } from '../../utils/formatters/feeHistory.js';\n/**\n * Returns a collection of historical gas information.\n *\n * - Docs: https://viem.sh/docs/actions/public/getFeeHistory\n * - JSON-RPC Methods: [`eth_feeHistory`](https://docs.alchemy.com/reference/eth-feehistory)\n *\n * @param client - Client to use\n * @param parameters - {@link GetFeeHistoryParameters}\n * @returns The gas estimate (in wei). {@link GetFeeHistoryReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getFeeHistory } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const feeHistory = await getFeeHistory(client, {\n *   blockCount: 4,\n *   rewardPercentiles: [25, 75],\n * })\n */\nexport async function getFeeHistory(client, { blockCount, blockNumber, blockTag = 'latest', rewardPercentiles, }) {\n    const blockNumberHex = blockNumber ? numberToHex(blockNumber) : undefined;\n    const feeHistory = await client.request({\n        method: 'eth_feeHistory',\n        params: [\n            numberToHex(blockCount),\n            blockNumberHex || blockTag,\n            rewardPercentiles,\n        ],\n    }, { dedupe: Boolean(blockNumberHex) });\n    return formatFeeHistory(feeHistory);\n}\n//# sourceMappingURL=getFeeHistory.js.map","import { parseEventLogs } from '../../utils/abi/parseEventLogs.js';\nimport { formatLog, } from '../../utils/formatters/log.js';\n/**\n * Returns a list of logs or hashes based on a [Filter](/docs/glossary/terms#filter) since the last time it was called.\n *\n * - Docs: https://viem.sh/docs/actions/public/getFilterChanges\n * - JSON-RPC Methods: [`eth_getFilterChanges`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getfilterchanges)\n *\n * A Filter can be created from the following actions:\n *\n * - [`createBlockFilter`](https://viem.sh/docs/actions/public/createBlockFilter)\n * - [`createContractEventFilter`](https://viem.sh/docs/contract/createContractEventFilter)\n * - [`createEventFilter`](https://viem.sh/docs/actions/public/createEventFilter)\n * - [`createPendingTransactionFilter`](https://viem.sh/docs/actions/public/createPendingTransactionFilter)\n *\n * Depending on the type of filter, the return value will be different:\n *\n * - If the filter was created with `createContractEventFilter` or `createEventFilter`, it returns a list of logs.\n * - If the filter was created with `createPendingTransactionFilter`, it returns a list of transaction hashes.\n * - If the filter was created with `createBlockFilter`, it returns a list of block hashes.\n *\n * @param client - Client to use\n * @param parameters - {@link GetFilterChangesParameters}\n * @returns Logs or hashes. {@link GetFilterChangesReturnType}\n *\n * @example\n * // Blocks\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createBlockFilter, getFilterChanges } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createBlockFilter(client)\n * const hashes = await getFilterChanges(client, { filter })\n *\n * @example\n * // Contract Events\n * import { createPublicClient, http, parseAbi } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createContractEventFilter, getFilterChanges } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createContractEventFilter(client, {\n *   address: '0xa0b86991c6218b36c1d19d4a2e9eb0ce3606eb48',\n *   abi: parseAbi(['event Transfer(address indexed, address indexed, uint256)']),\n *   eventName: 'Transfer',\n * })\n * const logs = await getFilterChanges(client, { filter })\n *\n * @example\n * // Raw Events\n * import { createPublicClient, http, parseAbiItem } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createEventFilter, getFilterChanges } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createEventFilter(client, {\n *   address: '0xa0b86991c6218b36c1d19d4a2e9eb0ce3606eb48',\n *   event: parseAbiItem('event Transfer(address indexed, address indexed, uint256)'),\n * })\n * const logs = await getFilterChanges(client, { filter })\n *\n * @example\n * // Transactions\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createPendingTransactionFilter, getFilterChanges } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createPendingTransactionFilter(client)\n * const hashes = await getFilterChanges(client, { filter })\n */\nexport async function getFilterChanges(_client, { filter, }) {\n    const strict = 'strict' in filter && filter.strict;\n    const logs = await filter.request({\n        method: 'eth_getFilterChanges',\n        params: [filter.id],\n    });\n    if (typeof logs[0] === 'string')\n        return logs;\n    const formattedLogs = logs.map((log) => formatLog(log));\n    if (!('abi' in filter) || !filter.abi)\n        return formattedLogs;\n    return parseEventLogs({\n        abi: filter.abi,\n        logs: formattedLogs,\n        strict,\n    });\n}\n//# sourceMappingURL=getFilterChanges.js.map","import { parseEventLogs } from '../../utils/abi/parseEventLogs.js';\nimport { formatLog, } from '../../utils/formatters/log.js';\n/**\n * Returns a list of event logs since the filter was created.\n *\n * - Docs: https://viem.sh/docs/actions/public/getFilterLogs\n * - JSON-RPC Methods: [`eth_getFilterLogs`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getfilterlogs)\n *\n * `getFilterLogs` is only compatible with **event filters**.\n *\n * @param client - Client to use\n * @param parameters - {@link GetFilterLogsParameters}\n * @returns A list of event logs. {@link GetFilterLogsReturnType}\n *\n * @example\n * import { createPublicClient, http, parseAbiItem } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createEventFilter, getFilterLogs } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const filter = await createEventFilter(client, {\n *   address: '0xa0b86991c6218b36c1d19d4a2e9eb0ce3606eb48',\n *   event: parseAbiItem('event Transfer(address indexed, address indexed, uint256)'),\n * })\n * const logs = await getFilterLogs(client, { filter })\n */\nexport async function getFilterLogs(_client, { filter, }) {\n    const strict = filter.strict ?? false;\n    const logs = await filter.request({\n        method: 'eth_getFilterLogs',\n        params: [filter.id],\n    });\n    const formattedLogs = logs.map((log) => formatLog(log));\n    if (!filter.abi)\n        return formattedLogs;\n    return parseEventLogs({\n        abi: filter.abi,\n        logs: formattedLogs,\n        strict,\n    });\n}\n//# sourceMappingURL=getFilterLogs.js.map","import { hexToNumber } from '../index.js';\nfunction formatStorageProof(storageProof) {\n    return storageProof.map((proof) => ({\n        ...proof,\n        value: BigInt(proof.value),\n    }));\n}\nexport function formatProof(proof) {\n    return {\n        ...proof,\n        balance: proof.balance ? BigInt(proof.balance) : undefined,\n        nonce: proof.nonce ? hexToNumber(proof.nonce) : undefined,\n        storageProof: proof.storageProof\n            ? formatStorageProof(proof.storageProof)\n            : undefined,\n    };\n}\n//# sourceMappingURL=proof.js.map","import { numberToHex, } from '../../utils/encoding/toHex.js';\nimport { formatProof, } from '../../utils/formatters/proof.js';\n/**\n * Returns the account and storage values of the specified account including the Merkle-proof.\n *\n * - Docs: https://viem.sh/docs/actions/public/getProof\n * - JSON-RPC Methods:\n *   - Calls [`eth_getProof`](https://eips.ethereum.org/EIPS/eip-1186)\n *\n * @param client - Client to use\n * @param parameters - {@link GetProofParameters}\n * @returns Proof data. {@link GetProofReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getProof } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const block = await getProof(client, {\n *  address: '0x...',\n *  storageKeys: ['0x...'],\n * })\n */\nexport async function getProof(client, { address, blockNumber, blockTag: blockTag_, storageKeys, }) {\n    const blockTag = blockTag_ ?? 'latest';\n    const blockNumberHex = blockNumber !== undefined ? numberToHex(blockNumber) : undefined;\n    const proof = await client.request({\n        method: 'eth_getProof',\n        params: [address, storageKeys, blockNumberHex || blockTag],\n    });\n    return formatProof(proof);\n}\n//# sourceMappingURL=getProof.js.map","import { numberToHex, } from '../../utils/encoding/toHex.js';\n/**\n * Returns the value from a storage slot at a given address.\n *\n * - Docs: https://viem.sh/docs/contract/getStorageAt\n * - JSON-RPC Methods: [`eth_getStorageAt`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getstorageat)\n *\n * @param client - Client to use\n * @param parameters - {@link GetStorageAtParameters}\n * @returns The value of the storage slot. {@link GetStorageAtReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getStorageAt } from 'viem/contract'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const code = await getStorageAt(client, {\n *   address: '0xFBA3912Ca04dd458c843e2EE08967fC04f3579c2',\n *   slot: toHex(0),\n * })\n */\nexport async function getStorageAt(client, { address, blockNumber, blockTag = 'latest', slot }) {\n    const blockNumberHex = blockNumber !== undefined ? numberToHex(blockNumber) : undefined;\n    const data = await client.request({\n        method: 'eth_getStorageAt',\n        params: [address, slot, blockNumberHex || blockTag],\n    });\n    return data;\n}\n//# sourceMappingURL=getStorageAt.js.map","import { getAction } from '../../utils/getAction.js';\nimport { getBlockNumber, } from './getBlockNumber.js';\nimport { getTransaction, } from './getTransaction.js';\n/**\n * Returns the number of blocks passed (confirmations) since the transaction was processed on a block.\n *\n * - Docs: https://viem.sh/docs/actions/public/getTransactionConfirmations\n * - Example: https://stackblitz.com/github/wevm/viem/tree/main/examples/transactions/fetching-transactions\n * - JSON-RPC Methods: [`eth_getTransactionConfirmations`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getTransactionConfirmations)\n *\n * @param client - Client to use\n * @param parameters - {@link GetTransactionConfirmationsParameters}\n * @returns The number of blocks passed since the transaction was processed. If confirmations is 0, then the Transaction has not been confirmed & processed yet. {@link GetTransactionConfirmationsReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { getTransactionConfirmations } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const confirmations = await getTransactionConfirmations(client, {\n *   hash: '0x4ca7ee652d57678f26e887c149ab0735f41de37bcad58c9f6d3ed5824f15b74d',\n * })\n */\nexport async function getTransactionConfirmations(client, { hash, transactionReceipt }) {\n    const [blockNumber, transaction] = await Promise.all([\n        getAction(client, getBlockNumber, 'getBlockNumber')({}),\n        hash\n            ? getAction(client, getTransaction, 'getTransaction')({ hash })\n            : undefined,\n    ]);\n    const transactionBlockNumber = transactionReceipt?.blockNumber || transaction?.blockNumber;\n    if (!transactionBlockNumber)\n        return 0n;\n    return blockNumber - transactionBlockNumber + 1n;\n}\n//# sourceMappingURL=getTransactionConfirmations.js.map","/**\n * Destroys a [`Filter`](https://viem.sh/docs/glossary/types#filter).\n *\n * - Docs: https://viem.sh/docs/actions/public/uninstallFilter\n * - JSON-RPC Methods: [`eth_uninstallFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_uninstallFilter)\n *\n * Destroys a Filter that was created from one of the following Actions:\n * - [`createBlockFilter`](https://viem.sh/docs/actions/public/createBlockFilter)\n * - [`createEventFilter`](https://viem.sh/docs/actions/public/createEventFilter)\n * - [`createPendingTransactionFilter`](https://viem.sh/docs/actions/public/createPendingTransactionFilter)\n *\n * @param client - Client to use\n * @param parameters - {@link UninstallFilterParameters}\n * @returns A boolean indicating if the Filter was successfully uninstalled. {@link UninstallFilterReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { createPendingTransactionFilter, uninstallFilter } from 'viem/public'\n *\n * const filter = await createPendingTransactionFilter(client)\n * const uninstalled = await uninstallFilter(client, { filter })\n * // true\n */\nexport async function uninstallFilter(_client, { filter }) {\n    return filter.request({\n        method: 'eth_uninstallFilter',\n        params: [filter.id],\n    });\n}\n//# sourceMappingURL=uninstallFilter.js.map","export const presignMessagePrefix = '\\x19Ethereum Signed Message:\\n';\n//# sourceMappingURL=strings.js.map","import { presignMessagePrefix } from '../../constants/strings.js';\nimport { concat } from '../data/concat.js';\nimport { size } from '../data/size.js';\nimport { bytesToHex, stringToHex, } from '../encoding/toHex.js';\nexport function toPrefixedMessage(message_) {\n    const message = (() => {\n        if (typeof message_ === 'string')\n            return stringToHex(message_);\n        if (typeof message_.raw === 'string')\n            return message_.raw;\n        return bytesToHex(message_.raw);\n    })();\n    const prefix = stringToHex(`${presignMessagePrefix}${size(message)}`);\n    return concat([prefix, message]);\n}\n//# sourceMappingURL=toPrefixedMessage.js.map","import { keccak256 } from '../hash/keccak256.js';\nimport { toPrefixedMessage } from './toPrefixedMessage.js';\nexport function hashMessage(message, to_) {\n    return keccak256(toPrefixedMessage(message), to_);\n}\n//# sourceMappingURL=hashMessage.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 = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = 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","import { equalBytes } from '@noble/curves/abstract/utils';\nimport { toBytes } from '../encoding/toBytes.js';\nimport { isHex } from './isHex.js';\nexport function isBytesEqual(a_, b_) {\n    const a = isHex(a_) ? toBytes(a_) : a_;\n    const b = isHex(b_) ? toBytes(b_) : b_;\n    return equalBytes(a, b);\n}\n//# sourceMappingURL=isBytesEqual.js.map","export const erc6492MagicBytes = '0x6492649264926492649264926492649264926492649264926492649264926492';\nexport const zeroHash = '0x0000000000000000000000000000000000000000000000000000000000000000';\n//# sourceMappingURL=bytes.js.map","import { erc6492MagicBytes } from '../../constants/bytes.js';\nimport { sliceHex } from '../data/slice.js';\n/** Whether or not the signature is an ERC-6492 formatted signature. */\nexport function isErc6492Signature(signature) {\n    return sliceHex(signature, -32) === erc6492MagicBytes;\n}\n//# sourceMappingURL=isErc6492Signature.js.map","import { erc6492MagicBytes } from '../../constants/bytes.js';\nimport { encodeAbiParameters } from '../abi/encodeAbiParameters.js';\nimport { concatHex } from '../data/concat.js';\n/**\n * @description Serializes a ERC-6492 flavoured signature into hex format.\n *\n * @param signature ERC-6492 signature in object format.\n * @returns ERC-6492 signature in hex format.\n *\n * @example\n * serializeSignature({ address: '0x...', data: '0x...', signature: '0x...' })\n * // '0x000000000000000000000000cafebabecafebabecafebabecafebabecafebabe000000000000000000000000000000000000000000000000000000000000006000000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000000000000000000000004deadbeef000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000041a461f509887bd19e312c0c58467ce8ff8e300d3c1a90b608a760c5b80318eaf15fe57c96f9175d6cd4daad4663763baa7e78836e067d0163e9a2ccf2ff753f5b1b000000000000000000000000000000000000000000000000000000000000006492649264926492649264926492649264926492649264926492649264926492'\n */\nexport function serializeErc6492Signature(parameters) {\n    const { address, data, signature } = parameters;\n    return concatHex([\n        encodeAbiParameters([{ type: 'address' }, { type: 'bytes' }, { type: 'bytes' }], [address, data, signature]),\n        erc6492MagicBytes,\n    ]);\n}\n//# sourceMappingURL=serializeErc6492Signature.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, 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","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// 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// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.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 { Field, mod, pow2 } from './abstract/modular.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { createCurve } from './_shortw_utils.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 { secp256k1 } from '@noble/curves/secp256k1';\nimport { hexToBigInt } from '../encoding/fromHex.js';\n/**\n * @description Converts a signature into hex format.\n *\n * @param signature The signature to convert.\n * @returns The signature in hex format.\n *\n * @example\n * serializeSignature({\n *   r: '0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf',\n *   s: '0x4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db8',\n *   yParity: 1\n * })\n * // \"0x6e100a352ec6ad1b70802290e18aeed190704973570f3b8ed42cb9808e2ea6bf4a90a229a244495b41890987806fcbd2d5d23fc0dbe5f5256c2613c039d76db81c\"\n */\nexport function serializeSignature({ r, s, v, yParity }) {\n    const yParity_ = (() => {\n        if (yParity === 0 || yParity === 1)\n            return yParity;\n        if (v && (v === 27n || v === 28n || v >= 35n))\n            return v % 2n === 0n ? 1 : 0;\n        throw new Error('Invalid `v` or `yParity` value');\n    })();\n    return `0x${new secp256k1.Signature(hexToBigInt(r), hexToBigInt(s)).toCompactHex()}${yParity_ === 0 ? '1b' : '1c'}`;\n}\n//# sourceMappingURL=serializeSignature.js.map","import { universalSignatureValidatorAbi } from '../../constants/abis.js';\nimport { universalSignatureValidatorByteCode } from '../../constants/contracts.js';\nimport { CallExecutionError } from '../../errors/contract.js';\nimport { encodeDeployData, } from '../../utils/abi/encodeDeployData.js';\nimport { isBytesEqual, } from '../../utils/data/isBytesEqual.js';\nimport { isHex } from '../../utils/data/isHex.js';\nimport { bytesToHex } from '../../utils/encoding/toHex.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { isErc6492Signature } from '../../utils/signature/isErc6492Signature.js';\nimport { serializeErc6492Signature } from '../../utils/signature/serializeErc6492Signature.js';\nimport { serializeSignature } from '../../utils/signature/serializeSignature.js';\nimport { call } from './call.js';\nimport { getCode } from './getCode.js';\n/**\n * Verifies a message hash onchain using ERC-6492.\n *\n * @param client - Client to use.\n * @param parameters - {@link VerifyHashParameters}\n * @returns Whether or not the signature is valid. {@link VerifyHashReturnType}\n */\nexport async function verifyHash(client, parameters) {\n    const { address, factory, factoryData, hash, signature, ...rest } = parameters;\n    const signatureHex = (() => {\n        if (isHex(signature))\n            return signature;\n        if (typeof signature === 'object' && 'r' in signature && 's' in signature)\n            return serializeSignature(signature);\n        return bytesToHex(signature);\n    })();\n    const wrappedSignature = await (async () => {\n        // If no `factory` or `factoryData` is provided, it is assumed that the\n        // address is not a Smart Account, or the Smart Account is already deployed.\n        if (!factory && !factoryData)\n            return signatureHex;\n        // If the signature is already wrapped, return the signature.\n        if (isErc6492Signature(signatureHex))\n            return signatureHex;\n        const bytecode = await getAction(client, getCode, 'getCode')({ address });\n        // If the Smart Account is deployed, return the plain signature.\n        if (bytecode)\n            return signatureHex;\n        // If the Smart Account is not deployed, wrap the signature with a 6492 wrapper\n        // to perform counterfactual validation.\n        return serializeErc6492Signature({\n            address: factory,\n            data: factoryData,\n            signature: signatureHex,\n        });\n    })();\n    try {\n        const { data } = await getAction(client, call, 'call')({\n            data: encodeDeployData({\n                abi: universalSignatureValidatorAbi,\n                args: [address, hash, wrappedSignature],\n                bytecode: universalSignatureValidatorByteCode,\n            }),\n            ...rest,\n        });\n        return isBytesEqual(data ?? '0x0', '0x1');\n    }\n    catch (error) {\n        if (error instanceof CallExecutionError) {\n            // if the execution fails, the signature was not valid and an internal method inside of the validator reverted\n            // this can happen for many reasons, for example if signer can not be recovered from the signature\n            // or if the signature has no valid format\n            return false;\n        }\n        throw error;\n    }\n}\n//# sourceMappingURL=verifyHash.js.map","import { hashMessage } from '../../utils/signature/hashMessage.js';\nimport { verifyHash, } from './verifyHash.js';\n/**\n * Verify that a message was signed by the provided address.\n *\n * Compatible with Smart Contract Accounts & Externally Owned Accounts via [ERC-6492](https://eips.ethereum.org/EIPS/eip-6492).\n *\n * - Docs {@link https://viem.sh/docs/actions/public/verifyMessage}\n *\n * @param client - Client to use.\n * @param parameters - {@link VerifyMessageParameters}\n * @returns Whether or not the signature is valid. {@link VerifyMessageReturnType}\n */\nexport async function verifyMessage(client, { address, message, factory, factoryData, signature, ...callRequest }) {\n    const hash = hashMessage(message);\n    return verifyHash(client, {\n        address,\n        factory: factory,\n        factoryData: factoryData,\n        hash,\n        signature,\n        ...callRequest,\n    });\n}\n//# sourceMappingURL=verifyMessage.js.map","export const arrayRegex = /^(.*)\\[([0-9]*)\\]$/;\n// `bytes<M>`: binary type of `M` bytes, `0 < M <= 32`\n// https://regexr.com/6va55\nexport const bytesRegex = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/;\n// `(u)int<M>`: (un)signed integer type of `M` bits, `0 < M <= 256`, `M % 8 == 0`\n// https://regexr.com/6v8hp\nexport const integerRegex = /^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;\n//# sourceMappingURL=regex.js.map","import { BytesSizeMismatchError } from '../errors/abi.js';\nimport { InvalidAddressError } from '../errors/address.js';\nimport { isAddress } from './address/isAddress.js';\nimport { size } from './data/size.js';\nimport { numberToHex } from './encoding/toHex.js';\nimport { bytesRegex, integerRegex } from './regex.js';\nimport { hashDomain, } from './signature/hashTypedData.js';\nimport { stringify } from './stringify.js';\nexport function serializeTypedData(parameters) {\n    const { domain: domain_, message: message_, primaryType, types, } = parameters;\n    const normalizeData = (struct, data_) => {\n        const data = { ...data_ };\n        for (const param of struct) {\n            const { name, type } = param;\n            if (type === 'address')\n                data[name] = data[name].toLowerCase();\n        }\n        return data;\n    };\n    const domain = (() => {\n        if (!types.EIP712Domain)\n            return {};\n        if (!domain_)\n            return {};\n        return normalizeData(types.EIP712Domain, domain_);\n    })();\n    const message = (() => {\n        if (primaryType === 'EIP712Domain')\n            return undefined;\n        return normalizeData(types[primaryType], message_);\n    })();\n    return stringify({ domain, message, primaryType, types });\n}\nexport function validateTypedData(parameters) {\n    const { domain, message, primaryType, types } = parameters;\n    const validateData = (struct, data) => {\n        for (const param of struct) {\n            const { name, type } = param;\n            const value = data[name];\n            const integerMatch = type.match(integerRegex);\n            if (integerMatch &&\n                (typeof value === 'number' || typeof value === 'bigint')) {\n                const [_type, base, size_] = integerMatch;\n                // If number cannot be cast to a sized hex value, it is out of range\n                // and will throw.\n                numberToHex(value, {\n                    signed: base === 'int',\n                    size: Number.parseInt(size_) / 8,\n                });\n            }\n            if (type === 'address' && typeof value === 'string' && !isAddress(value))\n                throw new InvalidAddressError({ address: value });\n            const bytesMatch = type.match(bytesRegex);\n            if (bytesMatch) {\n                const [_type, size_] = bytesMatch;\n                if (size_ && size(value) !== Number.parseInt(size_))\n                    throw new BytesSizeMismatchError({\n                        expectedSize: Number.parseInt(size_),\n                        givenSize: size(value),\n                    });\n            }\n            const struct = types[type];\n            if (struct)\n                validateData(struct, value);\n        }\n    };\n    // Validate domain types.\n    if (types.EIP712Domain && domain)\n        validateData(types.EIP712Domain, domain);\n    // Validate message types.\n    if (primaryType !== 'EIP712Domain')\n        validateData(types[primaryType], message);\n}\nexport function getTypesForEIP712Domain({ domain, }) {\n    return [\n        typeof domain?.name === 'string' && { name: 'name', type: 'string' },\n        domain?.version && { name: 'version', type: 'string' },\n        typeof domain?.chainId === 'number' && {\n            name: 'chainId',\n            type: 'uint256',\n        },\n        domain?.verifyingContract && {\n            name: 'verifyingContract',\n            type: 'address',\n        },\n        domain?.salt && { name: 'salt', type: 'bytes32' },\n    ].filter(Boolean);\n}\nexport function domainSeparator({ domain }) {\n    return hashDomain({\n        domain,\n        types: {\n            EIP712Domain: getTypesForEIP712Domain({ domain }),\n        },\n    });\n}\n//# sourceMappingURL=typedData.js.map","// Implementation forked and adapted from https://github.com/MetaMask/eth-sig-util/blob/main/src/sign-typed-data.ts\nimport { encodeAbiParameters, } from '../abi/encodeAbiParameters.js';\nimport { concat } from '../data/concat.js';\nimport { toHex } from '../encoding/toHex.js';\nimport { keccak256 } from '../hash/keccak256.js';\nimport { getTypesForEIP712Domain, validateTypedData, } from '../typedData.js';\nexport function hashTypedData(parameters) {\n    const { domain = {}, message, primaryType, } = parameters;\n    const types = {\n        EIP712Domain: getTypesForEIP712Domain({ domain }),\n        ...parameters.types,\n    };\n    // Need to do a runtime validation check on addresses, byte ranges, integer ranges, etc\n    // as we can't statically check this with TypeScript.\n    validateTypedData({\n        domain,\n        message,\n        primaryType,\n        types,\n    });\n    const parts = ['0x1901'];\n    if (domain)\n        parts.push(hashDomain({\n            domain,\n            types: types,\n        }));\n    if (primaryType !== 'EIP712Domain')\n        parts.push(hashStruct({\n            data: message,\n            primaryType,\n            types: types,\n        }));\n    return keccak256(concat(parts));\n}\nexport function hashDomain({ domain, types, }) {\n    return hashStruct({\n        data: domain,\n        primaryType: 'EIP712Domain',\n        types,\n    });\n}\nexport function hashStruct({ data, primaryType, types, }) {\n    const encoded = encodeData({\n        data,\n        primaryType,\n        types,\n    });\n    return keccak256(encoded);\n}\nfunction encodeData({ data, primaryType, types, }) {\n    const encodedTypes = [{ type: 'bytes32' }];\n    const encodedValues = [hashType({ primaryType, types })];\n    for (const field of types[primaryType]) {\n        const [type, value] = encodeField({\n            types,\n            name: field.name,\n            type: field.type,\n            value: data[field.name],\n        });\n        encodedTypes.push(type);\n        encodedValues.push(value);\n    }\n    return encodeAbiParameters(encodedTypes, encodedValues);\n}\nfunction hashType({ primaryType, types, }) {\n    const encodedHashType = toHex(encodeType({ primaryType, types }));\n    return keccak256(encodedHashType);\n}\nexport function encodeType({ primaryType, types, }) {\n    let result = '';\n    const unsortedDeps = findTypeDependencies({ primaryType, types });\n    unsortedDeps.delete(primaryType);\n    const deps = [primaryType, ...Array.from(unsortedDeps).sort()];\n    for (const type of deps) {\n        result += `${type}(${types[type]\n            .map(({ name, type: t }) => `${t} ${name}`)\n            .join(',')})`;\n    }\n    return result;\n}\nfunction findTypeDependencies({ primaryType: primaryType_, types, }, results = new Set()) {\n    const match = primaryType_.match(/^\\w*/u);\n    const primaryType = match?.[0];\n    if (results.has(primaryType) || types[primaryType] === undefined) {\n        return results;\n    }\n    results.add(primaryType);\n    for (const field of types[primaryType]) {\n        findTypeDependencies({ primaryType: field.type, types }, results);\n    }\n    return results;\n}\nfunction encodeField({ types, name, type, value, }) {\n    if (types[type] !== undefined) {\n        return [\n            { type: 'bytes32' },\n            keccak256(encodeData({ data: value, primaryType: type, types })),\n        ];\n    }\n    if (type === 'bytes') {\n        const prepend = value.length % 2 ? '0' : '';\n        value = `0x${prepend + value.slice(2)}`;\n        return [{ type: 'bytes32' }, keccak256(value)];\n    }\n    if (type === 'string')\n        return [{ type: 'bytes32' }, keccak256(toHex(value))];\n    if (type.lastIndexOf(']') === type.length - 1) {\n        const parsedType = type.slice(0, type.lastIndexOf('['));\n        const typeValuePairs = value.map((item) => encodeField({\n            name,\n            type: parsedType,\n            types,\n            value: item,\n        }));\n        return [\n            { type: 'bytes32' },\n            keccak256(encodeAbiParameters(typeValuePairs.map(([t]) => t), typeValuePairs.map(([, v]) => v))),\n        ];\n    }\n    return [{ type }, value];\n}\n//# sourceMappingURL=hashTypedData.js.map","import { hashTypedData, } from '../../utils/signature/hashTypedData.js';\nimport { verifyHash, } from './verifyHash.js';\n/**\n * Verify that typed data was signed by the provided address.\n *\n * - Docs {@link https://viem.sh/docs/actions/public/verifyTypedData}\n *\n * @param client - Client to use.\n * @param parameters - {@link VerifyTypedDataParameters}\n * @returns Whether or not the signature is valid. {@link VerifyTypedDataReturnType}\n */\nexport async function verifyTypedData(client, parameters) {\n    const { address, factory, factoryData, signature, message, primaryType, types, domain, ...callRequest } = parameters;\n    const hash = hashTypedData({ message, primaryType, types, domain });\n    return verifyHash(client, {\n        address,\n        factory: factory,\n        factoryData: factoryData,\n        hash,\n        signature,\n        ...callRequest,\n    });\n}\n//# sourceMappingURL=verifyTypedData.js.map","import { formatBlock } from '../../utils/formatters/block.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { observe } from '../../utils/observe.js';\nimport { poll } from '../../utils/poll.js';\nimport { stringify } from '../../utils/stringify.js';\nimport { getBlock } from './getBlock.js';\n/**\n * Watches and returns information for incoming blocks.\n *\n * - Docs: https://viem.sh/docs/actions/public/watchBlocks\n * - Examples: https://stackblitz.com/github/wevm/viem/tree/main/examples/blocks/watching-blocks\n * - JSON-RPC Methods:\n *   - When `poll: true`, calls [`eth_getBlockByNumber`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getBlockByNumber) on a polling interval.\n *   - When `poll: false` & WebSocket Transport, uses a WebSocket subscription via [`eth_subscribe`](https://docs.alchemy.com/reference/eth-subscribe-polygon) and the `\"newHeads\"` event.\n *\n * @param client - Client to use\n * @param parameters - {@link WatchBlocksParameters}\n * @returns A function that can be invoked to stop watching for new block numbers. {@link WatchBlocksReturnType}\n *\n * @example\n * import { createPublicClient, watchBlocks, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const unwatch = watchBlocks(client, {\n *   onBlock: (block) => console.log(block),\n * })\n */\nexport function watchBlocks(client, { blockTag = 'latest', emitMissed = false, emitOnBegin = false, onBlock, onError, includeTransactions: includeTransactions_, poll: poll_, pollingInterval = client.pollingInterval, }) {\n    const enablePolling = (() => {\n        if (typeof poll_ !== 'undefined')\n            return poll_;\n        if (client.transport.type === 'webSocket')\n            return false;\n        if (client.transport.type === 'fallback' &&\n            client.transport.transports[0].config.type === 'webSocket')\n            return false;\n        return true;\n    })();\n    const includeTransactions = includeTransactions_ ?? false;\n    let prevBlock;\n    const pollBlocks = () => {\n        const observerId = stringify([\n            'watchBlocks',\n            client.uid,\n            blockTag,\n            emitMissed,\n            emitOnBegin,\n            includeTransactions,\n            pollingInterval,\n        ]);\n        return observe(observerId, { onBlock, onError }, (emit) => poll(async () => {\n            try {\n                const block = await getAction(client, getBlock, 'getBlock')({\n                    blockTag,\n                    includeTransactions,\n                });\n                if (block.number && prevBlock?.number) {\n                    // If the current block number is the same as the previous,\n                    // we can skip.\n                    if (block.number === prevBlock.number)\n                        return;\n                    // If we have missed out on some previous blocks, and the\n                    // `emitMissed` flag is truthy, let's emit those blocks.\n                    if (block.number - prevBlock.number > 1 && emitMissed) {\n                        for (let i = prevBlock?.number + 1n; i < block.number; i++) {\n                            const block = (await getAction(client, getBlock, 'getBlock')({\n                                blockNumber: i,\n                                includeTransactions,\n                            }));\n                            emit.onBlock(block, prevBlock);\n                            prevBlock = block;\n                        }\n                    }\n                }\n                if (\n                // If no previous block exists, emit.\n                !prevBlock?.number ||\n                    // If the block tag is \"pending\" with no block number, emit.\n                    (blockTag === 'pending' && !block?.number) ||\n                    // If the next block number is greater than the previous block number, emit.\n                    // We don't want to emit blocks in the past.\n                    (block.number && block.number > prevBlock.number)) {\n                    emit.onBlock(block, prevBlock);\n                    prevBlock = block;\n                }\n            }\n            catch (err) {\n                emit.onError?.(err);\n            }\n        }, {\n            emitOnBegin,\n            interval: pollingInterval,\n        }));\n    };\n    const subscribeBlocks = () => {\n        let active = true;\n        let unsubscribe = () => (active = false);\n        (async () => {\n            try {\n                const transport = (() => {\n                    if (client.transport.type === 'fallback') {\n                        const transport = client.transport.transports.find((transport) => transport.config.type === 'webSocket');\n                        if (!transport)\n                            return client.transport;\n                        return transport.value;\n                    }\n                    return client.transport;\n                })();\n                const { unsubscribe: unsubscribe_ } = await transport.subscribe({\n                    params: ['newHeads'],\n                    onData(data) {\n                        if (!active)\n                            return;\n                        const format = client.chain?.formatters?.block?.format || formatBlock;\n                        const block = format(data.result);\n                        onBlock(block, prevBlock);\n                        prevBlock = block;\n                    },\n                    onError(error) {\n                        onError?.(error);\n                    },\n                });\n                unsubscribe = unsubscribe_;\n                if (!active)\n                    unsubscribe();\n            }\n            catch (err) {\n                onError?.(err);\n            }\n        })();\n        return () => unsubscribe();\n    };\n    return enablePolling ? pollBlocks() : subscribeBlocks();\n}\n//# sourceMappingURL=watchBlocks.js.map","import { DecodeLogDataMismatch, DecodeLogTopicsMismatch, } from '../../errors/abi.js';\nimport { InvalidInputRpcError } from '../../errors/rpc.js';\nimport { decodeEventLog } from '../../utils/abi/decodeEventLog.js';\nimport { encodeEventTopics, } from '../../utils/abi/encodeEventTopics.js';\nimport { formatLog } from '../../utils/formatters/log.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { observe } from '../../utils/observe.js';\nimport { poll } from '../../utils/poll.js';\nimport { stringify } from '../../utils/stringify.js';\nimport { createContractEventFilter } from './createContractEventFilter.js';\nimport { getBlockNumber } from './getBlockNumber.js';\nimport { getContractEvents, } from './getContractEvents.js';\nimport { getFilterChanges } from './getFilterChanges.js';\nimport { uninstallFilter } from './uninstallFilter.js';\n/**\n * Watches and returns emitted contract event logs.\n *\n * - Docs: https://viem.sh/docs/contract/watchContractEvent\n *\n * This Action will batch up all the event logs found within the [`pollingInterval`](https://viem.sh/docs/contract/watchContractEvent#pollinginterval-optional), and invoke them via [`onLogs`](https://viem.sh/docs/contract/watchContractEvent#onLogs).\n *\n * `watchContractEvent` will attempt to create an [Event Filter](https://viem.sh/docs/contract/createContractEventFilter) and listen to changes to the Filter per polling interval, however, if the RPC Provider does not support Filters (e.g. `eth_newFilter`), then `watchContractEvent` will fall back to using [`getLogs`](https://viem.sh/docs/actions/public/getLogs) instead.\n *\n * @param client - Client to use\n * @param parameters - {@link WatchContractEventParameters}\n * @returns A function that can be invoked to stop watching for new event logs. {@link WatchContractEventReturnType}\n *\n * @example\n * import { createPublicClient, http, parseAbi } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { watchContractEvent } from 'viem/contract'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const unwatch = watchContractEvent(client, {\n *   address: '0xFBA3912Ca04dd458c843e2EE08967fC04f3579c2',\n *   abi: parseAbi(['event Transfer(address indexed from, address indexed to, uint256 value)']),\n *   eventName: 'Transfer',\n *   args: { from: '0xc961145a54C96E3aE9bAA048c4F4D6b04C13916b' },\n *   onLogs: (logs) => console.log(logs),\n * })\n */\nexport function watchContractEvent(client, parameters) {\n    const { abi, address, args, batch = true, eventName, fromBlock, onError, onLogs, poll: poll_, pollingInterval = client.pollingInterval, strict: strict_, } = parameters;\n    const enablePolling = (() => {\n        if (typeof poll_ !== 'undefined')\n            return poll_;\n        if (typeof fromBlock === 'bigint')\n            return true;\n        if (client.transport.type === 'webSocket')\n            return false;\n        if (client.transport.type === 'fallback' &&\n            client.transport.transports[0].config.type === 'webSocket')\n            return false;\n        return true;\n    })();\n    const pollContractEvent = () => {\n        const strict = strict_ ?? false;\n        const observerId = stringify([\n            'watchContractEvent',\n            address,\n            args,\n            batch,\n            client.uid,\n            eventName,\n            pollingInterval,\n            strict,\n            fromBlock,\n        ]);\n        return observe(observerId, { onLogs, onError }, (emit) => {\n            let previousBlockNumber;\n            if (fromBlock !== undefined)\n                previousBlockNumber = fromBlock - 1n;\n            let filter;\n            let initialized = false;\n            const unwatch = poll(async () => {\n                if (!initialized) {\n                    try {\n                        filter = (await getAction(client, createContractEventFilter, 'createContractEventFilter')({\n                            abi,\n                            address,\n                            args: args,\n                            eventName: eventName,\n                            strict: strict,\n                            fromBlock,\n                        }));\n                    }\n                    catch { }\n                    initialized = true;\n                    return;\n                }\n                try {\n                    let logs;\n                    if (filter) {\n                        logs = await getAction(client, getFilterChanges, 'getFilterChanges')({ filter });\n                    }\n                    else {\n                        // If the filter doesn't exist, we will fall back to use `getLogs`.\n                        // The fall back exists because some RPC Providers do not support filters.\n                        // Fetch the block number to use for `getLogs`.\n                        const blockNumber = await getAction(client, getBlockNumber, 'getBlockNumber')({});\n                        // If the block number has changed, we will need to fetch the logs.\n                        // If the block number doesn't exist, we are yet to reach the first poll interval,\n                        // so do not emit any logs.\n                        if (previousBlockNumber && previousBlockNumber < blockNumber) {\n                            logs = await getAction(client, getContractEvents, 'getContractEvents')({\n                                abi,\n                                address,\n                                args,\n                                eventName,\n                                fromBlock: previousBlockNumber + 1n,\n                                toBlock: blockNumber,\n                                strict,\n                            });\n                        }\n                        else {\n                            logs = [];\n                        }\n                        previousBlockNumber = blockNumber;\n                    }\n                    if (logs.length === 0)\n                        return;\n                    if (batch)\n                        emit.onLogs(logs);\n                    else\n                        for (const log of logs)\n                            emit.onLogs([log]);\n                }\n                catch (err) {\n                    // If a filter has been set and gets uninstalled, providers will throw an InvalidInput error.\n                    // Reinitialize the filter when this occurs\n                    if (filter && err instanceof InvalidInputRpcError)\n                        initialized = false;\n                    emit.onError?.(err);\n                }\n            }, {\n                emitOnBegin: true,\n                interval: pollingInterval,\n            });\n            return async () => {\n                if (filter)\n                    await getAction(client, uninstallFilter, 'uninstallFilter')({ filter });\n                unwatch();\n            };\n        });\n    };\n    const subscribeContractEvent = () => {\n        const strict = strict_ ?? false;\n        const observerId = stringify([\n            'watchContractEvent',\n            address,\n            args,\n            batch,\n            client.uid,\n            eventName,\n            pollingInterval,\n            strict,\n        ]);\n        let active = true;\n        let unsubscribe = () => (active = false);\n        return observe(observerId, { onLogs, onError }, (emit) => {\n            ;\n            (async () => {\n                try {\n                    const transport = (() => {\n                        if (client.transport.type === 'fallback') {\n                            const transport = client.transport.transports.find((transport) => transport.config.type === 'webSocket');\n                            if (!transport)\n                                return client.transport;\n                            return transport.value;\n                        }\n                        return client.transport;\n                    })();\n                    const topics = eventName\n                        ? encodeEventTopics({\n                            abi: abi,\n                            eventName: eventName,\n                            args,\n                        })\n                        : [];\n                    const { unsubscribe: unsubscribe_ } = await transport.subscribe({\n                        params: ['logs', { address, topics }],\n                        onData(data) {\n                            if (!active)\n                                return;\n                            const log = data.result;\n                            try {\n                                const { eventName, args } = decodeEventLog({\n                                    abi: abi,\n                                    data: log.data,\n                                    topics: log.topics,\n                                    strict: strict_,\n                                });\n                                const formatted = formatLog(log, {\n                                    args,\n                                    eventName: eventName,\n                                });\n                                emit.onLogs([formatted]);\n                            }\n                            catch (err) {\n                                let eventName;\n                                let isUnnamed;\n                                if (err instanceof DecodeLogDataMismatch ||\n                                    err instanceof DecodeLogTopicsMismatch) {\n                                    // If strict mode is on, and log data/topics do not match event definition, skip.\n                                    if (strict_)\n                                        return;\n                                    eventName = err.abiItem.name;\n                                    isUnnamed = err.abiItem.inputs?.some((x) => !('name' in x && x.name));\n                                }\n                                // Set args to empty if there is an error decoding (e.g. indexed/non-indexed params mismatch).\n                                const formatted = formatLog(log, {\n                                    args: isUnnamed ? [] : {},\n                                    eventName,\n                                });\n                                emit.onLogs([formatted]);\n                            }\n                        },\n                        onError(error) {\n                            emit.onError?.(error);\n                        },\n                    });\n                    unsubscribe = unsubscribe_;\n                    if (!active)\n                        unsubscribe();\n                }\n                catch (err) {\n                    onError?.(err);\n                }\n            })();\n            return () => unsubscribe();\n        });\n    };\n    return enablePolling ? pollContractEvent() : subscribeContractEvent();\n}\n//# sourceMappingURL=watchContractEvent.js.map","import { encodeEventTopics, } from '../../utils/abi/encodeEventTopics.js';\nimport { observe } from '../../utils/observe.js';\nimport { poll } from '../../utils/poll.js';\nimport { stringify } from '../../utils/stringify.js';\nimport { DecodeLogDataMismatch, DecodeLogTopicsMismatch, } from '../../errors/abi.js';\nimport { InvalidInputRpcError } from '../../errors/rpc.js';\nimport { decodeEventLog } from '../../utils/abi/decodeEventLog.js';\nimport { formatLog } from '../../utils/formatters/log.js';\nimport { getAction } from '../../utils/getAction.js';\nimport { createEventFilter, } from './createEventFilter.js';\nimport { getBlockNumber } from './getBlockNumber.js';\nimport { getFilterChanges } from './getFilterChanges.js';\nimport { getLogs } from './getLogs.js';\nimport { uninstallFilter } from './uninstallFilter.js';\n/**\n * Watches and returns emitted [Event Logs](https://viem.sh/docs/glossary/terms#event-log).\n *\n * - Docs: https://viem.sh/docs/actions/public/watchEvent\n * - JSON-RPC Methods:\n *   - **RPC Provider supports `eth_newFilter`:**\n *     - Calls [`eth_newFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_newfilter) to create a filter (called on initialize).\n *     - On a polling interval, it will call [`eth_getFilterChanges`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getfilterchanges).\n *   - **RPC Provider does not support `eth_newFilter`:**\n *     - Calls [`eth_getLogs`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getlogs) for each block between the polling interval.\n *\n * This Action will batch up all the Event Logs found within the [`pollingInterval`](https://viem.sh/docs/actions/public/watchEvent#pollinginterval-optional), and invoke them via [`onLogs`](https://viem.sh/docs/actions/public/watchEvent#onLogs).\n *\n * `watchEvent` will attempt to create an [Event Filter](https://viem.sh/docs/actions/public/createEventFilter) and listen to changes to the Filter per polling interval, however, if the RPC Provider does not support Filters (e.g. `eth_newFilter`), then `watchEvent` will fall back to using [`getLogs`](https://viem.sh/docs/actions/public/getLogs) instead.\n *\n * @param client - Client to use\n * @param parameters - {@link WatchEventParameters}\n * @returns A function that can be invoked to stop watching for new Event Logs. {@link WatchEventReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { watchEvent } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const unwatch = watchEvent(client, {\n *   onLogs: (logs) => console.log(logs),\n * })\n */\nexport function watchEvent(client, { address, args, batch = true, event, events, fromBlock, onError, onLogs, poll: poll_, pollingInterval = client.pollingInterval, strict: strict_, }) {\n    const enablePolling = (() => {\n        if (typeof poll_ !== 'undefined')\n            return poll_;\n        if (typeof fromBlock === 'bigint')\n            return true;\n        if (client.transport.type === 'webSocket')\n            return false;\n        if (client.transport.type === 'fallback' &&\n            client.transport.transports[0].config.type === 'webSocket')\n            return false;\n        return true;\n    })();\n    const strict = strict_ ?? false;\n    const pollEvent = () => {\n        const observerId = stringify([\n            'watchEvent',\n            address,\n            args,\n            batch,\n            client.uid,\n            event,\n            pollingInterval,\n            fromBlock,\n        ]);\n        return observe(observerId, { onLogs, onError }, (emit) => {\n            let previousBlockNumber;\n            if (fromBlock !== undefined)\n                previousBlockNumber = fromBlock - 1n;\n            let filter;\n            let initialized = false;\n            const unwatch = poll(async () => {\n                if (!initialized) {\n                    try {\n                        filter = (await getAction(client, createEventFilter, 'createEventFilter')({\n                            address,\n                            args,\n                            event: event,\n                            events,\n                            strict,\n                            fromBlock,\n                        }));\n                    }\n                    catch { }\n                    initialized = true;\n                    return;\n                }\n                try {\n                    let logs;\n                    if (filter) {\n                        logs = await getAction(client, getFilterChanges, 'getFilterChanges')({ filter });\n                    }\n                    else {\n                        // If the filter doesn't exist, we will fall back to use `getLogs`.\n                        // The fall back exists because some RPC Providers do not support filters.\n                        // Fetch the block number to use for `getLogs`.\n                        const blockNumber = await getAction(client, getBlockNumber, 'getBlockNumber')({});\n                        // If the block number has changed, we will need to fetch the logs.\n                        // If the block number doesn't exist, we are yet to reach the first poll interval,\n                        // so do not emit any logs.\n                        if (previousBlockNumber && previousBlockNumber !== blockNumber) {\n                            logs = await getAction(client, getLogs, 'getLogs')({\n                                address,\n                                args,\n                                event: event,\n                                events,\n                                fromBlock: previousBlockNumber + 1n,\n                                toBlock: blockNumber,\n                            });\n                        }\n                        else {\n                            logs = [];\n                        }\n                        previousBlockNumber = blockNumber;\n                    }\n                    if (logs.length === 0)\n                        return;\n                    if (batch)\n                        emit.onLogs(logs);\n                    else\n                        for (const log of logs)\n                            emit.onLogs([log]);\n                }\n                catch (err) {\n                    // If a filter has been set and gets uninstalled, providers will throw an InvalidInput error.\n                    // Reinitialize the filter when this occurs\n                    if (filter && err instanceof InvalidInputRpcError)\n                        initialized = false;\n                    emit.onError?.(err);\n                }\n            }, {\n                emitOnBegin: true,\n                interval: pollingInterval,\n            });\n            return async () => {\n                if (filter)\n                    await getAction(client, uninstallFilter, 'uninstallFilter')({ filter });\n                unwatch();\n            };\n        });\n    };\n    const subscribeEvent = () => {\n        let active = true;\n        let unsubscribe = () => (active = false);\n        (async () => {\n            try {\n                const transport = (() => {\n                    if (client.transport.type === 'fallback') {\n                        const transport = client.transport.transports.find((transport) => transport.config.type === 'webSocket');\n                        if (!transport)\n                            return client.transport;\n                        return transport.value;\n                    }\n                    return client.transport;\n                })();\n                const events_ = events ?? (event ? [event] : undefined);\n                let topics = [];\n                if (events_) {\n                    const encoded = events_.flatMap((event) => encodeEventTopics({\n                        abi: [event],\n                        eventName: event.name,\n                        args,\n                    }));\n                    // TODO: Clean up type casting\n                    topics = [encoded];\n                    if (event)\n                        topics = topics[0];\n                }\n                const { unsubscribe: unsubscribe_ } = await transport.subscribe({\n                    params: ['logs', { address, topics }],\n                    onData(data) {\n                        if (!active)\n                            return;\n                        const log = data.result;\n                        try {\n                            const { eventName, args } = decodeEventLog({\n                                abi: events_ ?? [],\n                                data: log.data,\n                                topics: log.topics,\n                                strict,\n                            });\n                            const formatted = formatLog(log, { args, eventName });\n                            onLogs([formatted]);\n                        }\n                        catch (err) {\n                            let eventName;\n                            let isUnnamed;\n                            if (err instanceof DecodeLogDataMismatch ||\n                                err instanceof DecodeLogTopicsMismatch) {\n                                // If strict mode is on, and log data/topics do not match event definition, skip.\n                                if (strict_)\n                                    return;\n                                eventName = err.abiItem.name;\n                                isUnnamed = err.abiItem.inputs?.some((x) => !('name' in x && x.name));\n                            }\n                            // Set args to empty if there is an error decoding (e.g. indexed/non-indexed params mismatch).\n                            const formatted = formatLog(log, {\n                                args: isUnnamed ? [] : {},\n                                eventName,\n                            });\n                            onLogs([formatted]);\n                        }\n                    },\n                    onError(error) {\n                        onError?.(error);\n                    },\n                });\n                unsubscribe = unsubscribe_;\n                if (!active)\n                    unsubscribe();\n            }\n            catch (err) {\n                onError?.(err);\n            }\n        })();\n        return () => unsubscribe();\n    };\n    return enablePolling ? pollEvent() : subscribeEvent();\n}\n//# sourceMappingURL=watchEvent.js.map","import { getAction } from '../../utils/getAction.js';\nimport { observe } from '../../utils/observe.js';\nimport { poll } from '../../utils/poll.js';\nimport { stringify } from '../../utils/stringify.js';\nimport { createPendingTransactionFilter } from './createPendingTransactionFilter.js';\nimport { getFilterChanges } from './getFilterChanges.js';\nimport { uninstallFilter } from './uninstallFilter.js';\n/**\n * Watches and returns pending transaction hashes.\n *\n * - Docs: https://viem.sh/docs/actions/public/watchPendingTransactions\n * - JSON-RPC Methods:\n *   - When `poll: true`\n *     - Calls [`eth_newPendingTransactionFilter`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_newpendingtransactionfilter) to initialize the filter.\n *     - Calls [`eth_getFilterChanges`](https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_getFilterChanges) on a polling interval.\n *   - When `poll: false` & WebSocket Transport, uses a WebSocket subscription via [`eth_subscribe`](https://docs.alchemy.com/reference/eth-subscribe-polygon) and the `\"newPendingTransactions\"` event.\n *\n * This Action will batch up all the pending transactions found within the [`pollingInterval`](https://viem.sh/docs/actions/public/watchPendingTransactions#pollinginterval-optional), and invoke them via [`onTransactions`](https://viem.sh/docs/actions/public/watchPendingTransactions#ontransactions).\n *\n * @param client - Client to use\n * @param parameters - {@link WatchPendingTransactionsParameters}\n * @returns A function that can be invoked to stop watching for new pending transaction hashes. {@link WatchPendingTransactionsReturnType}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n * import { watchPendingTransactions } from 'viem/public'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n * const unwatch = await watchPendingTransactions(client, {\n *   onTransactions: (hashes) => console.log(hashes),\n * })\n */\nexport function watchPendingTransactions(client, { batch = true, onError, onTransactions, poll: poll_, pollingInterval = client.pollingInterval, }) {\n    const enablePolling = typeof poll_ !== 'undefined' ? poll_ : client.transport.type !== 'webSocket';\n    const pollPendingTransactions = () => {\n        const observerId = stringify([\n            'watchPendingTransactions',\n            client.uid,\n            batch,\n            pollingInterval,\n        ]);\n        return observe(observerId, { onTransactions, onError }, (emit) => {\n            let filter;\n            const unwatch = poll(async () => {\n                try {\n                    if (!filter) {\n                        try {\n                            filter = await getAction(client, createPendingTransactionFilter, 'createPendingTransactionFilter')({});\n                            return;\n                        }\n                        catch (err) {\n                            unwatch();\n                            throw err;\n                        }\n                    }\n                    const hashes = await getAction(client, getFilterChanges, 'getFilterChanges')({ filter });\n                    if (hashes.length === 0)\n                        return;\n                    if (batch)\n                        emit.onTransactions(hashes);\n                    else\n                        for (const hash of hashes)\n                            emit.onTransactions([hash]);\n                }\n                catch (err) {\n                    emit.onError?.(err);\n                }\n            }, {\n                emitOnBegin: true,\n                interval: pollingInterval,\n            });\n            return async () => {\n                if (filter)\n                    await getAction(client, uninstallFilter, 'uninstallFilter')({ filter });\n                unwatch();\n            };\n        });\n    };\n    const subscribePendingTransactions = () => {\n        let active = true;\n        let unsubscribe = () => (active = false);\n        (async () => {\n            try {\n                const { unsubscribe: unsubscribe_ } = await client.transport.subscribe({\n                    params: ['newPendingTransactions'],\n                    onData(data) {\n                        if (!active)\n                            return;\n                        const transaction = data.result;\n                        onTransactions([transaction]);\n                    },\n                    onError(error) {\n                        onError?.(error);\n                    },\n                });\n                unsubscribe = unsubscribe_;\n                if (!active)\n                    unsubscribe();\n            }\n            catch (err) {\n                onError?.(err);\n            }\n        })();\n        return () => unsubscribe();\n    };\n    return enablePolling\n        ? pollPendingTransactions()\n        : subscribePendingTransactions();\n}\n//# sourceMappingURL=watchPendingTransactions.js.map","/**\n * @description Parses EIP-4361 formatted message into message fields object.\n *\n * @see https://eips.ethereum.org/EIPS/eip-4361\n *\n * @returns EIP-4361 fields object\n */\nexport function parseSiweMessage(message) {\n    const { scheme, statement, ...prefix } = (message.match(prefixRegex)\n        ?.groups ?? {});\n    const { chainId, expirationTime, issuedAt, notBefore, requestId, ...suffix } = (message.match(suffixRegex)?.groups ?? {});\n    const resources = message.split('Resources:')[1]?.split('\\n- ').slice(1);\n    return {\n        ...prefix,\n        ...suffix,\n        ...(chainId ? { chainId: Number(chainId) } : {}),\n        ...(expirationTime ? { expirationTime: new Date(expirationTime) } : {}),\n        ...(issuedAt ? { issuedAt: new Date(issuedAt) } : {}),\n        ...(notBefore ? { notBefore: new Date(notBefore) } : {}),\n        ...(requestId ? { requestId } : {}),\n        ...(resources ? { resources } : {}),\n        ...(scheme ? { scheme } : {}),\n        ...(statement ? { statement } : {}),\n    };\n}\n// https://regexr.com/80gdj\nconst prefixRegex = /^(?:(?<scheme>[a-zA-Z][a-zA-Z0-9+-.]*):\\/\\/)?(?<domain>[a-zA-Z0-9+-.]*(?::[0-9]{1,5})?) (?:wants you to sign in with your Ethereum account:\\n)(?<address>0x[a-fA-F0-9]{40})\\n\\n(?:(?<statement>.*)\\n\\n)?/;\n// https://regexr.com/80gf9\nconst suffixRegex = /(?:URI: (?<uri>.+))\\n(?:Version: (?<version>.+))\\n(?:Chain ID: (?<chainId>\\d+))\\n(?:Nonce: (?<nonce>[a-zA-Z0-9]+))\\n(?:Issued At: (?<issuedAt>.+))(?:\\nExpiration Time: (?<expirationTime>.+))?(?:\\nNot Before: (?<notBefore>.+))?(?:\\nRequest ID: (?<requestId>.+))?/;\n//# sourceMappingURL=parseSiweMessage.js.map","import { isAddressEqual } from '../address/isAddressEqual.js';\n/**\n * @description Validates EIP-4361 message.\n *\n * @see https://eips.ethereum.org/EIPS/eip-4361\n */\nexport function validateSiweMessage(parameters) {\n    const { address, domain, message, nonce, scheme, time = new Date(), } = parameters;\n    if (domain && message.domain !== domain)\n        return false;\n    if (nonce && message.nonce !== nonce)\n        return false;\n    if (scheme && message.scheme !== scheme)\n        return false;\n    if (message.expirationTime && time >= message.expirationTime)\n        return false;\n    if (message.notBefore && time < message.notBefore)\n        return false;\n    try {\n        if (!message.address)\n            return false;\n        if (address && !isAddressEqual(message.address, address))\n            return false;\n    }\n    catch {\n        return false;\n    }\n    return true;\n}\n//# sourceMappingURL=validateSiweMessage.js.map","import { hashMessage } from '../../utils/signature/hashMessage.js';\nimport { parseSiweMessage } from '../../utils/siwe/parseSiweMessage.js';\nimport { validateSiweMessage, } from '../../utils/siwe/validateSiweMessage.js';\nimport { verifyHash, } from '../public/verifyHash.js';\n/**\n * Verifies [EIP-4361](https://eips.ethereum.org/EIPS/eip-4361) formatted message was signed.\n *\n * Compatible with Smart Contract Accounts & Externally Owned Accounts via [ERC-6492](https://eips.ethereum.org/EIPS/eip-6492).\n *\n * - Docs {@link https://viem.sh/docs/siwe/actions/verifySiweMessage}\n *\n * @param client - Client to use.\n * @param parameters - {@link VerifySiweMessageParameters}\n * @returns Whether or not the signature is valid. {@link VerifySiweMessageReturnType}\n */\nexport async function verifySiweMessage(client, parameters) {\n    const { address, domain, message, nonce, scheme, signature, time = new Date(), ...callRequest } = parameters;\n    const parsed = parseSiweMessage(message);\n    if (!parsed.address)\n        return false;\n    const isValid = validateSiweMessage({\n        address,\n        domain,\n        message: parsed,\n        nonce,\n        scheme,\n        time,\n    });\n    if (!isValid)\n        return false;\n    const hash = hashMessage(message);\n    return verifyHash(client, {\n        address: parsed.address,\n        hash,\n        signature,\n        ...callRequest,\n    });\n}\n//# sourceMappingURL=verifySiweMessage.js.map","import { getEnsAddress, } from '../../actions/ens/getEnsAddress.js';\nimport { getEnsAvatar, } from '../../actions/ens/getEnsAvatar.js';\nimport { getEnsName, } from '../../actions/ens/getEnsName.js';\nimport { getEnsResolver, } from '../../actions/ens/getEnsResolver.js';\nimport { getEnsText, } from '../../actions/ens/getEnsText.js';\nimport { call, } from '../../actions/public/call.js';\nimport { createBlockFilter, } from '../../actions/public/createBlockFilter.js';\nimport { createContractEventFilter, } from '../../actions/public/createContractEventFilter.js';\nimport { createEventFilter, } from '../../actions/public/createEventFilter.js';\nimport { createPendingTransactionFilter, } from '../../actions/public/createPendingTransactionFilter.js';\nimport { estimateContractGas, } from '../../actions/public/estimateContractGas.js';\nimport { estimateFeesPerGas, } from '../../actions/public/estimateFeesPerGas.js';\nimport { estimateGas, } from '../../actions/public/estimateGas.js';\nimport { estimateMaxPriorityFeePerGas, } from '../../actions/public/estimateMaxPriorityFeePerGas.js';\nimport { getBalance, } from '../../actions/public/getBalance.js';\nimport { getBlobBaseFee, } from '../../actions/public/getBlobBaseFee.js';\nimport { getBlock, } from '../../actions/public/getBlock.js';\nimport { getBlockNumber, } from '../../actions/public/getBlockNumber.js';\nimport { getBlockTransactionCount, } from '../../actions/public/getBlockTransactionCount.js';\nimport { getChainId, } from '../../actions/public/getChainId.js';\nimport { getCode, } from '../../actions/public/getCode.js';\nimport { getContractEvents, } from '../../actions/public/getContractEvents.js';\nimport { getEip712Domain, } from '../../actions/public/getEip712Domain.js';\nimport { getFeeHistory, } from '../../actions/public/getFeeHistory.js';\nimport { getFilterChanges, } from '../../actions/public/getFilterChanges.js';\nimport { getFilterLogs, } from '../../actions/public/getFilterLogs.js';\nimport { getGasPrice, } from '../../actions/public/getGasPrice.js';\nimport { getLogs, } from '../../actions/public/getLogs.js';\nimport { getProof, } from '../../actions/public/getProof.js';\nimport { getStorageAt, } from '../../actions/public/getStorageAt.js';\nimport { getTransaction, } from '../../actions/public/getTransaction.js';\nimport { getTransactionConfirmations, } from '../../actions/public/getTransactionConfirmations.js';\nimport { getTransactionCount, } from '../../actions/public/getTransactionCount.js';\nimport { getTransactionReceipt, } from '../../actions/public/getTransactionReceipt.js';\nimport { multicall, } from '../../actions/public/multicall.js';\nimport { readContract, } from '../../actions/public/readContract.js';\nimport { simulateContract, } from '../../actions/public/simulateContract.js';\nimport { uninstallFilter, } from '../../actions/public/uninstallFilter.js';\nimport { verifyMessage, } from '../../actions/public/verifyMessage.js';\nimport { verifyTypedData, } from '../../actions/public/verifyTypedData.js';\nimport { waitForTransactionReceipt, } from '../../actions/public/waitForTransactionReceipt.js';\nimport { watchBlockNumber, } from '../../actions/public/watchBlockNumber.js';\nimport { watchBlocks, } from '../../actions/public/watchBlocks.js';\nimport { watchContractEvent, } from '../../actions/public/watchContractEvent.js';\nimport { watchEvent, } from '../../actions/public/watchEvent.js';\nimport { watchPendingTransactions, } from '../../actions/public/watchPendingTransactions.js';\nimport { verifySiweMessage, } from '../../actions/siwe/verifySiweMessage.js';\nimport { prepareTransactionRequest, } from '../../actions/wallet/prepareTransactionRequest.js';\nimport { sendRawTransaction, } from '../../actions/wallet/sendRawTransaction.js';\nexport function publicActions(client) {\n    return {\n        call: (args) => call(client, args),\n        createBlockFilter: () => createBlockFilter(client),\n        createContractEventFilter: (args) => createContractEventFilter(client, args),\n        createEventFilter: (args) => createEventFilter(client, args),\n        createPendingTransactionFilter: () => createPendingTransactionFilter(client),\n        estimateContractGas: (args) => estimateContractGas(client, args),\n        estimateGas: (args) => estimateGas(client, args),\n        getBalance: (args) => getBalance(client, args),\n        getBlobBaseFee: () => getBlobBaseFee(client),\n        getBlock: (args) => getBlock(client, args),\n        getBlockNumber: (args) => getBlockNumber(client, args),\n        getBlockTransactionCount: (args) => getBlockTransactionCount(client, args),\n        getBytecode: (args) => getCode(client, args),\n        getChainId: () => getChainId(client),\n        getCode: (args) => getCode(client, args),\n        getContractEvents: (args) => getContractEvents(client, args),\n        getEip712Domain: (args) => getEip712Domain(client, args),\n        getEnsAddress: (args) => getEnsAddress(client, args),\n        getEnsAvatar: (args) => getEnsAvatar(client, args),\n        getEnsName: (args) => getEnsName(client, args),\n        getEnsResolver: (args) => getEnsResolver(client, args),\n        getEnsText: (args) => getEnsText(client, args),\n        getFeeHistory: (args) => getFeeHistory(client, args),\n        estimateFeesPerGas: (args) => estimateFeesPerGas(client, args),\n        getFilterChanges: (args) => getFilterChanges(client, args),\n        getFilterLogs: (args) => getFilterLogs(client, args),\n        getGasPrice: () => getGasPrice(client),\n        getLogs: (args) => getLogs(client, args),\n        getProof: (args) => getProof(client, args),\n        estimateMaxPriorityFeePerGas: (args) => estimateMaxPriorityFeePerGas(client, args),\n        getStorageAt: (args) => getStorageAt(client, args),\n        getTransaction: (args) => getTransaction(client, args),\n        getTransactionConfirmations: (args) => getTransactionConfirmations(client, args),\n        getTransactionCount: (args) => getTransactionCount(client, args),\n        getTransactionReceipt: (args) => getTransactionReceipt(client, args),\n        multicall: (args) => multicall(client, args),\n        prepareTransactionRequest: (args) => prepareTransactionRequest(client, args),\n        readContract: (args) => readContract(client, args),\n        sendRawTransaction: (args) => sendRawTransaction(client, args),\n        simulateContract: (args) => simulateContract(client, args),\n        verifyMessage: (args) => verifyMessage(client, args),\n        verifySiweMessage: (args) => verifySiweMessage(client, args),\n        verifyTypedData: (args) => verifyTypedData(client, args),\n        uninstallFilter: (args) => uninstallFilter(client, args),\n        waitForTransactionReceipt: (args) => waitForTransactionReceipt(client, args),\n        watchBlocks: (args) => watchBlocks(client, args),\n        watchBlockNumber: (args) => watchBlockNumber(client, args),\n        watchContractEvent: (args) => watchContractEvent(client, args),\n        watchEvent: (args) => watchEvent(client, args),\n        watchPendingTransactions: (args) => watchPendingTransactions(client, args),\n    };\n}\n//# sourceMappingURL=public.js.map","import { createClient, } from './createClient.js';\nimport { publicActions } from './decorators/public.js';\n/**\n * Creates a Public Client with a given [Transport](https://viem.sh/docs/clients/intro) configured for a [Chain](https://viem.sh/docs/clients/chains).\n *\n * - Docs: https://viem.sh/docs/clients/public\n *\n * A Public Client is an interface to \"public\" [JSON-RPC API](https://ethereum.org/en/developers/docs/apis/json-rpc/) methods such as retrieving block numbers, transactions, reading from smart contracts, etc through [Public Actions](/docs/actions/public/introduction).\n *\n * @param config - {@link PublicClientConfig}\n * @returns A Public Client. {@link PublicClient}\n *\n * @example\n * import { createPublicClient, http } from 'viem'\n * import { mainnet } from 'viem/chains'\n *\n * const client = createPublicClient({\n *   chain: mainnet,\n *   transport: http(),\n * })\n */\nexport function createPublicClient(parameters) {\n    const { key = 'public', name = 'Public Client' } = parameters;\n    const client = createClient({\n        ...parameters,\n        key,\n        name,\n        type: 'publicClient',\n    });\n    return client.extend(publicActions);\n}\n//# sourceMappingURL=createPublicClient.js.map","var __defProp = Object.defineProperty;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __publicField = (obj, key, value) => {\n  __defNormalProp(obj, typeof key !== \"symbol\" ? key + \"\" : key, value);\n  return value;\n};\n\n// src/index.ts\nimport { generateNonce } from \"siwe\";\n\n// src/errors.ts\nvar AuthClientError = class extends Error {\n  /**\n   * @param errCode - the AuthClientError code for this message\n   * @param context - a message, another Error, or a AuthClientErrorOpts\n   */\n  constructor(errCode, context) {\n    let parsedContext;\n    if (typeof context === \"string\") {\n      parsedContext = { message: context };\n    } else if (context instanceof Error) {\n      parsedContext = { cause: context, message: context.message };\n    } else {\n      parsedContext = context;\n    }\n    if (!parsedContext.message) {\n      parsedContext.message = parsedContext.cause?.message || \"\";\n    }\n    super(parsedContext.message, { cause: parsedContext.cause });\n    __publicField(this, \"errCode\");\n    /* Indicates if error message can be presented to the user */\n    __publicField(this, \"presentable\", false);\n    this.name = \"AuthClientError\";\n    this.errCode = errCode;\n  }\n};\nvar unwrap = (result) => {\n  if (result.isErr()) {\n    return { error: result.error, isError: true };\n  } else {\n    return { ...result.value, isError: false };\n  }\n};\n\n// src/clients/transports/http.ts\nimport { ResultAsync, ok, err } from \"neverthrow\";\nvar defaultPollOpts = {\n  interval: 1e3,\n  timeout: 1e4,\n  successCode: 200,\n  onResponse: () => {\n  }\n};\nvar get = async (client, path5, opts) => {\n  return ResultAsync.fromPromise(\n    fetch(getURI(client, path5), {\n      headers: getHeaders(opts)\n    }),\n    (e) => {\n      return new AuthClientError(\"unknown\", e);\n    }\n  ).andThen((response) => {\n    return ResultAsync.fromPromise(response.json(), (e) => {\n      return new AuthClientError(\"unknown\", e);\n    }).andThen((data) => {\n      return ok({ response, data });\n    });\n  });\n};\nvar post = async (client, path5, json, opts) => {\n  return ResultAsync.fromPromise(\n    fetch(getURI(client, path5), {\n      method: \"POST\",\n      body: JSON.stringify(json),\n      headers: getHeaders(opts)\n    }),\n    (e) => {\n      return new AuthClientError(\"unknown\", e);\n    }\n  ).andThen((response) => {\n    return ResultAsync.fromPromise(response.json(), (e) => {\n      return new AuthClientError(\"unknown\", e);\n    }).andThen((data) => {\n      return ok({ response, data });\n    });\n  });\n};\nvar poll = async (client, path5, pollOpts, opts) => {\n  const { timeout, interval, successCode, onResponse } = {\n    ...defaultPollOpts,\n    ...pollOpts\n  };\n  const deadline = Date.now() + timeout;\n  while (Date.now() < deadline) {\n    const res = await get(client, path5, opts);\n    if (res.isOk()) {\n      const { response } = res.value;\n      if (response.status === successCode) {\n        return ok(res.value);\n      }\n      onResponse(res.value);\n      await new Promise((resolve) => setTimeout(resolve, interval));\n    } else {\n      return err(res.error);\n    }\n  }\n  return err(new AuthClientError(\"unavailable\", `Polling timed out after ${timeout}ms`));\n};\nvar getURI = (client, path5) => {\n  return `${client.config.relay}/${client.config.version}/${path5}`;\n};\nvar getHeaders = (opts) => {\n  const headers = {\n    ...opts?.headers\n  };\n  if (opts?.authToken) {\n    headers[\"Authorization\"] = `Bearer ${opts.authToken}`;\n  }\n  return { ...headers, \"Content-Type\": \"application/json\" };\n};\n\n// src/actions/app/createChannel.ts\nvar path = \"channel\";\nvar createChannel = async (client, { ...request }) => {\n  const response = await post(client, path, request);\n  return unwrap(response);\n};\n\n// src/actions/app/status.ts\nvar path2 = \"channel/status\";\nvar status = async (client, { channelToken }) => {\n  const response = await get(client, path2, {\n    authToken: channelToken\n  });\n  return unwrap(response);\n};\n\n// src/messages/verify.ts\nimport { SiweError } from \"siwe\";\nimport { ResultAsync as ResultAsync2, err as err3, ok as ok3 } from \"neverthrow\";\n\n// src/messages/validate.ts\nimport { SiweMessage } from \"siwe\";\nimport { Result, err as err2, ok as ok2 } from \"neverthrow\";\n\n// src/messages/constants.ts\nvar STATEMENT = \"Farcaster Auth\";\nvar CHAIN_ID = 10;\n\n// src/messages/validate.ts\nvar FID_URI_REGEX = /^farcaster:\\/\\/fid\\/([1-9]\\d*)\\/?$/;\nvar validate = (params) => {\n  return Result.fromThrowable(\n    // SiweMessage validates itself when constructed\n    () => new SiweMessage(params),\n    // If construction time validation fails, propagate the error\n    (e) => new AuthClientError(\"bad_request.validation_failure\", e)\n  )().andThen(validateStatement).andThen(validateChainId).andThen(validateResources);\n};\nvar parseResources = (message) => {\n  const fid = parseFid(message);\n  if (fid.isErr())\n    return err2(fid.error);\n  return ok2({ fid: fid.value });\n};\nvar parseFid = (message) => {\n  const resource = (message.resources ?? []).find((resource2) => {\n    return FID_URI_REGEX.test(resource2);\n  });\n  if (!resource) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", \"No fid resource provided\"));\n  }\n  const fid = parseInt(resource.match(FID_URI_REGEX)?.[1] ?? \"\");\n  if (isNaN(fid)) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", \"Invalid fid\"));\n  }\n  return ok2(fid);\n};\nvar validateStatement = (message) => {\n  const validStatement = message.statement === STATEMENT || message.statement === \"Farcaster Connect\";\n  if (!validStatement) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", `Statement must be '${STATEMENT}'`));\n  }\n  return ok2(message);\n};\nvar validateChainId = (message) => {\n  if (message.chainId !== CHAIN_ID) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", `Chain ID must be ${CHAIN_ID}`));\n  }\n  return ok2(message);\n};\nvar validateResources = (message) => {\n  const fidResources = (message.resources ?? []).filter((resource) => {\n    return FID_URI_REGEX.test(resource);\n  });\n  if (fidResources.length === 0) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", \"No fid resource provided\"));\n  } else if (fidResources.length > 1) {\n    return err2(new AuthClientError(\"bad_request.validation_failure\", \"Multiple fid resources provided\"));\n  } else {\n    return ok2(message);\n  }\n};\n\n// src/messages/verify.ts\nvar voidVerifyFid = (_custody) => Promise.reject(new Error(\"Not implemented: Must provide an fid verifier\"));\nvar verify = async (nonce, domain, message, signature, options = {\n  getFid: voidVerifyFid\n}) => {\n  const { getFid, provider } = options;\n  const valid = validate(message).andThen((message2) => validateNonce(message2, nonce)).andThen((message2) => validateDomain(message2, domain));\n  if (valid.isErr())\n    return err3(valid.error);\n  const siwe = (await verifySiweMessage(valid.value, signature, provider)).andThen(mergeResources);\n  if (siwe.isErr())\n    return err3(siwe.error);\n  if (!siwe.value.success) {\n    const errMessage = siwe.value.error?.type ?? \"Failed to verify SIWE message\";\n    return err3(new AuthClientError(\"unauthorized\", errMessage));\n  }\n  const fid = await verifyFidOwner(siwe.value, getFid);\n  if (fid.isErr())\n    return err3(fid.error);\n  if (!fid.value.success) {\n    const errMessage = siwe.value.error?.type ?? \"Failed to validate fid owner\";\n    return err3(new AuthClientError(\"unauthorized\", errMessage));\n  }\n  const { error, ...response } = fid.value;\n  return ok3(response);\n};\nvar validateNonce = (message, nonce) => {\n  if (message.nonce !== nonce) {\n    return err3(new AuthClientError(\"unauthorized\", \"Invalid nonce\"));\n  } else {\n    return ok3(message);\n  }\n};\nvar validateDomain = (message, domain) => {\n  if (message.domain !== domain) {\n    return err3(new AuthClientError(\"unauthorized\", \"Invalid domain\"));\n  } else {\n    return ok3(message);\n  }\n};\nvar verifySiweMessage = async (message, signature, provider) => {\n  return ResultAsync2.fromPromise(message.verify({ signature }, { provider, suppressExceptions: true }), (e) => {\n    return new AuthClientError(\"unauthorized\", e);\n  });\n};\nvar verifyFidOwner = async (response, fidVerifier) => {\n  const signer = response.data.address;\n  return ResultAsync2.fromPromise(fidVerifier(signer), (e) => {\n    return new AuthClientError(\"unavailable\", e);\n  }).andThen((fid) => {\n    if (fid !== BigInt(response.fid)) {\n      response.success = false;\n      response.error = new SiweError(\n        `Invalid resource: signer ${signer} does not own fid ${response.fid}.`,\n        response.fid.toString(),\n        fid.toString()\n      );\n    }\n    return ok3(response);\n  });\n};\nvar mergeResources = (response) => {\n  return parseResources(response.data).andThen((resources) => {\n    return ok3({ ...resources, ...response });\n  });\n};\n\n// src/actions/app/verifySignInMessage.ts\nvar verifySignInMessage = async (client, { nonce, domain, message, signature }, provider) => {\n  const result = await verify(nonce, domain, message, signature, {\n    getFid: client.ethereum.getFid,\n    provider\n  });\n  return unwrap(result);\n};\n\n// src/actions/app/watchStatus.ts\nvar path3 = \"channel/status\";\nvar voidCallback = () => {\n};\nvar watchStatus = async (client, args) => {\n  const result = await poll(\n    client,\n    path3,\n    {\n      timeout: args?.timeout ?? 3e5,\n      interval: args?.interval ?? 1e3,\n      onResponse: args?.onResponse ?? voidCallback\n    },\n    { authToken: args.channelToken }\n  );\n  return unwrap(result);\n};\n\n// src/actions/auth/authenticate.ts\nvar path4 = \"channel/authenticate\";\nvar authenticate = async (client, { channelToken, authKey, ...request }) => {\n  const result = await post(client, path4, request, {\n    authToken: channelToken,\n    headers: {\n      \"X-Farcaster-Auth-Relay-Key\": authKey\n    }\n  });\n  return unwrap(result);\n};\n\n// src/messages/build.ts\nimport { err as err5, ok as ok5 } from \"neverthrow\";\n\n// src/messages/parseSignInURI.ts\nimport { err as err4, ok as ok4 } from \"neverthrow\";\nvar parseSignInURI = (signInUri) => {\n  const url = new URL(signInUri);\n  const searchParams = Object.fromEntries(url.searchParams.entries());\n  const { channelToken, ...params } = searchParams;\n  if (!channelToken) {\n    return err4(validationFail(\"No channel token provided\"));\n  }\n  if (!params[\"nonce\"]) {\n    return err4(validationFail(\"No nonce provided\"));\n  }\n  if (!params[\"siweUri\"]) {\n    return err4(validationFail(\"No SIWE URI provided\"));\n  }\n  if (!params[\"domain\"]) {\n    return err4(validationFail(\"No domain provided\"));\n  }\n  const { siweUri, ...siweParams } = params;\n  return ok4({ channelToken, params: { uri: siweUri, ...siweParams } });\n};\nvar validationFail = (message) => {\n  return new AuthClientError(\"bad_request.validation_failure\", message);\n};\n\n// src/messages/build.ts\nvar build = (params) => {\n  const { fid, ...siweParams } = params;\n  const resources = siweParams.resources ?? [];\n  siweParams.version = \"1\";\n  siweParams.statement = STATEMENT;\n  siweParams.chainId = CHAIN_ID;\n  siweParams.resources = [buildFidResource(fid), ...resources];\n  const valid = validate(siweParams);\n  if (valid.isErr())\n    return err5(valid.error);\n  else {\n    const siweMessage = valid.value;\n    return ok5({ siweMessage, message: siweMessage.toMessage() });\n  }\n};\nvar buildFidResource = (fid) => {\n  return `farcaster://fid/${fid}`;\n};\n\n// src/actions/auth/buildSignInMessage.ts\nvar buildSignInMessage = (_client, args) => {\n  return unwrap(build(args));\n};\n\n// src/actions/auth/parseSignInURI.ts\nvar parseSignInURI2 = (_client, { uri }) => {\n  return unwrap(parseSignInURI(uri));\n};\n\n// src/clients/createClient.ts\nvar configDefaults = {\n  relay: \"https://relay.farcaster.xyz\",\n  version: \"v1\"\n};\nvar createClient = ({ ethereum, ...config }) => {\n  return {\n    config: { ...configDefaults, ...config },\n    ethereum\n  };\n};\n\n// src/clients/createAppClient.ts\nvar createAppClient = (config, provider) => {\n  const client = createClient(config);\n  return {\n    ...client,\n    createChannel: (args) => createChannel(client, args),\n    status: (args) => status(client, args),\n    watchStatus: (args) => watchStatus(client, args),\n    verifySignInMessage: (args) => verifySignInMessage(client, args, provider)\n  };\n};\n\n// src/clients/createWalletClient.ts\nvar createWalletClient = (config) => {\n  const client = createClient(config);\n  return {\n    ...client,\n    authenticate: (args) => authenticate(client, args),\n    buildSignInMessage: (args) => buildSignInMessage(client, args),\n    parseSignInURI: (args) => parseSignInURI2(client, args)\n  };\n};\n\n// src/clients/ethereum/viemConnector.ts\nimport { createPublicClient, http } from \"viem\";\nimport { optimism } from \"viem/chains\";\n\n// src/contracts/idRegistry.ts\nvar idRegistryABI = [\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"_migrator\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"_initialOwner\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"nonpayable\",\n    type: \"constructor\"\n  },\n  {\n    inputs: [],\n    name: \"AlreadyMigrated\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"GatewayFrozen\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"HasId\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"HasNoId\",\n    type: \"error\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"account\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"currentNonce\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"InvalidAccountNonce\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"InvalidShortString\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"InvalidSignature\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"OnlyGuardian\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"OnlyMigrator\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"PermissionRevoked\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"SignatureExpired\",\n    type: \"error\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"string\",\n        name: \"str\",\n        type: \"string\"\n      }\n    ],\n    name: \"StringTooLong\",\n    type: \"error\"\n  },\n  {\n    inputs: [],\n    name: \"Unauthorized\",\n    type: \"error\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"guardian\",\n        type: \"address\"\n      }\n    ],\n    name: \"Add\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"AdminReset\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"id\",\n        type: \"uint256\"\n      },\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    name: \"ChangeRecoveryAddress\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [],\n    name: \"EIP712DomainChanged\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"idGateway\",\n        type: \"address\"\n      }\n    ],\n    name: \"FreezeIdGateway\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"migratedAt\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"Migrated\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"previousOwner\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"newOwner\",\n        type: \"address\"\n      }\n    ],\n    name: \"OwnershipTransferStarted\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"previousOwner\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"newOwner\",\n        type: \"address\"\n      }\n    ],\n    name: \"OwnershipTransferred\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"account\",\n        type: \"address\"\n      }\n    ],\n    name: \"Paused\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"id\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"Recover\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"id\",\n        type: \"uint256\"\n      },\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    name: \"Register\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"guardian\",\n        type: \"address\"\n      }\n    ],\n    name: \"Remove\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"uint256\",\n        name: \"oldCounter\",\n        type: \"uint256\"\n      },\n      {\n        indexed: false,\n        internalType: \"uint256\",\n        name: \"newCounter\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"SetIdCounter\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"oldIdGateway\",\n        type: \"address\"\n      },\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"newIdGateway\",\n        type: \"address\"\n      }\n    ],\n    name: \"SetIdGateway\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"oldMigrator\",\n        type: \"address\"\n      },\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"newMigrator\",\n        type: \"address\"\n      }\n    ],\n    name: \"SetMigrator\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        indexed: true,\n        internalType: \"uint256\",\n        name: \"id\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"Transfer\",\n    type: \"event\"\n  },\n  {\n    anonymous: false,\n    inputs: [\n      {\n        indexed: false,\n        internalType: \"address\",\n        name: \"account\",\n        type: \"address\"\n      }\n    ],\n    name: \"Unpaused\",\n    type: \"event\"\n  },\n  {\n    inputs: [],\n    name: \"CHANGE_RECOVERY_ADDRESS_TYPEHASH\",\n    outputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"\",\n        type: \"bytes32\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"TRANSFER_AND_CHANGE_RECOVERY_TYPEHASH\",\n    outputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"\",\n        type: \"bytes32\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"TRANSFER_TYPEHASH\",\n    outputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"\",\n        type: \"bytes32\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"VERSION\",\n    outputs: [\n      {\n        internalType: \"string\",\n        name: \"\",\n        type: \"string\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"acceptOwnership\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"guardian\",\n        type: \"address\"\n      }\n    ],\n    name: \"addGuardian\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        components: [\n          {\n            internalType: \"uint24\",\n            name: \"fid\",\n            type: \"uint24\"\n          },\n          {\n            internalType: \"address\",\n            name: \"custody\",\n            type: \"address\"\n          },\n          {\n            internalType: \"address\",\n            name: \"recovery\",\n            type: \"address\"\n          }\n        ],\n        internalType: \"struct IIdRegistry.BulkRegisterData[]\",\n        name: \"ids\",\n        type: \"tuple[]\"\n      }\n    ],\n    name: \"bulkRegisterIds\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        components: [\n          {\n            internalType: \"uint24\",\n            name: \"fid\",\n            type: \"uint24\"\n          },\n          {\n            internalType: \"address\",\n            name: \"custody\",\n            type: \"address\"\n          }\n        ],\n        internalType: \"struct IIdRegistry.BulkRegisterDefaultRecoveryData[]\",\n        name: \"ids\",\n        type: \"tuple[]\"\n      },\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    name: \"bulkRegisterIdsWithDefaultRecovery\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"uint24[]\",\n        name: \"ids\",\n        type: \"uint24[]\"\n      }\n    ],\n    name: \"bulkResetIds\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    name: \"changeRecoveryAddress\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"owner\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"deadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"sig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"changeRecoveryAddressFor\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"custodyOf\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"custody\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"domainSeparatorV4\",\n    outputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"\",\n        type: \"bytes32\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"eip712Domain\",\n    outputs: [\n      {\n        internalType: \"bytes1\",\n        name: \"fields\",\n        type: \"bytes1\"\n      },\n      {\n        internalType: \"string\",\n        name: \"name\",\n        type: \"string\"\n      },\n      {\n        internalType: \"string\",\n        name: \"version\",\n        type: \"string\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"chainId\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"address\",\n        name: \"verifyingContract\",\n        type: \"address\"\n      },\n      {\n        internalType: \"bytes32\",\n        name: \"salt\",\n        type: \"bytes32\"\n      },\n      {\n        internalType: \"uint256[]\",\n        name: \"extensions\",\n        type: \"uint256[]\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"freezeIdGateway\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"gatewayFrozen\",\n    outputs: [\n      {\n        internalType: \"bool\",\n        name: \"\",\n        type: \"bool\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"gracePeriod\",\n    outputs: [\n      {\n        internalType: \"uint24\",\n        name: \"\",\n        type: \"uint24\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"guardian\",\n        type: \"address\"\n      }\n    ],\n    name: \"guardians\",\n    outputs: [\n      {\n        internalType: \"bool\",\n        name: \"isGuardian\",\n        type: \"bool\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"structHash\",\n        type: \"bytes32\"\n      }\n    ],\n    name: \"hashTypedDataV4\",\n    outputs: [\n      {\n        internalType: \"bytes32\",\n        name: \"\",\n        type: \"bytes32\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"idCounter\",\n    outputs: [\n      {\n        internalType: \"uint256\",\n        name: \"\",\n        type: \"uint256\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"idGateway\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"owner\",\n        type: \"address\"\n      }\n    ],\n    name: \"idOf\",\n    outputs: [\n      {\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"isMigrated\",\n    outputs: [\n      {\n        internalType: \"bool\",\n        name: \"\",\n        type: \"bool\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"migrate\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"migratedAt\",\n    outputs: [\n      {\n        internalType: \"uint40\",\n        name: \"\",\n        type: \"uint40\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"migrator\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"name\",\n    outputs: [\n      {\n        internalType: \"string\",\n        name: \"\",\n        type: \"string\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"owner\",\n        type: \"address\"\n      }\n    ],\n    name: \"nonces\",\n    outputs: [\n      {\n        internalType: \"uint256\",\n        name: \"\",\n        type: \"uint256\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"owner\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"pause\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"paused\",\n    outputs: [\n      {\n        internalType: \"bool\",\n        name: \"\",\n        type: \"bool\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"pendingOwner\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"deadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"sig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"recover\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"recoveryDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"recoverySig\",\n        type: \"bytes\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"toDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"toSig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"recoverFor\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"recoveryOf\",\n    outputs: [\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      }\n    ],\n    name: \"register\",\n    outputs: [\n      {\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      }\n    ],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"guardian\",\n        type: \"address\"\n      }\n    ],\n    name: \"removeGuardian\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"renounceOwnership\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"uint256\",\n        name: \"_counter\",\n        type: \"uint256\"\n      }\n    ],\n    name: \"setIdCounter\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"_idGateway\",\n        type: \"address\"\n      }\n    ],\n    name: \"setIdGateway\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"_migrator\",\n        type: \"address\"\n      }\n    ],\n    name: \"setMigrator\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"deadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"sig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"transfer\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"deadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"sig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"transferAndChangeRecovery\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"recovery\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"fromDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"fromSig\",\n        type: \"bytes\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"toDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"toSig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"transferAndChangeRecoveryFor\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"from\",\n        type: \"address\"\n      },\n      {\n        internalType: \"address\",\n        name: \"to\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"fromDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"fromSig\",\n        type: \"bytes\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"toDeadline\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"toSig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"transferFor\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"newOwner\",\n        type: \"address\"\n      }\n    ],\n    name: \"transferOwnership\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"unpause\",\n    outputs: [],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [],\n    name: \"useNonce\",\n    outputs: [\n      {\n        internalType: \"uint256\",\n        name: \"\",\n        type: \"uint256\"\n      }\n    ],\n    stateMutability: \"nonpayable\",\n    type: \"function\"\n  },\n  {\n    inputs: [\n      {\n        internalType: \"address\",\n        name: \"custodyAddress\",\n        type: \"address\"\n      },\n      {\n        internalType: \"uint256\",\n        name: \"fid\",\n        type: \"uint256\"\n      },\n      {\n        internalType: \"bytes32\",\n        name: \"digest\",\n        type: \"bytes32\"\n      },\n      {\n        internalType: \"bytes\",\n        name: \"sig\",\n        type: \"bytes\"\n      }\n    ],\n    name: \"verifyFidSignature\",\n    outputs: [\n      {\n        internalType: \"bool\",\n        name: \"isValid\",\n        type: \"bool\"\n      }\n    ],\n    stateMutability: \"view\",\n    type: \"function\"\n  }\n];\nvar ID_REGISTRY_ADDRESS = \"0x00000000Fc6c5F01Fc30151999387Bb99A9f489b\";\n\n// src/clients/ethereum/viemConnector.ts\nvar viemConnector = (args) => {\n  const publicClient = createPublicClient({\n    chain: optimism,\n    transport: http(args?.rpcUrl)\n  });\n  const getFid = async (custody) => {\n    return publicClient.readContract({\n      address: ID_REGISTRY_ADDRESS,\n      abi: idRegistryABI,\n      functionName: \"idOf\",\n      args: [custody]\n    });\n  };\n  return {\n    getFid\n  };\n};\nexport {\n  AuthClientError,\n  authenticate,\n  buildSignInMessage,\n  createAppClient,\n  createChannel,\n  createClient,\n  createWalletClient,\n  generateNonce,\n  get,\n  parseSignInURI2 as parseSignInURI,\n  poll,\n  post,\n  status,\n  unwrap,\n  verifySignInMessage,\n  viemConnector,\n  watchStatus\n};\n","import { viemConnector as Vt, createAppClient as Be } from \"@farcaster/auth-client\";\nexport * from \"@farcaster/auth-client\";\nimport { jsx as C, jsxs as T, Fragment as j } from \"react/jsx-runtime\";\nimport * as I from \"react\";\nimport { createContext as Ie, useState as P, useEffect as F, useCallback as R, useContext as Me, useRef as qt, useMemo as Ae } from \"react\";\nimport { createPortal as Ne } from \"react-dom\";\nconst Pe = typeof window < \"u\" && (window != null && window.location) ? {\n  domain: window.location.host,\n  siweUri: window.location.href\n} : {}, Qt = {\n  relay: \"https://relay.farcaster.xyz\",\n  version: \"v1\",\n  ...Pe\n}, Gt = Ie({\n  isAuthenticated: !1,\n  config: Qt,\n  profile: {},\n  signInMessage: {},\n  onSignIn: () => {\n  },\n  onSignOut: () => {\n  }\n});\nfunction Te({\n  config: t,\n  children: e\n}) {\n  const [n, r] = P(), [o, i] = P(!1), [a, c] = P({}), [s, f] = P({}), l = {\n    ...Qt,\n    ...t\n  }, { relay: S, rpcUrl: h, version: v, provider: p } = l;\n  F(() => {\n    const g = h ? Vt({ rpcUrl: h }) : Vt(), w = Be({\n      relay: S,\n      ethereum: g,\n      version: v\n    }, p);\n    r(w);\n  }, [S, h, v, p]);\n  const u = R((g) => {\n    const { message: w, signature: m, fid: d, username: y, bio: B, displayName: b, pfpUrl: M, custody: A, verifications: N } = g;\n    i(!0), c({ fid: d, username: y, bio: B, displayName: b, pfpUrl: M, custody: A, verifications: N }), f({ message: w, signature: m });\n  }, []), E = () => {\n    i(!1), c({}), f({});\n  };\n  return /* @__PURE__ */ C(\n    Gt.Provider,\n    {\n      value: {\n        appClient: n,\n        isAuthenticated: o,\n        profile: a,\n        signInMessage: s,\n        config: l,\n        onSignIn: u,\n        onSignOut: E\n      },\n      children: e\n    }\n  );\n}\nfunction q() {\n  return Me(Gt);\n}\nfunction lt() {\n  const { appClient: t } = q();\n  return t;\n}\nfunction Re({\n  nonce: t,\n  notBefore: e,\n  expirationTime: n,\n  requestId: r,\n  onSuccess: o,\n  onError: i,\n  redirectUrl: a\n}) {\n  const { config: c } = q(), { siweUri: s, domain: f } = c, l = lt(), [S, h] = P(!1), [v, p] = P(), [u, E] = P(), [g, w] = P(), [m, d] = P(!1), [y, B] = P(!1), [b, M] = P(), A = R(async () => {\n    if (S && l && s && f && !v) {\n      const _ = typeof t == \"function\" ? await t() : t, {\n        data: mt,\n        isError: vt,\n        error: X\n      } = await l.createChannel({\n        nonce: _,\n        siweUri: s,\n        domain: f,\n        notBefore: e,\n        expirationTime: n,\n        requestId: r,\n        redirectUrl: a\n      });\n      if (vt)\n        B(!0), M(X), i == null || i(X);\n      else {\n        const { channelToken: tt, url: Dt, nonce: Ut } = mt;\n        p(tt), E(Dt), w(Ut), d(!0), o == null || o({ channelToken: tt, url: Dt, nonce: Ut });\n      }\n    }\n  }, [\n    S,\n    l,\n    s,\n    f,\n    v,\n    t,\n    e,\n    n,\n    r,\n    i,\n    o,\n    a\n  ]);\n  F(() => {\n    A();\n  }, [A]);\n  const N = R(async () => {\n    h(!0);\n  }, [h]), k = R(() => {\n    p(void 0), E(void 0), d(!1), B(!1), M(void 0);\n  }, [p, E, d, B, M]), L = R(() => {\n    k(), N();\n  }, [N, k]);\n  return {\n    connect: N,\n    reconnect: L,\n    reset: k,\n    isSuccess: m,\n    isError: y,\n    error: b,\n    data: { channelToken: v, url: u, nonce: g }\n  };\n}\nfunction ke({\n  nonce: t,\n  domain: e,\n  message: n,\n  signature: r,\n  onSuccess: o,\n  onError: i\n}) {\n  const a = lt(), [c, s] = P(!1), [f, l] = P(!1), [S, h] = P(!1), [v, p] = P(), u = async () => {\n    h(!1), l(!1), s(!1), p(void 0);\n  }, E = R(async () => {\n    if (a && t && e && n && r) {\n      const {\n        success: g,\n        isError: w,\n        error: m\n      } = await a.verifySignInMessage({\n        nonce: t,\n        domain: e,\n        message: n,\n        signature: r\n      });\n      w ? (h(!0), p(m), i == null || i(m)) : (s(g), l(!0), o == null || o({ message: n, signature: r, validSignature: g }));\n    }\n  }, [a, t, e, n, r, o, i]);\n  return F(() => {\n    u(), t && e && n && r && E();\n  }, [t, e, n, r, E]), {\n    isSuccess: f,\n    isError: S,\n    error: v,\n    data: { message: n, signature: r, validSignature: c }\n  };\n}\nconst Le = {\n  timeout: 3e5,\n  interval: 1500\n};\nfunction _e(t) {\n  const e = lt(), { channelToken: n, timeout: r, interval: o, onSuccess: i, onError: a, onResponse: c } = {\n    ...Le,\n    ...t\n  }, [s, f] = P(), [l, S] = P(!1), [h, v] = P(!1), [p, u] = P(!1), [E, g] = P(!1), [w, m] = P(), d = () => {\n    f(void 0), S(!1), g(!1), v(!1), m(void 0);\n  }, y = () => {\n    S(!0);\n  }, B = R(async () => {\n    if (l && e && n) {\n      u(!0);\n      const {\n        data: b,\n        isError: M,\n        error: A\n      } = await e.watchStatus({\n        channelToken: n,\n        timeout: r,\n        interval: o,\n        onResponse: ({ data: N }) => {\n          f(N), c == null || c(N);\n        }\n      });\n      M ? (g(!0), u(!1), m(A), a == null || a(A)) : (v(!0), u(!1), f(b), i == null || i(b));\n    }\n  }, [l, e, n, r, o, i, a, c]);\n  return F(() => {\n    d(), n && B();\n  }, [n, B]), {\n    watch: y,\n    isSuccess: h,\n    isPolling: p,\n    isError: E,\n    error: w,\n    data: s\n  };\n}\nconst Ze = {\n  timeout: 3e5,\n  interval: 1500\n};\nfunction Fe(t) {\n  const e = lt(), {\n    onSignIn: n,\n    onSignOut: r,\n    config: { domain: o, redirectUrl: i }\n  } = q(), { timeout: a, interval: c, onSuccess: s, onStatusResponse: f, onError: l, ...S } = {\n    ...Ze,\n    ...t\n  }, {\n    connect: h,\n    reconnect: v,\n    reset: p,\n    data: { channelToken: u, url: E, nonce: g },\n    isSuccess: w,\n    isError: m,\n    error: d\n  } = Re({ ...S, redirectUrl: i, onError: l }), {\n    watch: y,\n    isPolling: B,\n    data: b,\n    isError: M,\n    error: A\n  } = _e({\n    channelToken: u,\n    timeout: a,\n    interval: c,\n    onError: l,\n    onResponse: f\n  }), {\n    isSuccess: N,\n    data: { validSignature: k },\n    isError: L,\n    error: _\n  } = ke({\n    nonce: g,\n    domain: o,\n    message: b == null ? void 0 : b.message,\n    signature: b == null ? void 0 : b.signature,\n    onError: l\n  }), mt = m || M || L, vt = d || A || _, X = R(() => {\n    y();\n  }, [y]), tt = R(() => {\n    r(), p();\n  }, [r, p]);\n  return F(() => {\n    N && b && k && (n(b), s == null || s(b));\n  }, [N, b, k, n, s]), {\n    signIn: X,\n    signOut: tt,\n    connect: h,\n    reconnect: v,\n    isConnected: w,\n    isSuccess: N,\n    isPolling: B,\n    isError: mt,\n    error: vt,\n    channelToken: u,\n    url: E,\n    appClient: e,\n    data: b,\n    validSignature: k\n  };\n}\nfunction Xt({\n  height: t,\n  fill: e\n}) {\n  const n = t * 1.1;\n  return /* @__PURE__ */ T(\n    \"svg\",\n    {\n      xmlns: \"http://www.w3.org/2000/svg\",\n      width: n,\n      height: t,\n      fill: \"none\",\n      children: [\n        /* @__PURE__ */ C(\"title\", { children: \"Farcaster logo\" }),\n        /* @__PURE__ */ T(\"g\", { fill: Ht[e], clipPath: \"url(#a)\", children: [\n          /* @__PURE__ */ C(\"path\", { d: \"M3.786.05h14.156v2.824h4.025l-.844 2.825h-.714v11.427c.358 0 .65.287.65.642v.77h.13c.358 0 .649.288.649.642v.77h-7.273v-.77c0-.354.29-.642.65-.642h.13v-.77c0-.309.22-.566.512-.628l-.014-6.306c-.23-2.519-2.37-4.493-4.98-4.493-2.608 0-4.75 1.974-4.979 4.494l-.013 6.3c.346.05.772.315.772.633v.77h.13c.358 0 .65.288.65.642v.77H.15v-.77c0-.354.29-.642.649-.642h.13v-.77c0-.355.29-.642.65-.642V5.7H.863L.02 2.874h3.766V.05Z\" }),\n          /* @__PURE__ */ C(\"path\", { d: \"M17.942.05h.047V.003h-.047V.05ZM3.786.05V.003H3.74V.05h.047Zm14.156 2.824h-.048v.047h.048v-.047Zm4.025 0 .046.013.018-.06h-.064v.047Zm-.844 2.824v.047h.035l.01-.033-.045-.014Zm-.714 0v-.046h-.047v.046h.047Zm0 11.428h-.047v.047h.047v-.047Zm.65 1.412h-.048v.047h.047v-.047Zm.779 1.412v.047h.046v-.047h-.046Zm-7.273 0h-.048v.047h.048v-.047Zm.78-1.412v.047h.047v-.047h-.048Zm.512-1.398.01.045.038-.007v-.038h-.048Zm-.014-6.306h.048v-.004l-.048.004Zm-9.959 0-.047-.004v.004h.047Zm-.013 6.3h-.048v.041l.04.006.008-.047Zm.772 1.404h-.047v.047h.047v-.047Zm.78 1.412v.047h.047v-.047h-.048Zm-7.273 0H.102v.047H.15v-.047Zm.779-1.412v.047h.047v-.047H.93Zm.65-1.412v.047h.047v-.047h-.047Zm0-11.428h.047v-.046h-.047v.046Zm-.715 0-.045.014.01.033h.035v-.047ZM.02 2.874v-.047h-.063l.018.06.045-.013Zm3.766 0v.047h.048v-.047h-.048ZM17.942.003H3.786v.093h14.156V.003Zm.047 2.87V.05h-.095v2.824h.095Zm3.978-.046h-4.025v.094h4.025v-.094Zm-.798 2.885.844-2.825-.091-.026-.845 2.824.092.027Zm-.76.033h.714v-.093h-.714v.093Zm.048 11.381V5.698h-.095v11.428h.095Zm.649.641a.693.693 0 0 0-.697-.688v.094c.332 0 .602.266.602.595h.095Zm0 .77v-.77h-.095v.77h.095Zm.082-.045h-.13v.093h.13v-.093Zm.697.688a.692.692 0 0 0-.697-.688v.093c.333 0 .602.267.602.595h.095Zm0 .77v-.77h-.095v.77h.095Zm-3.943.047h3.896v-.094h-3.896v.094Zm-2.079 0h2.079v-.094h-2.079v.094Zm-1.298 0h1.298v-.094h-1.298v.094Zm-.048-.817v.77h.095v-.77h-.095Zm.697-.688a.693.693 0 0 0-.697.688h.095c0-.328.27-.595.602-.595v-.093Zm.13 0h-.13v.093h.13v-.093Zm-.047-.725v.77h.095v-.77h-.095Zm.55-.673a.69.69 0 0 0-.55.673h.095c0-.285.203-.524.476-.582l-.02-.09Zm-.051-6.26.014 6.306h.095l-.014-6.306h-.095Zm-4.932-4.447c2.583 0 4.704 1.956 4.932 4.452l.094-.009c-.232-2.543-2.393-4.536-5.026-4.536v.093ZM5.932 10.84c.227-2.496 2.348-4.452 4.932-4.452v-.093c-2.633 0-4.795 1.993-5.027 4.536l.095.008Zm-.014 6.295.014-6.3h-.095l-.014 6.3h.095Zm.773.633c0-.18-.12-.337-.276-.453a1.236 1.236 0 0 0-.538-.226l-.014.093c.166.025.351.1.495.207.145.108.238.241.238.38h.095Zm0 .77v-.77h-.095v.77h.095Zm.082-.045h-.13v.093h.13v-.093Zm.697.688a.693.693 0 0 0-.697-.688v.093c.332 0 .602.267.602.595h.095Zm0 .77v-.77h-.095v.77h.095Zm-1.606.047h1.558v-.094H5.864v.094Zm-.108 0h.108v-.094h-.108v.094Zm-1.97 0h1.97v-.094h-1.97v.094Zm-3.636 0h3.636v-.094H.15v.094Zm-.048-.817v.77h.095v-.77H.102Zm.697-.688a.693.693 0 0 0-.697.688h.095c0-.328.27-.595.602-.595v-.093Zm.13 0h-.13v.093h.13v-.093Zm-.048-.725v.77h.095v-.77H.881Zm.698-.688a.693.693 0 0 0-.698.688h.095c0-.328.27-.594.603-.594v-.094ZM1.53 5.7v11.427h.095V5.698h-.095Zm-.667.046h.715v-.093H.864v.093Zm-.89-2.858L.82 5.712l.09-.027-.844-2.824-.09.026Zm3.812-.06H.02v.094h3.766v-.094ZM3.74.05v2.824h.095V.05h-.095Z\" })\n        ] }),\n        /* @__PURE__ */ C(\"defs\", { children: /* @__PURE__ */ C(\"clipPath\", { id: \"a\", children: /* @__PURE__ */ C(\"path\", { fill: Ht[e], d: \"M0 0h22v20H0z\" }) }) })\n      ]\n    }\n  );\n}\nconst Ht = {\n  purple: \"#7C65C1\",\n  white: \"#FFFFFF\"\n};\nvar De = \"_1n3pr301\", Ue = \"_1n3pr306\", Ve = \"_1n3pr304\", He = \"_1n3pr305\", xe = \"_1n3pr300\", Rt = \"_1n3pr302\", Oe = \"_1n3pr303\";\nfunction Bt({ kind: t = \"primary\", children: e, className: n, ...r }) {\n  return /* @__PURE__ */ C(\"button\", { type: \"button\", className: ze[t] || n, ...r, children: e });\n}\nconst ze = {\n  primary: De,\n  secondary: Rt,\n  tertiary: Oe,\n  reset: xe\n};\nfunction Ke({\n  label: t,\n  onClick: e\n}) {\n  return /* @__PURE__ */ T(Bt, { kind: \"primary\", onClick: e, children: [\n    /* @__PURE__ */ C(Xt, { height: 20, fill: \"white\" }),\n    /* @__PURE__ */ C(\"span\", { style: { marginLeft: 9 }, children: t })\n  ] });\n}\nfunction Ye(t, e) {\n  F(() => {\n    function n(r) {\n      t.current && !t.current.contains(r.target) && e();\n    }\n    return document.addEventListener(\"mousedown\", n), () => {\n      document.removeEventListener(\"mousedown\", n);\n    };\n  }, [t, e]);\n}\nvar $e = \"_1rbg3ua1\", We = \"_1rbg3ua2\", je = \"_1rbg3ua3\", Je = \"_16wbil70\", qe = \"_16wbil71\";\nfunction Qe({ signOut: t }) {\n  return /* @__PURE__ */ C(\"div\", { className: Je, children: /* @__PURE__ */ T(\n    \"button\",\n    {\n      type: \"button\",\n      className: Rt,\n      style: {\n        boxShadow: \"0px 6px 12px 0 rgba(0,0,0,0.12)\"\n      },\n      onClick: t,\n      children: [\n        /* @__PURE__ */ T(\n          \"svg\",\n          {\n            width: \"19\",\n            height: \"20\",\n            viewBox: \"0 0 19 20\",\n            fill: \"none\",\n            xmlns: \"http://www.w3.org/2000/svg\",\n            className: qe,\n            children: [\n              /* @__PURE__ */ C(\"title\", { children: \"Sign Out\" }),\n              /* @__PURE__ */ C(\n                \"path\",\n                {\n                  d: \"M11.75 7V3.25C11.75 2.65326 11.5129 2.08097 11.091 1.65901C10.669 1.23705 10.0967 1 9.5 1H3.5C2.90326 1 2.33097 1.23705 1.90901 1.65901C1.48705 2.08097 1.25 2.65326 1.25 3.25V16.75C1.25 17.3467 1.48705 17.919 1.90901 18.341C2.33097 18.7629 2.90326 19 3.5 19H9.5C10.0967 19 10.669 18.7629 11.091 18.341C11.5129 17.919 11.75 17.3467 11.75 16.75V13M14.75 13L17.75 10M17.75 10L14.75 7M17.75 10H5\",\n                  stroke: \"black\",\n                  strokeWidth: \"1.5\",\n                  strokeLinecap: \"round\",\n                  strokeLinejoin: \"round\"\n                }\n              )\n            ]\n          }\n        ),\n        \"Sign out\"\n      ]\n    }\n  ) });\n}\nfunction Ge({\n  userData: t,\n  signOut: e,\n  hideSignOut: n\n}) {\n  const [r, o] = P(!1), i = qt(null);\n  Ye(i, () => o(!1));\n  const a = (t == null ? void 0 : t.username) ?? `!${t == null ? void 0 : t.fid}`, c = (t == null ? void 0 : t.pfpUrl) ?? \"https://warpcast.com/avatar.png\", s = r && !n;\n  return /* @__PURE__ */ C(\n    \"div\",\n    {\n      className: `fc-authkit-profile-button ${$e}`,\n      ref: i,\n      children: /* @__PURE__ */ T(\n        \"div\",\n        {\n          style: {\n            display: \"flex\",\n            flexDirection: \"column\",\n            alignItems: \"flex-end\"\n          },\n          children: [\n            /* @__PURE__ */ T(\n              \"button\",\n              {\n                type: \"button\",\n                className: Rt,\n                onClick: () => o(!r),\n                children: [\n                  /* @__PURE__ */ C(\"img\", { className: We, src: c, alt: \"avatar\" }),\n                  /* @__PURE__ */ C(\"span\", { className: je, children: a }),\n                  !n && /* @__PURE__ */ T(\n                    \"svg\",\n                    {\n                      width: \"24\",\n                      height: \"24\",\n                      viewBox: \"0 0 24 24\",\n                      fill: \"none\",\n                      xmlns: \"http://www.w3.org/2000/svg\",\n                      children: [\n                        /* @__PURE__ */ C(\"title\", { children: \"Dropdown\" }),\n                        /* @__PURE__ */ C(\"g\", { opacity: \"0.5\", children: /* @__PURE__ */ C(\n                          \"path\",\n                          {\n                            fillRule: \"evenodd\",\n                            clipRule: \"evenodd\",\n                            d: \"M6.26418 9.864C6.43293 9.69545 6.66168 9.60079 6.90018 9.60079C7.13869 9.60079 7.36743 9.69545 7.53618 9.864L12.0002 14.328L16.4642 9.864C16.5466 9.77557 16.6459 9.70465 16.7563 9.65546C16.8667 9.60627 16.9859 9.57982 17.1068 9.57769C17.2276 9.57555 17.3476 9.59778 17.4597 9.64305C17.5718 9.68831 17.6736 9.75569 17.759 9.84115C17.8445 9.92661 17.9119 10.0284 17.9571 10.1405C18.0024 10.2525 18.0246 10.3726 18.0225 10.4934C18.0204 10.6143 17.9939 10.7334 17.9447 10.8438C17.8955 10.9542 17.8246 11.0536 17.7362 11.136L12.6362 16.236C12.4674 16.4045 12.2387 16.4992 12.0002 16.4992C11.7617 16.4992 11.5329 16.4045 11.3642 16.236L6.26418 11.136C6.09564 10.9672 6.00098 10.7385 6.00098 10.5C6.00098 10.2615 6.09564 10.0327 6.26418 9.864Z\",\n                            fill: \"black\"\n                          }\n                        ) })\n                      ]\n                    }\n                  )\n                ]\n              }\n            ),\n            s && /* @__PURE__ */ C(Qe, { signOut: e })\n          ]\n        }\n      )\n    }\n  );\n}\nvar D = function() {\n  return D = Object.assign || function(e) {\n    for (var n, r = 1, o = arguments.length; r < o; r++) {\n      n = arguments[r];\n      for (var i in n)\n        Object.prototype.hasOwnProperty.call(n, i) && (e[i] = n[i]);\n    }\n    return e;\n  }, D.apply(this, arguments);\n};\nfunction te(t, e) {\n  var n = {};\n  for (var r in t)\n    Object.prototype.hasOwnProperty.call(t, r) && e.indexOf(r) < 0 && (n[r] = t[r]);\n  if (t != null && typeof Object.getOwnPropertySymbols == \"function\")\n    for (var o = 0, r = Object.getOwnPropertySymbols(t); o < r.length; o++)\n      e.indexOf(r[o]) < 0 && Object.prototype.propertyIsEnumerable.call(t, r[o]) && (n[r[o]] = t[r[o]]);\n  return n;\n}\nfunction Xe(t, e, n) {\n  if (n || arguments.length === 2)\n    for (var r = 0, o = e.length, i; r < o; r++)\n      (i || !(r in e)) && (i || (i = Array.prototype.slice.call(e, 0, r)), i[r] = e[r]);\n  return t.concat(i || Array.prototype.slice.call(e));\n}\nvar it = \"right-scroll-bar-position\", at = \"width-before-scroll-bar\", tn = \"with-scroll-bars-hidden\", en = \"--removed-body-scroll-bar-size\";\nfunction nn(t, e) {\n  return typeof t == \"function\" ? t(e) : t && (t.current = e), t;\n}\nfunction rn(t, e) {\n  var n = P(function() {\n    return {\n      // value\n      value: t,\n      // last callback\n      callback: e,\n      // \"memoized\" public interface\n      facade: {\n        get current() {\n          return n.value;\n        },\n        set current(r) {\n          var o = n.value;\n          o !== r && (n.value = r, n.callback(r, o));\n        }\n      }\n    };\n  })[0];\n  return n.callback = e, n.facade;\n}\nfunction on(t, e) {\n  return rn(e || null, function(n) {\n    return t.forEach(function(r) {\n      return nn(r, n);\n    });\n  });\n}\nfunction an(t) {\n  return t;\n}\nfunction cn(t, e) {\n  e === void 0 && (e = an);\n  var n = [], r = !1, o = {\n    read: function() {\n      if (r)\n        throw new Error(\"Sidecar: could not `read` from an `assigned` medium. `read` could be used only with `useMedium`.\");\n      return n.length ? n[n.length - 1] : t;\n    },\n    useMedium: function(i) {\n      var a = e(i, r);\n      return n.push(a), function() {\n        n = n.filter(function(c) {\n          return c !== a;\n        });\n      };\n    },\n    assignSyncMedium: function(i) {\n      for (r = !0; n.length; ) {\n        var a = n;\n        n = [], a.forEach(i);\n      }\n      n = {\n        push: function(c) {\n          return i(c);\n        },\n        filter: function() {\n          return n;\n        }\n      };\n    },\n    assignMedium: function(i) {\n      r = !0;\n      var a = [];\n      if (n.length) {\n        var c = n;\n        n = [], c.forEach(i), a = n;\n      }\n      var s = function() {\n        var l = a;\n        a = [], l.forEach(i);\n      }, f = function() {\n        return Promise.resolve().then(s);\n      };\n      f(), n = {\n        push: function(l) {\n          a.push(l), f();\n        },\n        filter: function(l) {\n          return a = a.filter(l), n;\n        }\n      };\n    }\n  };\n  return o;\n}\nfunction sn(t) {\n  t === void 0 && (t = {});\n  var e = cn(null);\n  return e.options = D({ async: !0, ssr: !1 }, t), e;\n}\nvar ee = function(t) {\n  var e = t.sideCar, n = te(t, [\"sideCar\"]);\n  if (!e)\n    throw new Error(\"Sidecar: please provide `sideCar` property to import the right car\");\n  var r = e.read();\n  if (!r)\n    throw new Error(\"Sidecar medium not found\");\n  return I.createElement(r, D({}, n));\n};\nee.isSideCarExport = !0;\nfunction ln(t, e) {\n  return t.useMedium(e), ee;\n}\nvar ne = sn(), wt = function() {\n}, ut = I.forwardRef(function(t, e) {\n  var n = I.useRef(null), r = I.useState({\n    onScrollCapture: wt,\n    onWheelCapture: wt,\n    onTouchMoveCapture: wt\n  }), o = r[0], i = r[1], a = t.forwardProps, c = t.children, s = t.className, f = t.removeScrollBar, l = t.enabled, S = t.shards, h = t.sideCar, v = t.noIsolation, p = t.inert, u = t.allowPinchZoom, E = t.as, g = E === void 0 ? \"div\" : E, w = t.gapMode, m = te(t, [\"forwardProps\", \"children\", \"className\", \"removeScrollBar\", \"enabled\", \"shards\", \"sideCar\", \"noIsolation\", \"inert\", \"allowPinchZoom\", \"as\", \"gapMode\"]), d = h, y = on([n, e]), B = D(D({}, m), o);\n  return I.createElement(\n    I.Fragment,\n    null,\n    l && I.createElement(d, { sideCar: ne, removeScrollBar: f, shards: S, noIsolation: v, inert: p, setCallbacks: i, allowPinchZoom: !!u, lockRef: n, gapMode: w }),\n    a ? I.cloneElement(I.Children.only(c), D(D({}, B), { ref: y })) : I.createElement(g, D({}, B, { className: s, ref: y }), c)\n  );\n});\nut.defaultProps = {\n  enabled: !0,\n  removeScrollBar: !0,\n  inert: !1\n};\nut.classNames = {\n  fullWidth: at,\n  zeroRight: it\n};\nvar un = function() {\n  if (typeof __webpack_nonce__ < \"u\")\n    return __webpack_nonce__;\n};\nfunction fn() {\n  if (!document)\n    return null;\n  var t = document.createElement(\"style\");\n  t.type = \"text/css\";\n  var e = un();\n  return e && t.setAttribute(\"nonce\", e), t;\n}\nfunction dn(t, e) {\n  t.styleSheet ? t.styleSheet.cssText = e : t.appendChild(document.createTextNode(e));\n}\nfunction hn(t) {\n  var e = document.head || document.getElementsByTagName(\"head\")[0];\n  e.appendChild(t);\n}\nvar gn = function() {\n  var t = 0, e = null;\n  return {\n    add: function(n) {\n      t == 0 && (e = fn()) && (dn(e, n), hn(e)), t++;\n    },\n    remove: function() {\n      t--, !t && e && (e.parentNode && e.parentNode.removeChild(e), e = null);\n    }\n  };\n}, mn = function() {\n  var t = gn();\n  return function(e, n) {\n    I.useEffect(function() {\n      return t.add(e), function() {\n        t.remove();\n      };\n    }, [e && n]);\n  };\n}, re = function() {\n  var t = mn(), e = function(n) {\n    var r = n.styles, o = n.dynamic;\n    return t(r, o), null;\n  };\n  return e;\n}, vn = {\n  left: 0,\n  top: 0,\n  right: 0,\n  gap: 0\n}, pt = function(t) {\n  return parseInt(t || \"\", 10) || 0;\n}, wn = function(t) {\n  var e = window.getComputedStyle(document.body), n = e[t === \"padding\" ? \"paddingLeft\" : \"marginLeft\"], r = e[t === \"padding\" ? \"paddingTop\" : \"marginTop\"], o = e[t === \"padding\" ? \"paddingRight\" : \"marginRight\"];\n  return [pt(n), pt(r), pt(o)];\n}, pn = function(t) {\n  if (t === void 0 && (t = \"margin\"), typeof window > \"u\")\n    return vn;\n  var e = wn(t), n = document.documentElement.clientWidth, r = window.innerWidth;\n  return {\n    left: e[0],\n    top: e[1],\n    right: e[2],\n    gap: Math.max(0, r - n + e[2] - e[0])\n  };\n}, yn = re(), Cn = function(t, e, n, r) {\n  var o = t.left, i = t.top, a = t.right, c = t.gap;\n  return n === void 0 && (n = \"margin\"), `\n  .`.concat(tn, ` {\n   overflow: hidden `).concat(r, `;\n   padding-right: `).concat(c, \"px \").concat(r, `;\n  }\n  body {\n    overflow: hidden `).concat(r, `;\n    overscroll-behavior: contain;\n    `).concat([\n    e && \"position: relative \".concat(r, \";\"),\n    n === \"margin\" && `\n    padding-left: `.concat(o, `px;\n    padding-top: `).concat(i, `px;\n    padding-right: `).concat(a, `px;\n    margin-left:0;\n    margin-top:0;\n    margin-right: `).concat(c, \"px \").concat(r, `;\n    `),\n    n === \"padding\" && \"padding-right: \".concat(c, \"px \").concat(r, \";\")\n  ].filter(Boolean).join(\"\"), `\n  }\n  \n  .`).concat(it, ` {\n    right: `).concat(c, \"px \").concat(r, `;\n  }\n  \n  .`).concat(at, ` {\n    margin-right: `).concat(c, \"px \").concat(r, `;\n  }\n  \n  .`).concat(it, \" .\").concat(it, ` {\n    right: 0 `).concat(r, `;\n  }\n  \n  .`).concat(at, \" .\").concat(at, ` {\n    margin-right: 0 `).concat(r, `;\n  }\n  \n  body {\n    `).concat(en, \": \").concat(c, `px;\n  }\n`);\n}, En = function(t) {\n  var e = t.noRelative, n = t.noImportant, r = t.gapMode, o = r === void 0 ? \"margin\" : r, i = I.useMemo(function() {\n    return pn(o);\n  }, [o]);\n  return I.createElement(yn, { styles: Cn(i, !e, o, n ? \"\" : \"!important\") });\n}, It = !1;\nif (typeof window < \"u\")\n  try {\n    var et = Object.defineProperty({}, \"passive\", {\n      get: function() {\n        return It = !0, !0;\n      }\n    });\n    window.addEventListener(\"test\", et, et), window.removeEventListener(\"test\", et, et);\n  } catch {\n    It = !1;\n  }\nvar x = It ? { passive: !1 } : !1, Sn = function(t) {\n  return t.tagName === \"TEXTAREA\";\n}, oe = function(t, e) {\n  var n = window.getComputedStyle(t);\n  return (\n    // not-not-scrollable\n    n[e] !== \"hidden\" && // contains scroll inside self\n    !(n.overflowY === n.overflowX && !Sn(t) && n[e] === \"visible\")\n  );\n}, bn = function(t) {\n  return oe(t, \"overflowY\");\n}, Bn = function(t) {\n  return oe(t, \"overflowX\");\n}, xt = function(t, e) {\n  var n = e.ownerDocument, r = e;\n  do {\n    typeof ShadowRoot < \"u\" && r instanceof ShadowRoot && (r = r.host);\n    var o = ie(t, r);\n    if (o) {\n      var i = ae(t, r), a = i[1], c = i[2];\n      if (a > c)\n        return !0;\n    }\n    r = r.parentNode;\n  } while (r && r !== n.body);\n  return !1;\n}, In = function(t) {\n  var e = t.scrollTop, n = t.scrollHeight, r = t.clientHeight;\n  return [\n    e,\n    n,\n    r\n  ];\n}, Mn = function(t) {\n  var e = t.scrollLeft, n = t.scrollWidth, r = t.clientWidth;\n  return [\n    e,\n    n,\n    r\n  ];\n}, ie = function(t, e) {\n  return t === \"v\" ? bn(e) : Bn(e);\n}, ae = function(t, e) {\n  return t === \"v\" ? In(e) : Mn(e);\n}, An = function(t, e) {\n  return t === \"h\" && e === \"rtl\" ? -1 : 1;\n}, Nn = function(t, e, n, r, o) {\n  var i = An(t, window.getComputedStyle(e).direction), a = i * r, c = n.target, s = e.contains(c), f = !1, l = a > 0, S = 0, h = 0;\n  do {\n    var v = ae(t, c), p = v[0], u = v[1], E = v[2], g = u - E - i * p;\n    (p || g) && ie(t, c) && (S += g, h += p), c instanceof ShadowRoot ? c = c.host : c = c.parentNode;\n  } while (\n    // portaled content\n    !s && c !== document.body || // self content\n    s && (e.contains(c) || e === c)\n  );\n  return (l && (o && Math.abs(S) < 1 || !o && a > S) || !l && (o && Math.abs(h) < 1 || !o && -a > h)) && (f = !0), f;\n}, nt = function(t) {\n  return \"changedTouches\" in t ? [t.changedTouches[0].clientX, t.changedTouches[0].clientY] : [0, 0];\n}, Ot = function(t) {\n  return [t.deltaX, t.deltaY];\n}, zt = function(t) {\n  return t && \"current\" in t ? t.current : t;\n}, Pn = function(t, e) {\n  return t[0] === e[0] && t[1] === e[1];\n}, Tn = function(t) {\n  return `\n  .block-interactivity-`.concat(t, ` {pointer-events: none;}\n  .allow-interactivity-`).concat(t, ` {pointer-events: all;}\n`);\n}, Rn = 0, O = [];\nfunction kn(t) {\n  var e = I.useRef([]), n = I.useRef([0, 0]), r = I.useRef(), o = I.useState(Rn++)[0], i = I.useState(re)[0], a = I.useRef(t);\n  I.useEffect(function() {\n    a.current = t;\n  }, [t]), I.useEffect(function() {\n    if (t.inert) {\n      document.body.classList.add(\"block-interactivity-\".concat(o));\n      var u = Xe([t.lockRef.current], (t.shards || []).map(zt), !0).filter(Boolean);\n      return u.forEach(function(E) {\n        return E.classList.add(\"allow-interactivity-\".concat(o));\n      }), function() {\n        document.body.classList.remove(\"block-interactivity-\".concat(o)), u.forEach(function(E) {\n          return E.classList.remove(\"allow-interactivity-\".concat(o));\n        });\n      };\n    }\n  }, [t.inert, t.lockRef.current, t.shards]);\n  var c = I.useCallback(function(u, E) {\n    if (\"touches\" in u && u.touches.length === 2)\n      return !a.current.allowPinchZoom;\n    var g = nt(u), w = n.current, m = \"deltaX\" in u ? u.deltaX : w[0] - g[0], d = \"deltaY\" in u ? u.deltaY : w[1] - g[1], y, B = u.target, b = Math.abs(m) > Math.abs(d) ? \"h\" : \"v\";\n    if (\"touches\" in u && b === \"h\" && B.type === \"range\")\n      return !1;\n    var M = xt(b, B);\n    if (!M)\n      return !0;\n    if (M ? y = b : (y = b === \"v\" ? \"h\" : \"v\", M = xt(b, B)), !M)\n      return !1;\n    if (!r.current && \"changedTouches\" in u && (m || d) && (r.current = y), !y)\n      return !0;\n    var A = r.current || y;\n    return Nn(A, E, u, A === \"h\" ? m : d, !0);\n  }, []), s = I.useCallback(function(u) {\n    var E = u;\n    if (!(!O.length || O[O.length - 1] !== i)) {\n      var g = \"deltaY\" in E ? Ot(E) : nt(E), w = e.current.filter(function(y) {\n        return y.name === E.type && (y.target === E.target || E.target === y.shadowParent) && Pn(y.delta, g);\n      })[0];\n      if (w && w.should) {\n        E.cancelable && E.preventDefault();\n        return;\n      }\n      if (!w) {\n        var m = (a.current.shards || []).map(zt).filter(Boolean).filter(function(y) {\n          return y.contains(E.target);\n        }), d = m.length > 0 ? c(E, m[0]) : !a.current.noIsolation;\n        d && E.cancelable && E.preventDefault();\n      }\n    }\n  }, []), f = I.useCallback(function(u, E, g, w) {\n    var m = { name: u, delta: E, target: g, should: w, shadowParent: Ln(g) };\n    e.current.push(m), setTimeout(function() {\n      e.current = e.current.filter(function(d) {\n        return d !== m;\n      });\n    }, 1);\n  }, []), l = I.useCallback(function(u) {\n    n.current = nt(u), r.current = void 0;\n  }, []), S = I.useCallback(function(u) {\n    f(u.type, Ot(u), u.target, c(u, t.lockRef.current));\n  }, []), h = I.useCallback(function(u) {\n    f(u.type, nt(u), u.target, c(u, t.lockRef.current));\n  }, []);\n  I.useEffect(function() {\n    return O.push(i), t.setCallbacks({\n      onScrollCapture: S,\n      onWheelCapture: S,\n      onTouchMoveCapture: h\n    }), document.addEventListener(\"wheel\", s, x), document.addEventListener(\"touchmove\", s, x), document.addEventListener(\"touchstart\", l, x), function() {\n      O = O.filter(function(u) {\n        return u !== i;\n      }), document.removeEventListener(\"wheel\", s, x), document.removeEventListener(\"touchmove\", s, x), document.removeEventListener(\"touchstart\", l, x);\n    };\n  }, []);\n  var v = t.removeScrollBar, p = t.inert;\n  return I.createElement(\n    I.Fragment,\n    null,\n    p ? I.createElement(i, { styles: Tn(o) }) : null,\n    v ? I.createElement(En, { gapMode: t.gapMode }) : null\n  );\n}\nfunction Ln(t) {\n  for (var e = null; t !== null; )\n    t instanceof ShadowRoot && (e = t.host, t = t.host), t = t.parentNode;\n  return e;\n}\nconst _n = ln(ne, kn);\nvar ce = I.forwardRef(function(t, e) {\n  return I.createElement(ut, D({}, t, { ref: e, sideCar: _n }));\n});\nce.classNames = ut.classNames;\nconst Zn = ce;\nvar Fn = \"nao3n43\", Dn = \"nao3n42\";\nconst Kt = (t, e) => {\n  const n = t.querySelectorAll(\"button:not(:disabled), a[href]\");\n  n.length !== 0 && n[e === \"end\" ? n.length - 1 : 0].focus();\n};\nfunction Un(t) {\n  const e = qt(null);\n  return F(() => {\n    const n = document.activeElement;\n    return () => {\n      var r;\n      (r = n.focus) == null || r.call(n);\n    };\n  }, []), F(() => {\n    if (e.current) {\n      const n = e.current.querySelector(\"[data-auto-focus]\");\n      n ? n.focus() : e.current.focus();\n    }\n  }, []), /* @__PURE__ */ T(j, { children: [\n    /* @__PURE__ */ C(\n      \"div\",\n      {\n        onFocus: R(() => e.current && Kt(e.current, \"end\"), []),\n        tabIndex: 0\n      }\n    ),\n    /* @__PURE__ */ C(\"div\", { ref: e, style: { outline: \"none\" }, tabIndex: -1, ...t }),\n    /* @__PURE__ */ C(\n      \"div\",\n      {\n        onFocus: R(() => e.current && Kt(e.current, \"start\"), []),\n        tabIndex: 0\n      }\n    )\n  ] });\n}\nfunction Vn() {\n  return typeof navigator < \"u\" && /android/i.test(navigator.userAgent);\n}\nfunction Hn() {\n  return typeof navigator < \"u\" && /iPhone|iPod/.test(navigator.userAgent);\n}\nfunction xn() {\n  return typeof navigator < \"u\" && (/iPad/.test(navigator.userAgent) || navigator.platform === \"MacIntel\" && navigator.maxTouchPoints > 1);\n}\nfunction On() {\n  return Hn() || xn();\n}\nfunction Mt() {\n  return Vn() || On();\n}\nconst zn = (t) => t.stopPropagation();\nfunction Kn({ children: t, onClose: e, open: n, titleId: r }) {\n  F(() => {\n    const c = (s) => n && s.key === \"Escape\" && e();\n    return document.addEventListener(\"keydown\", c), () => document.removeEventListener(\"keydown\", c);\n  }, [n, e]);\n  const [o, i] = P(!0);\n  F(() => {\n    i(\n      getComputedStyle(window.document.body).overflow !== \"hidden\"\n    );\n  }, []);\n  const a = R(() => e(), [e]);\n  return /* @__PURE__ */ C(j, { children: n ? Ne(\n    /* @__PURE__ */ C(Zn, { enabled: o, children: /* @__PURE__ */ C(\n      \"div\",\n      {\n        style: {\n          alignItems: Mt() ? \"flex-end\" : \"center\",\n          position: \"fixed\"\n        },\n        \"aria-labelledby\": r,\n        \"aria-modal\": !0,\n        className: Dn,\n        onClick: a,\n        role: \"dialog\",\n        children: /* @__PURE__ */ C(\n          Un,\n          {\n            className: Fn,\n            onClick: zn,\n            role: \"document\",\n            children: t\n          }\n        )\n      }\n    ) }),\n    document.body\n  ) : null });\n}\nvar Yn = \"_1sj0tk80\", Yt = \"_1sj0tk82\", $t = \"_1sj0tk81\", Q = {}, $n = function() {\n  return typeof Promise == \"function\" && Promise.prototype && Promise.prototype.then;\n}, se = {}, Z = {};\nlet kt;\nconst Wn = [\n  0,\n  // Not used\n  26,\n  44,\n  70,\n  100,\n  134,\n  172,\n  196,\n  242,\n  292,\n  346,\n  404,\n  466,\n  532,\n  581,\n  655,\n  733,\n  815,\n  901,\n  991,\n  1085,\n  1156,\n  1258,\n  1364,\n  1474,\n  1588,\n  1706,\n  1828,\n  1921,\n  2051,\n  2185,\n  2323,\n  2465,\n  2611,\n  2761,\n  2876,\n  3034,\n  3196,\n  3362,\n  3532,\n  3706\n];\nZ.getSymbolSize = function(e) {\n  if (!e)\n    throw new Error('\"version\" cannot be null or undefined');\n  if (e < 1 || e > 40)\n    throw new Error('\"version\" should be in range from 1 to 40');\n  return e * 4 + 17;\n};\nZ.getSymbolTotalCodewords = function(e) {\n  return Wn[e];\n};\nZ.getBCHDigit = function(t) {\n  let e = 0;\n  for (; t !== 0; )\n    e++, t >>>= 1;\n  return e;\n};\nZ.setToSJISFunction = function(e) {\n  if (typeof e != \"function\")\n    throw new Error('\"toSJISFunc\" is not a valid function.');\n  kt = e;\n};\nZ.isKanjiModeEnabled = function() {\n  return typeof kt < \"u\";\n};\nZ.toSJIS = function(e) {\n  return kt(e);\n};\nvar ft = {};\n(function(t) {\n  t.L = { bit: 1 }, t.M = { bit: 0 }, t.Q = { bit: 3 }, t.H = { bit: 2 };\n  function e(n) {\n    if (typeof n != \"string\")\n      throw new Error(\"Param is not a string\");\n    switch (n.toLowerCase()) {\n      case \"l\":\n      case \"low\":\n        return t.L;\n      case \"m\":\n      case \"medium\":\n        return t.M;\n      case \"q\":\n      case \"quartile\":\n        return t.Q;\n      case \"h\":\n      case \"high\":\n        return t.H;\n      default:\n        throw new Error(\"Unknown EC Level: \" + n);\n    }\n  }\n  t.isValid = function(r) {\n    return r && typeof r.bit < \"u\" && r.bit >= 0 && r.bit < 4;\n  }, t.from = function(r, o) {\n    if (t.isValid(r))\n      return r;\n    try {\n      return e(r);\n    } catch {\n      return o;\n    }\n  };\n})(ft);\nfunction le() {\n  this.buffer = [], this.length = 0;\n}\nle.prototype = {\n  get: function(t) {\n    const e = Math.floor(t / 8);\n    return (this.buffer[e] >>> 7 - t % 8 & 1) === 1;\n  },\n  put: function(t, e) {\n    for (let n = 0; n < e; n++)\n      this.putBit((t >>> e - n - 1 & 1) === 1);\n  },\n  getLengthInBits: function() {\n    return this.length;\n  },\n  putBit: function(t) {\n    const e = Math.floor(this.length / 8);\n    this.buffer.length <= e && this.buffer.push(0), t && (this.buffer[e] |= 128 >>> this.length % 8), this.length++;\n  }\n};\nvar jn = le;\nfunction G(t) {\n  if (!t || t < 1)\n    throw new Error(\"BitMatrix size must be defined and greater than 0\");\n  this.size = t, this.data = new Uint8Array(t * t), this.reservedBit = new Uint8Array(t * t);\n}\nG.prototype.set = function(t, e, n, r) {\n  const o = t * this.size + e;\n  this.data[o] = n, r && (this.reservedBit[o] = !0);\n};\nG.prototype.get = function(t, e) {\n  return this.data[t * this.size + e];\n};\nG.prototype.xor = function(t, e, n) {\n  this.data[t * this.size + e] ^= n;\n};\nG.prototype.isReserved = function(t, e) {\n  return this.reservedBit[t * this.size + e];\n};\nvar Jn = G, ue = {};\n(function(t) {\n  const e = Z.getSymbolSize;\n  t.getRowColCoords = function(r) {\n    if (r === 1)\n      return [];\n    const o = Math.floor(r / 7) + 2, i = e(r), a = i === 145 ? 26 : Math.ceil((i - 13) / (2 * o - 2)) * 2, c = [i - 7];\n    for (let s = 1; s < o - 1; s++)\n      c[s] = c[s - 1] - a;\n    return c.push(6), c.reverse();\n  }, t.getPositions = function(r) {\n    const o = [], i = t.getRowColCoords(r), a = i.length;\n    for (let c = 0; c < a; c++)\n      for (let s = 0; s < a; s++)\n        c === 0 && s === 0 || // top-left\n        c === 0 && s === a - 1 || // bottom-left\n        c === a - 1 && s === 0 || o.push([i[c], i[s]]);\n    return o;\n  };\n})(ue);\nvar fe = {};\nconst qn = Z.getSymbolSize, Wt = 7;\nfe.getPositions = function(e) {\n  const n = qn(e);\n  return [\n    // top-left\n    [0, 0],\n    // top-right\n    [n - Wt, 0],\n    // bottom-left\n    [0, n - Wt]\n  ];\n};\nvar de = {};\n(function(t) {\n  t.Patterns = {\n    PATTERN000: 0,\n    PATTERN001: 1,\n    PATTERN010: 2,\n    PATTERN011: 3,\n    PATTERN100: 4,\n    PATTERN101: 5,\n    PATTERN110: 6,\n    PATTERN111: 7\n  };\n  const e = {\n    N1: 3,\n    N2: 3,\n    N3: 40,\n    N4: 10\n  };\n  t.isValid = function(o) {\n    return o != null && o !== \"\" && !isNaN(o) && o >= 0 && o <= 7;\n  }, t.from = function(o) {\n    return t.isValid(o) ? parseInt(o, 10) : void 0;\n  }, t.getPenaltyN1 = function(o) {\n    const i = o.size;\n    let a = 0, c = 0, s = 0, f = null, l = null;\n    for (let S = 0; S < i; S++) {\n      c = s = 0, f = l = null;\n      for (let h = 0; h < i; h++) {\n        let v = o.get(S, h);\n        v === f ? c++ : (c >= 5 && (a += e.N1 + (c - 5)), f = v, c = 1), v = o.get(h, S), v === l ? s++ : (s >= 5 && (a += e.N1 + (s - 5)), l = v, s = 1);\n      }\n      c >= 5 && (a += e.N1 + (c - 5)), s >= 5 && (a += e.N1 + (s - 5));\n    }\n    return a;\n  }, t.getPenaltyN2 = function(o) {\n    const i = o.size;\n    let a = 0;\n    for (let c = 0; c < i - 1; c++)\n      for (let s = 0; s < i - 1; s++) {\n        const f = o.get(c, s) + o.get(c, s + 1) + o.get(c + 1, s) + o.get(c + 1, s + 1);\n        (f === 4 || f === 0) && a++;\n      }\n    return a * e.N2;\n  }, t.getPenaltyN3 = function(o) {\n    const i = o.size;\n    let a = 0, c = 0, s = 0;\n    for (let f = 0; f < i; f++) {\n      c = s = 0;\n      for (let l = 0; l < i; l++)\n        c = c << 1 & 2047 | o.get(f, l), l >= 10 && (c === 1488 || c === 93) && a++, s = s << 1 & 2047 | o.get(l, f), l >= 10 && (s === 1488 || s === 93) && a++;\n    }\n    return a * e.N3;\n  }, t.getPenaltyN4 = function(o) {\n    let i = 0;\n    const a = o.data.length;\n    for (let s = 0; s < a; s++)\n      i += o.data[s];\n    return Math.abs(Math.ceil(i * 100 / a / 5) - 10) * e.N4;\n  };\n  function n(r, o, i) {\n    switch (r) {\n      case t.Patterns.PATTERN000:\n        return (o + i) % 2 === 0;\n      case t.Patterns.PATTERN001:\n        return o % 2 === 0;\n      case t.Patterns.PATTERN010:\n        return i % 3 === 0;\n      case t.Patterns.PATTERN011:\n        return (o + i) % 3 === 0;\n      case t.Patterns.PATTERN100:\n        return (Math.floor(o / 2) + Math.floor(i / 3)) % 2 === 0;\n      case t.Patterns.PATTERN101:\n        return o * i % 2 + o * i % 3 === 0;\n      case t.Patterns.PATTERN110:\n        return (o * i % 2 + o * i % 3) % 2 === 0;\n      case t.Patterns.PATTERN111:\n        return (o * i % 3 + (o + i) % 2) % 2 === 0;\n      default:\n        throw new Error(\"bad maskPattern:\" + r);\n    }\n  }\n  t.applyMask = function(o, i) {\n    const a = i.size;\n    for (let c = 0; c < a; c++)\n      for (let s = 0; s < a; s++)\n        i.isReserved(s, c) || i.xor(s, c, n(o, s, c));\n  }, t.getBestMask = function(o, i) {\n    const a = Object.keys(t.Patterns).length;\n    let c = 0, s = 1 / 0;\n    for (let f = 0; f < a; f++) {\n      i(f), t.applyMask(f, o);\n      const l = t.getPenaltyN1(o) + t.getPenaltyN2(o) + t.getPenaltyN3(o) + t.getPenaltyN4(o);\n      t.applyMask(f, o), l < s && (s = l, c = f);\n    }\n    return c;\n  };\n})(de);\nvar dt = {};\nconst V = ft, rt = [\n  // L  M  Q  H\n  1,\n  1,\n  1,\n  1,\n  1,\n  1,\n  1,\n  1,\n  1,\n  1,\n  2,\n  2,\n  1,\n  2,\n  2,\n  4,\n  1,\n  2,\n  4,\n  4,\n  2,\n  4,\n  4,\n  4,\n  2,\n  4,\n  6,\n  5,\n  2,\n  4,\n  6,\n  6,\n  2,\n  5,\n  8,\n  8,\n  4,\n  5,\n  8,\n  8,\n  4,\n  5,\n  8,\n  11,\n  4,\n  8,\n  10,\n  11,\n  4,\n  9,\n  12,\n  16,\n  4,\n  9,\n  16,\n  16,\n  6,\n  10,\n  12,\n  18,\n  6,\n  10,\n  17,\n  16,\n  6,\n  11,\n  16,\n  19,\n  6,\n  13,\n  18,\n  21,\n  7,\n  14,\n  21,\n  25,\n  8,\n  16,\n  20,\n  25,\n  8,\n  17,\n  23,\n  25,\n  9,\n  17,\n  23,\n  34,\n  9,\n  18,\n  25,\n  30,\n  10,\n  20,\n  27,\n  32,\n  12,\n  21,\n  29,\n  35,\n  12,\n  23,\n  34,\n  37,\n  12,\n  25,\n  34,\n  40,\n  13,\n  26,\n  35,\n  42,\n  14,\n  28,\n  38,\n  45,\n  15,\n  29,\n  40,\n  48,\n  16,\n  31,\n  43,\n  51,\n  17,\n  33,\n  45,\n  54,\n  18,\n  35,\n  48,\n  57,\n  19,\n  37,\n  51,\n  60,\n  19,\n  38,\n  53,\n  63,\n  20,\n  40,\n  56,\n  66,\n  21,\n  43,\n  59,\n  70,\n  22,\n  45,\n  62,\n  74,\n  24,\n  47,\n  65,\n  77,\n  25,\n  49,\n  68,\n  81\n], ot = [\n  // L  M  Q  H\n  7,\n  10,\n  13,\n  17,\n  10,\n  16,\n  22,\n  28,\n  15,\n  26,\n  36,\n  44,\n  20,\n  36,\n  52,\n  64,\n  26,\n  48,\n  72,\n  88,\n  36,\n  64,\n  96,\n  112,\n  40,\n  72,\n  108,\n  130,\n  48,\n  88,\n  132,\n  156,\n  60,\n  110,\n  160,\n  192,\n  72,\n  130,\n  192,\n  224,\n  80,\n  150,\n  224,\n  264,\n  96,\n  176,\n  260,\n  308,\n  104,\n  198,\n  288,\n  352,\n  120,\n  216,\n  320,\n  384,\n  132,\n  240,\n  360,\n  432,\n  144,\n  280,\n  408,\n  480,\n  168,\n  308,\n  448,\n  532,\n  180,\n  338,\n  504,\n  588,\n  196,\n  364,\n  546,\n  650,\n  224,\n  416,\n  600,\n  700,\n  224,\n  442,\n  644,\n  750,\n  252,\n  476,\n  690,\n  816,\n  270,\n  504,\n  750,\n  900,\n  300,\n  560,\n  810,\n  960,\n  312,\n  588,\n  870,\n  1050,\n  336,\n  644,\n  952,\n  1110,\n  360,\n  700,\n  1020,\n  1200,\n  390,\n  728,\n  1050,\n  1260,\n  420,\n  784,\n  1140,\n  1350,\n  450,\n  812,\n  1200,\n  1440,\n  480,\n  868,\n  1290,\n  1530,\n  510,\n  924,\n  1350,\n  1620,\n  540,\n  980,\n  1440,\n  1710,\n  570,\n  1036,\n  1530,\n  1800,\n  570,\n  1064,\n  1590,\n  1890,\n  600,\n  1120,\n  1680,\n  1980,\n  630,\n  1204,\n  1770,\n  2100,\n  660,\n  1260,\n  1860,\n  2220,\n  720,\n  1316,\n  1950,\n  2310,\n  750,\n  1372,\n  2040,\n  2430\n];\ndt.getBlocksCount = function(e, n) {\n  switch (n) {\n    case V.L:\n      return rt[(e - 1) * 4 + 0];\n    case V.M:\n      return rt[(e - 1) * 4 + 1];\n    case V.Q:\n      return rt[(e - 1) * 4 + 2];\n    case V.H:\n      return rt[(e - 1) * 4 + 3];\n    default:\n      return;\n  }\n};\ndt.getTotalCodewordsCount = function(e, n) {\n  switch (n) {\n    case V.L:\n      return ot[(e - 1) * 4 + 0];\n    case V.M:\n      return ot[(e - 1) * 4 + 1];\n    case V.Q:\n      return ot[(e - 1) * 4 + 2];\n    case V.H:\n      return ot[(e - 1) * 4 + 3];\n    default:\n      return;\n  }\n};\nvar he = {}, ht = {};\nconst W = new Uint8Array(512), ct = new Uint8Array(256);\n(function() {\n  let e = 1;\n  for (let n = 0; n < 255; n++)\n    W[n] = e, ct[e] = n, e <<= 1, e & 256 && (e ^= 285);\n  for (let n = 255; n < 512; n++)\n    W[n] = W[n - 255];\n})();\nht.log = function(e) {\n  if (e < 1)\n    throw new Error(\"log(\" + e + \")\");\n  return ct[e];\n};\nht.exp = function(e) {\n  return W[e];\n};\nht.mul = function(e, n) {\n  return e === 0 || n === 0 ? 0 : W[ct[e] + ct[n]];\n};\n(function(t) {\n  const e = ht;\n  t.mul = function(r, o) {\n    const i = new Uint8Array(r.length + o.length - 1);\n    for (let a = 0; a < r.length; a++)\n      for (let c = 0; c < o.length; c++)\n        i[a + c] ^= e.mul(r[a], o[c]);\n    return i;\n  }, t.mod = function(r, o) {\n    let i = new Uint8Array(r);\n    for (; i.length - o.length >= 0; ) {\n      const a = i[0];\n      for (let s = 0; s < o.length; s++)\n        i[s] ^= e.mul(o[s], a);\n      let c = 0;\n      for (; c < i.length && i[c] === 0; )\n        c++;\n      i = i.slice(c);\n    }\n    return i;\n  }, t.generateECPolynomial = function(r) {\n    let o = new Uint8Array([1]);\n    for (let i = 0; i < r; i++)\n      o = t.mul(o, new Uint8Array([1, e.exp(i)]));\n    return o;\n  };\n})(he);\nconst ge = he;\nfunction Lt(t) {\n  this.genPoly = void 0, this.degree = t, this.degree && this.initialize(this.degree);\n}\nLt.prototype.initialize = function(e) {\n  this.degree = e, this.genPoly = ge.generateECPolynomial(this.degree);\n};\nLt.prototype.encode = function(e) {\n  if (!this.genPoly)\n    throw new Error(\"Encoder not initialized\");\n  const n = new Uint8Array(e.length + this.degree);\n  n.set(e);\n  const r = ge.mod(n, this.genPoly), o = this.degree - r.length;\n  if (o > 0) {\n    const i = new Uint8Array(this.degree);\n    return i.set(r, o), i;\n  }\n  return r;\n};\nvar Qn = Lt, me = {}, H = {}, _t = {};\n_t.isValid = function(e) {\n  return !isNaN(e) && e >= 1 && e <= 40;\n};\nvar U = {};\nconst ve = \"[0-9]+\", Gn = \"[A-Z $%*+\\\\-./:]+\";\nlet J = \"(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+\";\nJ = J.replace(/u/g, \"\\\\u\");\nconst Xn = \"(?:(?![A-Z0-9 $%*+\\\\-./:]|\" + J + `)(?:.|[\\r\n]))+`;\nU.KANJI = new RegExp(J, \"g\");\nU.BYTE_KANJI = new RegExp(\"[^A-Z0-9 $%*+\\\\-./:]+\", \"g\");\nU.BYTE = new RegExp(Xn, \"g\");\nU.NUMERIC = new RegExp(ve, \"g\");\nU.ALPHANUMERIC = new RegExp(Gn, \"g\");\nconst tr = new RegExp(\"^\" + J + \"$\"), er = new RegExp(\"^\" + ve + \"$\"), nr = new RegExp(\"^[A-Z0-9 $%*+\\\\-./:]+$\");\nU.testKanji = function(e) {\n  return tr.test(e);\n};\nU.testNumeric = function(e) {\n  return er.test(e);\n};\nU.testAlphanumeric = function(e) {\n  return nr.test(e);\n};\n(function(t) {\n  const e = _t, n = U;\n  t.NUMERIC = {\n    id: \"Numeric\",\n    bit: 1,\n    ccBits: [10, 12, 14]\n  }, t.ALPHANUMERIC = {\n    id: \"Alphanumeric\",\n    bit: 2,\n    ccBits: [9, 11, 13]\n  }, t.BYTE = {\n    id: \"Byte\",\n    bit: 4,\n    ccBits: [8, 16, 16]\n  }, t.KANJI = {\n    id: \"Kanji\",\n    bit: 8,\n    ccBits: [8, 10, 12]\n  }, t.MIXED = {\n    bit: -1\n  }, t.getCharCountIndicator = function(i, a) {\n    if (!i.ccBits)\n      throw new Error(\"Invalid mode: \" + i);\n    if (!e.isValid(a))\n      throw new Error(\"Invalid version: \" + a);\n    return a >= 1 && a < 10 ? i.ccBits[0] : a < 27 ? i.ccBits[1] : i.ccBits[2];\n  }, t.getBestModeForData = function(i) {\n    return n.testNumeric(i) ? t.NUMERIC : n.testAlphanumeric(i) ? t.ALPHANUMERIC : n.testKanji(i) ? t.KANJI : t.BYTE;\n  }, t.toString = function(i) {\n    if (i && i.id)\n      return i.id;\n    throw new Error(\"Invalid mode\");\n  }, t.isValid = function(i) {\n    return i && i.bit && i.ccBits;\n  };\n  function r(o) {\n    if (typeof o != \"string\")\n      throw new Error(\"Param is not a string\");\n    switch (o.toLowerCase()) {\n      case \"numeric\":\n        return t.NUMERIC;\n      case \"alphanumeric\":\n        return t.ALPHANUMERIC;\n      case \"kanji\":\n        return t.KANJI;\n      case \"byte\":\n        return t.BYTE;\n      default:\n        throw new Error(\"Unknown mode: \" + o);\n    }\n  }\n  t.from = function(i, a) {\n    if (t.isValid(i))\n      return i;\n    try {\n      return r(i);\n    } catch {\n      return a;\n    }\n  };\n})(H);\n(function(t) {\n  const e = Z, n = dt, r = ft, o = H, i = _t, a = 7973, c = e.getBCHDigit(a);\n  function s(h, v, p) {\n    for (let u = 1; u <= 40; u++)\n      if (v <= t.getCapacity(u, p, h))\n        return u;\n  }\n  function f(h, v) {\n    return o.getCharCountIndicator(h, v) + 4;\n  }\n  function l(h, v) {\n    let p = 0;\n    return h.forEach(function(u) {\n      const E = f(u.mode, v);\n      p += E + u.getBitsLength();\n    }), p;\n  }\n  function S(h, v) {\n    for (let p = 1; p <= 40; p++)\n      if (l(h, p) <= t.getCapacity(p, v, o.MIXED))\n        return p;\n  }\n  t.from = function(v, p) {\n    return i.isValid(v) ? parseInt(v, 10) : p;\n  }, t.getCapacity = function(v, p, u) {\n    if (!i.isValid(v))\n      throw new Error(\"Invalid QR Code version\");\n    typeof u > \"u\" && (u = o.BYTE);\n    const E = e.getSymbolTotalCodewords(v), g = n.getTotalCodewordsCount(v, p), w = (E - g) * 8;\n    if (u === o.MIXED)\n      return w;\n    const m = w - f(u, v);\n    switch (u) {\n      case o.NUMERIC:\n        return Math.floor(m / 10 * 3);\n      case o.ALPHANUMERIC:\n        return Math.floor(m / 11 * 2);\n      case o.KANJI:\n        return Math.floor(m / 13);\n      case o.BYTE:\n      default:\n        return Math.floor(m / 8);\n    }\n  }, t.getBestVersionForData = function(v, p) {\n    let u;\n    const E = r.from(p, r.M);\n    if (Array.isArray(v)) {\n      if (v.length > 1)\n        return S(v, E);\n      if (v.length === 0)\n        return 1;\n      u = v[0];\n    } else\n      u = v;\n    return s(u.mode, u.getLength(), E);\n  }, t.getEncodedBits = function(v) {\n    if (!i.isValid(v) || v < 7)\n      throw new Error(\"Invalid QR Code version\");\n    let p = v << 12;\n    for (; e.getBCHDigit(p) - c >= 0; )\n      p ^= a << e.getBCHDigit(p) - c;\n    return v << 12 | p;\n  };\n})(me);\nvar we = {};\nconst At = Z, pe = 1335, rr = 21522, jt = At.getBCHDigit(pe);\nwe.getEncodedBits = function(e, n) {\n  const r = e.bit << 3 | n;\n  let o = r << 10;\n  for (; At.getBCHDigit(o) - jt >= 0; )\n    o ^= pe << At.getBCHDigit(o) - jt;\n  return (r << 10 | o) ^ rr;\n};\nvar ye = {};\nconst or = H;\nfunction z(t) {\n  this.mode = or.NUMERIC, this.data = t.toString();\n}\nz.getBitsLength = function(e) {\n  return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);\n};\nz.prototype.getLength = function() {\n  return this.data.length;\n};\nz.prototype.getBitsLength = function() {\n  return z.getBitsLength(this.data.length);\n};\nz.prototype.write = function(e) {\n  let n, r, o;\n  for (n = 0; n + 3 <= this.data.length; n += 3)\n    r = this.data.substr(n, 3), o = parseInt(r, 10), e.put(o, 10);\n  const i = this.data.length - n;\n  i > 0 && (r = this.data.substr(n), o = parseInt(r, 10), e.put(o, i * 3 + 1));\n};\nvar ir = z;\nconst ar = H, yt = [\n  \"0\",\n  \"1\",\n  \"2\",\n  \"3\",\n  \"4\",\n  \"5\",\n  \"6\",\n  \"7\",\n  \"8\",\n  \"9\",\n  \"A\",\n  \"B\",\n  \"C\",\n  \"D\",\n  \"E\",\n  \"F\",\n  \"G\",\n  \"H\",\n  \"I\",\n  \"J\",\n  \"K\",\n  \"L\",\n  \"M\",\n  \"N\",\n  \"O\",\n  \"P\",\n  \"Q\",\n  \"R\",\n  \"S\",\n  \"T\",\n  \"U\",\n  \"V\",\n  \"W\",\n  \"X\",\n  \"Y\",\n  \"Z\",\n  \" \",\n  \"$\",\n  \"%\",\n  \"*\",\n  \"+\",\n  \"-\",\n  \".\",\n  \"/\",\n  \":\"\n];\nfunction K(t) {\n  this.mode = ar.ALPHANUMERIC, this.data = t;\n}\nK.getBitsLength = function(e) {\n  return 11 * Math.floor(e / 2) + 6 * (e % 2);\n};\nK.prototype.getLength = function() {\n  return this.data.length;\n};\nK.prototype.getBitsLength = function() {\n  return K.getBitsLength(this.data.length);\n};\nK.prototype.write = function(e) {\n  let n;\n  for (n = 0; n + 2 <= this.data.length; n += 2) {\n    let r = yt.indexOf(this.data[n]) * 45;\n    r += yt.indexOf(this.data[n + 1]), e.put(r, 11);\n  }\n  this.data.length % 2 && e.put(yt.indexOf(this.data[n]), 6);\n};\nvar cr = K, sr = function(e) {\n  for (var n = [], r = e.length, o = 0; o < r; o++) {\n    var i = e.charCodeAt(o);\n    if (i >= 55296 && i <= 56319 && r > o + 1) {\n      var a = e.charCodeAt(o + 1);\n      a >= 56320 && a <= 57343 && (i = (i - 55296) * 1024 + a - 56320 + 65536, o += 1);\n    }\n    if (i < 128) {\n      n.push(i);\n      continue;\n    }\n    if (i < 2048) {\n      n.push(i >> 6 | 192), n.push(i & 63 | 128);\n      continue;\n    }\n    if (i < 55296 || i >= 57344 && i < 65536) {\n      n.push(i >> 12 | 224), n.push(i >> 6 & 63 | 128), n.push(i & 63 | 128);\n      continue;\n    }\n    if (i >= 65536 && i <= 1114111) {\n      n.push(i >> 18 | 240), n.push(i >> 12 & 63 | 128), n.push(i >> 6 & 63 | 128), n.push(i & 63 | 128);\n      continue;\n    }\n    n.push(239, 191, 189);\n  }\n  return new Uint8Array(n).buffer;\n};\nconst lr = sr, ur = H;\nfunction Y(t) {\n  this.mode = ur.BYTE, typeof t == \"string\" && (t = lr(t)), this.data = new Uint8Array(t);\n}\nY.getBitsLength = function(e) {\n  return e * 8;\n};\nY.prototype.getLength = function() {\n  return this.data.length;\n};\nY.prototype.getBitsLength = function() {\n  return Y.getBitsLength(this.data.length);\n};\nY.prototype.write = function(t) {\n  for (let e = 0, n = this.data.length; e < n; e++)\n    t.put(this.data[e], 8);\n};\nvar fr = Y;\nconst dr = H, hr = Z;\nfunction $(t) {\n  this.mode = dr.KANJI, this.data = t;\n}\n$.getBitsLength = function(e) {\n  return e * 13;\n};\n$.prototype.getLength = function() {\n  return this.data.length;\n};\n$.prototype.getBitsLength = function() {\n  return $.getBitsLength(this.data.length);\n};\n$.prototype.write = function(t) {\n  let e;\n  for (e = 0; e < this.data.length; e++) {\n    let n = hr.toSJIS(this.data[e]);\n    if (n >= 33088 && n <= 40956)\n      n -= 33088;\n    else if (n >= 57408 && n <= 60351)\n      n -= 49472;\n    else\n      throw new Error(\n        \"Invalid SJIS character: \" + this.data[e] + `\nMake sure your charset is UTF-8`\n      );\n    n = (n >>> 8 & 255) * 192 + (n & 255), t.put(n, 13);\n  }\n};\nvar gr = $, Ce = { exports: {} };\n(function(t) {\n  var e = {\n    single_source_shortest_paths: function(n, r, o) {\n      var i = {}, a = {};\n      a[r] = 0;\n      var c = e.PriorityQueue.make();\n      c.push(r, 0);\n      for (var s, f, l, S, h, v, p, u, E; !c.empty(); ) {\n        s = c.pop(), f = s.value, S = s.cost, h = n[f] || {};\n        for (l in h)\n          h.hasOwnProperty(l) && (v = h[l], p = S + v, u = a[l], E = typeof a[l] > \"u\", (E || u > p) && (a[l] = p, c.push(l, p), i[l] = f));\n      }\n      if (typeof o < \"u\" && typeof a[o] > \"u\") {\n        var g = [\"Could not find a path from \", r, \" to \", o, \".\"].join(\"\");\n        throw new Error(g);\n      }\n      return i;\n    },\n    extract_shortest_path_from_predecessor_list: function(n, r) {\n      for (var o = [], i = r; i; )\n        o.push(i), n[i], i = n[i];\n      return o.reverse(), o;\n    },\n    find_path: function(n, r, o) {\n      var i = e.single_source_shortest_paths(n, r, o);\n      return e.extract_shortest_path_from_predecessor_list(\n        i,\n        o\n      );\n    },\n    /**\n     * A very naive priority queue implementation.\n     */\n    PriorityQueue: {\n      make: function(n) {\n        var r = e.PriorityQueue, o = {}, i;\n        n = n || {};\n        for (i in r)\n          r.hasOwnProperty(i) && (o[i] = r[i]);\n        return o.queue = [], o.sorter = n.sorter || r.default_sorter, o;\n      },\n      default_sorter: function(n, r) {\n        return n.cost - r.cost;\n      },\n      /**\n       * Add a new item to the queue and ensure the highest priority element\n       * is at the front of the queue.\n       */\n      push: function(n, r) {\n        var o = { value: n, cost: r };\n        this.queue.push(o), this.queue.sort(this.sorter);\n      },\n      /**\n       * Return the highest priority element in the queue.\n       */\n      pop: function() {\n        return this.queue.shift();\n      },\n      empty: function() {\n        return this.queue.length === 0;\n      }\n    }\n  };\n  t.exports = e;\n})(Ce);\nvar mr = Ce.exports;\n(function(t) {\n  const e = H, n = ir, r = cr, o = fr, i = gr, a = U, c = Z, s = mr;\n  function f(g) {\n    return unescape(encodeURIComponent(g)).length;\n  }\n  function l(g, w, m) {\n    const d = [];\n    let y;\n    for (; (y = g.exec(m)) !== null; )\n      d.push({\n        data: y[0],\n        index: y.index,\n        mode: w,\n        length: y[0].length\n      });\n    return d;\n  }\n  function S(g) {\n    const w = l(a.NUMERIC, e.NUMERIC, g), m = l(a.ALPHANUMERIC, e.ALPHANUMERIC, g);\n    let d, y;\n    return c.isKanjiModeEnabled() ? (d = l(a.BYTE, e.BYTE, g), y = l(a.KANJI, e.KANJI, g)) : (d = l(a.BYTE_KANJI, e.BYTE, g), y = []), w.concat(m, d, y).sort(function(b, M) {\n      return b.index - M.index;\n    }).map(function(b) {\n      return {\n        data: b.data,\n        mode: b.mode,\n        length: b.length\n      };\n    });\n  }\n  function h(g, w) {\n    switch (w) {\n      case e.NUMERIC:\n        return n.getBitsLength(g);\n      case e.ALPHANUMERIC:\n        return r.getBitsLength(g);\n      case e.KANJI:\n        return i.getBitsLength(g);\n      case e.BYTE:\n        return o.getBitsLength(g);\n    }\n  }\n  function v(g) {\n    return g.reduce(function(w, m) {\n      const d = w.length - 1 >= 0 ? w[w.length - 1] : null;\n      return d && d.mode === m.mode ? (w[w.length - 1].data += m.data, w) : (w.push(m), w);\n    }, []);\n  }\n  function p(g) {\n    const w = [];\n    for (let m = 0; m < g.length; m++) {\n      const d = g[m];\n      switch (d.mode) {\n        case e.NUMERIC:\n          w.push([\n            d,\n            { data: d.data, mode: e.ALPHANUMERIC, length: d.length },\n            { data: d.data, mode: e.BYTE, length: d.length }\n          ]);\n          break;\n        case e.ALPHANUMERIC:\n          w.push([\n            d,\n            { data: d.data, mode: e.BYTE, length: d.length }\n          ]);\n          break;\n        case e.KANJI:\n          w.push([\n            d,\n            { data: d.data, mode: e.BYTE, length: f(d.data) }\n          ]);\n          break;\n        case e.BYTE:\n          w.push([\n            { data: d.data, mode: e.BYTE, length: f(d.data) }\n          ]);\n      }\n    }\n    return w;\n  }\n  function u(g, w) {\n    const m = {}, d = { start: {} };\n    let y = [\"start\"];\n    for (let B = 0; B < g.length; B++) {\n      const b = g[B], M = [];\n      for (let A = 0; A < b.length; A++) {\n        const N = b[A], k = \"\" + B + A;\n        M.push(k), m[k] = { node: N, lastCount: 0 }, d[k] = {};\n        for (let L = 0; L < y.length; L++) {\n          const _ = y[L];\n          m[_] && m[_].node.mode === N.mode ? (d[_][k] = h(m[_].lastCount + N.length, N.mode) - h(m[_].lastCount, N.mode), m[_].lastCount += N.length) : (m[_] && (m[_].lastCount = N.length), d[_][k] = h(N.length, N.mode) + 4 + e.getCharCountIndicator(N.mode, w));\n        }\n      }\n      y = M;\n    }\n    for (let B = 0; B < y.length; B++)\n      d[y[B]].end = 0;\n    return { map: d, table: m };\n  }\n  function E(g, w) {\n    let m;\n    const d = e.getBestModeForData(g);\n    if (m = e.from(w, d), m !== e.BYTE && m.bit < d.bit)\n      throw new Error('\"' + g + '\" cannot be encoded with mode ' + e.toString(m) + `.\n Suggested mode is: ` + e.toString(d));\n    switch (m === e.KANJI && !c.isKanjiModeEnabled() && (m = e.BYTE), m) {\n      case e.NUMERIC:\n        return new n(g);\n      case e.ALPHANUMERIC:\n        return new r(g);\n      case e.KANJI:\n        return new i(g);\n      case e.BYTE:\n        return new o(g);\n    }\n  }\n  t.fromArray = function(w) {\n    return w.reduce(function(m, d) {\n      return typeof d == \"string\" ? m.push(E(d, null)) : d.data && m.push(E(d.data, d.mode)), m;\n    }, []);\n  }, t.fromString = function(w, m) {\n    const d = S(w, c.isKanjiModeEnabled()), y = p(d), B = u(y, m), b = s.find_path(B.map, \"start\", \"end\"), M = [];\n    for (let A = 1; A < b.length - 1; A++)\n      M.push(B.table[b[A]].node);\n    return t.fromArray(v(M));\n  }, t.rawSplit = function(w) {\n    return t.fromArray(\n      S(w, c.isKanjiModeEnabled())\n    );\n  };\n})(ye);\nconst gt = Z, Ct = ft, vr = jn, wr = Jn, pr = ue, yr = fe, Nt = de, Pt = dt, Cr = Qn, st = me, Er = we, Sr = H, Et = ye;\nfunction br(t, e) {\n  const n = t.size, r = yr.getPositions(e);\n  for (let o = 0; o < r.length; o++) {\n    const i = r[o][0], a = r[o][1];\n    for (let c = -1; c <= 7; c++)\n      if (!(i + c <= -1 || n <= i + c))\n        for (let s = -1; s <= 7; s++)\n          a + s <= -1 || n <= a + s || (c >= 0 && c <= 6 && (s === 0 || s === 6) || s >= 0 && s <= 6 && (c === 0 || c === 6) || c >= 2 && c <= 4 && s >= 2 && s <= 4 ? t.set(i + c, a + s, !0, !0) : t.set(i + c, a + s, !1, !0));\n  }\n}\nfunction Br(t) {\n  const e = t.size;\n  for (let n = 8; n < e - 8; n++) {\n    const r = n % 2 === 0;\n    t.set(n, 6, r, !0), t.set(6, n, r, !0);\n  }\n}\nfunction Ir(t, e) {\n  const n = pr.getPositions(e);\n  for (let r = 0; r < n.length; r++) {\n    const o = n[r][0], i = n[r][1];\n    for (let a = -2; a <= 2; a++)\n      for (let c = -2; c <= 2; c++)\n        a === -2 || a === 2 || c === -2 || c === 2 || a === 0 && c === 0 ? t.set(o + a, i + c, !0, !0) : t.set(o + a, i + c, !1, !0);\n  }\n}\nfunction Mr(t, e) {\n  const n = t.size, r = st.getEncodedBits(e);\n  let o, i, a;\n  for (let c = 0; c < 18; c++)\n    o = Math.floor(c / 3), i = c % 3 + n - 8 - 3, a = (r >> c & 1) === 1, t.set(o, i, a, !0), t.set(i, o, a, !0);\n}\nfunction St(t, e, n) {\n  const r = t.size, o = Er.getEncodedBits(e, n);\n  let i, a;\n  for (i = 0; i < 15; i++)\n    a = (o >> i & 1) === 1, i < 6 ? t.set(i, 8, a, !0) : i < 8 ? t.set(i + 1, 8, a, !0) : t.set(r - 15 + i, 8, a, !0), i < 8 ? t.set(8, r - i - 1, a, !0) : i < 9 ? t.set(8, 15 - i - 1 + 1, a, !0) : t.set(8, 15 - i - 1, a, !0);\n  t.set(r - 8, 8, 1, !0);\n}\nfunction Ar(t, e) {\n  const n = t.size;\n  let r = -1, o = n - 1, i = 7, a = 0;\n  for (let c = n - 1; c > 0; c -= 2)\n    for (c === 6 && c--; ; ) {\n      for (let s = 0; s < 2; s++)\n        if (!t.isReserved(o, c - s)) {\n          let f = !1;\n          a < e.length && (f = (e[a] >>> i & 1) === 1), t.set(o, c - s, f), i--, i === -1 && (a++, i = 7);\n        }\n      if (o += r, o < 0 || n <= o) {\n        o -= r, r = -r;\n        break;\n      }\n    }\n}\nfunction Nr(t, e, n) {\n  const r = new vr();\n  n.forEach(function(s) {\n    r.put(s.mode.bit, 4), r.put(s.getLength(), Sr.getCharCountIndicator(s.mode, t)), s.write(r);\n  });\n  const o = gt.getSymbolTotalCodewords(t), i = Pt.getTotalCodewordsCount(t, e), a = (o - i) * 8;\n  for (r.getLengthInBits() + 4 <= a && r.put(0, 4); r.getLengthInBits() % 8 !== 0; )\n    r.putBit(0);\n  const c = (a - r.getLengthInBits()) / 8;\n  for (let s = 0; s < c; s++)\n    r.put(s % 2 ? 17 : 236, 8);\n  return Pr(r, t, e);\n}\nfunction Pr(t, e, n) {\n  const r = gt.getSymbolTotalCodewords(e), o = Pt.getTotalCodewordsCount(e, n), i = r - o, a = Pt.getBlocksCount(e, n), c = r % a, s = a - c, f = Math.floor(r / a), l = Math.floor(i / a), S = l + 1, h = f - l, v = new Cr(h);\n  let p = 0;\n  const u = new Array(a), E = new Array(a);\n  let g = 0;\n  const w = new Uint8Array(t.buffer);\n  for (let b = 0; b < a; b++) {\n    const M = b < s ? l : S;\n    u[b] = w.slice(p, p + M), E[b] = v.encode(u[b]), p += M, g = Math.max(g, M);\n  }\n  const m = new Uint8Array(r);\n  let d = 0, y, B;\n  for (y = 0; y < g; y++)\n    for (B = 0; B < a; B++)\n      y < u[B].length && (m[d++] = u[B][y]);\n  for (y = 0; y < h; y++)\n    for (B = 0; B < a; B++)\n      m[d++] = E[B][y];\n  return m;\n}\nfunction Tr(t, e, n, r) {\n  let o;\n  if (Array.isArray(t))\n    o = Et.fromArray(t);\n  else if (typeof t == \"string\") {\n    let f = e;\n    if (!f) {\n      const l = Et.rawSplit(t);\n      f = st.getBestVersionForData(l, n);\n    }\n    o = Et.fromString(t, f || 40);\n  } else\n    throw new Error(\"Invalid data\");\n  const i = st.getBestVersionForData(o, n);\n  if (!i)\n    throw new Error(\"The amount of data is too big to be stored in a QR Code\");\n  if (!e)\n    e = i;\n  else if (e < i)\n    throw new Error(\n      `\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: ` + i + `.\n`\n    );\n  const a = Nr(e, n, o), c = gt.getSymbolSize(e), s = new wr(c);\n  return br(s, e), Br(s), Ir(s, e), St(s, n, 0), e >= 7 && Mr(s, e), Ar(s, a), isNaN(r) && (r = Nt.getBestMask(\n    s,\n    St.bind(null, s, n)\n  )), Nt.applyMask(r, s), St(s, n, r), {\n    modules: s,\n    version: e,\n    errorCorrectionLevel: n,\n    maskPattern: r,\n    segments: o\n  };\n}\nse.create = function(e, n) {\n  if (typeof e > \"u\" || e === \"\")\n    throw new Error(\"No input text\");\n  let r = Ct.M, o, i;\n  return typeof n < \"u\" && (r = Ct.from(n.errorCorrectionLevel, Ct.M), o = st.from(n.version), i = Nt.from(n.maskPattern), n.toSJISFunc && gt.setToSJISFunction(n.toSJISFunc)), Tr(e, o, r, i);\n};\nvar Ee = {}, Zt = {};\n(function(t) {\n  function e(n) {\n    if (typeof n == \"number\" && (n = n.toString()), typeof n != \"string\")\n      throw new Error(\"Color should be defined as hex string\");\n    let r = n.slice().replace(\"#\", \"\").split(\"\");\n    if (r.length < 3 || r.length === 5 || r.length > 8)\n      throw new Error(\"Invalid hex color: \" + n);\n    (r.length === 3 || r.length === 4) && (r = Array.prototype.concat.apply([], r.map(function(i) {\n      return [i, i];\n    }))), r.length === 6 && r.push(\"F\", \"F\");\n    const o = parseInt(r.join(\"\"), 16);\n    return {\n      r: o >> 24 & 255,\n      g: o >> 16 & 255,\n      b: o >> 8 & 255,\n      a: o & 255,\n      hex: \"#\" + r.slice(0, 6).join(\"\")\n    };\n  }\n  t.getOptions = function(r) {\n    r || (r = {}), r.color || (r.color = {});\n    const o = typeof r.margin > \"u\" || r.margin === null || r.margin < 0 ? 4 : r.margin, i = r.width && r.width >= 21 ? r.width : void 0, a = r.scale || 4;\n    return {\n      width: i,\n      scale: i ? 4 : a,\n      margin: o,\n      color: {\n        dark: e(r.color.dark || \"#000000ff\"),\n        light: e(r.color.light || \"#ffffffff\")\n      },\n      type: r.type,\n      rendererOpts: r.rendererOpts || {}\n    };\n  }, t.getScale = function(r, o) {\n    return o.width && o.width >= r + o.margin * 2 ? o.width / (r + o.margin * 2) : o.scale;\n  }, t.getImageWidth = function(r, o) {\n    const i = t.getScale(r, o);\n    return Math.floor((r + o.margin * 2) * i);\n  }, t.qrToImageData = function(r, o, i) {\n    const a = o.modules.size, c = o.modules.data, s = t.getScale(a, i), f = Math.floor((a + i.margin * 2) * s), l = i.margin * s, S = [i.color.light, i.color.dark];\n    for (let h = 0; h < f; h++)\n      for (let v = 0; v < f; v++) {\n        let p = (h * f + v) * 4, u = i.color.light;\n        if (h >= l && v >= l && h < f - l && v < f - l) {\n          const E = Math.floor((h - l) / s), g = Math.floor((v - l) / s);\n          u = S[c[E * a + g] ? 1 : 0];\n        }\n        r[p++] = u.r, r[p++] = u.g, r[p++] = u.b, r[p] = u.a;\n      }\n  };\n})(Zt);\n(function(t) {\n  const e = Zt;\n  function n(o, i, a) {\n    o.clearRect(0, 0, i.width, i.height), i.style || (i.style = {}), i.height = a, i.width = a, i.style.height = a + \"px\", i.style.width = a + \"px\";\n  }\n  function r() {\n    try {\n      return document.createElement(\"canvas\");\n    } catch {\n      throw new Error(\"You need to specify a canvas element\");\n    }\n  }\n  t.render = function(i, a, c) {\n    let s = c, f = a;\n    typeof s > \"u\" && (!a || !a.getContext) && (s = a, a = void 0), a || (f = r()), s = e.getOptions(s);\n    const l = e.getImageWidth(i.modules.size, s), S = f.getContext(\"2d\"), h = S.createImageData(l, l);\n    return e.qrToImageData(h.data, i, s), n(S, f, l), S.putImageData(h, 0, 0), f;\n  }, t.renderToDataURL = function(i, a, c) {\n    let s = c;\n    typeof s > \"u\" && (!a || !a.getContext) && (s = a, a = void 0), s || (s = {});\n    const f = t.render(i, a, s), l = s.type || \"image/png\", S = s.rendererOpts || {};\n    return f.toDataURL(l, S.quality);\n  };\n})(Ee);\nvar Se = {};\nconst Rr = Zt;\nfunction Jt(t, e) {\n  const n = t.a / 255, r = e + '=\"' + t.hex + '\"';\n  return n < 1 ? r + \" \" + e + '-opacity=\"' + n.toFixed(2).slice(1) + '\"' : r;\n}\nfunction bt(t, e, n) {\n  let r = t + e;\n  return typeof n < \"u\" && (r += \" \" + n), r;\n}\nfunction kr(t, e, n) {\n  let r = \"\", o = 0, i = !1, a = 0;\n  for (let c = 0; c < t.length; c++) {\n    const s = Math.floor(c % e), f = Math.floor(c / e);\n    !s && !i && (i = !0), t[c] ? (a++, c > 0 && s > 0 && t[c - 1] || (r += i ? bt(\"M\", s + n, 0.5 + f + n) : bt(\"m\", o, 0), o = 0, i = !1), s + 1 < e && t[c + 1] || (r += bt(\"h\", a), a = 0)) : o++;\n  }\n  return r;\n}\nSe.render = function(e, n, r) {\n  const o = Rr.getOptions(n), i = e.modules.size, a = e.modules.data, c = i + o.margin * 2, s = o.color.light.a ? \"<path \" + Jt(o.color.light, \"fill\") + ' d=\"M0 0h' + c + \"v\" + c + 'H0z\"/>' : \"\", f = \"<path \" + Jt(o.color.dark, \"stroke\") + ' d=\"' + kr(a, i, o.margin) + '\"/>', l = 'viewBox=\"0 0 ' + c + \" \" + c + '\"', h = '<svg xmlns=\"http://www.w3.org/2000/svg\" ' + (o.width ? 'width=\"' + o.width + '\" height=\"' + o.width + '\" ' : \"\") + l + ' shape-rendering=\"crispEdges\">' + s + f + `</svg>\n`;\n  return typeof r == \"function\" && r(null, h), h;\n};\nconst Lr = $n, Tt = se, be = Ee, _r = Se;\nfunction Ft(t, e, n, r, o) {\n  const i = [].slice.call(arguments, 1), a = i.length, c = typeof i[a - 1] == \"function\";\n  if (!c && !Lr())\n    throw new Error(\"Callback required as last argument\");\n  if (c) {\n    if (a < 2)\n      throw new Error(\"Too few arguments provided\");\n    a === 2 ? (o = n, n = e, e = r = void 0) : a === 3 && (e.getContext && typeof o > \"u\" ? (o = r, r = void 0) : (o = r, r = n, n = e, e = void 0));\n  } else {\n    if (a < 1)\n      throw new Error(\"Too few arguments provided\");\n    return a === 1 ? (n = e, e = r = void 0) : a === 2 && !e.getContext && (r = n, n = e, e = void 0), new Promise(function(s, f) {\n      try {\n        const l = Tt.create(n, r);\n        s(t(l, e, r));\n      } catch (l) {\n        f(l);\n      }\n    });\n  }\n  try {\n    const s = Tt.create(n, r);\n    o(null, t(s, e, r));\n  } catch (s) {\n    o(s);\n  }\n}\nQ.create = Tt.create;\nQ.toCanvas = Ft.bind(null, be.render);\nQ.toDataURL = Ft.bind(null, be.renderToDataURL);\nQ.toString = Ft.bind(null, function(t, e, n) {\n  return _r.render(t, n);\n});\nconst Zr = (t, e) => {\n  const n = Array.prototype.slice.call(\n    Q.create(t, { errorCorrectionLevel: e }).modules.data,\n    0\n  ), r = Math.sqrt(n.length);\n  return n.reduce(\n    (o, i, a) => (a % r === 0 ? o.push([i]) : o[o.length - 1].push(i)) && o,\n    []\n  );\n};\nfunction Fr({\n  ecl: t = \"H\",\n  logoMargin: e = 10,\n  logoSize: n = 50,\n  size: r = 200,\n  uri: o\n}) {\n  const a = r - parseInt(\"20\", 10) * 2, c = Ae(() => {\n    const l = [], S = Zr(o, t), h = a / S.length;\n    [\n      { x: 0, y: 0 },\n      { x: 1, y: 0 },\n      { x: 0, y: 1 }\n    ].forEach(({ x: g, y: w }) => {\n      const m = (S.length - 7) * h * g, d = (S.length - 7) * h * w;\n      for (let y = 0; y < 3; y++)\n        l.push(\n          /* @__PURE__ */ C(\n            \"rect\",\n            {\n              fill: y % 2 !== 0 ? \"white\" : \"black\",\n              height: h * (7 - y * 2),\n              rx: (y - 2) * -5 + (y === 0 ? 2 : 0),\n              ry: (y - 2) * -5 + (y === 0 ? 2 : 0),\n              width: h * (7 - y * 2),\n              x: m + h * y,\n              y: d + h * y\n            },\n            `${y}-${g}-${w}`\n          )\n        );\n    });\n    const p = Math.floor((n + e * 2) / h), u = S.length / 2 - p / 2, E = S.length / 2 + p / 2 - 1;\n    return S.forEach((g, w) => {\n      g.forEach((m, d) => {\n        S[w][d] && (w < 7 && d < 7 || w > S.length - 8 && d < 7 || w < 7 && d > S.length - 8 || w > u && w < E && d > u && d < E || l.push(\n          /* @__PURE__ */ C(\n            \"circle\",\n            {\n              cx: w * h + h / 2,\n              cy: d * h + h / 2,\n              fill: \"black\",\n              r: h / 3\n            },\n            `circle-${w}-${d}`\n          )\n        ));\n      });\n    }), l;\n  }, [t, n, e, a, o]), s = a / 2 - n / 2, f = n + e * 2;\n  return /* @__PURE__ */ C(\"div\", { className: Ve, children: /* @__PURE__ */ T(\"div\", { className: He, children: [\n    /* @__PURE__ */ C(\n      \"div\",\n      {\n        className: Ue,\n        style: {\n          top: s,\n          width: a\n        },\n        children: /* @__PURE__ */ C(Xt, { fill: \"purple\", height: n })\n      }\n    ),\n    /* @__PURE__ */ T(\"svg\", { height: a, style: { all: \"revert\" }, width: a, children: [\n      /* @__PURE__ */ C(\"title\", { children: \"QR Code\" }),\n      /* @__PURE__ */ T(\"defs\", { children: [\n        /* @__PURE__ */ C(\"clipPath\", { id: \"clip-wrapper\", children: /* @__PURE__ */ C(\"rect\", { height: f, width: f }) }),\n        /* @__PURE__ */ C(\"clipPath\", { id: \"clip-logo\", children: /* @__PURE__ */ C(\"rect\", { height: n, width: n }) })\n      ] }),\n      /* @__PURE__ */ C(\"rect\", { fill: \"transparent\", height: a, width: a }),\n      c\n    ] })\n  ] }) });\n}\nfunction Dr({\n  open: t,\n  onClose: e,\n  url: n,\n  isError: r,\n  error: o\n}) {\n  return /* @__PURE__ */ C(Kn, { open: t, titleId: \"Sign In With Farcaster\", onClose: e, children: /* @__PURE__ */ C(\"div\", { className: \"fc-authkit-qrcode-dialog\", children: /* @__PURE__ */ T(\"div\", { className: Yn, children: [\n    /* @__PURE__ */ C(\n      Bt,\n      {\n        kind: \"reset\",\n        onClick: e,\n        style: { position: \"absolute\", top: 19, right: 13 },\n        children: /* @__PURE__ */ C(\n          \"svg\",\n          {\n            xmlns: \"http://www.w3.org/2000/svg\",\n            width: 18,\n            height: 18,\n            fill: \"none\",\n            children: /* @__PURE__ */ C(\n              \"path\",\n              {\n                fill: \"rgba(0,0,0,0.5)\",\n                fillRule: \"evenodd\",\n                d: \"M1.15 1.15a.937.937 0 0 1 1.325 0L9 7.674l6.525-6.524a.937.937 0 1 1 1.325 1.325L10.326 9l6.524 6.525a.937.937 0 0 1-1.325 1.325L9 10.326 2.475 16.85a.938.938 0 0 1-1.325-1.325L7.674 9 1.15 2.475a.937.937 0 0 1 0-1.325Z\",\n                clipRule: \"evenodd\"\n              }\n            )\n          }\n        )\n      }\n    ),\n    r ? /* @__PURE__ */ T(j, { children: [\n      /* @__PURE__ */ C(\"div\", { className: $t, children: \"Error\" }),\n      /* @__PURE__ */ C(\"div\", { className: Yt, children: (o == null ? void 0 : o.message) ?? \"Unknown error, please try again.\" })\n    ] }) : /* @__PURE__ */ T(j, { children: [\n      /* @__PURE__ */ C(\"div\", { className: $t, children: \"Sign in with Farcaster\" }),\n      /* @__PURE__ */ C(\"div\", { className: Yt, children: \"Scan with your phone's camera to continue.\" }),\n      /* @__PURE__ */ C(\n        \"div\",\n        {\n          style: {\n            display: \"flex\",\n            justifyContent: \"center\",\n            marginTop: 24,\n            marginBottom: 12\n          },\n          children: /* @__PURE__ */ C(Fr, { uri: n, size: 264, logoSize: 22, logoMargin: 12 })\n        }\n      ),\n      /* @__PURE__ */ C(\"div\", { style: { display: \"flex\", justifyContent: \"center\" }, children: /* @__PURE__ */ T(\n        Bt,\n        {\n          kind: \"tertiary\",\n          style: {\n            display: \"flex\",\n            alignItems: \"center\",\n            fontWeight: 500\n          },\n          onClick: () => {\n            window.location.href = n;\n          },\n          children: [\n            /* @__PURE__ */ C(\n              \"svg\",\n              {\n                xmlns: \"http://www.w3.org/2000/svg\",\n                width: 12,\n                height: 18,\n                fill: \"none\",\n                children: /* @__PURE__ */ C(\n                  \"path\",\n                  {\n                    fill: \"#7C65C1\",\n                    fillRule: \"evenodd\",\n                    d: \"M0 3a3 3 0 0 1 3-3h6a3 3 0 0 1 3 3v12a3 3 0 0 1-3 3H3a3 3 0 0 1-3-3V3Zm4-1.5v.75c0 .414.336.75.75.75h2.5A.75.75 0 0 0 8 2.25V1.5h1A1.5 1.5 0 0 1 10.5 3v12A1.5 1.5 0 0 1 9 16.5H3A1.5 1.5 0 0 1 1.5 15V3A1.5 1.5 0 0 1 3 1.5h1Z\",\n                    clipRule: \"evenodd\"\n                  }\n                )\n              }\n            ),\n            /* @__PURE__ */ C(\"span\", { style: { marginLeft: 9 }, children: \"I'm using my phone →\" })\n          ]\n        }\n      ) })\n    ] })\n  ] }) }) });\n}\nvar Ur = \"_8rz8bk0\";\nfunction Vr({\n  debug: t,\n  hideSignOut: e,\n  onSignOut: n,\n  ...r\n}) {\n  const { onSuccess: o, onStatusResponse: i, onError: a } = r, c = R(\n    (L) => {\n      o == null || o(L);\n    },\n    [o]\n  ), s = R(\n    (L) => {\n      i == null || i(L);\n    },\n    [i]\n  ), f = R(\n    (L) => {\n      a == null || a(L);\n    },\n    [a]\n  ), l = R(() => {\n    n == null || n();\n  }, [n]), S = Fe({\n    ...r,\n    onSuccess: c,\n    onStatusResponse: s,\n    onError: f\n  }), {\n    signIn: h,\n    signOut: v,\n    connect: p,\n    reconnect: u,\n    isSuccess: E,\n    isError: g,\n    error: w,\n    channelToken: m,\n    url: d,\n    data: y,\n    validSignature: B\n  } = S, b = R(() => {\n    A(!1), v(), l();\n  }, [v, l]), [M, A] = P(!1), N = R(() => {\n    g && u(), A(!0), h(), d && Mt() && (window.location.href = d);\n  }, [g, u, h, d]), k = E && B;\n  return F(() => {\n    m || p();\n  }, [m, p]), /* @__PURE__ */ T(\"div\", { className: \"fc-authkit-signin-button\", children: [\n    k ? /* @__PURE__ */ C(\n      Ge,\n      {\n        userData: y,\n        signOut: b,\n        hideSignOut: !!e\n      }\n    ) : /* @__PURE__ */ T(j, { children: [\n      /* @__PURE__ */ C(Ke, { onClick: N, label: \"Sign in\" }),\n      d && /* @__PURE__ */ C(\n        Dr,\n        {\n          open: M && !Mt(),\n          onClose: () => A(!1),\n          url: d,\n          isError: g,\n          error: w\n        }\n      )\n    ] }),\n    t && /* @__PURE__ */ C(\"div\", { className: Ur, children: /* @__PURE__ */ C(\"pre\", { children: JSON.stringify(S, null, 2) }) })\n  ] });\n}\nfunction Hr() {\n  const { isAuthenticated: t, profile: e } = q();\n  return { isAuthenticated: t, profile: e };\n}\nfunction $r() {\n  return /* @__PURE__ */ T(Te, { config: {\n    rpcUrl: \"https://mainnet.optimism.io\"\n  }, children: [\n    /* @__PURE__ */ C(\"div\", { style: { position: \"fixed\", top: 12, right: 12, zIndex: 1e3 }, children: /* @__PURE__ */ C(\n      Vr,\n      {\n        nonce: \"abcd1234\",\n        requestId: \"some-unique-request-id\",\n        timeout: 2e4,\n        onError: (e) => console.error(\"error callback:\", e),\n        onSuccess: (e) => console.log(\"success callback:\", e),\n        onStatusResponse: (e) => console.log(\"status callback:\", e),\n        onSignOut: () => console.log(\"sign out callback\"),\n        debug: !0\n      }\n    ) }),\n    /* @__PURE__ */ C(xr, {})\n  ] });\n}\nfunction xr() {\n  const {\n    isAuthenticated: t,\n    profile: { fid: e, bio: n, displayName: r, custody: o }\n  } = Hr();\n  return /* @__PURE__ */ C(\"div\", { style: { fontFamily: \"sans-serif\" }, children: t && /* @__PURE__ */ T(\"div\", { children: [\n    e && /* @__PURE__ */ T(\"p\", { children: [\n      /* @__PURE__ */ C(\"strong\", { children: \"FID:\" }),\n      \" \",\n      e\n    ] }),\n    r && /* @__PURE__ */ T(\"p\", { children: [\n      /* @__PURE__ */ C(\"strong\", { children: \"Display name:\" }),\n      \" \",\n      r\n    ] }),\n    n && /* @__PURE__ */ T(\"p\", { children: [\n      /* @__PURE__ */ C(\"strong\", { children: \"Bio:\" }),\n      \" \",\n      n\n    ] }),\n    o && /* @__PURE__ */ T(\"p\", { children: [\n      /* @__PURE__ */ C(\"strong\", { children: \"Custody address:\" }),\n      \" \",\n      o\n    ] })\n  ] }) });\n}\nfunction Wr() {\n  const { signInMessage: t } = q();\n  return t;\n}\nexport {\n  Te as AuthKitProvider,\n  $r as Demo,\n  Fr as QRCode,\n  Vr as SignInButton,\n  lt as useAppClient,\n  Re as useCreateChannel,\n  Hr as useProfile,\n  Fe as useSignIn,\n  Wr as useSignInMessage,\n  ke as useVerifySignInMessage,\n  _e as useWatchStatus\n};\n","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 { InvalidAddressError, } from '../../errors/address.js';\nimport { isAddress } from './isAddress.js';\nexport function isAddressEqual(a, b) {\n    if (!isAddress(a, { strict: false }))\n        throw new InvalidAddressError({ address: a });\n    if (!isAddress(b, { strict: false }))\n        throw new InvalidAddressError({ address: b });\n    return a.toLowerCase() === b.toLowerCase();\n}\n//# sourceMappingURL=isAddressEqual.js.map"],"names":["number","n","Number","isSafeInteger","bool","b","isBytes","a","Uint8Array","constructor","name","bytes","lengths","length","includes","hash","h","create","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","output","out","min","Object","defineProperty","exports","value","add5L","add5H","add4H","add4L","add3H","add3L","add","rotlBL","rotlBH","rotlSL","rotlSH","rotr32L","rotr32H","rotrBL","rotrBH","rotrSL","rotrSH","shrSL","shrSH","toBig","split","fromBig","U32_MASK64","BigInt","_32n","le","l","lst","Ah","Uint32Array","Al","i","_l","s","_h","Bh","Bl","Cl","low","Ch","Dl","Dh","El","Eh","crypto","globalThis","undefined","shake256","shake128","keccak_512","keccak_384","keccak_256","keccak_224","sha3_512","sha3_384","sha3_256","sha3_224","Keccak","keccakP","_assert_js_1","__webpack_require__","_u64_js_1","utils_js_1","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","round","R","x","y","push","t","j","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlL","rounds","B","idx1","idx0","B0","B1","Th","Tl","curH","curL","shift","PI","fill","Hash","suffix","enableXOF","pos","posOut","state","state32","u32","keccak","isLE","byteSwap32","update","data","len","toBytes","take","Math","finish","writeInto","bufferOut","set","subarray","xofInto","xof","digestInto","destroy","digest","_cloneInto","to","gen","wrapConstructor","genShake","wrapXOFConstructorWithOpts","opts","dkLen","randomBytes","wrapConstructorWithOpts","checkOpts","concatBytes","utf8ToBytes","asyncLoop","nextTick","hexToBytes","bytesToHex","byteSwapIfBE","byteSwap","rotl","rotr","createView","u8","crypto_1","arr","buffer","byteOffset","byteLength","floor","DataView","word","hexes","Array","from","_","toString","padStart","hex","asciis","_0","_9","_A","_F","_a","_f","asciiToBase16","char","hl","al","array","ai","hi","n1","charCodeAt","n2","iters","tick","cb","ts","Date","now","diff","str","TextEncoder","encode","arrays","sum","res","pad","clone","toStr","defaults","call","assign","hashCons","hashC","msg","tmp","bytesLength","getRandomValues","__importDefault","mod","__esModule","ParsedMessage","api_1","node_exports_1","utils_1","GRAMMAR","GrammarApi","generateApi","api","default","generate","errors","console","error","errorsToAscii","linesToAscii","log","displayAttributeErrors","toObject","grammarObj","parser","ast","id","ids","callbacks","scheme","chars","phraseIndex","phraseLength","ret","SEM_OK","SEM_PRE","utils","charsToString","domain","address","statement","uri","version","chainId","parseIntegerNumber","nonce","issuedAt","expirationTime","notBefore","requestId","resources","slice","result","parse","success","JSON","stringify","elements","key","translate","entries","isEIP55Address","__createBinding","o","m","k","k2","desc","getOwnPropertyDescriptor","writable","configurable","enumerable","get","__exportStar","p","prototype","hasOwnProperty","abnf_1","sha3_1","lowerAddress","toLowerCase","replace","parseInt","toUpperCase","parsed","isNaN","Infinity","module","src","lineMap","Buffer","thisFileName","thisObject","apglib","converter","scanner","attributes","showAttributes","showAttributeErrors","showRuleDependencies","showRules","abnfToHtml","beg","end","CONTROL_BEG","style","CLASS_CTRLCHAR","CONTROL_END","INVALID_BEG","CLASS_NOMATCH","INVALID_END","html","isArray","ch","String","fromCharCode","charToHex","abnfToAscii","lines","forEach","val","lineNo","beginChar","linesToHtml","CLASS_GRAMMAR","errorsToHtml","title","errorArrow","line","relchar","text","prefix","stringToAsciiHtml","isScanned","isParsed","isTranslated","haveAttributes","attributeErrors","isBuffer","decode","sabnf","scan","strict","trace","lite","syntax","semantic","rules","udts","displayRules","order","displayRuleDependencies","displayAttributes","toSource","config","generateSource","generateObject","ruleAttributes","ruleDependencies","State","ruleCount","udtCount","startRule","dependenciesComplete","attributesComplete","isMutuallyRecursive","ruleIndexes","indexArray","ruleAlphaIndexes","ruleTypeIndexes","udtIndexes","udtAlphaIndexes","attrsErrorCount","attrs","attrsErrors","attrsWorking","ruleDeps","attrGen","rdGen","compRulesAlpha","bind","compUdtsAlpha","compRulesType","compRulesGroup","rule","left","nested","right","empty","finite","cyclic","leaf","isOpen","isComplete","attrInit","attr","attrCopy","dst","recursiveType","ATTR_N","groupNumber","refersTo","falseArray","refersToUdt","referencedBy","typeToString","ATTR_R","ATTR_MR","falsifyArray","lower","ApgLib","syn","sem","sabnfGrammar","findLine","charIndex","charLength","translateIndex","map","index","reduceOpcodes","opcodes","reducedIndex","op","type","ALT","children","CAT","REP","max","traceObject","charsLength","rulesLineMap","bkrname","bkrlower","source","typescript","opcodeCount","charCodeMin","charCodeMax","ruleNames","udtNames","alt","cat","rnm","udt","rep","and","not","tls","tbs","trg","bkr","bka","bkn","abg","aen","RNM","UDT","AND","NOT","BKA","BKN","BKR","ABG","AEN","TLS","string","TBS","TRG","sort","udtFunc","funcName","ii","thisRule","isBkr","thisUdt","ruleIndex","opIndex","bkrCase","BKR_MODE_CS","bkrMode","BKR_MODE_UM","stringArg","obj","grammarObject","isEmptyOnly","isRecursive","truth","tError","fError","showAttr","seq","dep","showLegend","show","attri","depi","iAttr","stateArg","ruleAttrsEval","opEval","opi","opAlt","count","childAttrs","opCat","isCatLeft","isCatRight","isCatNested","isCatEmpty","isCatFinite","isCatCyclic","opBkr","temp","leader","rdi","startSeg","maxRule","maxUdt","pre","first","groupCount","rdj","newGroup","phraseCount","endLength","textLength","invalidCount","endType","invalidChars","invalid","SEM_POST","lf","cr","crlf","grammar","test","NameList","names","decnum","num","binnum","hexnum","digit","abgop","aenop","alternation","definedas","SEM_SKIP","topStack","altStack","pop","andop","bmax","bmin","bkaop","bknop","bkrop","ci","cs","um","pm","BKR_MODE_CI","BKR_MODE_PM","bstring","tbsstr","clsop","concatenation","defined","dmax","dmin","dstring","file","topRule","nameObj","hasBkr","incalt","notop","optionopen","repetition","repop","topRep","rnmop","rulelookup","ruleName","rulename","tbsop","tlscase","tlsstring","tlsop","trgop","udtName","xmax","xmin","xstring","rulesIn","udtsIn","thisFuncName","alphaArray","udtAlphaArray","udtIndexArray","topAlt","ACTIVE","EMPTY","NOMATCH","MATCH","basicelementerr","basicError","clsclose","clsOpen","clsopen","clsstring","stringTabChar","definedaserror","repCount","groupclose","groupOpen","groupError","groupopen","optionOpen","optionError","tlsOpen","prosValOpen","lineenderror","lineend","optionclose","prosvalclose","prosvalopen","prosvalstring","ruleerror","rulenameerror","stringtab","tlsclose","tlsopen","udtop","trans","UTF8","UTF16","UTF16BE","UTF16LE","UTF32","UTF32BE","UTF32LE","UINT7","ASCII","BINARY","UINT8","UINT16","UINT16LE","UINT16BE","UINT32","UINT32LE","UINT32BE","ESCAPED","STRING","bom8","buf","bom","bom16","bom32","validateSrc","getType","typeArg","base64","rx","exec","validateDst","fix","rem","utf8","utf16be","utf16le","utf32be","utf32le","uint7","uint8","uint16be","uint16le","uint32be","uint32le","escaped","c","lineEnds","convert","srcType","srcData","dstType","ascii","base64codes","base64chars","u","b1","i1","i2","i3","inc","bytes2","b2","bytes3","b3","bytes4","b4","at","high","alloc","isHex","getx","bufArg","nexti","fromCodePoint","getU","getu","lfchars","tail","units","codes","validate","lineLen","buildLine","c1","c2","c3","c4","that","nodeCount","nodesDefined","nodeCallbacks","stack","records","indent","astObject","init","charsIn","list","indexOf","ruleDefined","udtDefined","down","callbackIndex","thisIndex","thatIndex","up","callback","record","setLength","getLength","toXml","modeArg","display","charsToDec","caption","mode","charsToAscii","charsToHex","charsToUnicode","xml","depth","rec","phrases","itemIndex","maxListSize","size","ceil","increment","maxSize","items","getListIndex","item","fn","LOOKAROUND_NONE","LOOKAROUND_AHEAD","LOOKAROUND_BEHIND","circular","stats","emitcss","opExecute","charsBegin","charsEnd","lookAround","thisThis","treeDepth","maxTreeDepth","nodeHits","ruleCallbacks","udtCallbacks","syntaxData","maxMatched","limitTreeDepth","limitNodeHits","evaluateRule","sysData","functionName","evaluateUdt","udtIndex","clear","anchor","backRef","copy","top","lengthArg","savePhrase","getPhrase","systemData","thisData","uFrame","pFrame","refresh","lookAroundValue","inLookAround","initializeAst","initializeTrace","initializeStats","statsObject","initializeGrammar","initializeStartRule","start","initializeInputChars","inputArg","begArg","lenArg","input","stringToChars","initializeCallbacks","func","setMaxTreeDepth","setMaxNodeHits","hits","privateParse","startRuleArg","callbackData","matched","inputLength","subBegin","subEnd","subLength","parseSubstring","inputChars","inputIndex","opALT","opCAT","astLength","catCharIndex","catPhrase","ulen","plen","opREP","repCharIndex","repPhrase","validateRnmCallbackResult","charsLeft","opRNM","astDefined","savedOpcodes","saveFrame","notLookAround","validateUdtCallbackResult","opUDT","astIndex","UdtIndex","opAND","opNOT","opTRG","opTBS","opTLS","code","opABG","opAEN","opBKR","lmcode","frame","insensitive","lmIndex","opBKA","opBKN","opCATBehind","catMatched","opREPBehind","opTRGBehind","opTBSBehind","opTLSBehind","opBKRBehind","lk","collect","totals","ruleStats","udtStats","sortAlpha","lhs","rhs","sortHits","total","sortIndex","EmptyStat","match","nomatch","incStat","stat","displayRow","CLASS_ACTIVE","CLASS_EMPTY","CLASS_MATCH","displayOpsOnly","nameId","inputRules","inputUdts","toHtml","CLASS_STATS","toHtmlPage","htmlToPage","CLASS_MONOSPACE","CLASS_LOOKAHEAD","CLASS_LOOKBEHIND","CLASS_REMAINDER","CLASS_LINEEND","CLASS_ERROR","CLASS_PHRASE","CLASS_EMPTYPHRASE","CLASS_STATE","CLASS_TRACE","CLASS_RULES","CLASS_RULESLINK","CLASS_ATTRIBUTES","maxRecords","lastRecord","filteredRecords","recordStack","operatorFilter","ruleFilter","PHRASE_END","PHRASE_CONTINUE","PHRASE_EMPTY","initOperatorFilter","setOperators","filter","operators","upper","initRuleFilter","setRules","setMaxRecords","last","getMaxRecords","getLastRecord","filterOps","filterRecords","offset","dirUp","thisLine","thatLine","opcode","lookAnchor","thatRecord","toTreeObj","root","node","parent","branchesIncomplete","nodeOpcode","casetype","modetype","opcodeToString","opData","nodePhrase","nodeId","nodeDown","branch","stateToString","phrase","nodeUp","leafNodes","branchCount","firstRecord","dummy","lineIndex","prev","leftMost","rightMost","walk","tree","toTree","htmlHeader","modeName","header","displayTrg","displayRep","displayTbs","MAX_TLS","displayTls","charu","charl","base","asciiChars","subPhrase","charsArg","comma","charsToAsciiHtml","displayBehind","beg1","len1","beg2","len2","lastchar","spanBehind","spanRemainder","spanend","MAX_PHRASE","displayForward","spanAhead","htmlTable","lookAhead","lookBehind","modearg","modein","emitCss","getBounds","titleArg","page","parserResultToHtml","cap","bounds","charsToHtmlEntities","charsToJsUnicode","createCurve","getHash","hmac_1","weierstrass_js_1","hmac","msgs","curveDef","defHash","weierstrass","freeze","validateBasic","wNAF","modular_js_1","bits","constTimeNegate","condition","neg","negate","windows","W","windowSize","unsafeLadder","elm","ZERO","d","double","precomputeWindow","points","window","precomputes","f","BASE","mask","maxNumber","shiftBy","wbits","offset2","abs","cond1","cond2","wNAFCached","P","precomputesMap","transform","_WINDOW_SIZE","comp","curve","validateField","Fp","validateObject","Gx","Gy","nBitLength","nByteLength","nLength","ORDER","createHasher","isogenyMap","hash_to_field","expand_message_xof","expand_message_xmd","os2ip","bytesToNumberBE","i2osp","isNum","DST","lenInBytes","H","b_in_bytes","r_in_bytes","ell","DST_prime","Z_pad","l_i_b_str","b_0","args","strxor","pseudo_random_bytes","options","prb","expand","_DST","validateDST","L","log2p","len_in_bytes","e","elm_offset","tv","field","COEFF","reverse","xNum","xDen","yNum","yDen","reduce","acc","mul","div","Point","mapToCurve","def","hashToCurve","u0","fromAffine","u1","clearCofactor","assertValidity","encodeToCurve","encodeDST","mapHashToField","getMinHashLength","getFieldBytesLength","hashToPrivateScalar","FpSqrtEven","FpSqrtOdd","Field","FpIsSquare","FpDiv","FpInvertBatch","FpPow","isNegativeLE","FpSqrt","tonelliShanks","invert","pow2","pow","_3n","_4n","_5n","_8n","power","modulo","v","q","r","gcd","Q","S","Z","legendreC","p1div4","eql","sqr","Q1div2","ONE","g","t2","ge","nv","sub","FIELD_FIELDS","nums","lastMultiplied","is0","inverted","inv","reduceRight","_nBitLength","fieldOrder","bitLength","MASK","BYTES","BITS","legendreConst","bitLen","redef","sqrtP","bitMask","isValid","isOdd","sqrN","addN","subN","mulN","sqrt","invertBatch","cmov","numberToBytesLE","numberToBytesBE","fromBytes","bytesToNumberLE","groupOrder","hashLen","ensureBytes","minLen","fieldLen","reduced","createHmacDrbg","bitSet","bitGet","equalBytes","numberToVarBytesBE","hexToNumber","numberToHexUnpadded","u8a","byte","expectedLength","u8n","u8fr","qByteLen","hmacFn","reset","reseed","seed","sl","pred","validatorFns","bigint","function","boolean","stringOrUint8Array","object","validators","optValidators","checkField","fieldName","isOptional","checkVal","mapToCurveSimpleSWU","SWUFpSqrtRatio","weierstrassPoints","DER","ut","curve_js_1","b2n","h2b","Err","Error","_parseInt","E","toSig","sBytes","rBytesLeft","hexFromSig","sig","shl","rhl","rl","CURVE","validatePointOpts","allowedPrivateKeyLengths","wrapPrivateKey","isTorsionFree","allowInfinityPoint","endo","beta","splitScalar","_c","point","_isCompressed","toAffine","weierstrassEquation","x2","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","pointPrecomputes","Map","assertPrjPoint","other","px","py","pz","normalizeZ","toInv","fromHex","fromPrivateKey","privateKey","multiply","_setWindowSize","delete","hasEvenY","equals","X1","Y1","Z1","X2","Y2","Z2","U1","U2","X3","Y3","Z3","t0","t1","t3","t4","t5","subtract","wnaf","multiplyUnsafe","I","k1neg","k1","k2neg","k1p","k2p","scalar","fake","f1p","f2p","multiplyAndAddUnsafe","G","iz","z","ax","ay","zz","cofactor","toRawBytes","isCompressed","toHex","_bits","ProjectivePoint","_2n_pow_c1_1","_2n_pow_c1","c6","c7","sqrtRatio","tv1","tv2","tv3","tv5","tv4","isQR","tvv5","e1","y1","y2","validateOpts","bits2int","bits2int_modN","lowS","CURVE_ORDER","compressedLen","uncompressedLen","modN","invN","head","numToNByteStr","slcNum","Signature","recovery","fromCompact","fromDER","addRecoveryBit","recoverPublicKey","msgHash","radj","ir","u2","hasHighS","normalizeS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isProbPub","delta","ORDER_MASK","int2octets","defaultSigOpts","prehash","defaultVerOpts","getPublicKey","getSharedSecret","privateA","publicB","sign","privKey","k2sig","prepSig","some","extraEntropy","ent","h1int","seedArgs","kBytes","ik","normS","isBiggerThanHalfOrder","drbg","C","verify","signature","publicKey","_sig","sg","derError","message","is","isValidPrivateKey","randomPrivateKey","precompute","A","tv6","schnorr","secp256k1","sha256_1","hash_to_curve_js_1","_shortw_utils_js_1","secp256k1P","secp256k1N","divNearest","sqrtMod","_6n","_11n","_22n","_23n","_44n","_88n","b6","b9","b11","b22","b44","b88","b176","b220","b223","a1","a2","POW_2_128","sha256","fe","TAGGED_HASH_PREFIXES","taggedHash","tag","messages","tagP","tagH","pointToBytes","numTo32b","modP","GmulAdd","schnorrGetExtPubKey","priv","d_","lift_x","xx","challenge","schnorrVerify","pub","auxRand","rand","k_","isoMap","mapSWU","htf","scalars","SHA2","padOffset","view","dataView","process","roundClean","setBigUint64","_u32_max","wh","wl","setUint32","oview","outLen","HMAC","_key","iHash","oHash","getPrototypeOf","pbkdf2Async","pbkdf2","hmac_js_1","pbkdf2Init","_password","_salt","_opts","asyncTick","password","salt","DK","PRF","PRFSalt","pbkdf2Output","prfW","ti","Ti","setInt32","ui","ripemd160","RIPEMD160","_sha2_js_1","Rho","Id","Pi","idxL","idxR","shifts","shiftsL","idx","shiftsR","Kl","Kr","group","BUF","h0","h1","h2","h3","h4","getUint32","ar","bl","br","cl","dl","dr","el","er","rGroup","hbl","hbr","rr","sr","tl","tr","scryptAsync","scrypt","sha256_js_1","pbkdf2_js_1","XorAndSalsa","pi","oi","y00","y01","y02","y03","y04","y05","y06","y07","y08","y09","y10","y11","y12","y13","y14","y15","x00","x01","x02","x03","x04","x05","x06","x07","x08","x09","x10","x11","x12","x13","x14","x15","BlockMix","scryptInit","N","maxmem","onProgress","blockSize","blockSize32","memUsed","B32","V","blockMixCb","totalBlockMix","callbackPer","blockMixCnt","scryptOutput","sha224","Chi","Maj","SHA256_K","IV","SHA256_W","SHA256","D","F","W15","W2","s0","s1","T1","T2","SHA224","sha384","sha512_256","sha512_224","sha512","SHA512","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","SHA512_224","SHA512_256","SHA384","extendStatics","setPrototypeOf","__proto__","__extends","__","__assign","arguments","apply","__rest","getOwnPropertySymbols","propertyIsEnumerable","__decorate","decorators","target","Reflect","decorate","__param","paramIndex","decorator","__metadata","metadataKey","metadataValue","metadata","__awaiter","thisArg","_arguments","generator","Promise","resolve","reject","fulfilled","step","next","rejected","done","adopt","then","__generator","body","label","sent","trys","ops","verb","Symbol","iterator","__values","__read","__spread","concat","__spreadArrays","il","jl","__spreadArray","pack","__await","__asyncGenerator","asyncIterator","resume","fulfill","settle","__asyncDelegator","__asyncValues","__makeTemplateObject","cooked","raw","__setModuleDefault","__importStar","__classPrivateFieldGet","receiver","kind","has","__classPrivateFieldSet","__classPrivateFieldIn","SiweMessage","siwe_parser_1","ethersCompat_1","types_1","param","parsedMessage","generateNonce","validateMessage","toMessage","headerPrefx","uriField","join","versionField","suffixArray","toISOString","expiryField","prepareMessage","provider","warn","suppressExceptions","catch","params","_b","EIP4361Message","addr","fail","invalidParams","checkInvalidKeys","VerifyParamsKeys","invalidOpts","VerifyOptsKeys","time","SiweError","SiweErrorType","SCHEME_MISMATCH","DOMAIN_MISMATCH","NONCE_MISMATCH","checkTime","expirationDate","getTime","EXPIRED_MESSAGE","NOT_YET_VALID_MESSAGE","verifyMessage","EIP1271Promise","checkContractWalletSignature","INVALID_SIGNATURE","all","verificationFallback","EIP1271Response","fallbackResponse","UNABLE_TO_PARSE","INVALID_DOMAIN","INVALID_ADDRESS","getAddress","isUri","INVALID_URI","INVALID_MESSAGE_VERSION","INVALID_NONCE","isValidISO8601Date","INVALID_TIME_FORMAT","hashMessage","ethers_1","ethersVerifyMessage","ethersHashMessage","ethersGetAddress","ethers","expected","received","random_1","EIP1271_ABI","ISO8601","walletContract","Contract","hashedMessage","isValidSignature","randomStringForEntropy","inputMatch","inputDate","inputDateParsed","groups","date","parsedInputMatch","keys","invalidKeys","is_uri","is_iri","is_http_uri","is_http_iri","is_https_uri","is_https_iri","is_web_uri","is_web_iri","isHttpUri","isHttpsUri","isWebUri","splitUri","splitted","authority","path","query","fragment","allowHttps","port","_AES_key","_AES_Kd","_AES_Ke","AES","numberOfRounds","rcon","Si","T3","T4","T5","T6","T7","T8","U3","U4","convertToInt32","roundKeyCount","KC","tk","rconpointer","tt","encrypt","plaintext","decrypt","ciphertext","WeakMap","pkcs7Strip","pkcs7Pad","OFB","ECB","CTR","CFB","CBC","ModeOfOperation","aes_js_1","mode_js_1","mode_cbc_js_1","mode_cfb_js_1","mode_ctr_js_1","mode_ecb_js_1","mode_ofb_js_1","padding_js_1","_CBC_iv","_CBC_lastBlock","iv","aes","block","_CFB_instances","_CFB_iv","_CFB_shiftRegister","_CFB_shift","segmentSize","isInteger","defineProperties","xorSegment","WeakSet","_CTR_remaining","_CTR_remainingIndex","_CTR_counter","initialValue","setCounterValue","setCounterBytes","counter","MAX_SAFE_INTEGER","crypttext","_OFB_iv","_OFB_lastPrecipher","_OFB_lastPrecipherIndex","cls","padder","AbiCoder","index_js_1","abstract_coder_js_1","address_js_1","array_js_1","boolean_js_1","bytes_js_1","fixed_bytes_js_1","null_js_1","number_js_1","string_js_1","tuple_js_1","fragments_js_1","index_js_2","index_js_3","PanicReasons","paramTypeBytes","RegExp","paramTypeNumber","defaultCoder","defaultMaxInflation","getCoder","ArrayCoder","arrayChildren","arrayLength","isTuple","TupleCoder","components","baseType","AddressCoder","BooleanCoder","StringCoder","BytesCoder","NullCoder","assertArgument","NumberCoder","FixedBytesCoder","getDefaultValue","types","coders","ParamType","coder","defaultValue","values","assertArgumentCount","writer","Writer","loose","Reader","_setDefaultMaxInflation","defaultAbiCoder","getBuiltinCallException","action","tx","abiCoder","reason","revert","getBytes","hexlify","transaction","makeError","invocation","decodeBytes32String","encodeBytes32String","toUtf8Bytes","zeroPadBytes","_bytes","toUtf8String","Coder","checkResultErrors","Result","WordSize","Padding","passProperties","_guard","resultNames","getNames","throwError","wrapped","guard","wrap","nameCounts","accum","proxy","Proxy","prop","getNumber","Function","getValue","toArray","deep","assert","operation","_names","fromItems","toBeArray","getBytesCopy","checkErrors","childPath","localName","dynamic","_throwError","dataLength","writeData","appendWriter","writeBytes","paddingOffset","writeValue","writeUpdatableValue","allowLoose","bytesRead","maxInflation","consumed","incrementBytesRead","info","peekBytes","alignedLength","subReader","reader","readBytes","readValue","toBigInt","readIndex","toNumber","maths_js_1","typed_js_1","_value","Typed","dereference","toBeHex","AnonymousCoder","unpack","anonymous_js_1","arrayValues","unique","argument","staticWriter","dynamicWriter","updateFuncs","dynamicOffset","updateFunc","baseOffset","baseReader","offsetReader","isError","defaultChild","DynamicBytesCoder","substring","Empty","BN_0","BN_1","BN_MAX_UINT256","signed","getBigInt","maxUintValue","toTwos","fromTwos","utf8_js_1","properties_js_1","uniqueNames","StructFragment","FunctionFragment","FallbackFragment","ConstructorFragment","EventFragment","ErrorFragment","NamedFragment","Fragment","setify","Set","KwVisibDeploy","_kwVisibDeploy","_kwVisib","KwVisib","_kwTypes","KwTypes","_kwModifiers","KwModifiers","Keywords","_keywords","SimpleTokens","regexWhitespacePrefix","regexNumberPrefix","regexIdPrefix","regexId","regexType","TokenString","tokens","subTokenString","linkBack","linkNext","popKeyword","allowed","peek","popType","popParen","popParams","link","peekKeyword","peekType","token","lex","brackets","commas","cur","allowSingle","included","consumeName","keyword","consumeKeywords","keywords","consumeMutability","modifiers","consumeParams","allowIndexed","consumeGas","consumeEoi","regexArrayType","verifyBasicType","internal","for","ParamTypeInternal","ErrorFragmentInternal","EventFragmentInternal","ConstructorFragmentInternal","FallbackFragmentInternal","FunctionFragmentInternal","StructFragmentInternal","indexed","assertPrivate","format","isIndexable","_this","walkAsync","promises","setValue","childType","isParamType","comps","bracket","arrayMatch","startsWith","inputs","isConstructor","isFragment","isEvent","isFunction","isStruct","joinParams","selector","anonymous","topicHash","getTopicHash","payable","gas","stateMutability","errorObj","topIsValid","mutability","outputs","constant","getSelector","TransactionDescription","LogDescription","ErrorDescription","Interface","Indexed","abi_coder_js_1","bytes32_js_1","interface_js_1","topic","_isIndexed","isIndexed","BuiltinErrors","fragments","deploy","fallback","receive","events","functions","abi","frags","getAbiCoder","bucket","minimal","formatJson","getFunction","forceUnique","isHexString","matching","lastValue","valueLength","allowOptions","isTyped","splice","lastArg","matchStr","getFunctionName","hasFunction","forEachFunction","localeCompare","getEvent","eventTopic","getEventName","hasEvent","forEachEvent","getError","forEachError","_decodeParams","_encodeParams","encodeDeploy","decodeErrorResult","dataSlice","encodeErrorResult","decodeFunctionData","encodeFunctionData","decodeFunctionResult","method","_data","ef","parseTransaction","encodeFunctionResult","encodeFilterTopics","expectedCount","topics","encodeTopic","keccak256","zeroPadValue","encodeEventLog","dataTypes","dataValues","decodeEventLog","nonIndexed","resultIndexed","resultNonIndexed","nonIndexedIndex","indexedIndex","parseCallResult","parseLog","parseError","hexData","_gaurd","width","_typedSymbol","gaurd","minValue","maxValue","isBigInt","isData","isString","tupleName","TypeError","uint16","uint24","uint32","uint40","uint48","uint56","uint64","uint72","uint80","uint88","uint96","uint104","uint112","uint120","uint128","uint136","uint144","uint152","uint160","uint168","uint176","uint184","uint192","uint200","uint208","uint216","uint224","uint232","uint240","uint248","uint256","uint","int8","int16","int24","int32","int40","int48","int56","int64","int72","int80","int88","int96","int104","int112","int120","int128","int136","int144","int152","int160","int168","int176","int184","int192","int200","int208","int216","int224","int232","int240","int248","int256","int","bytes1","bytes5","bytes6","bytes7","bytes8","bytes9","bytes10","bytes11","bytes12","bytes13","bytes14","bytes15","bytes16","bytes17","bytes18","bytes19","bytes20","bytes21","bytes22","bytes23","bytes24","bytes25","bytes26","bytes27","bytes28","bytes29","bytes30","bytes31","bytes32","tuple","overrides","getIcapAddress","BN_36","getChecksumAddress","expanded","hashed","ibanLookup","ibanChecksum","checksum","Base36","fromBase36","base36","resolveAddress","isAddress","isAddressable","checkAddress","promise","resolver","resolveName","getCreate2Address","getCreateAddress","nonceHex","encodeRlp","_from","_initCodeHash","initCodeHash","contract_address_js_1","checks_js_1","ZeroAddress","ZeroHash","MessagePrefix","EtherSymbol","MaxInt256","MinInt256","MaxUint256","WeiPerEther","addresses_js_1","hashes_js_1","numbers_js_1","strings_js_1","BaseContract","resolveArgs","copyOverrides","provider_js_1","wrappers_js_1","canCall","canEstimate","estimateGas","canResolve","canSend","sendTransaction","getResolver","PreparedTopicFilter","contract","runner","getRunner","resolvedArgs","interface","getTopicFilter","feature","getProvider","arg","_overrides","copyRequest","_runner","internalValues","getInternal","getSubInfo","event","topicHashify","hasSub","subs","getSub","listener","foundFragment","_foundFragment","emit","ContractEventPayload","ContractUnknownEventPayload","starting","listeners","on","stop","started","off","lastEmit","_emit","payloadFunc","once","passArgs","resultPromise","filters","_deployTx","addrPromise","iface","deployTx","ContractTransactionResponse","buildWrappedFallback","populateTransaction","noValue","noData","staticCall","isCallException","send","_contract","connect","attach","getDeployedCode","getCode","waitForDeployment","deploymentTransaction","wait","checkCode","buildWrappedMethod","getFragment","resolveProperties","staticCallResult","buildWrappedEvent","queryTransaction","queryFilter","fromBlock","toBlock","getLogs","EventLog","UndecodedEventLog","Log","listenerCount","removeAllListeners","addListener","removeListener","buildClass","CustomContract","_ContractBase","ContractFactory","contract_js_1","bytecode","getDeployTransaction","sentTx","fromSolidity","evm","ContractTransactionReceipt","factory_js_1","eventName","eventSignature","TransactionReceipt","logs","TransactionResponse","confirms","timeout","receipt","EventPayload","getBlock","getTransaction","getTransactionReceipt","_log","pbkdf2Sync","createHmac","createHash","pbkdf2_1","sha512_1","anyGlobal","getGlobal","self","msCrypto","algo","_algo","iterations","keylen","computeHmac","crypto_js_1","locked","_computeHmac","algorithm","__computeHmac","lock","register","SigningKey","scryptSync","keccak_js_1","ripemd160_js_1","random_js_1","scrypt_js_1","sha2_js_1","signing_key_js_1","signature_js_1","_keccak256","__keccak256","_pbkdf2","__pbkdf2","_randomBytes","__randomBytes","ripemd160_1","_ripemd160","__ripemd160","scrypt_1","lockedSync","lockedAsync","_scryptAsync","passwd","_scryptSync","__scryptAsync","__scryptSync","_passwd","progress","_sha256","_sha512","__sha256","__sha512","locked256","locked512","BN_2","BN_27","BN_28","BN_35","toUint256","networkV","legacyChainId","getChainId","yParity","yParityAndS","compactSerialized","serialized","toJSON","_type","bv","getChainIdV","getNormalizedV","assertError","check","_r","_v","secp256k1_1","computePublicKey","compressedPublicKey","computeSharedSecret","pubKey","compressed","secpSig","addPoints","p0","p1","pub0","pub1","EnsPlugin","Network","EnsResolver","WebSocketProvider","SocketProvider","IpcSocketProvider","QuickNodeProvider","PocketProvider","InfuraWebSocketProvider","InfuraProvider","EtherscanProvider","CloudflareProvider","ChainstackProvider","AnkrProvider","AlchemyProvider","BrowserProvider","JsonRpcSigner","JsonRpcProvider","JsonRpcApiProvider","FallbackProvider","AbstractProvider","VoidSigner","NonceManager","AbstractSigner","FeeData","Block","getDefaultProvider","verifyTypedData","TypedDataEncoder","solidityPackedSha256","solidityPackedKeccak256","solidityPacked","dnsEncode","namehash","isValidName","ensNormalize","getUint","FixedNumber","FetchCancelSignal","FetchResponse","FetchRequest","assertNormalize","stripZerosLeft","isBytesLike","encodeBase64","decodeBase64","encodeBase58","decodeBase58","Transaction","recoverAddress","computeAddress","accessListify","showThrottleMessage","UnmanagedSubscriber","SocketSubscriber","SocketPendingSubscriber","SocketEventSubscriber","SocketBlockSubscriber","MulticoinProviderPlugin","NetworkPlugin","GasCostPlugin","FetchUrlFeeDataNetworkPlugin","FeeDataNetworkPlugin","EtherscanPlugin","wordlists","WordlistOwlA","WordlistOwl","LangEn","Wordlist","encryptKeystoreJsonSync","encryptKeystoreJson","decryptKeystoreJson","decryptKeystoreJsonSync","decryptCrowdsaleJson","isKeystoreJson","isCrowdsaleJson","getIndexedAccountPath","getAccountPath","defaultPath","Wallet","HDNodeVoidWallet","HDNodeWallet","BaseWallet","Mnemonic","uuidV4","decodeRlp","Utf8ErrorFuncs","toUtf8CodePoints","parseUnits","formatUnits","parseEther","formatEther","toQuantity","_version_js_1","index_js_4","index_js_5","index_js_6","index_js_7","index_js_8","index_js_9","index_js_10","index_js_11","id_js_1","namehash_js_1","message_js_1","solidity_js_1","typed_data_js_1","ens_normalize_1","Zeros","checkComponent","ensNameSplit","ens_normalize","_maxLength","regexBytes","regexNumber","regexArray","tight","_pack","padding","BN__1","hexTrue","hexFalse","domainFieldTypes","verifyingContract","domainFieldNames","checkString","domainChecks","getBaseEncoder","boundsUpper","boundsLower","hexPadRight","encodeType","fields","splitArray","primaryType","fullTypes","encoderCache","_types","links","parents","subtypes","primaryTypes","checkCircular","found","child","subtype","st","getEncoder","encoder","subEncoder","encodedType","unshift","encodeData","hashStruct","_visit","visit","getPrimaryType","hashDomain","domainFields","EIP712Domain","resolveNames","ensCache","getPayload","domainValues","domainTypes","typesWithDomain","tslib_1","ens_resolver_js_1","format_js_1","network_js_1","subscriber_polling_js_1","isPromise","getTag","pause","dropWhilePaused","concisify","getSubscription","_event","orphan","addresses","addAddress","defaultOptions","cacheTimeout","pollingInterval","plugins","pausedState","networkPromise","anyNetwork","performCache","lastBlockNumber","nextTimer","timers","disableCcipRead","_network","network","setTimeout","attachPlugin","plugin","getPlugin","perform","req","_perform","ccipReadFetch","calldata","urls","sender","errorMessages","url","href","request","errorMessage","resp","bodyJson","statusCode","_wrapBlock","formatBlock","_wrapLog","formatLog","_wrapTransactionReceipt","formatTransactionReceipt","_wrapTransactionResponse","formatTransactionResponse","_detectNetwork","getBlockNumber","blockNumber","_getAddress","_getBlockTag","blockTag","_getFilter","blockHash","_address","_getTransactionRequest","_request","getNetwork","detectNetwork","actual","getFeeData","getFeeDataFunc","_block","gasPrice","priorityFee","maxFeePerGas","maxPriorityFeePerGas","baseFeePerGas","feeData","processFunc","_tx","attempt","enableCcipRead","ccipArgs","txSender","parseOffchainLookup","extraData","errorArgs","zeros","urlsOffset","urlsLength","urlsData","_parseString","_parseBytes","ccipResult","encodeBytes","datas","byteCount","numPad","bytesPad","checkNetwork","getAccountValue","_blockTag","getBalance","getTransactionCount","getStorage","_position","position","broadcastTransaction","signedTx","signedTransaction","replaceableTransaction","includeTransactions","prefetchTxs","effectiveGasPrice","getTransactionResult","_filter","_getProvider","fromName","getAvatar","lookupAddress","ensAddr","getEnsAddress","ensContract","resolverContract","waitForTransaction","_confirms","timer","clearTimeout","waitForBlock","_clearTimeout","timerId","_setTimeout","_func","paused","_forEachSubscriber","subscriber","_getSubscriber","PollingBlockSubscriber","PollingBlockTagSubscriber","PollingEventSubscriber","PollingTransactionSubscriber","PollingOrphanSubscriber","_recoverSubscriber","oldSub","newSub","emitArgs","removed","subscription","addressableMap","nameMap","payload","padded","checkProvider","signer","populate","getNonce","populateCall","gasLimit","hasEip1559","txObj","signTransaction","throwUnsupported","signMessage","signTypedData","shown","service","provider_ankr_js_1","provider_alchemy_js_1","provider_chainstack_js_1","provider_cloudflare_js_1","provider_etherscan_js_1","provider_infura_js_1","provider_quicknode_js_1","provider_fallback_js_1","provider_jsonrpc_js_1","provider_websocket_js_1","Testnets","allowService","exclusive","close","staticNetwork","providers","alchemy","ankr","chainstack","etherscan","projectSecret","projectId","infura","quicknode","quorum","BasicMulticoinProviderPlugin","getIpfsLink","proivder","supportsCoinType","coinType","encodeAddress","decodeAddress","matcherIpfs","matchers","supports2544","supportsWildcard","supportsInterface","fetch","ethCoinType","coinPlugin","getText","getContentHash","ipfs","swarm","avatar","_getAvatar","linkage","owner","tokenId","tokenOwner","ownerOf","balance","balanceOf","metadataUrl","response","assertOk","bodyText","imageUrl","image","ensPlugin","currentName","formatReceiptLog","formatUint256","formatHash","formatData","formatBoolean","arrayOf","allowNull","nullValue","altNames","srcKey","altKey","_formatLog","transactionHash","transactionIndex","_formatBlock","parentHash","parentBeaconBlockRoot","timestamp","difficulty","gasUsed","stateRoot","receiptsRoot","blobGasUsed","excessBlobGas","miner","prevRandao","transactions","_formatReceiptLog","_formatTransactionReceipt","contractAddress","logsBloom","cumulativeGasUsed","blobGasPrice","status","accessList","blobVersionedHashes","maxFeePerBlobGas","creates","abstract_provider_js_1","abstract_signer_js_1","community_js_1","default_provider_js_1","signer_noncemanager_js_1","plugins_network_js_1","provider_browser_js_1","provider_pocket_js_1","provider_ipcsocket_js_1","provider_socket_js_1","provider_socket_js_2","Networks","matches","getPlugins","basename","computeIntrinsicGas","costs","txBase","txCreate","txDataZero","txDataNonzero","txAccessListAddress","txAccessListStorageKey","storageKeys","injectCommonNetworks","injected","registerEth","ensNetwork","getGasStationPlugin","networkFunc","custom","ensAddress","nameOrChainId","existing","decimals","frac","fetchFeeData","setHeader","_response","_feeData","standard","maxFee","maxPriorityFee","effectiveBlock","props","nullish","targetNetwork","feeDataFunc","defaultApiKey","apiKey","getRequest","isCommunityResource","getHost","allowGzip","retryFunc","polling","getRpcError","JsonRpcApiPollingProvider","ethereum","_options","batchMaxCount","_start","_send","hasSigner","accounts","getSigner","getApiKey","EtherscanPluginId","baseUrl","skipKeys","nextId","_apiKey","getBaseUrl","getUrl","getPostUrl","getPostData","apikey","post","setThrottleParams","slotInterval","hasBody","throttle","throwThrottleError","jsonrpc","_getTransactionPostData","maxFeePerGs","_checkError","txhash","postData","getEtherPrice","parseFloat","ethusd","getContract","defaultConfig","stallTimeout","priority","weight","defaultState","requests","lateResponses","errorResponses","outOfSync","unsupportedEvents","rollingDuration","score","_updateNumber","_totalTime","_lastFatalError","_lastFatalErrorTimestamp","waitForSync","_normalize","normalizeResult","checkQuorum","results","tally","best","getMedian","resultWeight","errorMap","bestError","mid","getAnyResult","eventQuorum","eventWorkers","configs","height","initialSyncPromise","providerConfigs","_translatePerform","getNextConfig","running","allConfigs","shuffle","random","addRunner","didBump","staller","dt","duration","initialSync","getFuzzyMode","bestResult","bestWeight","waitForQuorum","interesting","newRunners","race","broadcasts","waiting","inflightQuorum","defaultProjectId","_getConnection","credentials","getWebSocketProvider","setCredentials","subscriber_filterid_js_1","Primitive","deepCopy","getLowerCase","isPollable","batchStallTime","batchMaxSize","sendUncheckedTransaction","_to","hexTx","getRpcTransaction","timeouts","invalids","checkTx","sendTransactionHash","_message","populated","unlock","_legacySignMessage","payloads","drainTimer","notReady","pendingDetectNetwork","scheduleDrain","stallTime","_getOption","batch","_resolve","getRpcRequest","ready","_waitUntilReady","FilterIdPendingSubscriber","FilterIdEventSubscriber","dstKey","_error","spelunkData","spelunkMessage","_spelunkMessage","actionMap","eth_sign","personal_sign","eth_signTypedData_v4","eth_signTransaction","eth_sendTransaction","eth_requestAccounts","wallet_requestAccounts","unsupported","details","accountsPromise","account","listAccounts","defaultApplicationId","applicationId","applicationSecret","defaultToken","filterId","emitPromise","_register","_handleMessage","logFilter","pending","_write","_processMessage","reasonCode","ws_js_1","websocket","WebSocket","onopen","onmessage","toJson","customData","kzg","blobs","prefetchedTransactions","txs","indexOrHash","getPrefetchedTransaction","isMined","isLondon","orphanedEvent","removedEvent","fee","getResult","confirmations","createRemovedTransactionFilter","reorderedEvent","createReorderedTransactionFilter","startBlock","_timeout","nextScan","stopScanning","checkReplacement","mined","cancelled","replacement","checkReceipt","waiter","cancellers","cancel","txListener","replaceListener","isLegacy","isBerlin","isCancun","noncePromise","FilterIdSubscriber","filterIdPromise","poller","hault","poll","_subscribe","_emitResults","_recover","teardown","OnBlockSubscriber","getPollingSubscriber","interval","_poll","lastBlock","_WebSocket","accessSetify","storageKey","pubkey","accesslist_js_1","transaction_js_1","BN_MAX_UINT","getVersionedHash","versioned","handleAddress","handleAccessList","handleNumber","handleUint","formatNumber","formatAccessList","_parseEipSignature","typeName","_blobs","versionedHashes","blob","commit","blobToKzgCommitment","proof","computeBlobKzgProof","commitment","getSerialized","unsignedHash","unsignedSerialized","fromPublicKey","isSigned","sidecar","inferType","_serializeLegacy","legacy","_serializeEip2930","_serializeEip1559","_serializeEip4844","formatHashes","inferTypes","hasGasPrice","hasFee","hasAccessList","hasBlob","_parseLegacy","_parseEip2930","_parseEip1559","_parseEip4844","fBlobs","fCommits","fProofs","data_js_1","errors_js_1","Alphabet","Lookup","BN_58","getAlpha","letter","textData","atob","btoa","_getBytes","HexCharacters","zeroPad","HEX","shortMessage","_normalizeForms","form","normalize","givenGuard","className","emitter","base64_js_1","geturl_js_1","defaultGetUrlFunc","createGetUrl","reData","reIpfs","dataGatewayFunc","signal","getIpfsGatewayFunc","Gateways","fetchSignals","checkSignal","allowInsecure","gzip","headers","bodyType","creds","preflight","retry","getUrlFunc","getHeader","clearHeaders","username","allowInsecureAuthentication","preflightFunc","maxAttempts","expires","delay","makeServerError","stall","statusMessage","location","redirect","retryAfter","trunc","current","lockConfig","getGateway","registerGateway","registerGetUrl","createGetUrlFunc","createDataGateway","createIpfsGatewayFunc","ok","requestUrl","responseBody","responseStatus","BN_N1","BN_5","getTens","checkValue","safeOp","limit","fault","getFormat","tens","negative","checkFormat","addUnsafe","subUnsafe","mulUnsafe","mulSignal","divUnsafe","divSignal","cmp","eq","lt","lte","gt","gte","ceiling","bump","isZero","isNegative","toUnsafeFloat","toFormat","fromString","fromValue","_decimals","_format","whole","decimal","_signal","protocol","controller","AbortController","abort","Headers","respBody","arrayBuffer","statusText","defaultGetUrl","base58_js_1","events_js_1","fetch_js_1","fixednumber_js_1","rlp_decode_js_1","rlp_encode_js_1","units_js_1","uuid_js_1","_width","Nibbles","checkType","trim","data_js_2","unarrayifyInteger","_decodeChildren","childOffset","decoded","_decode","checkOffset","lengthLength","hexlifyByte","arrayifyInteger","nibbles","_encode","unit","wei","ether","ignoreFunc","badCodepoint","getUtf8CodePoints","onError","extraLength","overlongMask","nextChar","pair","ignore","codePoints","codePoint","signingKey","btx","signMessageSync","lang_en_js_1","base_wallet_js_1","mnemonic_js_1","json_keystore_js_1","MasterSecret","zpad","encodeBase58Check","ser_I","chainCode","IL","IR","derivePath","component","deriveChild","HardenedBit","fingerprint","parentFingerprint","mnemonic","wordlist","locale","entropy","progressCallback","encryptSync","extendedKey","hasPath","neuter","_index","fromSeed","_seed","fromExtendedKey","createRandom","fromEntropy","computeSeed","fromMnemonic","fromPhrase","Ki","hdwallet_js_1","json_crowdsale_js_1","wallet_js_1","json","encseed","getPassword","spelunk","looseArrayify","encryptedSeed","aesCbc","seedHex","getAccount","computedMAC","cipher","aesCtr","mnemonicKey","mnemonicCiphertext","mnemonicIv","mnemonicAesCtr","getDecryptKdfParams","kdf","prf","getEncryptKdfParams","_encryptKeystore","uuidRandom","uuid","derivedKey","macPrefix","mac","Crypto","cipherparams","kdfparams","dklen","client","gethFilename","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","mnemonicCounter","passwordBytes","getUpperMask","mnemonicToEntropy","words","getWordIndex","bit","entropyBits","checksumMask","entropyToMnemonic","indices","remainingBits","checksumBits","getWord","_entropy","entropyToPhrase","phraseToEntropy","isValidMnemonic","hexString","_path","reqd","fromAccount","wallet","fromEncryptedJson","fromEncryptedJsonSync","decodeBits","flood","Base64","decodeOwl","subsChrs","Word","unfold","sep","initial","clumps","leftover","semi","decodeOwlA","bit_reader_js_1","decode_owl_js_1","accents","accent","posOffset","positions","charCode","regex","wordlist_js_1","wordlist_owl_js_1","wordlist_owla_js_1","wordlists_js_1","_decodeWords","loadWords","decode_owla_js_1","_accent","en","SHIFTED_RANK","EXCLUSIONS","DECOMP","RECOMP","MAPPED","IGNORED","CM","NSM","ESCAPE","NFC_CHECK","GROUPS","WHOLE_VALID","WHOLE_MAP","VALID","EMOJI_LIST","EMOJI_ROOT","FENCED","read_compressed_payload","decode_arithmetic","u16","symbol_count","skip","pos_payload","read_width","read_buffer","read_bit","FULL","symbols","range","HALF","unsafe_atob","lookup","carry","read_sorted","read_sorted_arrays","read_array_while","read_mapped","w","read_linear_table","dx","dy","vN","flatMap","ys","j_dy","flat","read_transposed","read_deltas","quote_cp","cp","explode_cp","cps","codePointAt","str_from_cps","compare_arrays","unpack_cc","packed","unpack_cp","is_hangul","S0","decomposed","init$1","check_order","cc","s_index","l_index","V_COUNT","v_index","t_index","L0","V0","T0","mapped","prev_cc","nfd","nfc","composed_from_decomposed","prev_cp","composed","compose_pair","recomp","Array_from","group_has_cp","Emoji","is_emoji","sorted","read_sorted_array","read_sorted_set","set_add_many","chunks","unrestricted","read_chunked","M","wholes","recs","gs","find","union","complement","multi","add_to_union","read_trie","saved","quoted_cp","should_escape","bidi_qq","safe_str_from_cps","quoter","is_combining_mark","nf","tokens_from_str","token_count","norm","check_leading_underscore","lastIndexOf","emoji","every","check_label_extension","error_placement","check_fenced","determine_group","error_group_member","error_disallowed","check_group","check_whole","maker","shared","err","flatten","quoted","gg","where","consume_emoji_reversed","filter_fe0f","eaten","TY_VALID","TY_MAPPED","TY_IGNORED","is_valid_or_mapped","requires_check","collapse_valid_tokens","ens_beautify","labels","array_replace","ens_emoji","ens_normalize_fragment","frag","decompose","ens_split","preserve_emoji","ens_tokenize","cps0","tokens0","kt","defaultErrorConfig","withStackTrace","createNeverThrowError","isOk","ResultAsync","_promise","fromSafePromise","Ok","fromPromise","errorFn","fromThrowable","combine","asyncResultList","combineResultAsyncList","combineWithAllErrors","combineResultAsyncListWithAllErrors","isErr","mapErr","andThen","newValue","orElse","_err","unwrapOr","safeUnwrap","successCallback","failureCallback","errAsync","combineResultList","resultList","combineResultListWithAllErrors","asyncAndThen","asyncMap","_unsafeUnwrap","_unsafeUnwrapErr","_ok","getEnsResolver","universalResolverAddress","universalResolverAddress_","chain","getChainContractAddress","resolverAddress","getAction","readContract","NC","packetToBytes","T","createFilterRequestScope","requestMap","transport","onResponse","method_","createBlockFilter","FilterTypeNotSupportedError","docsPath","encodeEventTopics","parameters","abiItem","getAbiItem","mE","errors_abi","mv","definition","formatAbiItem","toEventSelector","indexedInputs","args_","encodeArg","O0","encodeAbiParameters","createContractEventFilter","eC","Boolean","createEventFilter","events_","createPendingTransactionFilter","estimateContractGas","parseAccount","getContractError","getBlobBaseFee","getBlockTransactionCount","blockNumberHex","dedupe","ly","decodeEventLog_docsPath","strict_","argTopics","FM","lC","isUnnamed","decodeTopic","decodedArg","decodeAbiParameters","nonIndexedInputs","decodedData","xB","cursor","lQ","SM","parseEventLogs","formattedLogs","formatters_log","U","getContractEvents","Eip712DomainNotFoundError","metaMessages","getEip712Domain","factory","factoryData","extensions","cause","getFeeHistory","blockCount","rewardPercentiles","feeHistory","gasUsedRatio","oldestBlock","reward","getFilterChanges","_client","getFilterLogs","getProof","blockTag_","storageProof","getStorageAt","slot","getTransactionConfirmations","transactionReceipt","transactionBlockNumber","uninstallFilter","to_","toPrefixedMessage","message_","$G","zo","abytes","utils_bytesToNumberBE","utils_bytesToNumberLE","utils_numberToBytesBE","utils_ensureBytes","utils_concatBytes","erc6492MagicBytes","modular_0n","modular_1n","modular_2n","modular_mod","kb","_assert","vp","Gg","aI","curve_0n","curve_1n","utils_namespaceObject","weierstrass_0n","weierstrass_1n","weierstrass_3n","secp256k1_1n","secp256k1_2n","sqrtError","eV","O6","esm_sha256","J","verifyHash","rest","signatureHex","serializeSignature","yParity_","y_","wrappedSignature","p5","serializeErc6492Signature","encodeDeployData","abis","$o","contracts","ST","isBytesEqual","a_","b_","cg","callRequest","bytesRegex","integerRegex","encoded","encodedTypes","encodedValues","hashType","encodedHashType","unsortedDeps","findTypeDependencies","primaryType_","encodeField","prepend","parsedType","typeValuePairs","hashTypedData","getTypesForEIP712Domain","validateTypedData","validateData","struct","integerMatch","size_","bytesMatch","KY","expectedSize","givenSize","parts","hashTypedData_hashDomain","prefixRegex","suffixRegex","verifySiweMessage","parseSiweMessage","validateSiweMessage","isAddressEqual","publicActions","getBytecode","O","getEnsAvatar","getEnsName","getEnsText","estimateFeesPerGas","X","getGasPrice","estimateMaxPriorityFeePerGas","K","multicall","prepareTransactionRequest","sendRawTransaction","simulateContract","waitForTransactionReceipt","watchBlocks","emitMissed","emitOnBegin","onBlock","includeTransactions_","poll_","prevBlock","active","unsubscribe","enablePolling","transports","pollBlocks","observerId","utils_stringify","uid","observe","N7","$","unsubscribe_","subscribe","onData","formatters","formatters_block","watchBlockNumber","watchContractEvent","onLogs","pollContractEvent","previousBlockNumber","initialized","unwatch","rpc","yR","subscribeContractEvent","formatted","watchEvent","pollEvent","watchPendingTransactions","onTransactions","pollPendingTransactions","hashes","__defProp","__defNormalProp","__publicField","AuthClientError","errCode","context","parsedContext","unwrap","defaultPollOpts","successCode","path5","getURI","getHeaders","dist_poll","pollOpts","deadline","relay","authToken","createChannel","dist_status","channelToken","STATEMENT","FID_URI_REGEX","siwe","validateStatement","validateChainId","validateResources","parseResources","fid","parseFid","resource","resource2","fidResources","voidVerifyFid","getFid","valid","validateNonce","message2","validateDomain","dist_verifySiweMessage","mergeResources","verifyFidOwner","fidVerifier","verifySignInMessage","voidCallback","watchStatus","configDefaults","dist_createClient","createAppClient","idRegistryABI","internalType","viemConnector","publicClient","createPublicClient","createClient","extend","optimism","http","rpcUrl","custody","Qt","host","siweUri","Gt","react","createContext","isAuthenticated","profile","signInMessage","onSignIn","onSignOut","Te","useState","useEffect","useCallback","bio","displayName","pfpUrl","verifications","jsx_runtime","jsx","Provider","appClient","useContext","Le","Ze","Xt","jsxs","xmlns","Ht","clipPath","purple","white","Rt","Bt","ze","primary","secondary","tertiary","Ke","onClick","marginLeft","Qe","signOut","boxShadow","viewBox","stroke","strokeWidth","strokeLinecap","strokeLinejoin","Ge","userData","hideSignOut","useRef","contains","document","addEventListener","removeEventListener","ref","flexDirection","alignItems","opacity","fillRule","clipRule","te","it","ee","sideCar","read","createElement","isSideCarExport","ne","useMedium","assignSyncMedium","assignMedium","async","ssr","wt","forwardRef","onScrollCapture","onWheelCapture","onTouchMoveCapture","forwardProps","removeScrollBar","enabled","shards","noIsolation","inert","allowPinchZoom","as","gapMode","facade","setCallbacks","lockRef","cloneElement","Children","only","defaultProps","classNames","fullWidth","zeroRight","gn","nc","setAttribute","dn","styleSheet","cssText","appendChild","createTextNode","getElementsByTagName","remove","parentNode","removeChild","mn","re","styles","vn","gap","pt","wn","getComputedStyle","pn","documentElement","clientWidth","innerWidth","yn","Cn","En","noRelative","noImportant","useMemo","It","et","passive","oe","overflowY","overflowX","tagName","xt","ownerDocument","ShadowRoot","ie","ae","scrollTop","scrollHeight","clientHeight","scrollLeft","scrollWidth","Nn","direction","nt","changedTouches","clientX","clientY","Ot","deltaX","deltaY","zt","Rn","_n","classList","Xe","touches","shadowParent","should","cancelable","preventDefault","Ln","ce","Kt","querySelectorAll","focus","Un","activeElement","querySelector","onFocus","tabIndex","outline","Mt","Vn","navigator","userAgent","platform","maxTouchPoints","zn","stopPropagation","Kn","onClose","open","titleId","overflow","react_dom","createPortal","role","Yt","$t","se","Wn","getSymbolSize","getSymbolTotalCodewords","getBCHDigit","setToSJISFunction","isKanjiModeEnabled","toSJIS","ft","reservedBit","put","putBit","getLengthInBits","xor","isReserved","ue","getRowColCoords","getPositions","auth_kit_fe","qn","de","Patterns","PATTERN000","PATTERN001","PATTERN010","PATTERN011","PATTERN100","PATTERN101","PATTERN110","PATTERN111","N1","N2","N3","N4","getPenaltyN1","getPenaltyN2","getPenaltyN3","getPenaltyN4","applyMask","getBestMask","rt","ot","getBlocksCount","getTotalCodewordsCount","he","ht","ct","Lt","genPoly","degree","initialize","exp","generateECPolynomial","auth_kit_ge","me","_t","ve","Xn","KANJI","BYTE_KANJI","BYTE","NUMERIC","ALPHANUMERIC","nr","testKanji","testNumeric","testAlphanumeric","ccBits","MIXED","getCharCountIndicator","getBestModeForData","getCapacity","getBestVersionForData","getBitsLength","getEncodedBits","we","jt","At","pe","ye","or","write","substr","yt","lr","Y","ur","hr","Ce","single_source_shortest_paths","PriorityQueue","make","cost","extract_shortest_path_from_predecessor_list","find_path","queue","sorter","default_sorter","mr","St","Er","unescape","encodeURIComponent","fromArray","lastCount","table","rawSplit","Ct","errorCorrectionLevel","Nt","maskPattern","toSJISFunc","Tr","Et","Nr","Sr","Pt","Pr","yr","Br","Ir","pr","Mr","Ar","modules","segments","Ee","Zt","getOptions","color","margin","scale","dark","light","rendererOpts","getScale","getImageWidth","qrToImageData","render","getContext","createImageData","clearRect","putImageData","renderToDataURL","toDataURL","quality","Se","Jt","toFixed","bt","Ft","Tt","Rr","kr","toCanvas","be","Zr","Fr","ecl","logoMargin","logoSize","ry","cx","cy","Dr","justifyContent","marginTop","marginBottom","fontWeight","Vr","debug","onSuccess","onStatusResponse","Fe","redirectUrl","reconnect","isSuccess","Re","mt","vt","Dt","Ut","watch","isPolling","_e","validSignature","ke","signIn","isConnected","DEFAULT_CONTEXT","setVisible","_open","constructMissingProviderErrorMessage","visible","valueName","WalletModalContext","react__WEBPACK_IMPORTED_MODULE_0__","useWalletModal","_isAddress_js__WEBPACK_IMPORTED_MODULE_0__","_errors_address_js__WEBPACK_IMPORTED_MODULE_1__"],"sourceRoot":""}