{"version":3,"file":"static/chunks/8650-6fcad9b0b4ee416b.js","mappings":"sRCiCA,qCAAwBA,6BAjCN,kBACG,OAgCN,SAASA,EACtBC,CAA6C,CAC7CC,CAA2B,MAmChBC,EAjCX,IAAIC,EAAsC,CAExCC,QAAS,OAAC,CAAEC,MAAAA,CAAK,CAAEC,UAAAA,CAAS,CAAEC,UAAAA,CAAS,CAAE,CAAAC,SAgBhC,IACT,CACF,CAE8B,aAA1B,OAAOR,GACTG,CAAAA,EAAgBM,MAAM,CAAGT,CAAAA,EAG3B,IAAME,EAAgB,CACpB,GAAGC,CAAe,CAClB,GAAGF,CAAO,EAGZ,MAAOS,CAAAA,EAAAA,EAAAA,OAAQ,EAAC,CACd,GAAGR,CAAa,CAChBS,QAAO,MAAET,CAAAA,EAAAA,EAAcU,iBAAiB,SAA/BV,EAAiCS,OAAO,EAErD,6XC1DO,IAAAE,EAAsBC,EAAuC,eAAvCC,EAAUC,CAAQ,EAC7C,GAAI,CAAAC,OAAAA,CAAOC,CAAAA,SAAAA,CAAW,EAAAV,KACpB,oBAAMU,OACR,UAAAL,EAAAM,iBAAA,CAAAF,GAGF,OAAAD,yHCoDA,qCAAAI,uBAxE+B,UACF,UAEF,IAK3B,SAASC,EACPC,CAA4D,EAW5D,MAAO,CACLC,QAASC,GAFe,YAAaF,EAGjCA,EAA4BC,OAAO,CAClCD,CACP,CACF,CAEA,IAAMG,EAAiB,CACrBhB,OAAQ,IAAMiB,QAAQC,OAAO,CAACN,EAAc,IAAM,OAClDjB,QAAS,KACTwB,IAAK,EACP,EAyCAR,EAhCA,SAAkBnB,CAAwB,EACxC,IAAM4B,EAAO,CAAE,GAAGJ,CAAc,CAAE,GAAGxB,CAAO,EACtC6B,EAAOC,CAAAA,EAAAA,EAAAA,IAAI,EAAC,IAAMF,EAAKpB,MAAM,GAAGuB,IAAI,CAACX,IACrCY,EAAUJ,EAAKzB,OAAO,CAE5B,SAAS8B,EAAkBC,CAAU,EACnC,IAAMC,EAAkBH,EACtB,GAAAI,EAAAC,GAAA,EAACL,EAAAA,CAAQ3B,UAAW,GAAMC,UAAW,GAAMF,MAAO,OAChD,KAEEW,EAAWa,EAAKD,GAAG,CACvB,GAAAS,EAAAE,IAAA,EAAAF,EAAAG,QAAA,YAEG,oBAAOtB,OACN,GAAAmB,EAAAC,GAAA,EAACG,EAAAA,UAAU,EAACC,UAAWb,EAAKlB,OAAO,GACjC,KACJ,GAAA0B,EAAAC,GAAA,EAACR,EAAAA,CAAM,GAAGK,CAAK,MAGjB,GAAAE,EAAAC,GAAA,EAACvB,EAAAA,YAAY,EAACE,OAAO,wBACnB,GAAAoB,EAAAC,GAAA,EAACR,EAAAA,CAAM,GAAGK,CAAK,KAInB,MAAO,GAAAE,EAAAC,GAAA,EAACK,EAAAA,QAAQ,EAACC,SAAUR,WAAkBpB,GAC/C,CAIA,OAFAkB,EAAkBW,WAAW,CAAG,oBAEzBX,CACT,iLClEOY,EAAsEhC,EAAA,cAAlD2B,EAAWjC,CAAX,EACzB,IAAAkC,UAAAA,CAAA,EAAAlC,KAEE,oBAAOU,OACT,YAGA,IAAM6B,EAAa,GAAAD,EAAAE,uBAAA,sBAEnBD,EAAA,MAGEE,EAAMC,qBAAwBC,EAAAA,EAAAA,CAC9B,IAAKD,EAAME,EAAkBD,qBAAA,KAC3B,IAAKD,KAASE,EAAM,CACpB,IAAAF,CAAMG,CAAAA,EAAWH,CAAAA,SAGjBH,IAAAA,EAAiBM,CAAAA,CAAAA,EAAAA,CAAAA,KAAAA,CAAAA,MAAAA,CAAAA,GAAAA,EAAAA,QAAAA,CAAAA,SACnBN,EAAAO,IAAA,IAAAD,EACF,CAEA,QACEN,IAAAA,EAAOQ,MAAA,CACT,KAIKR,CAAAA,EAASS,EAAKC,GAAAA,EAAAA,EAAAA,QAAAA,CAAAA,UACbV,EAAAS,GAAA,IAGiB,GAAAnB,EAAAC,GAAA,UAEboB,WAAI,UACJC,IAAAA,aACAC,KAAGX,EAAAY,WAAA,WAAAC,UAAAL,GALEA,GAAAA,OAQX,EAAAA,GAGN,sBC7CAM,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,iDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,iDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,6EAAgF,kDCA3GD,EAAAC,OAAA,EAAkB,OAAS,gEAAiE,uGCqsB5FC,EAuBAA,EAvrBAC,YAtCAC,EAAAC,OAAAC,cAAA,CACAC,EAAAF,OAAAG,qBAAA,CACAC,EAAAJ,OAAAK,SAAA,CAAAC,cAAA,CACAC,EAAAP,OAAAK,SAAA,CAAAG,oBAAA,CACAC,EAAA,CAAAC,EAAA1B,EAAA2B,IAAA3B,KAAA0B,EAAAX,EAAAW,EAAA1B,EAAA,CAA8E4B,WAAA,GAAAC,aAAA,GAAAC,SAAA,GAAAH,MAAAA,CAAA,GAA6DD,CAAA,CAAA1B,EAAA,CAAA2B,EAC3II,EAAA,CAAAC,EAAAC,KACA,QAAAC,KAAAD,GAAAA,CAAAA,EAAA,IACAb,EAAAe,IAAA,CAAAF,EAAAC,IACAT,EAAAO,EAAAE,EAAAD,CAAA,CAAAC,EAAA,EACA,GAAAhB,EACA,QAAAgB,KAAAhB,EAAAe,GACAV,EAAAY,IAAA,CAAAF,EAAAC,IACAT,EAAAO,EAAAE,EAAAD,CAAA,CAAAC,EAAA,EAEA,OAAAF,CACA,EACAI,EAAA,CAAAC,EAAAC,KACA,IAAAC,EAAA,GACA,QAAAL,KAAAG,EACAjB,EAAAe,IAAA,CAAAE,EAAAH,IAAAI,EAAAA,EAAAE,OAAA,CAAAN,IACAK,CAAAA,CAAA,CAAAL,EAAA,CAAAG,CAAA,CAAAH,EAAA,EACA,GAAAG,MAAAA,GAAAnB,EACA,QAAAgB,KAAAhB,EAAAmB,GACA,EAAAC,EAAAE,OAAA,CAAAN,IAAAX,EAAAY,IAAA,CAAAE,EAAAH,IACAK,CAAAA,CAAA,CAAAL,EAAA,CAAAG,CAAA,CAAAH,EAAA,EAEA,OAAAK,CACA,EAYA,KACA,IAAAE,EAAA,MAAAA,EAMAC,YAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,CAAAC,CAAA,EAQA,GAPA,KAAAH,OAAA,CAAAA,EACA,KAAAC,oBAAA,CAAAA,EAGA,KAAArF,OAAA,IAEA,KAAAwF,UAAA,IACAJ,EAAAF,EAAAO,WAAA,EAAAL,EAAAF,EAAAQ,WAAA,CACA,+CACA,GAAAH,EAAA,IAAAA,EAAA,EACA,2CACA,MAAAI,IAAA,CAAAP,EAAAA,EAAA,GACA,IAAAQ,EAAA,GACA,QAAAC,EAAA,EAAsBA,EAAA,KAAAF,IAAA,CAAeE,IACrCD,EAAAjD,IAAA,KACA,QAAAkD,EAAA,EAAsBA,EAAA,KAAAF,IAAA,CAAeE,IACrC,KAAA7F,OAAA,CAAA2C,IAAA,CAAAiD,EAAAE,KAAA,IACA,KAAAN,UAAA,CAAA7C,IAAA,CAAAiD,EAAAE,KAAA,IAEA,KAAAC,oBAAA,GACA,IAAAC,EAAA,KAAAC,mBAAA,CAAAX,GAEA,GADA,KAAAY,aAAA,CAAAF,GACAT,IAAAA,EAAA,CACA,IAAAY,EAAA,IACA,QAAAN,EAAA,EAAwBA,EAAA,EAAOA,IAAA,CAC/B,KAAAO,SAAA,CAAAP,GACA,KAAAQ,cAAA,CAAAR,GACA,IAAAS,EAAA,KAAAC,eAAA,GACAD,EAAAH,IACAZ,EAAAM,EACAM,EAAAG,GAEA,KAAAF,SAAA,CAAAP,EACA,CACA,CACAW,EAAA,GAAAjB,GAAAA,GAAA,GACA,KAAAkB,IAAA,CAAAlB,EACA,KAAAa,SAAA,CAAAb,GACA,KAAAc,cAAA,CAAAd,GACA,KAAAC,UAAA,IAQA,OAAAkB,WAAAC,CAAA,CAAAC,CAAA,EACA,IAAAC,EAAAvD,EAAAwD,SAAA,CAAAC,YAAA,CAAAJ,GACA,OAAAzB,EAAA8B,cAAA,CAAAH,EAAAD,EACA,CAKA,OAAAK,aAAAC,CAAA,CAAAN,CAAA,EACA,IAAAO,EAAA7D,EAAAwD,SAAA,CAAAM,SAAA,CAAAF,GACA,OAAAhC,EAAA8B,cAAA,EAAAG,EAAA,CAAAP,EACA,CAWA,OAAAI,eAAAH,CAAA,CAAAD,CAAA,CAAAS,EAAA,EAAAC,EAAA,GAAAb,EAAA,GAAAc,EAAA,QAGAnC,EACAoC,EAHA,IAAAtC,CAAAA,EAAAO,WAAA,EAAA4B,GAAAA,GAAAC,GAAAA,GAAApC,EAAAQ,WAAA,GAAAe,EAAA,IAAAA,EAAA,EACA,kCAGA,IAAArB,EAAAiC,GAAmCjC,IAAA,CACnC,IAAAqC,EAAAvC,EAAAA,EAAAwC,mBAAA,CAAAtC,EAAAwB,GACAe,EAAAb,EAAAc,YAAA,CAAAf,EAAAzB,GACA,GAAAuC,GAAAF,EAAA,CACAD,EAAAG,EACA,KACA,CACA,GAAAvC,GAAAkC,EACA,iCACA,CACA,QAAAO,IAAA,CAAA3C,EAAA4C,GAAA,CAAAC,MAAA,CAAA7C,EAAA4C,GAAA,CAAAE,QAAA,CAAA9C,EAAA4C,GAAA,CAAAG,IAAA,EACAV,GAAAC,GAAAtC,EAAAA,EAAAwC,mBAAA,CAAAtC,EAAAyC,IACAjB,CAAAA,EAAAiB,CAAA,EAEA,IAAAK,EAAA,GACA,QAAAf,KAAAN,EAGA,QAAAnC,KAFAyD,EAAAhB,EAAAiB,IAAA,CAAAC,QAAA,GAAAH,GACAC,EAAAhB,EAAAmB,QAAA,CAAAnB,EAAAiB,IAAA,CAAAG,gBAAA,CAAAnD,GAAA8C,GACAf,EAAAqB,OAAA,IACAN,EAAAvF,IAAA,CAAA+B,GAEA8B,EAAA0B,EAAAtF,MAAA,EAAA4E,GACA,IAAAiB,EAAAvD,EAAAA,EAAAwC,mBAAA,CAAAtC,EAAAwB,GACAJ,EAAA0B,EAAAtF,MAAA,EAAA6F,GACAN,EAAA,EAAAO,KAAAC,GAAA,GAAAF,EAAAP,EAAAtF,MAAA,EAAAsF,GACAC,EAAA,KAAAD,EAAAtF,MAAA,MAAAsF,GACA1B,EAAA0B,EAAAtF,MAAA,OACA,QAAAgG,EAAA,IAA8BV,EAAAtF,MAAA,CAAA6F,EAA8BG,GAAA,IAC5DT,EAAAS,EAAA,EAAAV,GACA,IAAA5C,EAAA,GACA,KAAAA,EAAAA,EAAA1C,MAAA,CAAAsF,EAAAtF,MAAA,EACA0C,EAAA3C,IAAA,IAEA,OADAuF,EAAAW,OAAA,EAAAnE,EAAAmB,IAAAP,CAAA,CAAAO,IAAA,IAAAnB,GAAA,EAAAmB,CAAAA,EAAAA,CAAA,GACA,IAAAX,EAAAE,EAAAwB,EAAAtB,EAAAmB,EACA,CAKAqC,UAAAC,CAAA,CAAAC,CAAA,EACA,UAAAD,GAAAA,EAAA,KAAApD,IAAA,KAAAqD,GAAAA,EAAA,KAAArD,IAAA,OAAA3F,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CAGAE,YAAA,CACA,YAAAjJ,OAAA,CAIA+F,sBAAA,CACA,QAAAF,EAAA,EAAsBA,EAAA,KAAAF,IAAA,CAAeE,IACrC,KAAAqD,iBAAA,GAAArD,EAAAA,EAAA,MACA,KAAAqD,iBAAA,CAAArD,EAAA,EAAAA,EAAA,MAEA,KAAAsD,iBAAA,MACA,KAAAA,iBAAA,MAAAxD,IAAA,MACA,KAAAwD,iBAAA,QAAAxD,IAAA,IACA,IAAAyD,EAAA,KAAAC,4BAAA,GACAC,EAAAF,EAAAxG,MAAA,CACA,QAAAiD,EAAA,EAAsBA,EAAAyD,EAAczD,IACpC,QAAA0D,EAAA,EAAwBA,EAAAD,EAAcC,IACtC,GAAA1D,GAAA0D,GAAAA,GAAA1D,GAAAA,GAAA0D,GAAAD,EAAA,GAAAzD,GAAAyD,EAAA,GAAAC,GAAAA,GACA,KAAAC,oBAAA,CAAAJ,CAAA,CAAAvD,EAAA,CAAAuD,CAAA,CAAAG,EAAA,EAGA,KAAAlD,cAAA,IACA,KAAAoD,WAAA,EACA,CAGApD,eAAAI,CAAA,EACA,IAAAS,EAAA,KAAA7B,oBAAA,CAAAqE,UAAA,IAAAjD,EACAkD,EAAAzC,EACA,QAAArB,EAAA,EAAsBA,EAAA,GAAQA,IAC9B8D,EAAAA,GAAA,GAAAA,IAAA,QACA,IAAAC,EAAA,CAAA1C,GAAA,GAAAyC,CAAA,QACAnD,EAAAoD,IAAA,OACA,QAAA/D,EAAA,EAAsBA,GAAA,EAAQA,IAC9B,KAAAqD,iBAAA,GAAArD,EAAAgE,EAAAD,EAAA/D,IACA,KAAAqD,iBAAA,KAAAW,EAAAD,EAAA,IACA,KAAAV,iBAAA,KAAAW,EAAAD,EAAA,IACA,KAAAV,iBAAA,KAAAW,EAAAD,EAAA,IACA,QAAA/D,EAAA,EAAsBA,EAAA,GAAQA,IAC9B,KAAAqD,iBAAA,IAAArD,EAAA,EAAAgE,EAAAD,EAAA/D,IACA,QAAAA,EAAA,EAAsBA,EAAA,EAAOA,IAC7B,KAAAqD,iBAAA,MAAAvD,IAAA,GAAAE,EAAA,EAAAgE,EAAAD,EAAA/D,IACA,QAAAA,EAAA,EAAsBA,EAAA,GAAQA,IAC9B,KAAAqD,iBAAA,QAAAvD,IAAA,IAAAE,EAAAgE,EAAAD,EAAA/D,IACA,KAAAqD,iBAAA,QAAAvD,IAAA,MACA,CAGA8D,aAAA,CACA,QAAArE,OAAA,GACA,OACA,IAAAuE,EAAA,KAAAvE,OAAA,CACA,QAAAS,EAAA,EAAsBA,EAAA,GAAQA,IAC9B8D,EAAAA,GAAA,GAAAA,IAAA,SACA,IAAAC,EAAA,KAAAxE,OAAA,KAAAuE,EACAnD,EAAAoD,IAAA,OACA,QAAA/D,EAAA,EAAsBA,EAAA,GAAQA,IAAA,CAC9B,IAAAiE,EAAAD,EAAAD,EAAA/D,GACApB,EAAA,KAAAkB,IAAA,IAAAE,EAAA,EACAnB,EAAAgE,KAAAqB,KAAA,CAAAlE,EAAA,GACA,KAAAqD,iBAAA,CAAAzE,EAAAC,EAAAoF,GACA,KAAAZ,iBAAA,CAAAxE,EAAAD,EAAAqF,EACA,CACA,CAGAX,kBAAAJ,CAAA,CAAAC,CAAA,EACA,QAAAgB,EAAA,GAAwBA,GAAA,EAASA,IACjC,QAAAC,EAAA,GAA0BA,GAAA,EAASA,IAAA,CACnC,IAAAC,EAAAxB,KAAAyB,GAAA,CAAAzB,KAAA0B,GAAA,CAAAH,GAAAvB,KAAA0B,GAAA,CAAAJ,IACAK,EAAAtB,EAAAkB,EACAK,EAAAtB,EAAAgB,CACA,IAAAK,GAAAA,EAAA,KAAA1E,IAAA,KAAA2E,GAAAA,EAAA,KAAA3E,IAAA,EACA,KAAAuD,iBAAA,CAAAmB,EAAAC,EAAAJ,GAAAA,GAAAA,GAAAA,EACA,CAEA,CAGAV,qBAAAT,CAAA,CAAAC,CAAA,EACA,QAAAgB,EAAA,GAAwBA,GAAA,EAASA,IACjC,QAAAC,EAAA,GAA0BA,GAAA,EAASA,IACnC,KAAAf,iBAAA,CAAAH,EAAAkB,EAAAjB,EAAAgB,EAAAtB,GAAAA,KAAAyB,GAAA,CAAAzB,KAAA0B,GAAA,CAAAH,GAAAvB,KAAA0B,GAAA,CAAAJ,IAEA,CAGAd,kBAAAH,CAAA,CAAAC,CAAA,CAAAuB,CAAA,EACA,KAAAvK,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CAAAwB,EACA,KAAA/E,UAAA,CAAAwD,EAAA,CAAAD,EAAA,GACA,CAIA9C,oBAAAiB,CAAA,EACA,IAAAsD,EAAA,KAAApF,OAAA,CACAwB,EAAA,KAAAvB,oBAAA,CACA,GAAA6B,EAAAtE,MAAA,EAAAsC,EAAAwC,mBAAA,CAAA8C,EAAA5D,GACA,qCACA,IAAA6D,EAAAvF,EAAAwF,2BAAA,CAAA9D,EAAA+D,OAAA,EAAAH,EAAA,CACAI,EAAA1F,EAAA2F,uBAAA,CAAAjE,EAAA+D,OAAA,EAAAH,EAAA,CACAM,EAAApC,KAAAqB,KAAA,CAAA7E,EAAA6F,oBAAA,CAAAP,GAAA,GACAQ,EAAAP,EAAAK,EAAAL,EACAQ,EAAAvC,KAAAqB,KAAA,CAAAe,EAAAL,GACAS,EAAA,GACAC,EAAAjG,EAAAkG,yBAAA,CAAAR,GACA,QAAA/E,EAAA,EAAAwF,EAAA,EAA6BxF,EAAA4E,EAAe5E,IAAA,CAC5C,IAAAyF,EAAApE,EAAApB,KAAA,CAAAuF,EAAAA,EAAAJ,EAAAL,EAAA/E,CAAAA,EAAAmF,EAAA,MACAK,GAAAC,EAAA1I,MAAA,CACA,IAAA2I,EAAArG,EAAAsG,2BAAA,CAAAF,EAAAH,GACAtF,EAAAmF,GACAM,EAAA3I,IAAA,IACAuI,EAAAvI,IAAA,CAAA2I,EAAAG,MAAA,CAAAF,GACA,CACA,IAAAG,EAAA,GACA,QAAA7F,EAAA,EAAsBA,EAAAqF,CAAA,IAAAtI,MAAA,CAAsBiD,IAC5CqF,EAAArC,OAAA,EAAA8C,EAAApC,KACA1D,CAAAA,GAAAoF,EAAAL,GAAArB,GAAAyB,CAAA,GACAU,EAAA/I,IAAA,CAAAgJ,CAAA,CAAA9F,EAAA,CACA,GAGA,OADAW,EAAAkF,EAAA9I,MAAA,EAAAkI,GACAY,CACA,CAGAxF,cAAAgB,CAAA,EACA,GAAAA,EAAAtE,MAAA,EAAA8F,KAAAqB,KAAA,CAAA7E,EAAA6F,oBAAA,MAAA3F,OAAA,KACA,qCACA,IAAAS,EAAA,EACA,QAAA+F,EAAA,KAAAjG,IAAA,GAAsCiG,GAAA,EAAYA,GAAA,GAClD,GAAAA,GACAA,CAAAA,EAAA,GACA,QAAAC,EAAA,EAA2BA,EAAA,KAAAlG,IAAA,CAAkBkG,IAC7C,QAAAtC,EAAA,EAA0BA,EAAA,EAAOA,IAAA,CACjC,IAAAR,EAAA6C,EAAArC,EAEAP,EAAA8C,CADAF,EAAA,QACA,KAAAjG,IAAA,GAAAkG,EAAAA,CACA,OAAArG,UAAA,CAAAwD,EAAA,CAAAD,EAAA,EAAAlD,EAAAqB,EAAAA,EAAAtE,MAAA,GACA,KAAA5C,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CAAAc,EAAA3C,CAAA,CAAArB,IAAA,KAAAA,CAAAA,EAAAA,CAAA,GACAA,IAEA,CAEA,CACAW,EAAAX,GAAAqB,EAAAA,EAAAtE,MAAA,CACA,CAMAwD,UAAAK,CAAA,EACA,GAAAA,EAAA,GAAAA,EAAA,EACA,4CACA,QAAAuC,EAAA,EAAsBA,EAAA,KAAArD,IAAA,CAAeqD,IACrC,QAAAD,EAAA,EAAwBA,EAAA,KAAApD,IAAA,CAAeoD,IAAA,CACvC,IAAAgD,EACA,OAAAtF,GACA,OACAsF,EAAA,CAAAhD,EAAAC,CAAAA,EAAA,KACA,KACA,QACA+C,EAAA/C,EAAA,KACA,KACA,QACA+C,EAAAhD,EAAA,KACA,KACA,QACAgD,EAAA,CAAAhD,EAAAC,CAAAA,EAAA,KACA,KACA,QACA+C,EAAA,CAAArD,KAAAqB,KAAA,CAAAhB,EAAA,GAAAL,KAAAqB,KAAA,CAAAf,EAAA,SACA,KACA,QACA+C,EAAAhD,EAAAC,EAAA,EAAAD,EAAAC,EAAA,KACA,KACA,QACA+C,EAAA,CAAAhD,EAAAC,EAAA,EAAAD,EAAAC,EAAA,QACA,KACA,QACA+C,EAAA,EAAAhD,EAAAC,CAAAA,EAAA,EAAAD,EAAAC,EAAA,QACA,KACA,SACA,0BACA,CACA,MAAAxD,UAAA,CAAAwD,EAAA,CAAAD,EAAA,EAAAgD,GACA,MAAA/L,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,OAAA/I,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CACA,CAEA,CAGAxC,iBAAA,CACA,IAAAmF,EAAA,EACA,QAAA1C,EAAA,EAAsBA,EAAA,KAAArD,IAAA,CAAeqD,IAAA,CACrC,IAAAgD,EAAA,GACAC,EAAA,EACAC,EAAA,gBACA,QAAAnD,EAAA,EAAwBA,EAAA,KAAApD,IAAA,CAAeoD,IACvC,KAAA/I,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,EAAAiD,EAEAC,KAAAA,EACAP,GAAAxG,EAAAiH,UAAA,CACAF,EAAA,GACAP,KAEA,KAAAU,uBAAA,CAAAH,EAAAC,GACAF,GACAN,CAAAA,GAAA,KAAAW,0BAAA,CAAAH,GAAAhH,EAAAoH,UAAA,EACAN,EAAA,KAAAhM,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CACAkD,EAAA,GAGAP,GAAA,KAAAa,8BAAA,CAAAP,EAAAC,EAAAC,GAAAhH,EAAAoH,UAAA,CAEA,QAAAvD,EAAA,EAAsBA,EAAA,KAAApD,IAAA,CAAeoD,IAAA,CACrC,IAAAiD,EAAA,GACAQ,EAAA,EACAN,EAAA,gBACA,QAAAlD,EAAA,EAAwBA,EAAA,KAAArD,IAAA,CAAeqD,IACvC,KAAAhJ,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,EAAAiD,EAEAQ,KAAAA,EACAd,GAAAxG,EAAAiH,UAAA,CACAK,EAAA,GACAd,KAEA,KAAAU,uBAAA,CAAAI,EAAAN,GACAF,GACAN,CAAAA,GAAA,KAAAW,0BAAA,CAAAH,GAAAhH,EAAAoH,UAAA,EACAN,EAAA,KAAAhM,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CACAyD,EAAA,GAGAd,GAAA,KAAAa,8BAAA,CAAAP,EAAAQ,EAAAN,GAAAhH,EAAAoH,UAAA,CAEA,QAAAtD,EAAA,EAAsBA,EAAA,KAAArD,IAAA,GAAmBqD,IACzC,QAAAD,EAAA,EAAwBA,EAAA,KAAApD,IAAA,GAAmBoD,IAAA,CAC3C,IAAAe,EAAA,KAAA9J,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,CACAe,GAAA,KAAA9J,OAAA,CAAAgJ,EAAA,CAAAD,EAAA,IAAAe,GAAA,KAAA9J,OAAA,CAAAgJ,EAAA,GAAAD,EAAA,EAAAe,GAAA,KAAA9J,OAAA,CAAAgJ,EAAA,GAAAD,EAAA,IACA2C,CAAAA,GAAAxG,EAAAuH,UAAA,CACA,CAEA,IAAAC,EAAA,EACA,QAAA9G,KAAA,KAAA5F,OAAA,CACA0M,EAAA9G,EAAA+G,MAAA,EAAAC,EAAA9C,IAAA8C,EAAA9C,CAAAA,EAAA,KAAA4C,GACA,IAAAG,EAAA,KAAAlH,IAAA,MAAAA,IAAA,CACA0F,EAAA3C,KAAAoE,IAAA,CAAApE,KAAA0B,GAAA,CAAAsC,GAAAA,EAAAG,GAAAA,GAAAA,GAAA,EAIA,OAHArG,EAAA,GAAA6E,GAAAA,GAAA,GAEA7E,EAAA,GADAkF,CAAAA,GAAAL,EAAAnG,EAAA6H,UAAA,GACArB,GAAA,SACAA,CACA,CAKArC,8BAAA,CACA,WAAAjE,OAAA,CACA,UAEA,IAAAkE,EAAAZ,KAAAqB,KAAA,MAAA3E,OAAA,MACA4H,EAAA,SAAA5H,OAAA,IAAAsD,EAAAA,KAAAoE,IAAA,SAAA1H,OAAA,IAAAkE,CAAAA,EAAAA,EAAA,IACAoC,EAAA,IACA,QAAAuB,EAAA,KAAAtH,IAAA,GAAsC+F,EAAA9I,MAAA,CAAA0G,EAA0B2D,GAAAD,EAChEtB,EAAAwB,MAAA,KAAAD,GACA,OAAAvB,CACA,CACA,CAIA,OAAAX,qBAAAP,CAAA,EACA,GAAAA,EAAAtF,EAAAO,WAAA,EAAA+E,EAAAtF,EAAAQ,WAAA,CACA,gDACA,IAAAgG,EAAA,IAAAlB,EAAA,KAAAA,EAAA,GACA,GAAAA,GAAA,GACA,IAAAlB,EAAAZ,KAAAqB,KAAA,CAAAS,EAAA,KACAkB,GAAA,IAAApC,EAAA,IAAAA,EAAA,GACAkB,GAAA,GACAkB,CAAAA,GAAA,GACA,CAEA,OADAlF,EAAA,KAAAkF,GAAAA,GAAA,OACAA,CACA,CAIA,OAAAhE,oBAAA8C,CAAA,CAAA5D,CAAA,EACA,OAAA8B,KAAAqB,KAAA,CAAA7E,EAAA6F,oBAAA,CAAAP,GAAA,GAAAtF,EAAA2F,uBAAA,CAAAjE,EAAA+D,OAAA,EAAAH,EAAA,CAAAtF,EAAAwF,2BAAA,CAAA9D,EAAA+D,OAAA,EAAAH,EAAA,CAIA,OAAAY,0BAAA+B,CAAA,EACA,GAAAA,EAAA,GAAAA,EAAA,IACA,wCACA,IAAAzB,EAAA,GACA,QAAA7F,EAAA,EAAsBA,EAAAsH,EAAA,EAAgBtH,IACtC6F,EAAA/I,IAAA,IACA+I,EAAA/I,IAAA,IACA,IAAAyK,EAAA,EACA,QAAAvH,EAAA,EAAsBA,EAAAsH,EAAYtH,IAAA,CAClC,QAAA0D,EAAA,EAAwBA,EAAAmC,EAAA9I,MAAA,CAAmB2G,IAC3CmC,CAAA,CAAAnC,EAAA,CAAArE,EAAAmI,mBAAA,CAAA3B,CAAA,CAAAnC,EAAA,CAAA6D,GACA7D,EAAA,EAAAmC,EAAA9I,MAAA,EACA8I,CAAAA,CAAA,CAAAnC,EAAA,EAAAmC,CAAA,CAAAnC,EAAA,IAEA6D,EAAAlI,EAAAmI,mBAAA,CAAAD,EAAA,EACA,CACA,OAAA1B,CACA,CAEA,OAAAF,4BAAAtE,CAAA,CAAAoG,CAAA,EACA,IAAA5B,EAAA4B,EAAAzK,GAAA,OACA,QAAA6B,KAAAwC,EAAA,CACA,IAAAqG,EAAA7I,EAAAgH,EAAA8B,KAAA,GACA9B,EAAA/I,IAAA,IACA2K,EAAAzE,OAAA,EAAA4E,EAAA5H,IAAA6F,CAAA,CAAA7F,EAAA,EAAAX,EAAAmI,mBAAA,CAAAI,EAAAF,GACA,CACA,OAAA7B,CACA,CAGA,OAAA2B,oBAAAtE,CAAA,CAAAC,CAAA,EACA,GAAAD,IAAA,MAAAC,IAAA,KACA,sCACA,IAAA0E,EAAA,EACA,QAAA7H,EAAA,EAAsBA,GAAA,EAAQA,IAE9B6H,EADAA,GAAA,GAAAA,IAAA,OACA,CAAA1E,IAAAnD,EAAA,GAAAkD,EAGA,OADAvC,EAAAkH,IAAA,MACAA,CACA,CAGArB,2BAAAH,CAAA,EACA,IAAAyB,EAAAzB,CAAA,IACA1F,EAAAmH,GAAA,OAAAhI,IAAA,EACA,IAAAiI,EAAAD,EAAA,GAAAzB,CAAA,KAAAyB,GAAAzB,CAAA,KAAAyB,EAAAA,GAAAzB,CAAA,KAAAyB,GAAAzB,CAAA,KAAAyB,EACA,OAAAC,GAAA1B,CAAA,KAAAyB,EAAAA,GAAAzB,CAAA,KAAAyB,EAAA,KAAAC,CAAAA,GAAA1B,CAAA,KAAAyB,EAAAA,GAAAzB,CAAA,KAAAyB,EAAA,IACA,CAEApB,+BAAAsB,CAAA,CAAAC,CAAA,CAAA5B,CAAA,EAOA,OANA2B,IACA,KAAAzB,uBAAA,CAAA0B,EAAA5B,GACA4B,EAAA,GAEAA,GAAA,KAAAnI,IAAA,CACA,KAAAyG,uBAAA,CAAA0B,EAAA5B,GACA,KAAAG,0BAAA,CAAAH,EACA,CAEAE,wBAAA0B,CAAA,CAAA5B,CAAA,EACA,GAAAA,CAAA,KACA4B,CAAAA,GAAA,KAAAnI,IAAA,EACAuG,EAAA6B,GAAA,GACA7B,EAAA8B,OAAA,CAAAF,EACA,CACA,EAqCA,SAAA3F,EAAA8F,CAAA,CAAAC,CAAA,CAAAhG,CAAA,EACA,GAAAgG,EAAA,GAAAA,EAAA,IAAAD,IAAAC,GAAA,EACA,uCACA,QAAArI,EAAAqI,EAAA,EAA0BrI,GAAA,EAAQA,IAClCqC,EAAAvF,IAAA,CAAAsL,IAAApI,EAAA,EACA,CACA,SAAAgE,EAAAd,CAAA,CAAAlD,CAAA,EACA,OAAAkD,IAAAlD,EAAA,KACA,CACA,SAAAW,EAAA2H,CAAA,EACA,IAAAA,EACA,8BACA,CA9CAjJ,EAAAO,WAAA,GAEAP,EAAAQ,WAAA,IAEAR,EAAAiH,UAAA,GACAjH,EAAAuH,UAAA,GACAvH,EAAAoH,UAAA,IACApH,EAAA6H,UAAA,IACA7H,EAAA2F,uBAAA,EAGA,4HAEA,6HAEA,6HAEA,6HAEA,CACA3F,EAAAwF,2BAAA,EAGA,sGAEA,+GAEA,kHAEA,mHAEA,CAEApH,EAAA8K,MAAA,CAAAlJ,EAcA,IAAAmJ,EAAA,MAAAA,EAKAlJ,YAAAiD,CAAA,CAAAE,CAAA,CAAAgG,CAAA,EAIA,GAHA,KAAAlG,IAAA,CAAAA,EACA,KAAAE,QAAA,CAAAA,EACA,KAAAgG,OAAA,CAAAA,EACAhG,EAAA,EACA,oCACA,MAAAgG,OAAA,CAAAA,EAAAxI,KAAA,EACA,CAKA,OAAAsB,UAAAF,CAAA,EACA,IAAAgB,EAAA,GACA,QAAAxD,KAAAwC,EACAiB,EAAAzD,EAAA,EAAAwD,GACA,WAAAmG,EAAAA,EAAAE,IAAA,CAAAC,IAAA,CAAAtH,EAAAtE,MAAA,CAAAsF,EACA,CAEA,OAAAuG,YAAAC,CAAA,EACA,IAAAL,EAAAM,SAAA,CAAAD,GACA,2DACA,IAAAxG,EAAA,GACA,QAAArC,EAAA,EAAsBA,EAAA6I,EAAA9L,MAAA,EAAmB,CACzC,IAAA+K,EAAAjF,KAAAC,GAAA,CAAA+F,EAAA9L,MAAA,CAAAiD,EAAA,GACAsC,EAAAyG,SAAAF,EAAAG,SAAA,CAAAhJ,EAAAA,EAAA8H,GAAA,IAAAA,EAAAA,EAAA,EAAAzF,GACArC,GAAA8H,CACA,CACA,WAAAU,EAAAA,EAAAE,IAAA,CAAAO,OAAA,CAAAJ,EAAA9L,MAAA,CAAAsF,EACA,CAIA,OAAA6G,iBAAApI,CAAA,MAIAd,EAHA,IAAAwI,EAAAW,cAAA,CAAArI,GACA,gFACA,IAAAuB,EAAA,GAEA,IAAArC,EAAA,EAAkBA,EAAA,GAAAc,EAAA/D,MAAA,CAAsBiD,GAAA,GACxC,IAAAoJ,EAAAZ,GAAAA,EAAAa,oBAAA,CAAAjK,OAAA,CAAA0B,EAAAwI,MAAA,CAAAtJ,IAEAsC,EADA8G,GAAAZ,EAAAa,oBAAA,CAAAjK,OAAA,CAAA0B,EAAAwI,MAAA,CAAAtJ,EAAA,IACA,GAAAqC,EACA,CAGA,OAFArC,EAAAc,EAAA/D,MAAA,EACAuF,EAAAkG,EAAAa,oBAAA,CAAAjK,OAAA,CAAA0B,EAAAwI,MAAA,CAAAtJ,IAAA,EAAAqC,GACA,IAAAmG,EAAAA,EAAAE,IAAA,CAAAa,YAAA,CAAAzI,EAAA/D,MAAA,CAAAsF,EACA,CAGA,OAAAnB,aAAAJ,CAAA,QACA,IAAAA,EACA,GACA0H,EAAAM,SAAA,CAAAhI,GACA,CAAA0H,EAAAI,WAAA,CAAA9H,GAAA,CACA0H,EAAAW,cAAA,CAAArI,GACA,CAAA0H,EAAAU,gBAAA,CAAApI,GAAA,CAEA,CAAA0H,EAAAjH,SAAA,CAAAiH,EAAAgB,eAAA,CAAA1I,IAAA,CAIA,OAAA2I,QAAAC,CAAA,EACA,IAAArH,EAAA,GACA,GAAAqH,EAAA,EACA,sDACA,GAAAA,EAAA,IACApH,EAAAoH,EAAA,EAAArH,QACA,GAAAqH,EAAA,MACApH,EAAA,IAAAD,GACAC,EAAAoH,EAAA,GAAArH,QACQ,GAAAqH,EAAA,IACRpH,EAAA,IAAAD,GACAC,EAAAoH,EAAA,GAAArH,QAEA,sDACA,WAAAmG,EAAAA,EAAAE,IAAA,CAAAiB,GAAA,GAAAtH,EACA,CAGA,OAAAyG,UAAAhI,CAAA,EACA,OAAA0H,EAAAoB,aAAA,CAAAC,IAAA,CAAA/I,EACA,CAIA,OAAAqI,eAAArI,CAAA,EACA,OAAA0H,EAAAsB,kBAAA,CAAAD,IAAA,CAAA/I,EACA,CAGA6B,SAAA,CACA,YAAA8F,OAAA,CAAAxI,KAAA,EACA,CAGA,OAAA8B,aAAAf,CAAA,CAAAzB,CAAA,EACA,IAAAsG,EAAA,EACA,QAAAvE,KAAAN,EAAA,CACA,IAAA+I,EAAAzI,EAAAiB,IAAA,CAAAG,gBAAA,CAAAnD,GACA,GAAA+B,EAAAmB,QAAA,KAAAsH,EACA,OAAAC,IACAnE,GAAA,EAAAkE,EAAAzI,EAAAmH,OAAA,CAAA1L,MAAA,CAEA,OAAA8I,CACA,CAEA,OAAA2D,gBAAAS,CAAA,EACAA,EAAA3M,UAAA2M,GACA,IAAApE,EAAA,GACA,QAAA7F,EAAA,EAAsBA,EAAAiK,EAAAlN,MAAA,CAAgBiD,IACtCiK,KAAAA,EAAAX,MAAA,CAAAtJ,GACA6F,EAAA/I,IAAA,CAAAmN,EAAAC,UAAA,CAAAlK,KAEA6F,EAAA/I,IAAA,CAAAiM,SAAAkB,EAAAjB,SAAA,CAAAhJ,EAAA,EAAAA,EAAA,QACAA,GAAA,GAGA,OAAA6F,CACA,CACA,CAGA2C,CAAAA,EAAAoB,aAAA,YAEApB,EAAAsB,kBAAA,yBAGAtB,EAAAa,oBAAA,iDACA,IAAApI,EAAAuH,CACA/K,CAAAA,EAAAwD,SAAA,CAAAuH,CACA,GAAC9K,GAAAA,CAAAA,EAAA,KAGD,KACA,IAAAyM,EAAA,MAGA7K,YAAAwF,CAAA,CAAAjB,CAAA,EACA,KAAAiB,OAAA,CAAAA,EACA,KAAAjB,UAAA,CAAAA,CACA,CACA,CAEAsG,CAAAA,EAAAC,GAAA,KAAAD,EAAA,KAEAA,EAAAjI,MAAA,KAAAiI,EAAA,KAEAA,EAAAhI,QAAA,KAAAgI,EAAA,KAEAA,EAAA/H,IAAA,KAAA+H,EAAA,KAEAE,EAAApI,GAAA,CAAAkI,CACA,GAAG1M,CArBHA,EAsBCC,GAAAA,CAAAA,EAAA,KADE6K,MAAA,EAAA9K,CAAAA,EAAA8K,MAAA,MAIH,KACA,IAAA+B,EAAA,MAEAhL,YAAAkD,CAAA,CAAA+H,CAAA,EACA,KAAA/H,QAAA,CAAAA,EACA,KAAA+H,gBAAA,CAAAA,CACA,CAIA7H,iBAAAiC,CAAA,EACA,YAAA4F,gBAAA,CAAA1H,KAAAqB,KAAA,EAAAS,EAAA,QAEA,CAEA2F,CAAAA,EAAArB,OAAA,KAAAqB,EAAA,cACAA,EAAAf,YAAA,KAAAe,EAAA,aACAA,EAAA3B,IAAA,KAAA2B,EAAA,aACAA,EAAAE,KAAA,KAAAF,EAAA,aACAA,EAAAX,GAAA,KAAAW,EAAA,WAEAG,EAAA/B,IAAA,CAAA4B,CACA,GAAG7M,CAxBHA,EAyBCC,GAAAA,CAAAA,EAAA,KADEuD,SAAA,EAAAxD,CAAAA,EAAAwD,SAAA,MAEH,IAAAyJ,EAAAhN,EAQAiN,EAAA,CACAC,EAAAF,EAAAnC,MAAA,CAAAtG,GAAA,CAAAmI,GAAA,CACAS,EAAAH,EAAAnC,MAAA,CAAAtG,GAAA,CAAAC,MAAA,CACA4I,EAAAJ,EAAAnC,MAAA,CAAAtG,GAAA,CAAAE,QAAA,CACA4I,EAAAL,EAAAnC,MAAA,CAAAtG,GAAA,CAAAG,IAAA,EAIA4I,EAAA,UACAC,EAAA,UAMA,SAAAC,EAAA/Q,CAAA,CAAAgR,EAAA,GACA,IAAAC,EAAA,GA6BA,OA5BAjR,EAAA6I,OAAA,UAAAjD,CAAA,CAAAoD,CAAA,EACA,IAAAkI,EAAA,KACAtL,EAAAiD,OAAA,UAAAsI,CAAA,CAAApI,CAAA,EACA,IAAAoI,GAAAD,OAAAA,EAAA,CACAD,EAAAtO,IAAA,CACA,IAAcuO,EAAAF,EAAA,CAAgB,EAAEhI,EAAAgI,EAAW,GAAGjI,EAAAmI,EAAU,KAAKA,EAAAF,EAAe,IAE5EE,EAAA,KACA,MACA,CACA,GAAAnI,IAAAnD,EAAAhD,MAAA,IACA,IAAAuO,EACA,MAEAD,QAAAA,EACAD,EAAAtO,IAAA,KAAuBoG,EAAAiI,EAAW,GAAGhI,EAAAgI,EAAA,MAAY,EAAOjI,EAAAiI,EAAW,IAEnEC,EAAAtO,IAAA,CACA,IAAgBuO,EAAAF,EAAe,GAAGhI,EAAAgI,EAAA,EAAY,EAAGjI,EAAA,EAAAmI,EAAc,KAAKA,EAAAF,EAAe,IAGnF,MACA,CACAG,GAAAD,OAAAA,GACAA,CAAAA,EAAAnI,CAAAA,CAEA,EACA,GACAkI,EAAAG,IAAA,IACA,CACA,SAAAC,EAAArR,CAAA,CAAAsR,CAAA,EACA,OAAAtR,EAAA8F,KAAA,GAAAjD,GAAA,EAAA+C,EAAAoD,IACA,EAAAsI,EAAAtI,CAAA,EAAAA,GAAAsI,EAAAtI,CAAA,CAAAsI,EAAAC,CAAA,CACA3L,EAEAA,EAAA/C,GAAA,EAAAsO,EAAApI,IACA,CAAAA,EAAAuI,EAAAvI,CAAA,EAAAA,GAAAuI,EAAAvI,CAAA,CAAAuI,EAAAE,CAAA,GACAL,GAKA,CA8BA,SAAAM,EAAA,CACArN,MAAAA,CAAA,CACAsN,MAAAA,CAAA,CACArK,WAAAA,CAAA,CACAsK,cAAAA,CAAA,CACAC,WAAAA,CAAA,CACAC,cAAAA,CAAA,CACAlM,KAAAA,CAAA,CACAmM,WAAAA,CAAA,CACC,EACD,IAAAC,EAAeC,EAAAC,OAAa,MAE5B,IAAAC,EAAAC,CADAC,MAAAC,OAAA,CAAAjO,GAAAA,EAAA,CAAAA,EAAA,EACAuI,MAAA,EAAA2F,EAAAC,KACAD,EAAA3P,IAAA,IAAA4N,EAAAzJ,SAAA,CAAAC,YAAA,CAAAwL,IACAD,GACK,IACL,OAAA/B,EAAAnC,MAAA,CAAApH,cAAA,CACAkL,EACA1B,CAAA,CAAAkB,EAAA,CACArK,EACA,OACA,OACAyK,EAEA,EAAG,CAAA1N,EAAAsN,EAAArK,EAAAyK,EAAA,EACH,CAAUU,MAAAA,CAAA,CAAAxB,OAAAA,CAAA,CAAAyB,SAAAA,CAAA,CAAAC,wBAAAA,CAAA,EAAqDV,EAAAC,OAAa,MAC5E,IAAAU,EAAAZ,EAAA9I,UAAA,GACA2J,EAhCA,MAgCAhB,EA/BAlJ,KAAAyB,GAAA,CAAAzB,KAAAqB,KAAA,CA+BA6H,GA/BA,GAEAD,EA3EA,EACA,EAwGAkB,EAAAF,EAAA/P,MAAA,CAAAgQ,EAAAA,EACAE,EAAAC,SA1DAP,CAAA,CAAA7M,CAAA,CAAAqL,CAAA,CAAAa,CAAA,EACA,GAAAA,MAAAA,EACA,YAEA,IAAAY,EAAAD,EAAA5P,MAAA,CAAAoO,EAAAA,EACAgC,EAAAtK,KAAAqB,KAAA,CAAApE,GAAAA,GACAsN,EAAAR,EAAA9M,EACA6L,EAAA,CAAAK,EAAAqB,KAAA,EAAAF,CAAA,EAAAC,EACA1B,EAAA,CAAAM,EAAAsB,MAAA,EAAAH,CAAA,EAAAC,EACAlK,EAAA8I,MAAAA,EAAA9I,CAAA,CAAAyJ,EAAA5P,MAAA,GAAA4O,EAAA,EAAAK,EAAA9I,CAAA,CAAAkK,EACAjK,EAAA6I,MAAAA,EAAA7I,CAAA,CAAAwJ,EAAA5P,MAAA,GAAA2O,EAAA,EAAAM,EAAA7I,CAAA,CAAAiK,EACAG,EAAAvB,MAAAA,EAAAuB,OAAA,GAAAvB,EAAAuB,OAAA,CACA9B,EAAA,KACA,GAAAO,EAAAwB,QAAA,EACA,IAAAC,EAAA5K,KAAAqB,KAAA,CAAAhB,GACAwK,EAAA7K,KAAAqB,KAAA,CAAAf,GAGAsI,EAAA,CAAmBvI,EAAAuK,EAAAtK,EAAAuK,EAAA/B,EAFnB9I,KAAAoE,IAAA,CAAA0E,EAAAzI,EAAAuK,GAEmB/B,EADnB7I,KAAAoE,IAAA,CAAAyE,EAAAvI,EAAAuK,EACmB,CACnB,CAEA,OAAWxK,EAAAA,EAAAC,EAAAA,EAAAuI,EAAAA,EAAAC,EAAAA,EAAAF,WAAAA,EAAA8B,QAAAA,EAAAI,YADX3B,EAAA2B,WAAA,CAEA,EAqCAb,EACAhN,EACAiN,EACAf,GAEA,OACAW,MAAAG,EACA3B,OAAA4B,EACAH,SAAAI,EACAH,wBAAAI,CACA,CACA,EAAG,CAAAf,EAAApM,EAAAkM,EAAAF,EAAAC,EAAA,EACH,OACAG,OAAAA,EACAf,OAAAA,EACAwB,MAAAA,EACAC,SAAAA,EACAC,wBAAAA,CACA,CACA,CACA,IAAAe,EAAA,WACA,IACA,IAAAC,SAAAC,OAAA,KAAAD,OACA,CAAI,MAAAE,EAAA,CACJ,QACA,CACA,QACA,GAsIAC,CArImB7B,EAAA8B,UAAgB,CACnC,SAAAtS,CAAA,CAAAuS,CAAA,EACA,IACA3P,MAAAA,CAAA,CACAuB,KAAAA,EAjJA,GAiJA,CACA+L,MAAAA,EAjJA,GAiJA,CACAsC,QAAAA,EAAAnD,CAAA,CACAoD,QAAAA,EAAAnD,CAAA,CACAa,cAAAA,EAjJA,EAiJA,CACAtK,WAAAA,EAjJA,CAiJA,CACAyK,WAAAA,CAAA,CACAF,WAAAA,CAAA,CACAC,cAAAA,CAAA,CACA,CAXArQ,EAWM0S,EAAArP,EAXNrD,EAWM,CACN,QACA,OACA,QACA,UACA,UACA,gBACA,aACA,aACA,aACA,gBACA,EACA,CAA6B2S,MAAAA,CAAA,EAA7BD,EAAqCE,EAAAvP,EAArCqP,EAAqC,WACrCG,EAAAxC,MAAAA,EAAA,OAAAA,EAAAyC,GAAA,CACAC,EAAoBvC,EAAAwC,MAAY,OAChCC,EAAmBzC,EAAAwC,MAAY,OAC/BE,EAAyB1C,EAAA2C,WAAiB,CAC1C,IACAJ,EAAAK,OAAA,CAAAC,EACA,mBAAAd,EACAA,EAAAc,GACUd,GACVA,CAAAA,EAAAa,OAAA,CAAAC,CAAA,CAEA,EACA,CAAAd,EAAA,EAEA,CAAAe,EAAAC,EAAA,CAA4C/C,EAAAgD,QAAc,KAC1D,CAAYhE,OAAAA,CAAA,CAAAwB,MAAAA,CAAA,CAAAC,SAAAA,CAAA,CAAAC,wBAAAA,CAAA,EAAmDjB,EAAA,CAC/DrN,MAAAA,EACAsN,MAAAA,EACArK,WAAAA,EACAyK,WAAAA,EACAH,cAAAA,EACAC,WAAAA,EACAC,cAAAA,EACAlM,KAAAA,CACA,GACIqM,EAAAiD,SAAe,MACnB,GAAAV,MAAAA,EAAAK,OAAA,EACA,IAAAM,EAAAX,EAAAK,OAAA,CACAO,EAAAD,EAAAE,UAAA,OACA,IAAAD,EACA,OAEA,IAAAE,EAAA7C,EACA8C,EAAAb,EAAAG,OAAA,CACAW,EAAA7C,MAAAA,GAAA4C,OAAAA,GAAAA,EAAAE,QAAA,EAAAF,IAAAA,EAAAG,aAAA,EAAAH,IAAAA,EAAAI,YAAA,CACAH,GACA7C,MAAAA,EAAApB,UAAA,EACA+D,CAAAA,EAAAhE,EACAmB,EACAE,EAAApB,UAAA,CACA,EAGA,IAAAqE,EAAApV,OAAAqV,gBAAA,GACAV,CAAAA,EAAA/B,MAAA,CAAA+B,EAAAhC,KAAA,CAAAvN,EAAAgQ,EACA,IAAA1C,EAAAtN,EAAA8M,EAAAkD,EACAR,EAAAlC,KAAA,CAAAA,EAAAA,GACAkC,EAAAU,SAAA,CAAA7B,EACAmB,EAAAW,QAAA,KAAArD,EAAAA,GACA0C,EAAAU,SAAA,CAAA5B,EACAR,EACA0B,EAAAY,IAAA,KAAArC,OAAA3C,EAAAsE,EAAArE,KAEAwB,EAAA3J,OAAA,UAAAjD,CAAA,CAAAoQ,CAAA,EACApQ,EAAAiD,OAAA,UAAAsI,CAAA,CAAA8E,CAAA,EACA9E,GACAgE,EAAAW,QAAA,CAAAG,EAAAjF,EAAAgF,EAAAhF,EAAA,IAEA,EACA,GAEA0B,GACAyC,CAAAA,EAAAe,WAAA,CAAAxD,EAAAU,OAAA,EAEAmC,GACAJ,EAAAgB,SAAA,CACAb,EACA5C,EAAA3J,CAAA,CAAAiI,EACA0B,EAAA1J,CAAA,CAAAgI,EACA0B,EAAAlB,CAAA,CACAkB,EAAAnB,CAAA,CAGA,CACA,GACIS,EAAAiD,SAAe,MACnBF,EAAA,GACA,EAAK,CAAAV,EAAA,EACL,IAAA+B,EAAA5R,EAAA,CAAyC2O,OAAAxN,EAAAuN,MAAAvN,CAAA,EAA2BwO,GACpEkC,EAAA,KAgBA,OAfA,MAAAhC,GACAgC,CAAAA,EAA4BrE,EAAAsE,aAAmB,CAC/C,MACA,CACAhC,IAAAD,EACA5R,IAAA4R,EACAF,MAAA,CAAmBoC,QAAA,QACnBC,OAAA,KACAzB,EAAA,GACA,EACA0B,IAAAhC,EACAjB,YAAAd,MAAAA,EAAA,OAAAA,EAAAc,WAAA,EAEA,EAE2BxB,EAAAsE,aAAmB,CAACtE,EAAAnQ,QAAc,MAAwBmQ,EAAAsE,aAAmB,CACxG,SACA9R,EAAA,CACA2P,MAAAiC,EACAjD,OAAAxN,EACAuN,MAAAvN,EACA8Q,IAAA/B,EACAgC,KAAA,KACA,EAAOtC,IACPiC,EACA,GAEAnU,WAAA,gBACA,IAAAyU,EAAgB3E,EAAA8B,UAAgB,CAChC,SAAAtS,CAAA,CAAAuS,CAAA,EACA,IACA3P,MAAAA,CAAA,CACAuB,KAAAA,EAvRA,GAuRA,CACA+L,MAAAA,EAvRA,GAuRA,CACAsC,QAAAA,EAAAnD,CAAA,CACAoD,QAAAA,EAAAnD,CAAA,CACAa,cAAAA,EAvRA,EAuRA,CACAtK,WAAAA,EAvRA,CAuRA,CACAyK,WAAAA,CAAA,CACA8E,MAAAA,CAAA,CACAhF,WAAAA,CAAA,CACAC,cAAAA,CAAA,CACA,CAZArQ,EAYM4S,EAAAvP,EAZNrD,EAYM,CACN,QACA,OACA,QACA,UACA,UACA,gBACA,aACA,aACA,QACA,aACA,gBACA,EACA,CAAYwP,OAAAA,CAAA,CAAAwB,MAAAA,CAAA,CAAAC,SAAAA,CAAA,CAAAC,wBAAAA,CAAA,EAAmDjB,EAAA,CAC/DrN,MAAAA,EACAsN,MAAAA,EACArK,WAAAA,EACAyK,WAAAA,EACAH,cAAAA,EACAC,WAAAA,EACAC,cAAAA,EACAlM,KAAAA,CACA,GACA0P,EAAA7C,EACA8C,EAAA,IACA,OAAAzD,GAAAa,MAAAA,IACA,MAAAA,EAAApB,UAAA,EACA+D,CAAAA,EAAAhE,EACAmB,EACAE,EAAApB,UAAA,CACA,EAEAgE,EAA8BtD,EAAAsE,aAAmB,CACjD,QACA,CACAtT,KAAA6O,EAAAyC,GAAA,CACAnB,OAAAT,EAAAnB,CAAA,CACA2B,MAAAR,EAAAlB,CAAA,CACAzI,EAAA2J,EAAA3J,CAAA,CAAAiI,EACAhI,EAAA0J,EAAA1J,CAAA,CAAAgI,EACA6F,oBAAA,OACAzD,QAAAV,EAAAU,OAAA,CACAI,YAAAd,EAAAc,WAAA,IAIA,IAAAsD,EAAA/F,EAAAsE,EAAArE,GACA,OAA2BgB,EAAAsE,aAAmB,CAC9C,MACA9R,EAAA,CACA2O,OAAAxN,EACAuN,MAAAvN,EACAoR,QAAA,OAAwBtE,EAAA,CAAU,EAAEA,EAAS,EAC7CgE,IAAA1C,EACA2C,KAAA,KACA,EAAOtC,GACP,EAAAwC,GAAiC5E,EAAAsE,aAAmB,cAAAM,GAC9B5E,EAAAsE,aAAmB,CACzC,OACA,CACAP,KAAA/B,EACAgD,EAAA,SAAsBvE,EAAS,GAAGA,EAAS,KAC3CwE,eAAA,YACA,GAEsBjF,EAAAsE,aAAmB,SAAWP,KAAA9B,EAAA+C,EAAAF,EAAAG,eAAA,eACpD3B,EAEA,EAEAqB,CAAAA,EAAAzU,WAAA","sources":["webpack://_N_E/./node_modules/next/dist/api/app-dynamic.js","webpack://_N_E/../../../src/shared/lib/app-dynamic.tsx","webpack://_N_E/../../../../src/shared/lib/lazy-dynamic/dynamic-bailout-to-csr.tsx","webpack://_N_E/../../../../src/shared/lib/lazy-dynamic/loadable.tsx","webpack://_N_E/../../../../src/shared/lib/lazy-dynamic/preload-css.tsx","webpack://_N_E/./node_modules/next/font/google/target.css?3a0d","webpack://_N_E/./node_modules/next/font/google/target.css?242c","webpack://_N_E/./node_modules/next/font/google/target.css?8d5d","webpack://_N_E/./node_modules/next/font/google/target.css?8389","webpack://_N_E/./node_modules/next/font/google/target.css?1aa9","webpack://_N_E/./node_modules/next/font/google/target.css?1f70","webpack://_N_E/./node_modules/next/font/google/target.css?9f57","webpack://_N_E/./node_modules/next/font/google/target.css?2c31","webpack://_N_E/./node_modules/next/font/google/target.css?697b","webpack://_N_E/./node_modules/next/font/google/target.css?7412","webpack://_N_E/./node_modules/next/font/google/target.css?7a51","webpack://_N_E/./node_modules/next/font/google/target.css?99b1","webpack://_N_E/./node_modules/next/font/google/target.css?c192","webpack://_N_E/./node_modules/next/font/google/target.css?698c","webpack://_N_E/./node_modules/next/font/google/target.css?a11f","webpack://_N_E/./node_modules/next/font/local/target.css?373b","webpack://_N_E/./node_modules/qrcode.react/lib/esm/index.js"],"sourcesContent":["export * from \"../shared/lib/app-dynamic\";\nexport { default } from \"../shared/lib/app-dynamic\";\n\n//# sourceMappingURL=app-dynamic.js.map",null,null,null,null,"// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__Inter_d65c78', '__Inter_Fallback_d65c78'\",\"fontStyle\":\"normal\"},\"className\":\"__className_d65c78\"};","// extracted by mini-css-extract-plugin\nmodule.exports = {\"style\":{\"fontFamily\":\"'__montFont_423a27', '__montFont_Fallback_423a27'\"},\"className\":\"__className_423a27\"};","var __defProp = Object.defineProperty;\nvar __getOwnPropSymbols = Object.getOwnPropertySymbols;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __propIsEnum = Object.prototype.propertyIsEnumerable;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __spreadValues = (a, b) => {\n  for (var prop in b || (b = {}))\n    if (__hasOwnProp.call(b, prop))\n      __defNormalProp(a, prop, b[prop]);\n  if (__getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(b)) {\n      if (__propIsEnum.call(b, prop))\n        __defNormalProp(a, prop, b[prop]);\n    }\n  return a;\n};\nvar __objRest = (source, exclude) => {\n  var target = {};\n  for (var prop in source)\n    if (__hasOwnProp.call(source, prop) && exclude.indexOf(prop) < 0)\n      target[prop] = source[prop];\n  if (source != null && __getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(source)) {\n      if (exclude.indexOf(prop) < 0 && __propIsEnum.call(source, prop))\n        target[prop] = source[prop];\n    }\n  return target;\n};\n\n// src/index.tsx\nimport React from \"react\";\n\n// src/third-party/qrcodegen/index.ts\n/**\n * @license QR Code generator library (TypeScript)\n * Copyright (c) Project Nayuki.\n * SPDX-License-Identifier: MIT\n */\nvar qrcodegen;\n((qrcodegen2) => {\n  const _QrCode = class _QrCode {\n    /*-- Constructor (low level) and fields --*/\n    // Creates a new QR Code with the given version number,\n    // error correction level, data codeword bytes, and mask number.\n    // This is a low-level API that most users should not use directly.\n    // A mid-level API is the encodeSegments() function.\n    constructor(version, errorCorrectionLevel, dataCodewords, msk) {\n      this.version = version;\n      this.errorCorrectionLevel = errorCorrectionLevel;\n      // The modules of this QR Code (false = light, true = dark).\n      // Immutable after constructor finishes. Accessed through getModule().\n      this.modules = [];\n      // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.\n      this.isFunction = [];\n      if (version < _QrCode.MIN_VERSION || version > _QrCode.MAX_VERSION)\n        throw new RangeError(\"Version value out of range\");\n      if (msk < -1 || msk > 7)\n        throw new RangeError(\"Mask value out of range\");\n      this.size = version * 4 + 17;\n      let row = [];\n      for (let i = 0; i < this.size; i++)\n        row.push(false);\n      for (let i = 0; i < this.size; i++) {\n        this.modules.push(row.slice());\n        this.isFunction.push(row.slice());\n      }\n      this.drawFunctionPatterns();\n      const allCodewords = this.addEccAndInterleave(dataCodewords);\n      this.drawCodewords(allCodewords);\n      if (msk == -1) {\n        let minPenalty = 1e9;\n        for (let i = 0; i < 8; i++) {\n          this.applyMask(i);\n          this.drawFormatBits(i);\n          const penalty = this.getPenaltyScore();\n          if (penalty < minPenalty) {\n            msk = i;\n            minPenalty = penalty;\n          }\n          this.applyMask(i);\n        }\n      }\n      assert(0 <= msk && msk <= 7);\n      this.mask = msk;\n      this.applyMask(msk);\n      this.drawFormatBits(msk);\n      this.isFunction = [];\n    }\n    /*-- Static factory functions (high level) --*/\n    // Returns a QR Code representing the given Unicode text string at the given error correction level.\n    // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer\n    // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible\n    // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the\n    // ecl argument if it can be done without increasing the version.\n    static encodeText(text, ecl) {\n      const segs = qrcodegen2.QrSegment.makeSegments(text);\n      return _QrCode.encodeSegments(segs, ecl);\n    }\n    // Returns a QR Code representing the given binary data at the given error correction level.\n    // This function always encodes using the binary segment mode, not any text mode. The maximum number of\n    // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.\n    // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.\n    static encodeBinary(data, ecl) {\n      const seg = qrcodegen2.QrSegment.makeBytes(data);\n      return _QrCode.encodeSegments([seg], ecl);\n    }\n    /*-- Static factory functions (mid level) --*/\n    // Returns a QR Code representing the given segments with the given encoding parameters.\n    // The smallest possible QR Code version within the given range is automatically\n    // chosen for the output. Iff boostEcl is true, then the ECC level of the result\n    // may be higher than the ecl argument if it can be done without increasing the\n    // version. The mask number is either between 0 to 7 (inclusive) to force that\n    // mask, or -1 to automatically choose an appropriate mask (which may be slow).\n    // This function allows the user to create a custom sequence of segments that switches\n    // between modes (such as alphanumeric and byte) to encode text in less space.\n    // This is a mid-level API; the high-level API is encodeText() and encodeBinary().\n    static encodeSegments(segs, ecl, minVersion = 1, maxVersion = 40, mask = -1, boostEcl = true) {\n      if (!(_QrCode.MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= _QrCode.MAX_VERSION) || mask < -1 || mask > 7)\n        throw new RangeError(\"Invalid value\");\n      let version;\n      let dataUsedBits;\n      for (version = minVersion; ; version++) {\n        const dataCapacityBits2 = _QrCode.getNumDataCodewords(version, ecl) * 8;\n        const usedBits = QrSegment.getTotalBits(segs, version);\n        if (usedBits <= dataCapacityBits2) {\n          dataUsedBits = usedBits;\n          break;\n        }\n        if (version >= maxVersion)\n          throw new RangeError(\"Data too long\");\n      }\n      for (const newEcl of [_QrCode.Ecc.MEDIUM, _QrCode.Ecc.QUARTILE, _QrCode.Ecc.HIGH]) {\n        if (boostEcl && dataUsedBits <= _QrCode.getNumDataCodewords(version, newEcl) * 8)\n          ecl = newEcl;\n      }\n      let bb = [];\n      for (const seg of segs) {\n        appendBits(seg.mode.modeBits, 4, bb);\n        appendBits(seg.numChars, seg.mode.numCharCountBits(version), bb);\n        for (const b of seg.getData())\n          bb.push(b);\n      }\n      assert(bb.length == dataUsedBits);\n      const dataCapacityBits = _QrCode.getNumDataCodewords(version, ecl) * 8;\n      assert(bb.length <= dataCapacityBits);\n      appendBits(0, Math.min(4, dataCapacityBits - bb.length), bb);\n      appendBits(0, (8 - bb.length % 8) % 8, bb);\n      assert(bb.length % 8 == 0);\n      for (let padByte = 236; bb.length < dataCapacityBits; padByte ^= 236 ^ 17)\n        appendBits(padByte, 8, bb);\n      let dataCodewords = [];\n      while (dataCodewords.length * 8 < bb.length)\n        dataCodewords.push(0);\n      bb.forEach((b, i) => dataCodewords[i >>> 3] |= b << 7 - (i & 7));\n      return new _QrCode(version, ecl, dataCodewords, mask);\n    }\n    /*-- Accessor methods --*/\n    // Returns the color of the module (pixel) at the given coordinates, which is false\n    // for light or true for dark. The top left corner has the coordinates (x=0, y=0).\n    // If the given coordinates are out of bounds, then false (light) is returned.\n    getModule(x, y) {\n      return 0 <= x && x < this.size && 0 <= y && y < this.size && this.modules[y][x];\n    }\n    // Modified to expose modules for easy access\n    getModules() {\n      return this.modules;\n    }\n    /*-- Private helper methods for constructor: Drawing function modules --*/\n    // Reads this object's version field, and draws and marks all function modules.\n    drawFunctionPatterns() {\n      for (let i = 0; i < this.size; i++) {\n        this.setFunctionModule(6, i, i % 2 == 0);\n        this.setFunctionModule(i, 6, i % 2 == 0);\n      }\n      this.drawFinderPattern(3, 3);\n      this.drawFinderPattern(this.size - 4, 3);\n      this.drawFinderPattern(3, this.size - 4);\n      const alignPatPos = this.getAlignmentPatternPositions();\n      const numAlign = alignPatPos.length;\n      for (let i = 0; i < numAlign; i++) {\n        for (let j = 0; j < numAlign; j++) {\n          if (!(i == 0 && j == 0 || i == 0 && j == numAlign - 1 || i == numAlign - 1 && j == 0))\n            this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);\n        }\n      }\n      this.drawFormatBits(0);\n      this.drawVersion();\n    }\n    // Draws two copies of the format bits (with its own error correction code)\n    // based on the given mask and this object's error correction level field.\n    drawFormatBits(mask) {\n      const data = this.errorCorrectionLevel.formatBits << 3 | mask;\n      let rem = data;\n      for (let i = 0; i < 10; i++)\n        rem = rem << 1 ^ (rem >>> 9) * 1335;\n      const bits = (data << 10 | rem) ^ 21522;\n      assert(bits >>> 15 == 0);\n      for (let i = 0; i <= 5; i++)\n        this.setFunctionModule(8, i, getBit(bits, i));\n      this.setFunctionModule(8, 7, getBit(bits, 6));\n      this.setFunctionModule(8, 8, getBit(bits, 7));\n      this.setFunctionModule(7, 8, getBit(bits, 8));\n      for (let i = 9; i < 15; i++)\n        this.setFunctionModule(14 - i, 8, getBit(bits, i));\n      for (let i = 0; i < 8; i++)\n        this.setFunctionModule(this.size - 1 - i, 8, getBit(bits, i));\n      for (let i = 8; i < 15; i++)\n        this.setFunctionModule(8, this.size - 15 + i, getBit(bits, i));\n      this.setFunctionModule(8, this.size - 8, true);\n    }\n    // Draws two copies of the version bits (with its own error correction code),\n    // based on this object's version field, iff 7 <= version <= 40.\n    drawVersion() {\n      if (this.version < 7)\n        return;\n      let rem = this.version;\n      for (let i = 0; i < 12; i++)\n        rem = rem << 1 ^ (rem >>> 11) * 7973;\n      const bits = this.version << 12 | rem;\n      assert(bits >>> 18 == 0);\n      for (let i = 0; i < 18; i++) {\n        const color = getBit(bits, i);\n        const a = this.size - 11 + i % 3;\n        const b = Math.floor(i / 3);\n        this.setFunctionModule(a, b, color);\n        this.setFunctionModule(b, a, color);\n      }\n    }\n    // Draws a 9*9 finder pattern including the border separator,\n    // with the center module at (x, y). Modules can be out of bounds.\n    drawFinderPattern(x, y) {\n      for (let dy = -4; dy <= 4; dy++) {\n        for (let dx = -4; dx <= 4; dx++) {\n          const dist = Math.max(Math.abs(dx), Math.abs(dy));\n          const xx = x + dx;\n          const yy = y + dy;\n          if (0 <= xx && xx < this.size && 0 <= yy && yy < this.size)\n            this.setFunctionModule(xx, yy, dist != 2 && dist != 4);\n        }\n      }\n    }\n    // Draws a 5*5 alignment pattern, with the center module\n    // at (x, y). All modules must be in bounds.\n    drawAlignmentPattern(x, y) {\n      for (let dy = -2; dy <= 2; dy++) {\n        for (let dx = -2; dx <= 2; dx++)\n          this.setFunctionModule(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) != 1);\n      }\n    }\n    // Sets the color of a module and marks it as a function module.\n    // Only used by the constructor. Coordinates must be in bounds.\n    setFunctionModule(x, y, isDark) {\n      this.modules[y][x] = isDark;\n      this.isFunction[y][x] = true;\n    }\n    /*-- Private helper methods for constructor: Codewords and masking --*/\n    // Returns a new byte string representing the given data with the appropriate error correction\n    // codewords appended to it, based on this object's version and error correction level.\n    addEccAndInterleave(data) {\n      const ver = this.version;\n      const ecl = this.errorCorrectionLevel;\n      if (data.length != _QrCode.getNumDataCodewords(ver, ecl))\n        throw new RangeError(\"Invalid argument\");\n      const numBlocks = _QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\n      const blockEccLen = _QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver];\n      const rawCodewords = Math.floor(_QrCode.getNumRawDataModules(ver) / 8);\n      const numShortBlocks = numBlocks - rawCodewords % numBlocks;\n      const shortBlockLen = Math.floor(rawCodewords / numBlocks);\n      let blocks = [];\n      const rsDiv = _QrCode.reedSolomonComputeDivisor(blockEccLen);\n      for (let i = 0, k = 0; i < numBlocks; i++) {\n        let dat = data.slice(k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1));\n        k += dat.length;\n        const ecc = _QrCode.reedSolomonComputeRemainder(dat, rsDiv);\n        if (i < numShortBlocks)\n          dat.push(0);\n        blocks.push(dat.concat(ecc));\n      }\n      let result = [];\n      for (let i = 0; i < blocks[0].length; i++) {\n        blocks.forEach((block, j) => {\n          if (i != shortBlockLen - blockEccLen || j >= numShortBlocks)\n            result.push(block[i]);\n        });\n      }\n      assert(result.length == rawCodewords);\n      return result;\n    }\n    // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire\n    // data area of this QR Code. Function modules need to be marked off before this is called.\n    drawCodewords(data) {\n      if (data.length != Math.floor(_QrCode.getNumRawDataModules(this.version) / 8))\n        throw new RangeError(\"Invalid argument\");\n      let i = 0;\n      for (let right = this.size - 1; right >= 1; right -= 2) {\n        if (right == 6)\n          right = 5;\n        for (let vert = 0; vert < this.size; vert++) {\n          for (let j = 0; j < 2; j++) {\n            const x = right - j;\n            const upward = (right + 1 & 2) == 0;\n            const y = upward ? this.size - 1 - vert : vert;\n            if (!this.isFunction[y][x] && i < data.length * 8) {\n              this.modules[y][x] = getBit(data[i >>> 3], 7 - (i & 7));\n              i++;\n            }\n          }\n        }\n      }\n      assert(i == data.length * 8);\n    }\n    // XORs the codeword modules in this QR Code with the given mask pattern.\n    // The function modules must be marked and the codeword bits must be drawn\n    // before masking. Due to the arithmetic of XOR, calling applyMask() with\n    // the same mask value a second time will undo the mask. A final well-formed\n    // QR Code needs exactly one (not zero, two, etc.) mask applied.\n    applyMask(mask) {\n      if (mask < 0 || mask > 7)\n        throw new RangeError(\"Mask value out of range\");\n      for (let y = 0; y < this.size; y++) {\n        for (let x = 0; x < this.size; x++) {\n          let invert;\n          switch (mask) {\n            case 0:\n              invert = (x + y) % 2 == 0;\n              break;\n            case 1:\n              invert = y % 2 == 0;\n              break;\n            case 2:\n              invert = x % 3 == 0;\n              break;\n            case 3:\n              invert = (x + y) % 3 == 0;\n              break;\n            case 4:\n              invert = (Math.floor(x / 3) + Math.floor(y / 2)) % 2 == 0;\n              break;\n            case 5:\n              invert = x * y % 2 + x * y % 3 == 0;\n              break;\n            case 6:\n              invert = (x * y % 2 + x * y % 3) % 2 == 0;\n              break;\n            case 7:\n              invert = ((x + y) % 2 + x * y % 3) % 2 == 0;\n              break;\n            default:\n              throw new Error(\"Unreachable\");\n          }\n          if (!this.isFunction[y][x] && invert)\n            this.modules[y][x] = !this.modules[y][x];\n        }\n      }\n    }\n    // Calculates and returns the penalty score based on state of this QR Code's current modules.\n    // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.\n    getPenaltyScore() {\n      let result = 0;\n      for (let y = 0; y < this.size; y++) {\n        let runColor = false;\n        let runX = 0;\n        let runHistory = [0, 0, 0, 0, 0, 0, 0];\n        for (let x = 0; x < this.size; x++) {\n          if (this.modules[y][x] == runColor) {\n            runX++;\n            if (runX == 5)\n              result += _QrCode.PENALTY_N1;\n            else if (runX > 5)\n              result++;\n          } else {\n            this.finderPenaltyAddHistory(runX, runHistory);\n            if (!runColor)\n              result += this.finderPenaltyCountPatterns(runHistory) * _QrCode.PENALTY_N3;\n            runColor = this.modules[y][x];\n            runX = 1;\n          }\n        }\n        result += this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) * _QrCode.PENALTY_N3;\n      }\n      for (let x = 0; x < this.size; x++) {\n        let runColor = false;\n        let runY = 0;\n        let runHistory = [0, 0, 0, 0, 0, 0, 0];\n        for (let y = 0; y < this.size; y++) {\n          if (this.modules[y][x] == runColor) {\n            runY++;\n            if (runY == 5)\n              result += _QrCode.PENALTY_N1;\n            else if (runY > 5)\n              result++;\n          } else {\n            this.finderPenaltyAddHistory(runY, runHistory);\n            if (!runColor)\n              result += this.finderPenaltyCountPatterns(runHistory) * _QrCode.PENALTY_N3;\n            runColor = this.modules[y][x];\n            runY = 1;\n          }\n        }\n        result += this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) * _QrCode.PENALTY_N3;\n      }\n      for (let y = 0; y < this.size - 1; y++) {\n        for (let x = 0; x < this.size - 1; x++) {\n          const color = this.modules[y][x];\n          if (color == this.modules[y][x + 1] && color == this.modules[y + 1][x] && color == this.modules[y + 1][x + 1])\n            result += _QrCode.PENALTY_N2;\n        }\n      }\n      let dark = 0;\n      for (const row of this.modules)\n        dark = row.reduce((sum, color) => sum + (color ? 1 : 0), dark);\n      const total = this.size * this.size;\n      const k = Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1;\n      assert(0 <= k && k <= 9);\n      result += k * _QrCode.PENALTY_N4;\n      assert(0 <= result && result <= 2568888);\n      return result;\n    }\n    /*-- Private helper functions --*/\n    // Returns an ascending list of positions of alignment patterns for this version number.\n    // Each position is in the range [0,177), and are used on both the x and y axes.\n    // This could be implemented as lookup table of 40 variable-length lists of integers.\n    getAlignmentPatternPositions() {\n      if (this.version == 1)\n        return [];\n      else {\n        const numAlign = Math.floor(this.version / 7) + 2;\n        const step = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (numAlign * 2 - 2)) * 2;\n        let result = [6];\n        for (let pos = this.size - 7; result.length < numAlign; pos -= step)\n          result.splice(1, 0, pos);\n        return result;\n      }\n    }\n    // Returns the number of data bits that can be stored in a QR Code of the given version number, after\n    // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.\n    // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.\n    static getNumRawDataModules(ver) {\n      if (ver < _QrCode.MIN_VERSION || ver > _QrCode.MAX_VERSION)\n        throw new RangeError(\"Version number out of range\");\n      let result = (16 * ver + 128) * ver + 64;\n      if (ver >= 2) {\n        const numAlign = Math.floor(ver / 7) + 2;\n        result -= (25 * numAlign - 10) * numAlign - 55;\n        if (ver >= 7)\n          result -= 36;\n      }\n      assert(208 <= result && result <= 29648);\n      return result;\n    }\n    // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any\n    // QR Code of the given version number and error correction level, with remainder bits discarded.\n    // This stateless pure function could be implemented as a (40*4)-cell lookup table.\n    static getNumDataCodewords(ver, ecl) {\n      return Math.floor(_QrCode.getNumRawDataModules(ver) / 8) - _QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] * _QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\n    }\n    // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be\n    // implemented as a lookup table over all possible parameter values, instead of as an algorithm.\n    static reedSolomonComputeDivisor(degree) {\n      if (degree < 1 || degree > 255)\n        throw new RangeError(\"Degree out of range\");\n      let result = [];\n      for (let i = 0; i < degree - 1; i++)\n        result.push(0);\n      result.push(1);\n      let root = 1;\n      for (let i = 0; i < degree; i++) {\n        for (let j = 0; j < result.length; j++) {\n          result[j] = _QrCode.reedSolomonMultiply(result[j], root);\n          if (j + 1 < result.length)\n            result[j] ^= result[j + 1];\n        }\n        root = _QrCode.reedSolomonMultiply(root, 2);\n      }\n      return result;\n    }\n    // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.\n    static reedSolomonComputeRemainder(data, divisor) {\n      let result = divisor.map((_) => 0);\n      for (const b of data) {\n        const factor = b ^ result.shift();\n        result.push(0);\n        divisor.forEach((coef, i) => result[i] ^= _QrCode.reedSolomonMultiply(coef, factor));\n      }\n      return result;\n    }\n    // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result\n    // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.\n    static reedSolomonMultiply(x, y) {\n      if (x >>> 8 != 0 || y >>> 8 != 0)\n        throw new RangeError(\"Byte out of range\");\n      let z = 0;\n      for (let i = 7; i >= 0; i--) {\n        z = z << 1 ^ (z >>> 7) * 285;\n        z ^= (y >>> i & 1) * x;\n      }\n      assert(z >>> 8 == 0);\n      return z;\n    }\n    // Can only be called immediately after a light run is added, and\n    // returns either 0, 1, or 2. A helper function for getPenaltyScore().\n    finderPenaltyCountPatterns(runHistory) {\n      const n = runHistory[1];\n      assert(n <= this.size * 3);\n      const core = n > 0 && runHistory[2] == n && runHistory[3] == n * 3 && runHistory[4] == n && runHistory[5] == n;\n      return (core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0) + (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0);\n    }\n    // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().\n    finderPenaltyTerminateAndCount(currentRunColor, currentRunLength, runHistory) {\n      if (currentRunColor) {\n        this.finderPenaltyAddHistory(currentRunLength, runHistory);\n        currentRunLength = 0;\n      }\n      currentRunLength += this.size;\n      this.finderPenaltyAddHistory(currentRunLength, runHistory);\n      return this.finderPenaltyCountPatterns(runHistory);\n    }\n    // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().\n    finderPenaltyAddHistory(currentRunLength, runHistory) {\n      if (runHistory[0] == 0)\n        currentRunLength += this.size;\n      runHistory.pop();\n      runHistory.unshift(currentRunLength);\n    }\n  };\n  /*-- Constants and tables --*/\n  // The minimum version number supported in the QR Code Model 2 standard.\n  _QrCode.MIN_VERSION = 1;\n  // The maximum version number supported in the QR Code Model 2 standard.\n  _QrCode.MAX_VERSION = 40;\n  // For use in getPenaltyScore(), when evaluating which mask is best.\n  _QrCode.PENALTY_N1 = 3;\n  _QrCode.PENALTY_N2 = 3;\n  _QrCode.PENALTY_N3 = 40;\n  _QrCode.PENALTY_N4 = 10;\n  _QrCode.ECC_CODEWORDS_PER_BLOCK = [\n    // Version: (note that index 0 is for padding, and is set to an illegal value)\n    //0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level\n    [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n    // Low\n    [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],\n    // Medium\n    [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n    // Quartile\n    [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]\n    // High\n  ];\n  _QrCode.NUM_ERROR_CORRECTION_BLOCKS = [\n    // Version: (note that index 0 is for padding, and is set to an illegal value)\n    //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level\n    [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],\n    // Low\n    [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],\n    // Medium\n    [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],\n    // Quartile\n    [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]\n    // High\n  ];\n  let QrCode = _QrCode;\n  qrcodegen2.QrCode = _QrCode;\n  function appendBits(val, len, bb) {\n    if (len < 0 || len > 31 || val >>> len != 0)\n      throw new RangeError(\"Value out of range\");\n    for (let i = len - 1; i >= 0; i--)\n      bb.push(val >>> i & 1);\n  }\n  function getBit(x, i) {\n    return (x >>> i & 1) != 0;\n  }\n  function assert(cond) {\n    if (!cond)\n      throw new Error(\"Assertion error\");\n  }\n  const _QrSegment = class _QrSegment {\n    /*-- Constructor (low level) and fields --*/\n    // Creates a new QR Code segment with the given attributes and data.\n    // The character count (numChars) must agree with the mode and the bit buffer length,\n    // but the constraint isn't checked. The given bit buffer is cloned and stored.\n    constructor(mode, numChars, bitData) {\n      this.mode = mode;\n      this.numChars = numChars;\n      this.bitData = bitData;\n      if (numChars < 0)\n        throw new RangeError(\"Invalid argument\");\n      this.bitData = bitData.slice();\n    }\n    /*-- Static factory functions (mid level) --*/\n    // Returns a segment representing the given binary data encoded in\n    // byte mode. All input byte arrays are acceptable. Any text string\n    // can be converted to UTF-8 bytes and encoded as a byte mode segment.\n    static makeBytes(data) {\n      let bb = [];\n      for (const b of data)\n        appendBits(b, 8, bb);\n      return new _QrSegment(_QrSegment.Mode.BYTE, data.length, bb);\n    }\n    // Returns a segment representing the given string of decimal digits encoded in numeric mode.\n    static makeNumeric(digits) {\n      if (!_QrSegment.isNumeric(digits))\n        throw new RangeError(\"String contains non-numeric characters\");\n      let bb = [];\n      for (let i = 0; i < digits.length; ) {\n        const n = Math.min(digits.length - i, 3);\n        appendBits(parseInt(digits.substring(i, i + n), 10), n * 3 + 1, bb);\n        i += n;\n      }\n      return new _QrSegment(_QrSegment.Mode.NUMERIC, digits.length, bb);\n    }\n    // Returns a segment representing the given text string encoded in alphanumeric mode.\n    // The characters allowed are: 0 to 9, A to Z (uppercase only), space,\n    // dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n    static makeAlphanumeric(text) {\n      if (!_QrSegment.isAlphanumeric(text))\n        throw new RangeError(\"String contains unencodable characters in alphanumeric mode\");\n      let bb = [];\n      let i;\n      for (i = 0; i + 2 <= text.length; i += 2) {\n        let temp = _QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45;\n        temp += _QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1));\n        appendBits(temp, 11, bb);\n      }\n      if (i < text.length)\n        appendBits(_QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6, bb);\n      return new _QrSegment(_QrSegment.Mode.ALPHANUMERIC, text.length, bb);\n    }\n    // Returns a new mutable list of zero or more segments to represent the given Unicode text string.\n    // The result may use various segment modes and switch modes to optimize the length of the bit stream.\n    static makeSegments(text) {\n      if (text == \"\")\n        return [];\n      else if (_QrSegment.isNumeric(text))\n        return [_QrSegment.makeNumeric(text)];\n      else if (_QrSegment.isAlphanumeric(text))\n        return [_QrSegment.makeAlphanumeric(text)];\n      else\n        return [_QrSegment.makeBytes(_QrSegment.toUtf8ByteArray(text))];\n    }\n    // Returns a segment representing an Extended Channel Interpretation\n    // (ECI) designator with the given assignment value.\n    static makeEci(assignVal) {\n      let bb = [];\n      if (assignVal < 0)\n        throw new RangeError(\"ECI assignment value out of range\");\n      else if (assignVal < 1 << 7)\n        appendBits(assignVal, 8, bb);\n      else if (assignVal < 1 << 14) {\n        appendBits(2, 2, bb);\n        appendBits(assignVal, 14, bb);\n      } else if (assignVal < 1e6) {\n        appendBits(6, 3, bb);\n        appendBits(assignVal, 21, bb);\n      } else\n        throw new RangeError(\"ECI assignment value out of range\");\n      return new _QrSegment(_QrSegment.Mode.ECI, 0, bb);\n    }\n    // Tests whether the given string can be encoded as a segment in numeric mode.\n    // A string is encodable iff each character is in the range 0 to 9.\n    static isNumeric(text) {\n      return _QrSegment.NUMERIC_REGEX.test(text);\n    }\n    // Tests whether the given string can be encoded as a segment in alphanumeric mode.\n    // A string is encodable iff each character is in the following set: 0 to 9, A to Z\n    // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n    static isAlphanumeric(text) {\n      return _QrSegment.ALPHANUMERIC_REGEX.test(text);\n    }\n    /*-- Methods --*/\n    // Returns a new copy of the data bits of this segment.\n    getData() {\n      return this.bitData.slice();\n    }\n    // (Package-private) Calculates and returns the number of bits needed to encode the given segments at\n    // the given version. The result is infinity if a segment has too many characters to fit its length field.\n    static getTotalBits(segs, version) {\n      let result = 0;\n      for (const seg of segs) {\n        const ccbits = seg.mode.numCharCountBits(version);\n        if (seg.numChars >= 1 << ccbits)\n          return Infinity;\n        result += 4 + ccbits + seg.bitData.length;\n      }\n      return result;\n    }\n    // Returns a new array of bytes representing the given string encoded in UTF-8.\n    static toUtf8ByteArray(str) {\n      str = encodeURI(str);\n      let result = [];\n      for (let i = 0; i < str.length; i++) {\n        if (str.charAt(i) != \"%\")\n          result.push(str.charCodeAt(i));\n        else {\n          result.push(parseInt(str.substring(i + 1, i + 3), 16));\n          i += 2;\n        }\n      }\n      return result;\n    }\n  };\n  /*-- Constants --*/\n  // Describes precisely all strings that are encodable in numeric mode.\n  _QrSegment.NUMERIC_REGEX = /^[0-9]*$/;\n  // Describes precisely all strings that are encodable in alphanumeric mode.\n  _QrSegment.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\\/:-]*$/;\n  // The set of all legal characters in alphanumeric mode,\n  // where each character value maps to the index in the string.\n  _QrSegment.ALPHANUMERIC_CHARSET = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\";\n  let QrSegment = _QrSegment;\n  qrcodegen2.QrSegment = _QrSegment;\n})(qrcodegen || (qrcodegen = {}));\n((qrcodegen2) => {\n  let QrCode;\n  ((QrCode2) => {\n    const _Ecc = class _Ecc {\n      // The QR Code can tolerate about 30% erroneous codewords\n      /*-- Constructor and fields --*/\n      constructor(ordinal, formatBits) {\n        this.ordinal = ordinal;\n        this.formatBits = formatBits;\n      }\n    };\n    /*-- Constants --*/\n    _Ecc.LOW = new _Ecc(0, 1);\n    // The QR Code can tolerate about  7% erroneous codewords\n    _Ecc.MEDIUM = new _Ecc(1, 0);\n    // The QR Code can tolerate about 15% erroneous codewords\n    _Ecc.QUARTILE = new _Ecc(2, 3);\n    // The QR Code can tolerate about 25% erroneous codewords\n    _Ecc.HIGH = new _Ecc(3, 2);\n    let Ecc = _Ecc;\n    QrCode2.Ecc = _Ecc;\n  })(QrCode = qrcodegen2.QrCode || (qrcodegen2.QrCode = {}));\n})(qrcodegen || (qrcodegen = {}));\n((qrcodegen2) => {\n  let QrSegment;\n  ((QrSegment2) => {\n    const _Mode = class _Mode {\n      /*-- Constructor and fields --*/\n      constructor(modeBits, numBitsCharCount) {\n        this.modeBits = modeBits;\n        this.numBitsCharCount = numBitsCharCount;\n      }\n      /*-- Method --*/\n      // (Package-private) Returns the bit width of the character count field for a segment in\n      // this mode in a QR Code at the given version number. The result is in the range [0, 16].\n      numCharCountBits(ver) {\n        return this.numBitsCharCount[Math.floor((ver + 7) / 17)];\n      }\n    };\n    /*-- Constants --*/\n    _Mode.NUMERIC = new _Mode(1, [10, 12, 14]);\n    _Mode.ALPHANUMERIC = new _Mode(2, [9, 11, 13]);\n    _Mode.BYTE = new _Mode(4, [8, 16, 16]);\n    _Mode.KANJI = new _Mode(8, [8, 10, 12]);\n    _Mode.ECI = new _Mode(7, [0, 0, 0]);\n    let Mode = _Mode;\n    QrSegment2.Mode = _Mode;\n  })(QrSegment = qrcodegen2.QrSegment || (qrcodegen2.QrSegment = {}));\n})(qrcodegen || (qrcodegen = {}));\nvar qrcodegen_default = qrcodegen;\n\n// src/index.tsx\n/**\n * @license qrcode.react\n * Copyright (c) Paul O'Shannessy\n * SPDX-License-Identifier: ISC\n */\nvar ERROR_LEVEL_MAP = {\n  L: qrcodegen_default.QrCode.Ecc.LOW,\n  M: qrcodegen_default.QrCode.Ecc.MEDIUM,\n  Q: qrcodegen_default.QrCode.Ecc.QUARTILE,\n  H: qrcodegen_default.QrCode.Ecc.HIGH\n};\nvar DEFAULT_SIZE = 128;\nvar DEFAULT_LEVEL = \"L\";\nvar DEFAULT_BGCOLOR = \"#FFFFFF\";\nvar DEFAULT_FGCOLOR = \"#000000\";\nvar DEFAULT_INCLUDEMARGIN = false;\nvar DEFAULT_MINVERSION = 1;\nvar SPEC_MARGIN_SIZE = 4;\nvar DEFAULT_MARGIN_SIZE = 0;\nvar DEFAULT_IMG_SCALE = 0.1;\nfunction generatePath(modules, margin = 0) {\n  const ops = [];\n  modules.forEach(function(row, y) {\n    let start = null;\n    row.forEach(function(cell, x) {\n      if (!cell && start !== null) {\n        ops.push(\n          `M${start + margin} ${y + margin}h${x - start}v1H${start + margin}z`\n        );\n        start = null;\n        return;\n      }\n      if (x === row.length - 1) {\n        if (!cell) {\n          return;\n        }\n        if (start === null) {\n          ops.push(`M${x + margin},${y + margin} h1v1H${x + margin}z`);\n        } else {\n          ops.push(\n            `M${start + margin},${y + margin} h${x + 1 - start}v1H${start + margin}z`\n          );\n        }\n        return;\n      }\n      if (cell && start === null) {\n        start = x;\n      }\n    });\n  });\n  return ops.join(\"\");\n}\nfunction excavateModules(modules, excavation) {\n  return modules.slice().map((row, y) => {\n    if (y < excavation.y || y >= excavation.y + excavation.h) {\n      return row;\n    }\n    return row.map((cell, x) => {\n      if (x < excavation.x || x >= excavation.x + excavation.w) {\n        return cell;\n      }\n      return false;\n    });\n  });\n}\nfunction getImageSettings(cells, size, margin, imageSettings) {\n  if (imageSettings == null) {\n    return null;\n  }\n  const numCells = cells.length + margin * 2;\n  const defaultSize = Math.floor(size * DEFAULT_IMG_SCALE);\n  const scale = numCells / size;\n  const w = (imageSettings.width || defaultSize) * scale;\n  const h = (imageSettings.height || defaultSize) * scale;\n  const x = imageSettings.x == null ? cells.length / 2 - w / 2 : imageSettings.x * scale;\n  const y = imageSettings.y == null ? cells.length / 2 - h / 2 : imageSettings.y * scale;\n  const opacity = imageSettings.opacity == null ? 1 : imageSettings.opacity;\n  let excavation = null;\n  if (imageSettings.excavate) {\n    let floorX = Math.floor(x);\n    let floorY = Math.floor(y);\n    let ceilW = Math.ceil(w + x - floorX);\n    let ceilH = Math.ceil(h + y - floorY);\n    excavation = { x: floorX, y: floorY, w: ceilW, h: ceilH };\n  }\n  const crossOrigin = imageSettings.crossOrigin;\n  return { x, y, h, w, excavation, opacity, crossOrigin };\n}\nfunction getMarginSize(includeMargin, marginSize) {\n  if (marginSize != null) {\n    return Math.max(Math.floor(marginSize), 0);\n  }\n  return includeMargin ? SPEC_MARGIN_SIZE : DEFAULT_MARGIN_SIZE;\n}\nfunction useQRCode({\n  value,\n  level,\n  minVersion,\n  includeMargin,\n  marginSize,\n  imageSettings,\n  size,\n  boostLevel\n}) {\n  let qrcode = React.useMemo(() => {\n    const values = Array.isArray(value) ? value : [value];\n    const segments = values.reduce((accum, v) => {\n      accum.push(...qrcodegen_default.QrSegment.makeSegments(v));\n      return accum;\n    }, []);\n    return qrcodegen_default.QrCode.encodeSegments(\n      segments,\n      ERROR_LEVEL_MAP[level],\n      minVersion,\n      void 0,\n      void 0,\n      boostLevel\n    );\n  }, [value, level, minVersion, boostLevel]);\n  const { cells, margin, numCells, calculatedImageSettings } = React.useMemo(() => {\n    let cells2 = qrcode.getModules();\n    const margin2 = getMarginSize(includeMargin, marginSize);\n    const numCells2 = cells2.length + margin2 * 2;\n    const calculatedImageSettings2 = getImageSettings(\n      cells2,\n      size,\n      margin2,\n      imageSettings\n    );\n    return {\n      cells: cells2,\n      margin: margin2,\n      numCells: numCells2,\n      calculatedImageSettings: calculatedImageSettings2\n    };\n  }, [qrcode, size, imageSettings, includeMargin, marginSize]);\n  return {\n    qrcode,\n    margin,\n    cells,\n    numCells,\n    calculatedImageSettings\n  };\n}\nvar SUPPORTS_PATH2D = function() {\n  try {\n    new Path2D().addPath(new Path2D());\n  } catch (e) {\n    return false;\n  }\n  return true;\n}();\nvar QRCodeCanvas = React.forwardRef(\n  function QRCodeCanvas2(props, forwardedRef) {\n    const _a = props, {\n      value,\n      size = DEFAULT_SIZE,\n      level = DEFAULT_LEVEL,\n      bgColor = DEFAULT_BGCOLOR,\n      fgColor = DEFAULT_FGCOLOR,\n      includeMargin = DEFAULT_INCLUDEMARGIN,\n      minVersion = DEFAULT_MINVERSION,\n      boostLevel,\n      marginSize,\n      imageSettings\n    } = _a, extraProps = __objRest(_a, [\n      \"value\",\n      \"size\",\n      \"level\",\n      \"bgColor\",\n      \"fgColor\",\n      \"includeMargin\",\n      \"minVersion\",\n      \"boostLevel\",\n      \"marginSize\",\n      \"imageSettings\"\n    ]);\n    const _b = extraProps, { style } = _b, otherProps = __objRest(_b, [\"style\"]);\n    const imgSrc = imageSettings == null ? void 0 : imageSettings.src;\n    const _canvas = React.useRef(null);\n    const _image = React.useRef(null);\n    const setCanvasRef = React.useCallback(\n      (node) => {\n        _canvas.current = node;\n        if (typeof forwardedRef === \"function\") {\n          forwardedRef(node);\n        } else if (forwardedRef) {\n          forwardedRef.current = node;\n        }\n      },\n      [forwardedRef]\n    );\n    const [isImgLoaded, setIsImageLoaded] = React.useState(false);\n    const { margin, cells, numCells, calculatedImageSettings } = useQRCode({\n      value,\n      level,\n      minVersion,\n      boostLevel,\n      includeMargin,\n      marginSize,\n      imageSettings,\n      size\n    });\n    React.useEffect(() => {\n      if (_canvas.current != null) {\n        const canvas = _canvas.current;\n        const ctx = canvas.getContext(\"2d\");\n        if (!ctx) {\n          return;\n        }\n        let cellsToDraw = cells;\n        const image = _image.current;\n        const haveImageToRender = calculatedImageSettings != null && image !== null && image.complete && image.naturalHeight !== 0 && image.naturalWidth !== 0;\n        if (haveImageToRender) {\n          if (calculatedImageSettings.excavation != null) {\n            cellsToDraw = excavateModules(\n              cells,\n              calculatedImageSettings.excavation\n            );\n          }\n        }\n        const pixelRatio = window.devicePixelRatio || 1;\n        canvas.height = canvas.width = size * pixelRatio;\n        const scale = size / numCells * pixelRatio;\n        ctx.scale(scale, scale);\n        ctx.fillStyle = bgColor;\n        ctx.fillRect(0, 0, numCells, numCells);\n        ctx.fillStyle = fgColor;\n        if (SUPPORTS_PATH2D) {\n          ctx.fill(new Path2D(generatePath(cellsToDraw, margin)));\n        } else {\n          cells.forEach(function(row, rdx) {\n            row.forEach(function(cell, cdx) {\n              if (cell) {\n                ctx.fillRect(cdx + margin, rdx + margin, 1, 1);\n              }\n            });\n          });\n        }\n        if (calculatedImageSettings) {\n          ctx.globalAlpha = calculatedImageSettings.opacity;\n        }\n        if (haveImageToRender) {\n          ctx.drawImage(\n            image,\n            calculatedImageSettings.x + margin,\n            calculatedImageSettings.y + margin,\n            calculatedImageSettings.w,\n            calculatedImageSettings.h\n          );\n        }\n      }\n    });\n    React.useEffect(() => {\n      setIsImageLoaded(false);\n    }, [imgSrc]);\n    const canvasStyle = __spreadValues({ height: size, width: size }, style);\n    let img = null;\n    if (imgSrc != null) {\n      img = /* @__PURE__ */ React.createElement(\n        \"img\",\n        {\n          src: imgSrc,\n          key: imgSrc,\n          style: { display: \"none\" },\n          onLoad: () => {\n            setIsImageLoaded(true);\n          },\n          ref: _image,\n          crossOrigin: calculatedImageSettings == null ? void 0 : calculatedImageSettings.crossOrigin\n        }\n      );\n    }\n    return /* @__PURE__ */ React.createElement(React.Fragment, null, /* @__PURE__ */ React.createElement(\n      \"canvas\",\n      __spreadValues({\n        style: canvasStyle,\n        height: size,\n        width: size,\n        ref: setCanvasRef,\n        role: \"img\"\n      }, otherProps)\n    ), img);\n  }\n);\nQRCodeCanvas.displayName = \"QRCodeCanvas\";\nvar QRCodeSVG = React.forwardRef(\n  function QRCodeSVG2(props, forwardedRef) {\n    const _a = props, {\n      value,\n      size = DEFAULT_SIZE,\n      level = DEFAULT_LEVEL,\n      bgColor = DEFAULT_BGCOLOR,\n      fgColor = DEFAULT_FGCOLOR,\n      includeMargin = DEFAULT_INCLUDEMARGIN,\n      minVersion = DEFAULT_MINVERSION,\n      boostLevel,\n      title,\n      marginSize,\n      imageSettings\n    } = _a, otherProps = __objRest(_a, [\n      \"value\",\n      \"size\",\n      \"level\",\n      \"bgColor\",\n      \"fgColor\",\n      \"includeMargin\",\n      \"minVersion\",\n      \"boostLevel\",\n      \"title\",\n      \"marginSize\",\n      \"imageSettings\"\n    ]);\n    const { margin, cells, numCells, calculatedImageSettings } = useQRCode({\n      value,\n      level,\n      minVersion,\n      boostLevel,\n      includeMargin,\n      marginSize,\n      imageSettings,\n      size\n    });\n    let cellsToDraw = cells;\n    let image = null;\n    if (imageSettings != null && calculatedImageSettings != null) {\n      if (calculatedImageSettings.excavation != null) {\n        cellsToDraw = excavateModules(\n          cells,\n          calculatedImageSettings.excavation\n        );\n      }\n      image = /* @__PURE__ */ React.createElement(\n        \"image\",\n        {\n          href: imageSettings.src,\n          height: calculatedImageSettings.h,\n          width: calculatedImageSettings.w,\n          x: calculatedImageSettings.x + margin,\n          y: calculatedImageSettings.y + margin,\n          preserveAspectRatio: \"none\",\n          opacity: calculatedImageSettings.opacity,\n          crossOrigin: calculatedImageSettings.crossOrigin\n        }\n      );\n    }\n    const fgPath = generatePath(cellsToDraw, margin);\n    return /* @__PURE__ */ React.createElement(\n      \"svg\",\n      __spreadValues({\n        height: size,\n        width: size,\n        viewBox: `0 0 ${numCells} ${numCells}`,\n        ref: forwardedRef,\n        role: \"img\"\n      }, otherProps),\n      !!title && /* @__PURE__ */ React.createElement(\"title\", null, title),\n      /* @__PURE__ */ React.createElement(\n        \"path\",\n        {\n          fill: bgColor,\n          d: `M0,0 h${numCells}v${numCells}H0z`,\n          shapeRendering: \"crispEdges\"\n        }\n      ),\n      /* @__PURE__ */ React.createElement(\"path\", { fill: fgColor, d: fgPath, shapeRendering: \"crispEdges\" }),\n      image\n    );\n  }\n);\nQRCodeSVG.displayName = \"QRCodeSVG\";\nexport {\n  QRCodeCanvas,\n  QRCodeSVG\n};\n"],"names":["dynamic","dynamicOptions","options","mergedOptions","loadableOptions","loading","error","isLoading","pastDelay","param","loader","Loadable","modules","loadableGenerated","_bailouttocsr","require","BailoutToCSR","children","reason","window","BailoutToCSRError","_default","convertModule","mod","default","hasDefault","defaultOptions","Promise","resolve","ssr","opts","Lazy","lazy","then","Loading","LoadableComponent","props","fallbackElement","_jsxruntime","jsx","jsxs","Fragment","PreloadCss","moduleIds","Suspense","fallback","displayName","_requestasyncstorageexternal","allFiles","getExpectedRequestStore","requestStore","manifest","reactLoadableManifest","key","cssFiles","push","length","map","file","rel","href","as","assetPrefix","encodeURI","module","exports","qrcodegen2","qrcodegen","__defProp","Object","defineProperty","__getOwnPropSymbols","getOwnPropertySymbols","__hasOwnProp","prototype","hasOwnProperty","__propIsEnum","propertyIsEnumerable","__defNormalProp","obj","value","enumerable","configurable","writable","__spreadValues","a","b","prop","call","__objRest","source","exclude","target","indexOf","_QrCode","constructor","version","errorCorrectionLevel","dataCodewords","msk","isFunction","MIN_VERSION","MAX_VERSION","size","row","i","slice","drawFunctionPatterns","allCodewords","addEccAndInterleave","drawCodewords","minPenalty","applyMask","drawFormatBits","penalty","getPenaltyScore","assert","mask","encodeText","text","ecl","segs","QrSegment","makeSegments","encodeSegments","encodeBinary","data","seg","makeBytes","minVersion","maxVersion","boostEcl","dataUsedBits","dataCapacityBits2","getNumDataCodewords","usedBits","getTotalBits","newEcl","Ecc","MEDIUM","QUARTILE","HIGH","bb","appendBits","mode","modeBits","numChars","numCharCountBits","getData","dataCapacityBits","Math","min","padByte","forEach","getModule","x","y","getModules","setFunctionModule","drawFinderPattern","alignPatPos","getAlignmentPatternPositions","numAlign","j","drawAlignmentPattern","drawVersion","formatBits","rem","bits","getBit","color","floor","dy","dx","dist","max","abs","xx","yy","isDark","ver","numBlocks","NUM_ERROR_CORRECTION_BLOCKS","ordinal","blockEccLen","ECC_CODEWORDS_PER_BLOCK","rawCodewords","getNumRawDataModules","numShortBlocks","shortBlockLen","blocks","rsDiv","reedSolomonComputeDivisor","k","dat","ecc","reedSolomonComputeRemainder","concat","result","block","right","vert","upward","invert","runColor","runX","runHistory","PENALTY_N1","finderPenaltyAddHistory","finderPenaltyCountPatterns","PENALTY_N3","finderPenaltyTerminateAndCount","runY","PENALTY_N2","dark","reduce","sum","total","ceil","PENALTY_N4","step","pos","splice","degree","root","reedSolomonMultiply","divisor","factor","shift","coef","z","n","core","currentRunColor","currentRunLength","pop","unshift","val","len","cond","QrCode","_QrSegment","bitData","Mode","BYTE","makeNumeric","digits","isNumeric","parseInt","substring","NUMERIC","makeAlphanumeric","isAlphanumeric","temp","ALPHANUMERIC_CHARSET","charAt","ALPHANUMERIC","toUtf8ByteArray","makeEci","assignVal","ECI","NUMERIC_REGEX","test","ALPHANUMERIC_REGEX","ccbits","Infinity","str","charCodeAt","_Ecc","LOW","QrCode2","_Mode","numBitsCharCount","KANJI","QrSegment2","qrcodegen_default","ERROR_LEVEL_MAP","L","M","Q","H","DEFAULT_BGCOLOR","DEFAULT_FGCOLOR","generatePath","margin","ops","start","cell","join","excavateModules","excavation","h","w","useQRCode","level","includeMargin","marginSize","imageSettings","boostLevel","qrcode","react__WEBPACK_IMPORTED_MODULE_0__","useMemo","segments","values","Array","isArray","accum","v","cells","numCells","calculatedImageSettings","cells2","margin2","numCells2","calculatedImageSettings2","getImageSettings","defaultSize","scale","width","height","opacity","excavate","floorX","floorY","crossOrigin","SUPPORTS_PATH2D","Path2D","addPath","e","QRCodeCanvas","forwardRef","forwardedRef","bgColor","fgColor","extraProps","style","otherProps","imgSrc","src","_canvas","useRef","_image","setCanvasRef","useCallback","current","node","isImgLoaded","setIsImageLoaded","useState","useEffect","canvas","ctx","getContext","cellsToDraw","image","haveImageToRender","complete","naturalHeight","naturalWidth","pixelRatio","devicePixelRatio","fillStyle","fillRect","fill","rdx","cdx","globalAlpha","drawImage","canvasStyle","img","createElement","display","onLoad","ref","role","QRCodeSVG","title","preserveAspectRatio","fgPath","viewBox","d","shapeRendering"],"sourceRoot":""}